{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-reconstruction/papers/ran/1","list_of":"/task/graph-reconstruction","task":"Graph Reconstruction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,16],"of":16,"counts":{"archive_papers_tagged":88,"with_a_code_link":41,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":88,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-reconstruction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/causaldynamics-a-large-scale-benchmark-for","slug":"causaldynamics-a-large-scale-benchmark-for","title":"CausalDynamics: A large-scale benchmark for structural discovery of dynamical causal models","date":"2025-05-22","arxiv_id":"2505.16620","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/causaldynamics-a-large-scale-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2505.16620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16620"}},"official":{"repos":["kausable/causaldynamics"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/grain-exact-graph-reconstruction-from","slug":"grain-exact-graph-reconstruction-from","title":"GRAIN: Exact Graph Reconstruction from Gradients","date":"2025-03-03","arxiv_id":"2503.01838","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/grain-exact-graph-reconstruction-from#ran","syntology_url":"https://syntology.ai/paper/2503.01838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01838"}},"official":{"repos":["insait-institute/grain"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/targeted-cause-discovery-with-data-driven","slug":"targeted-cause-discovery-with-data-driven","title":"Large-Scale Targeted Cause Discovery with Data-Driven Learning","date":"2024-08-29","arxiv_id":"2408.16218","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/targeted-cause-discovery-with-data-driven#ran","syntology_url":"https://syntology.ai/paper/2408.16218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16218"}},"official":{"repos":["snu-mllab/targeted-cause-discovery"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-parsing-networks","slug":"graph-parsing-networks","title":"Graph Parsing Networks","date":"2024-02-22","arxiv_id":"2402.14393","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-parsing-networks#ran","syntology_url":"https://syntology.ai/paper/2402.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14393"}},"official":{"repos":["lumia-group/graphparsingnetworks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-scale-traffic-pattern-bank-for-cross","slug":"multi-scale-traffic-pattern-bank-for-cross","title":"Multi-scale Traffic Pattern Bank for Cross-city Few-shot Traffic Forecasting","date":"2024-02-01","arxiv_id":"2402.00397","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multi-scale-traffic-pattern-bank-for-cross#ran","syntology_url":"https://syntology.ai/paper/2402.00397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.00397"}},"official":{"repos":["zhyliu00/mtpb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-strengthening-and-defending-graph","slug":"on-strengthening-and-defending-graph","title":"On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation","date":"2023-06-15","arxiv_id":"2306.09104","repositories_listed":1,"syntology":{"n":23,"n_ran":23,"n_constructed":3,"n_ran_checked":16,"n_instrument":7,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":12,"n_pointer_only":2,"phrase":"23 ran (of which 3 constructed an object rather than computing a result; 16 with no instrument failure: 2 honoured, 2 violated, 12 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-strengthening-and-defending-graph#ran","syntology_url":"https://syntology.ai/paper/2306.09104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09104"}},"official":{"repos":["tmlr-group/mc-gra"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":3,"n_ran_no_instrument_failure":15,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/information-recovery-driven-deep-incomplete","slug":"information-recovery-driven-deep-incomplete","title":"Information Recovery-Driven Deep Incomplete Multiview Clustering Network","date":"2023-04-02","arxiv_id":"2304.00429","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/information-recovery-driven-deep-incomplete#ran","syntology_url":"https://syntology.ai/paper/2304.00429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00429"}},"official":{"repos":["justsmart/RecFormer","justsmart/Recformer-mindspore"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transg-transformer-based-skeleton-graph","slug":"transg-transformer-based-skeleton-graph","title":"TranSG: Transformer-Based Skeleton Graph Prototype Contrastive Learning with Structure-Trajectory Prompted Reconstruction for Person Re-Identification","date":"2023-03-13","arxiv_id":"2303.06819","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transg-transformer-based-skeleton-graph#ran","syntology_url":"https://syntology.ai/paper/2303.06819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06819"}},"official":{"repos":["kali-hac/transg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spatio-temporal-graph-few-shot-learning-with","slug":"spatio-temporal-graph-few-shot-learning-with","title":"Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge Transfer","date":"2022-05-27","arxiv_id":"2205.13947","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spatio-temporal-graph-few-shot-learning-with#ran","syntology_url":"https://syntology.ai/paper/2205.13947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13947"}},"official":{"repos":["robinlu1209/st-gfsl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-auto-encoder-via-neighborhood-1","slug":"graph-auto-encoder-via-neighborhood-1","title":"Graph Auto-Encoder Via Neighborhood Wasserstein Reconstruction","date":"2022-02-18","arxiv_id":"2202.09025","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-auto-encoder-via-neighborhood-1#ran","syntology_url":"https://syntology.ai/paper/2202.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09025"}},"official":{"repos":["mtang724/nwr-gae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tgrnet-a-table-graph-reconstruction-network","slug":"tgrnet-a-table-graph-reconstruction-network","title":"TGRNet: A Table Graph Reconstruction Network for Table Structure Recognition","date":"2021-06-20","arxiv_id":"2106.10598","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/tgrnet-a-table-graph-reconstruction-network#ran","syntology_url":"https://syntology.ai/paper/2106.10598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10598"}},"official":{"repos":["xuewenyuan/TGRNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-riemannian-graph-convolutional-networks","slug":"semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","arxiv_id":"2106.03134","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-riemannian-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2106.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03134"}},"official":{"repos":["xiongbo010/qgcn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"5697a9f26c7a9d09d51af3c84e9924a009785b3a43254a8942dd20dabb89da8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}