{"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","name":"Graph Reconstruction","slug":"graph-reconstruction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":88,"papers_with_code":41,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":88,"of":88,"of_with_code":41,"tagged_in_all":88,"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":13,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"items":[{"url":"/paper/geometric-laplacian-eigenmap-embedding","slug":"geometric-laplacian-eigenmap-embedding","title":"GLEE: Geometric Laplacian Eigenmap Embedding","date":"2019-05-23","arxiv_id":"1905.09763","repositories_listed":3,"syntology":null},{"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/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/local2global-scaling-global-representation","slug":"local2global-scaling-global-representation","title":"Local2Global: Scaling global representation learning on graphs via local training","date":"2021-07-26","arxiv_id":"2107.12224","repositories_listed":2,"syntology":null},{"url":"/paper/edge-representation-learning-with-hypergraphs","slug":"edge-representation-learning-with-hypergraphs","title":"Edge Representation Learning with Hypergraphs","date":"2021-06-30","arxiv_id":"2106.15845","repositories_listed":2,"syntology":null},{"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/glodyne-global-topology-preserving-dynamic","slug":"glodyne-global-topology-preserving-dynamic","title":"GloDyNE: Global Topology Preserving Dynamic Network Embedding","date":"2020-08-05","arxiv_id":"2008.01935","repositories_listed":2,"syntology":null},{"url":"/paper/vectorizing-world-buildings-planar-graph","slug":"vectorizing-world-buildings-planar-graph","title":"Vectorizing World Buildings: Planar Graph Reconstruction by Primitive Detection and Relationship Inference","date":"2019-12-11","arxiv_id":"1912.05135","repositories_listed":2,"syntology":null},{"url":"/paper/dynwalks-global-topology-and-recent-changes-1","slug":"dynwalks-global-topology-and-recent-changes-1","title":"DynWalks: Global Topology and Recent Changes Awareness Dynamic Network Embedding","date":"2019-07-27","arxiv_id":"1907.11968","repositories_listed":2,"syntology":null},{"url":"/paper/graph-convolutional-transformer-learning-the","slug":"graph-convolutional-transformer-learning-the","title":"Learning the Graphical Structure of Electronic Health Records with Graph Convolutional Transformer","date":"2019-06-11","arxiv_id":"1906.04716","repositories_listed":2,"syntology":null},{"url":"/paper/erarag-efficient-and-incremental-retrieval","slug":"erarag-efficient-and-incremental-retrieval","title":"EraRAG: Efficient and Incremental Retrieval Augmented Generation for Growing Corpora","date":"2025-06-26","arxiv_id":"2506.20963","repositories_listed":1,"syntology":null},{"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":14,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 1 violated, 11 with no contract checked; 2 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":14,"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":8,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 3 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":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-representation-learning-for-3","slug":"contrastive-representation-learning-for-3","title":"Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks","date":"2024-08-22","arxiv_id":"2408.12753","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-individuality-and-collectivity","slug":"exploring-the-individuality-and-collectivity","title":"Exploring the Individuality and Collectivity of Intents behind Interactions for Graph Collaborative Filtering","date":"2024-05-15","arxiv_id":"2405.09042","repositories_listed":1,"syntology":null},{"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":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 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":0,"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":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 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":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/constraint-free-structure-learning-with","slug":"constraint-free-structure-learning-with","title":"Constraint-Free Structure Learning with Smooth Acyclic Orientations","date":"2023-09-15","arxiv_id":"2309.08406","repositories_listed":1,"syntology":null},{"url":"/paper/generative-contrastive-graph-learning-for","slug":"generative-contrastive-graph-learning-for","title":"Generative Contrastive Graph Learning for Recommendation","date":"2023-07-11","arxiv_id":"2307.05100","repositories_listed":1,"syntology":null},{"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/an-open-unified-deep-graph-learning-framework","slug":"an-open-unified-deep-graph-learning-framework","title":"An open unified deep graph learning framework for discovering drug leads","date":"2022-12-06","arxiv_id":"2301.03424","repositories_listed":1,"syntology":null},{"url":"/paper/data-imputation-with-iterative-graph","slug":"data-imputation-with-iterative-graph","title":"Data Imputation with Iterative Graph Reconstruction","date":"2022-12-06","arxiv_id":"2212.02810","repositories_listed":1,"syntology":null},{"url":"/paper/private-graph-extraction-via-feature","slug":"private-graph-extraction-via-feature","title":"Private Graph Extraction via Feature Explanations","date":"2022-06-29","arxiv_id":"2206.14724","repositories_listed":1,"syntology":null},{"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":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 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":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-text-classification-using-graph","slug":"multi-task-text-classification-using-graph","title":"Multi-Task Text Classification using Graph Convolutional Networks for Large-Scale Low Resource Language","date":"2022-05-02","arxiv_id":"2205.01204","repositories_listed":1,"syntology":null},{"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/heat-holistic-edge-attention-transformer-for","slug":"heat-holistic-edge-attention-transformer-for","title":"HEAT: Holistic Edge Attention Transformer for Structured Reconstruction","date":"2021-11-30","arxiv_id":"2111.15143","repositories_listed":1,"syntology":null},{"url":"/paper/inference-attacks-against-graph-neural","slug":"inference-attacks-against-graph-neural","title":"Inference Attacks Against Graph Neural Networks","date":"2021-10-06","arxiv_id":"2110.02631","repositories_listed":1,"syntology":null},{"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/jointgt-graph-text-joint-representation","slug":"jointgt-graph-text-joint-representation","title":"JointGT: Graph-Text Joint Representation Learning for Text Generation from Knowledge Graphs","date":"2021-06-19","arxiv_id":"2106.10502","repositories_listed":1,"syntology":null},{"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":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 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":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-robust-and-generalized-framework-for","slug":"a-robust-and-generalized-framework-for","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","date":"2021-05-22","arxiv_id":"2105.10651","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-invariant-variational-autoencoder","slug":"permutation-invariant-variational-autoencoder","title":"Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning","date":"2021-04-20","arxiv_id":"2104.09856","repositories_listed":1,"syntology":null},{"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"]}}},{"url":"/paper/disentangling-homophily-community-structure","slug":"disentangling-homophily-community-structure","title":"Disentangling homophily, community structure and triadic closure in networks","date":"2021-01-07","arxiv_id":"2101.02510","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-general-graph-neural-network","slug":"a-simple-and-general-graph-neural-network","title":"Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passing","date":"2020-09-05","arxiv_id":"2009.02562","repositories_listed":1,"syntology":null},{"url":"/paper/self-constructing-graph-convolutional","slug":"self-constructing-graph-convolutional","title":"Self-Constructing Graph Convolutional Networks for Semantic Labeling","date":"2020-03-15","arxiv_id":"2003.06932","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicgem-a-library-for-dynamic-graph","slug":"dynamicgem-a-library-for-dynamic-graph","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","date":"2018-11-26","arxiv_id":"1811.10734","repositories_listed":1,"syntology":null},{"url":null,"slug":"reconxf-graph-reconstruction-attack-via","title":"ReconXF: Graph Reconstruction Attack via Public Feature Explanations on Privatized Node Features and Labels","date":"2025-06-02","arxiv_id":"2506.02134","repositories_listed":0,"syntology":null},{"url":null,"slug":"elspr-evaluator-llm-training-data-self","title":"ELSPR: Evaluator LLM Training Data Self-Purification on Non-Transitive Preferences via Tournament Graph Reconstruction","date":"2025-05-23","arxiv_id":"2505.17691","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-and-steering-connectome","title":"Unveiling and Steering Connectome Organization with Interpretable Latent Variables","date":"2025-05-19","arxiv_id":"2505.13011","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-inference-with-effective-resistance","title":"Graph Inference with Effective Resistance Queries","date":"2025-02-25","arxiv_id":"2502.18350","repositories_listed":0,"syntology":null},{"url":null,"slug":"clear-cluster-based-prompt-learning-on","title":"CLEAR: Cluster-based Prompt Learning on Heterogeneous Graphs","date":"2025-02-13","arxiv_id":"2502.08918","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-coarse-and-fine","title":"Graph Neural Networks with Coarse- and Fine-Grained Division for Mitigating Label Sparsity and Noise","date":"2024-11-06","arxiv_id":"2411.03744","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-optimized-adaptive-graph-reconstruction","title":"Dual-Optimized Adaptive Graph Reconstruction for Multi-View Graph Clustering","date":"2024-10-30","arxiv_id":"2410.22983","repositories_listed":0,"syntology":null},{"url":null,"slug":"cotconet-an-optimized-coupled-transformer","title":"CoTCoNet: An Optimized Coupled Transformer-Convolutional Network with an Adaptive Graph Reconstruction for Leukemia Detection","date":"2024-10-11","arxiv_id":"2410.08797","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-influential-nodes-in-brain","title":"Identifying Influential nodes in Brain Networks via Self-Supervised Graph-Transformer","date":"2024-09-17","arxiv_id":"2409.11174","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-network-chebnet-graph","title":"Graph Neural Network, ChebNet, Graph Convolutional Network, and Graph Autoencoder: Tutorial and Survey","date":"2024-07-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bindgpt-a-scalable-framework-for-3d-molecular","title":"BindGPT: A Scalable Framework for 3D Molecular Design via Language Modeling and Reinforcement Learning","date":"2024-06-06","arxiv_id":"2406.03686","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-ood-detection-in-molecular-graphs","title":"Optimizing OOD Detection in Molecular Graphs: A Novel Approach with Diffusion Models","date":"2024-04-24","arxiv_id":"2404.15625","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-generalization-estimation-in","title":"Temporal Generalization Estimation in Evolving Graphs","date":"2024-04-07","arxiv_id":"2404.04969","repositories_listed":0,"syntology":null},{"url":null,"slug":"sign-rank-limitations-for-attention-based","title":"Sign Rank Limitations for Inner Product Graph Decoders","date":"2024-02-06","arxiv_id":"2402.06662","repositories_listed":0,"syntology":null},{"url":null,"slug":"filling-in-the-gaps-efficient-event","title":"Filling in the Gaps: Efficient Event Coreference Resolution using Graph Autoencoder Networks","date":"2023-10-18","arxiv_id":"2310.11965","repositories_listed":0,"syntology":null},{"url":null,"slug":"curve-your-attention-mixed-curvature","title":"Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning","date":"2023-09-08","arxiv_id":"2309.04082","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-structure-recovery-of-linear-dynamical","title":"Causal Structure Recovery of Linear Dynamical Systems: An FFT based Approach","date":"2023-09-05","arxiv_id":"2309.02571","repositories_listed":0,"syntology":null},{"url":null,"slug":"restore-graph-embedding-assessment-through","title":"RESTORE: Graph Embedding Assessment Through Reconstruction","date":"2023-08-28","arxiv_id":"2308.14659","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-equivalent-graph-reconstruction-model-and","title":"An Equivalent Graph Reconstruction Model and its Application in Recommendation Prediction","date":"2023-07-05","arxiv_id":"2307.02183","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-vectorizing-of-building-structures","title":"Optimized Vectorizing of Building Structures with Switch: High-Efficiency Convolutional Channel-Switch Hybridization Strategy","date":"2023-06-26","arxiv_id":"2306.15035","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-curvature-transformers-for-graph","title":"Mixed-Curvature Transformers for Graph Representation Learning papersreview","date":"2023-06-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fault-identification-of-rotating-machinery","title":"A Graph Reconstruction by Dynamic Signal Coefficient for Fault Classification","date":"2023-05-30","arxiv_id":"2306.05281","repositories_listed":0,"syntology":null},{"url":null,"slug":"road-network-representation-learning-a-dual","title":"Road Network Representation Learning: A Dual Graph based Approach","date":"2023-04-13","arxiv_id":"2304.07298","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairgen-towards-fair-graph-generation","title":"FairGen: Towards Fair Graph Generation","date":"2023-03-30","arxiv_id":"2303.17743","repositories_listed":0,"syntology":null},{"url":null,"slug":"traffic-prediction-with-transfer-learning-a","title":"Traffic Prediction with Transfer Learning: A Mutual Information-based Approach","date":"2023-03-13","arxiv_id":"2303.07184","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-representation-learning","title":"Privacy-Preserving Representation Learning for Text-Attributed Networks with Simplicial Complexes","date":"2023-02-09","arxiv_id":"2302.04383","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-the-privacy-leakage-via-graph","title":"Measuring the Privacy Leakage via Graph Reconstruction Attacks on Simplicial Neural Networks (Student Abstract)","date":"2023-02-08","arxiv_id":"2302.04373","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-primitive-graph-learning-for","title":"Regularized Primitive Graph Learning for Unified Vector Mapping","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-complex-network-based-graph-embedding","title":"A Complex Network based Graph Embedding Method for Link Prediction","date":"2022-09-11","arxiv_id":"2209.04884","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-overview-of-the-quantitative-causality","title":"An overview of the quantitative causality analysis and causal graph reconstruction based on a rigorous formalism of information flow","date":"2021-12-31","arxiv_id":"2112.14839","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-for-powerful-graph","title":"Reconstruction for Powerful Graph Representations","date":"2021-10-01","arxiv_id":"2110.00577","repositories_listed":0,"syntology":null},{"url":null,"slug":"normalized-multivariate-time-series-causality","title":"Normalized multivariate time series causality analysis and causal graph reconstruction","date":"2021-04-23","arxiv_id":"2104.11360","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatio-temporal-modeling-for-large-scale","title":"Spatio-temporal Modeling for Large-scale Vehicular Networks Using Graph Convolutional Networks","date":"2021-03-13","arxiv_id":"2103.07636","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-node-representations-from-noisy","title":"Learning Node Representations from Noisy Graph Structures","date":"2020-12-04","arxiv_id":"2012.02434","repositories_listed":0,"syntology":null},{"url":null,"slug":"scg-net-self-constructing-graph-neural","title":"SCG-Net: Self-Constructing Graph Neural Networks for Semantic Segmentation","date":"2020-09-03","arxiv_id":"2009.01599","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-approach-pbcn-in-social","title":"Privacy-Preserving Approach PBCN in Social Network With Differential Privacy","date":"2020-06-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-gene-expression-from-network","title":"A Graph Feature Auto-Encoder for the Prediction of Unobserved Node Features on Biological Networks","date":"2020-05-08","arxiv_id":"2005.03961","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-auto-encoder-with-bi","title":"Unsupervised Graph Embedding via Adaptive Graph Learning","date":"2020-03-10","arxiv_id":"2003.04508","repositories_listed":0,"syntology":null},{"url":null,"slug":"road-network-reconstruction-from-satellite","title":"Road Network Reconstruction from Satellite Images with Machine Learning Supported by Topological Methods","date":"2019-09-15","arxiv_id":"1909.06728","repositories_listed":0,"syntology":null},{"url":null,"slug":"homogeneous-network-embedding-for-massive","title":"Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank","date":"2019-06-17","arxiv_id":"1906.06826","repositories_listed":0,"syntology":null},{"url":null,"slug":"marginalized-latent-semantic-encoder-for-zero","title":"Marginalized Latent Semantic Encoder for Zero-Shot Learning","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-graph-convolutional-network-for","title":"Generative Graph Convolutional Network for Growing Graphs","date":"2019-03-06","arxiv_id":"1903.02640","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-effect-of-graph-embeddings-on-fraud","title":"Empirical effect of graph embeddings on fraud detection/ risk mitigation","date":"2019-03-05","arxiv_id":"1903.05976","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-representation-learning-for-directed","title":"Node Representation Learning for Directed Graphs","date":"2018-10-22","arxiv_id":"1810.09176","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-gan-learn-topological-features-of-a-graph","title":"Can GAN Learn Topological Features of a Graph?","date":"2017-07-19","arxiv_id":"1707.06197","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-optimal-learning-of","title":"Information Theoretic Optimal Learning of Gaussian Graphical Models","date":"2017-03-15","arxiv_id":"1703.04886","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-graph-reconstruction-via-empirical-risk","title":"On Graph Reconstruction via Empirical Risk Minimization: Fast Learning Rates and Scalability","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":16,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":16,"papers_where_code_ran_first_page":"/task/graph-reconstruction/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/graph-reconstruction/papers/ran/1","json":"/task/graph-reconstruction/papers/ran/1.json","rows":16}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"89d08dd05915e44b291c28178a6fd54bc42b9038c93c053830dd2e9e6acd4488","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}