{"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-learning","name":"Graph Learning","slug":"graph-learning","description_markdown":"Graph learning is a branch of machine learning that focuses on the analysis and interpretation of data represented in graph form. In this context, a graph is a collection of nodes (or vertices) and edges, where nodes represent entities and edges represent the relationships or interactions between these entities. This structure is particularly useful for modeling complex networks found in various domains such as social networks, biological networks, and communication networks.\r\n\r\nGraph learning leverages the relationships and structures within the graph to learn and make predictions. It includes techniques like graph neural networks (GNNs), which extend the concept of neural networks to handle graph-structured data. These models are adept at capturing the dependencies and influence of connected nodes, leading to more accurate predictions in scenarios where relationships play a key role.\r\n\r\nKey applications of graph learning include recommender systems, drug discovery, social network analysis, and fraud detection. By utilizing the inherent structure of graph data, graph learning algorithms can uncover deep insights and patterns that are not apparent with traditional machine learning approaches.","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":1570,"papers_with_code":686,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":10,"subtasks":2,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-learning-on-camels","slug":"graph-learning-on-camels","dataset":"CAMELS","dataset_url":null,"rows_in_archive":1,"metrics":["R^2","absolute relative error"],"first_row_in_archive_order":{"model":"HaloGraphNet","paper_title":"Inferring halo masses with Graph Neural Networks","paper_url":"/paper/inferring-halo-masses-with-graph-neural","paper_date":"2021-11-16","arxiv_id":"2111.08683","code_links":[{"title":"PabloVD/HaloGraphNet","url":"https://github.com/PabloVD/HaloGraphNet"}],"syntology":null}}],"datasets":[{"url":"/dataset/botnet","name":"BotNet","full_name":null,"num_papers_in_archive":12},{"url":"/dataset/mindboggle","name":"Mindboggle","full_name":"","num_papers_in_archive":9},{"url":"/dataset/mimic-sparql","name":"MIMIC-SPARQL","full_name":"","num_papers_in_archive":3},{"url":"/dataset/gvlqa","name":"GVLQA","full_name":"Graph Vision-Language Question-Answering","num_papers_in_archive":2},{"url":"/dataset/asep","name":"AsEP","full_name":"Antibody-specific Epitope Prediction","num_papers_in_archive":1},{"url":"/dataset/ethz-shape","name":"ETHZ-Shape","full_name":"ETHZ-Shape","num_papers_in_archive":1},{"url":"/dataset/lowest-common-ancestor-generations-lcag","name":"Lowest Common Ancestor Generations (LCAG) Phasespace Particle Decay Reconstruction Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/ocb","name":"OCB","full_name":"Open Circuit Benchmark","num_papers_in_archive":1},{"url":"/dataset/sagc-a68","name":"SAGC-A68","full_name":"A space access graph dataset for the classification of spaces and space elements in apartment buildings","num_papers_in_archive":1}],"subtasks":[{"url":"/task/graph-sampling","name":"Graph Sampling"},{"url":"/task/task-graph-learning","name":"Task Graph Learning"}],"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":16,"rows_per_page":100,"shown":100,"of":1570,"of_with_code":686,"tagged_in_all":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":158,"every_run_a_failure_of_syntologys_instrument":35,"listed_with_a_run_with_no_instrument_failure":158,"listed_every_run_a_failure_of_syntologys_instrument":35,"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/graph-random-neural-network","slug":"graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","arxiv_id":"2005.11079","repositories_listed":9,"syntology":{"n":22,"n_ran":15,"n_constructed":1,"n_ran_checked":9,"n_instrument":6,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-random-neural-network#ran","syntology_url":"https://syntology.ai/paper/2005.11079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11079"}},"official":{"repos":["Grand20/grand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-graph-library-towards-efficient-and","slug":"deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","arxiv_id":"1909.01315","repositories_listed":7,"syntology":{"n":39,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":28,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 28 unverified","sample_list":"/paper/deep-graph-library-towards-efficient-and#ran","syntology_url":"https://syntology.ai/paper/1909.01315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01315"}},"official":{"repos":["dglai/dgl-0.5-benchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/large-scale-learning-on-non-homophilous","slug":"large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":15,"n_constructed":5,"n_ran_checked":10,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":11,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/large-scale-learning-on-non-homophilous#ran","syntology_url":"https://syntology.ai/paper/2110.14446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14446"}},"official":{"repos":["cuai/non-homophily-large-scale"],"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/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","repositories_listed":5,"syntology":null},{"url":"/paper/higher-order-attention-networks","slug":"higher-order-attention-networks","title":"Topological Deep Learning: Going Beyond Graph Data","date":"2022-06-01","arxiv_id":"2206.00606","repositories_listed":4,"syntology":null},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-negative-sampling-in-graph","slug":"understanding-negative-sampling-in-graph","title":"Understanding Negative Sampling in Graph Representation Learning","date":"2020-05-20","arxiv_id":"2005.09863","repositories_listed":4,"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/understanding-negative-sampling-in-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09863"}},"official":{"repos":["zyang-16/MCNS"],"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/triplet-interaction-improves-graph","slug":"triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cat-balanced-continual-graph-learning-with","slug":"cat-balanced-continual-graph-learning-with","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","date":"2023-09-18","arxiv_id":"2309.09455","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 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","sample_list":"/paper/cat-balanced-continual-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.09455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.09455"}},"official":{"repos":["superallen13/CaT-CGL"],"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/sthg-spatial-temporal-heterogeneous-graph","slug":"sthg-spatial-temporal-heterogeneous-graph","title":"STHG: Spatial-Temporal Heterogeneous Graph Learning for Advanced Audio-Visual Diarization","date":"2023-06-18","arxiv_id":"2306.10608","repositories_listed":3,"syntology":null},{"url":"/paper/link-prediction-without-graph-neural-networks","slug":"link-prediction-without-graph-neural-networks","title":"Link Prediction without Graph Neural Networks","date":"2023-05-23","arxiv_id":"2305.13656","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-subgraph-representation-learning","slug":"simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/graph-matching-with-bi-level-noisy","slug":"graph-matching-with-bi-level-noisy","title":"Graph Matching with Bi-level Noisy Correspondence","date":"2022-12-08","arxiv_id":"2212.04085","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-matching-with-bi-level-noisy#ran","syntology_url":"https://syntology.ai/paper/2212.04085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04085"}},"official":{"repos":["Thinklab-SJTU/ThinkMatch","xlearning-scu/2023-iccv-common","Lin-Yijie/Graph-Matching-Networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhanced-graph-learning-schemes-driven-by","slug":"enhanced-graph-learning-schemes-driven-by","title":"Enhanced graph-learning schemes driven by similar distributions of motifs","date":"2022-07-11","arxiv_id":"2207.04747","repositories_listed":3,"syntology":null},{"url":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}},"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/invariance-principle-meets-out-of","slug":"invariance-principle-meets-out-of","title":"Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphs","date":"2022-02-11","arxiv_id":"2202.05441","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/invariance-principle-meets-out-of#ran","syntology_url":"https://syntology.ai/paper/2202.05441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05441"}},"official":{"repos":["lfhase/ciga"],"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/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autosf-towards-automatic-scoring-function","slug":"autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","arxiv_id":"2107.00184","repositories_listed":3,"syntology":null},{"url":"/paper/tcl-transformer-based-dynamic-graph-modelling","slug":"tcl-transformer-based-dynamic-graph-modelling","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","date":"2021-05-17","arxiv_id":"2105.07944","repositories_listed":3,"syntology":null},{"url":"/paper/learning-on-attribute-missing-graphs","slug":"learning-on-attribute-missing-graphs","title":"Learning on Attribute-Missing Graphs","date":"2020-11-03","arxiv_id":"2011.01623","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-on-attribute-missing-graphs#ran","syntology_url":"https://syntology.ai/paper/2011.01623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01623"}},"official":{"repos":["xuChenSJTU/SAT-master-online"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","repositories_listed":3,"syntology":null},{"url":"/paper/lifelong-graph-learning","slug":"lifelong-graph-learning","title":"Lifelong Graph Learning","date":"2020-09-01","arxiv_id":"2009.00647","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2009.00647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00647"}},"official":{"repos":["wang-chen/LGL","wang-chen/lgl-action-recognition"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-3d-part-assembly-via-dynamic-graph","slug":"generative-3d-part-assembly-via-dynamic-graph","title":"Generative 3D Part Assembly via Dynamic Graph Learning","date":"2020-06-14","arxiv_id":"2006.07793","repositories_listed":3,"syntology":null},{"url":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","slug":"deepergcn-all-you-need-to-train-deeper-gcns","title":"DeeperGCN: All You Need to Train Deeper GCNs","date":"2020-06-13","arxiv_id":"2006.07739","repositories_listed":3,"syntology":null},{"url":"/paper/connecting-the-dots-multivariate-time-series","slug":"connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","arxiv_id":"2005.11650","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/connecting-the-dots-multivariate-time-series#ran","syntology_url":"https://syntology.ai/paper/2005.11650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11650"}},"official":{"repos":["nnzhan/MTGNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/diffusion-improves-graph-learning-1","slug":"diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","arxiv_id":"1911.05485","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 3 unverified","sample_list":"/paper/diffusion-improves-graph-learning-1#ran","syntology_url":"https://syntology.ai/paper/1911.05485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05485"}},"official":{"repos":["klicperajo/gdc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/graph-construction-from-data-using-non","slug":"graph-construction-from-data-using-non","title":"Neighborhood and Graph Constructions using Non-Negative Kernel Regression","date":"2019-10-21","arxiv_id":"1910.09383","repositories_listed":3,"syntology":null},{"url":"/paper/fast-and-distributed-equivariant-graph-neural","slug":"fast-and-distributed-equivariant-graph-neural","title":"Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning","date":"2025-06-24","arxiv_id":"2506.19482","repositories_listed":2,"syntology":null},{"url":"/paper/2506-08618","slug":"2506-08618","title":"HSG-12M: A Large-Scale Spatial Multigraph Dataset","date":"2025-06-10","arxiv_id":"2506.08618","repositories_listed":2,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"10 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/2506-08618#ran","syntology_url":"https://syntology.ai/paper/2506.08618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08618"}},"official":{"repos":["sarinstein-yan/hsg-12m","sarinstein-yan/poly2graph"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-and-improving-graph-based","slug":"evaluating-and-improving-graph-based","title":"Evaluating and Improving Graph-based Explanation Methods for Multi-Agent Coordination","date":"2025-02-14","arxiv_id":"2502.09889","repositories_listed":2,"syntology":null},{"url":"/paper/neural-graph-pattern-machine","slug":"neural-graph-pattern-machine","title":"Beyond Message Passing: Neural Graph Pattern Machine","date":"2025-01-30","arxiv_id":"2501.18739","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-graph-pattern-machine#ran","syntology_url":"https://syntology.ai/paper/2501.18739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18739"}},"official":{"repos":["zehong-wang/gpm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fragmented-layer-grouping-in-gui-designs","slug":"fragmented-layer-grouping-in-gui-designs","title":"Fragmented Layer Grouping in GUI Designs Through Graph Learning Based on Multimodal Information","date":"2024-12-07","arxiv_id":"2412.05555","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-of-deep-graph-learning-under","slug":"a-survey-of-deep-graph-learning-under","title":"A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation","date":"2024-10-25","arxiv_id":"2410.19265","repositories_listed":2,"syntology":null},{"url":"/paper/learning-based-link-anomaly-detection-in","slug":"learning-based-link-anomaly-detection-in","title":"Learning-Based Link Anomaly Detection in Continuous-Time Dynamic Graphs","date":"2024-05-28","arxiv_id":"2405.18050","repositories_listed":2,"syntology":null},{"url":"/paper/de-hnn-an-effective-neural-model-for-circuit","slug":"de-hnn-an-effective-neural-model-for-circuit","title":"DE-HNN: An effective neural model for Circuit Netlist representation","date":"2024-03-30","arxiv_id":"2404.00477","repositories_listed":2,"syntology":null},{"url":"/paper/towards-learning-from-graphs-with-heterophily","slug":"towards-learning-from-graphs-with-heterophily","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","date":"2024-01-18","arxiv_id":"2401.09769","repositories_listed":2,"syntology":null},{"url":"/paper/d4explainer-in-distribution-gnn-explanations","slug":"d4explainer-in-distribution-gnn-explanations","title":"D4Explainer: In-Distribution GNN Explanations via Discrete Denoising Diffusion","date":"2023-10-30","arxiv_id":"2310.19321","repositories_listed":2,"syntology":{"n":21,"n_ran":15,"n_constructed":3,"n_ran_checked":5,"n_instrument":10,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"15 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 10 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/d4explainer-in-distribution-gnn-explanations#ran","syntology_url":"https://syntology.ai/paper/2310.19321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19321"}},"official":{"repos":["graph-and-geometric-learning/d4explainer"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/can-llms-effectively-leverage-structural","slug":"can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","arxiv_id":"2309.16595","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/can-llms-effectively-leverage-structural#ran","syntology_url":"https://syntology.ai/paper/2309.16595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16595"}},"official":{"repos":["trais-lab/llm-structured-data"],"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":["listed","official"]}}},{"url":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":4,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 4 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/how-expressive-are-graph-neural-networks-in","slug":"how-expressive-are-graph-neural-networks-in","title":"How Expressive are Graph Neural Networks in Recommendation?","date":"2023-08-22","arxiv_id":"2308.11127","repositories_listed":2,"syntology":null},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 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) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stg4traffic-a-survey-and-benchmark-of-spatial","slug":"stg4traffic-a-survey-and-benchmark-of-spatial","title":"STG4Traffic: A Survey and Benchmark of Spatial-Temporal Graph Neural Networks for Traffic Prediction","date":"2023-07-02","arxiv_id":"2307.00495","repositories_listed":2,"syntology":null},{"url":"/paper/expectation-complete-graph-representations","slug":"expectation-complete-graph-representations","title":"Expectation-Complete Graph Representations with Homomorphisms","date":"2023-06-09","arxiv_id":"2306.05838","repositories_listed":2,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/expectation-complete-graph-representations#ran","syntology_url":"https://syntology.ai/paper/2306.05838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05838"}},"official":{"repos":["ocatias/homcountgnns","pwelke/homcount"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-heterogeneous-graph-convolutions-via","slug":"spectral-heterogeneous-graph-convolutions-via","title":"Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials","date":"2023-05-31","arxiv_id":"2305.19872","repositories_listed":2,"syntology":null},{"url":"/paper/deep-temporal-graph-clustering","slug":"deep-temporal-graph-clustering","title":"Deep Temporal Graph Clustering","date":"2023-05-18","arxiv_id":"2305.10738","repositories_listed":2,"syntology":null},{"url":"/paper/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}},"official":{"repos":["qslim/pdf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-dynamic-graph-learning-new-1","slug":"towards-better-dynamic-graph-learning-new-1","title":"Towards Better Dynamic Graph Learning: New Architecture and Unified Library","date":"2023-03-23","arxiv_id":"2303.13047","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/towards-better-dynamic-graph-learning-new-1#ran","syntology_url":"https://syntology.ai/paper/2303.13047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13047"}},"official":{"repos":["yule-buaa/dyglib"],"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/multiresolution-graph-transformers-and","slug":"multiresolution-graph-transformers-and","title":"Multiresolution Graph Transformers and Wavelet Positional Encoding for Learning Hierarchical Structures","date":"2023-02-17","arxiv_id":"2302.08647","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multiresolution-graph-transformers-and#ran","syntology_url":"https://syntology.ai/paper/2302.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08647"}},"official":{"repos":["hysonlab/multires-graph-transformer","vijaydwivedi75/lrgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-framework-against-topology-and","slug":"a-unified-framework-against-topology-and","title":"A Unified Framework against Topology and Class Imbalance","date":"2022-10-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/roland-graph-learning-framework-for-dynamic","slug":"roland-graph-learning-framework-for-dynamic","title":"ROLAND: Graph Learning Framework for Dynamic Graphs","date":"2022-08-15","arxiv_id":"2208.07239","repositories_listed":2,"syntology":null},{"url":"/paper/learning-long-term-spatial-temporal-graphs","slug":"learning-long-term-spatial-temporal-graphs","title":"Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection","date":"2022-07-15","arxiv_id":"2207.07783","repositories_listed":2,"syntology":null},{"url":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}},"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/all-the-world-s-a-hyper-graph-a-data-drama","slug":"all-the-world-s-a-hyper-graph-a-data-drama","title":"All the World's a (Hyper)Graph: A Data Drama","date":"2022-06-16","arxiv_id":"2206.08225","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/all-the-world-s-a-hyper-graph-a-data-drama#ran","syntology_url":"https://syntology.ai/paper/2206.08225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08225"}},"official":{"repos":["hyperbard/hyperbard","hyperbard/tutorials"],"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/dual-contrastive-attributed-graph-clustering","slug":"dual-contrastive-attributed-graph-clustering","title":"NCAGC: A Neighborhood Contrast Framework for Attributed Graph Clustering","date":"2022-06-16","arxiv_id":"2206.07897","repositories_listed":2,"syntology":null},{"url":"/paper/long-range-graph-benchmark","slug":"long-range-graph-benchmark","title":"Long Range Graph Benchmark","date":"2022-06-16","arxiv_id":"2206.08164","repositories_listed":2,"syntology":null},{"url":"/paper/kgtuner-efficient-hyper-parameter-search-for","slug":"kgtuner-efficient-hyper-parameter-search-for","title":"KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning","date":"2022-05-05","arxiv_id":"2205.02460","repositories_listed":2,"syntology":{"n":19,"n_ran":11,"n_constructed":3,"n_ran_checked":6,"n_instrument":5,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":18,"phrase":"11 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/kgtuner-efficient-hyper-parameter-search-for#ran","syntology_url":"https://syntology.ai/paper/2205.02460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02460"}},"official":{"repos":["automl-research/kgtuner"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/hypergraph-convolutional-networks-via-1","slug":"hypergraph-convolutional-networks-via-1","title":"Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs","date":"2022-03-31","arxiv_id":"2203.16939","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/hypergraph-convolutional-networks-via-1#ran","syntology_url":"https://syntology.ai/paper/2203.16939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16939"}},"official":{"repos":["youjibiying/H-GNNs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/source-free-progressive-graph-learning-for","slug":"source-free-progressive-graph-learning-for","title":"Source-Free Progressive Graph Learning for Open-Set Domain Adaptation","date":"2022-02-13","arxiv_id":"2202.06174","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/source-free-progressive-graph-learning-for#ran","syntology_url":"https://syntology.ai/paper/2202.06174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06174"}},"official":{"repos":["BUserName/PGL","luoyadan/sf-pgl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-and-generalizable-graph","slug":"interpretable-and-generalizable-graph","title":"Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism","date":"2022-01-31","arxiv_id":"2201.12987","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/interpretable-and-generalizable-graph#ran","syntology_url":"https://syntology.ai/paper/2201.12987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12987"}},"official":{"repos":["Graph-COM/GSAT"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-approximation-of-extended-persistent","slug":"neural-approximation-of-extended-persistent","title":"Neural Approximation of Graph Topological Features","date":"2022-01-28","arxiv_id":"2201.12032","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-approximation-of-extended-persistent#ran","syntology_url":"https://syntology.ai/paper/2201.12032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12032"}},"official":{"repos":["pkuyzy/TLC-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-scale-adaptive-graph-neural-network-for","slug":"multi-scale-adaptive-graph-neural-network-for","title":"Multi-Scale Adaptive Graph Neural Network for Multivariate Time Series Forecasting","date":"2022-01-13","arxiv_id":"2201.04828","repositories_listed":2,"syntology":null},{"url":"/paper/tcgl-temporal-contrastive-graph-for-self","slug":"tcgl-temporal-contrastive-graph-for-self","title":"TCGL: Temporal Contrastive Graph for Self-supervised Video Representation Learning","date":"2021-12-07","arxiv_id":"2112.03587","repositories_listed":2,"syntology":null},{"url":"/paper/joint-graph-learning-and-matching-for","slug":"joint-graph-learning-and-matching-for","title":"Joint Graph Learning and Matching for Semantic Feature Correspondence","date":"2021-09-01","arxiv_id":"2109.00240","repositories_listed":2,"syntology":null},{"url":"/paper/gipa-general-information-propagation","slug":"gipa-general-information-propagation","title":"GIPA: General Information Propagation Algorithm for Graph Learning","date":"2021-05-13","arxiv_id":"2105.06035","repositories_listed":2,"syntology":null},{"url":"/paper/consistency-of-mechanistic-causal-discovery","slug":"consistency-of-mechanistic-causal-discovery","title":"Neural graphical modelling in continuous-time: consistency guarantees and algorithms","date":"2021-05-06","arxiv_id":"2105.02522","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/consistency-of-mechanistic-causal-discovery#ran","syntology_url":"https://syntology.ai/paper/2105.02522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02522"}},"official":{"repos":["vanderschaarlab/mlforhealthlabpub"],"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/autogl-a-library-for-automated-graph-learning","slug":"autogl-a-library-for-automated-graph-learning","title":"AutoGL: A Library for Automated Graph Learning","date":"2021-04-11","arxiv_id":"2104.04987","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autogl-a-library-for-automated-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2104.04987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04987"}},"official":{"repos":["THUMNLab/AutoGL","thumnlab/autogl-light"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graphsmote-imbalanced-node-classification-on","slug":"graphsmote-imbalanced-node-classification-on","title":"GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks","date":"2021-03-16","arxiv_id":"2103.08826","repositories_listed":2,"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":2,"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/graphsmote-imbalanced-node-classification-on#ran","syntology_url":"https://syntology.ai/paper/2103.08826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08826"}},"official":{"repos":["TianxiangZhao/GraphSmote"],"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/automated-machine-learning-on-graphs-a-survey","slug":"automated-machine-learning-on-graphs-a-survey","title":"Automated Machine Learning on Graphs: A Survey","date":"2021-03-01","arxiv_id":"2103.00742","repositories_listed":2,"syntology":null},{"url":"/paper/pgl-at-textgraphs-2020-shared-task","slug":"pgl-at-textgraphs-2020-shared-task","title":"PGL at TextGraphs 2020 Shared Task: Explanation Regeneration using Language and Graph Learning Methods","date":"2020-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-graph-learning-by-joint-modeling","slug":"multi-view-graph-learning-by-joint-modeling","title":"Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistency","date":"2020-08-24","arxiv_id":"2008.10208","repositories_listed":2,"syntology":null},{"url":"/paper/graph-convolutional-networks-for-graphs","slug":"graph-convolutional-networks-for-graphs","title":"Graph Convolutional Networks for Graphs Containing Missing Features","date":"2020-07-09","arxiv_id":"2007.04583","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-convolutional-networks-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2007.04583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04583"}},"official":{"repos":["marblet/GCNmf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-graph-neural-networks-with","slug":"scaling-graph-neural-networks-with","title":"Scaling Graph Neural Networks with Approximate PageRank","date":"2020-07-03","arxiv_id":"2007.01570","repositories_listed":2,"syntology":null},{"url":"/paper/iterative-deep-graph-learning-for-graph-1","slug":"iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","arxiv_id":"2006.13009","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/iterative-deep-graph-learning-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2006.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13009"}},"official":{"repos":["hugochan/IDGL"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-self-supervised-program-repair","slug":"graph-based-self-supervised-program-repair","title":"Graph-based, Self-Supervised Program Repair from Diagnostic Feedback","date":"2020-05-20","arxiv_id":"2005.10636","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 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) · 2 unverified","sample_list":"/paper/graph-based-self-supervised-program-repair#ran","syntology_url":"https://syntology.ai/paper/2005.10636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10636"}},"official":{"repos":["michiyasunaga/DrRepair","worksheets.codalab.org/worksheets/0x01838644724a433c932bef4cb5c42fbd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-landmark-detection-via-topology","slug":"structured-landmark-detection-via-topology","title":"Structured Landmark Detection via Topology-Adapting Deep Graph Learning","date":"2020-04-17","arxiv_id":"2004.08190","repositories_listed":2,"syntology":null},{"url":"/paper/pick-processing-key-information-extraction","slug":"pick-processing-key-information-extraction","title":"PICK: Processing Key Information Extraction from Documents using Improved Graph Learning-Convolutional Networks","date":"2020-04-16","arxiv_id":"2004.07464","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pick-processing-key-information-extraction#ran","syntology_url":"https://syntology.ai/paper/2004.07464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07464"}},"official":{"repos":["wenwenyu/PICK-pytorch"],"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":["listed","official"]}}},{"url":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","repositories_listed":2,"syntology":null},{"url":"/paper/automating-botnet-detection-with-graph-neural","slug":"automating-botnet-detection-with-graph-neural","title":"Automating Botnet Detection with Graph Neural Networks","date":"2020-03-13","arxiv_id":"2003.06344","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/automating-botnet-detection-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2003.06344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06344"}},"official":{"repos":["harvardnlp/botnet-detection"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","repositories_listed":2,"syntology":null},{"url":"/paper/structured-graph-learning-via-laplacian","slug":"structured-graph-learning-via-laplacian","title":"Structured Graph Learning Via Laplacian Spectral Constraints","date":"2019-09-24","arxiv_id":"1909.11594","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/structured-graph-learning-via-laplacian#ran","syntology_url":"https://syntology.ai/paper/1909.11594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11594"}},"official":{"repos":["dppalomar/spectralGraphTopology"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}},"official":null}},{"url":"/paper/a-unified-framework-for-structured-graph","slug":"a-unified-framework-for-structured-graph","title":"A Unified Framework for Structured Graph Learning via Spectral Constraints","date":"2019-04-22","arxiv_id":"1904.09792","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","repositories_listed":2,"syntology":null},{"url":"/paper/robust-graph-learning-from-noisy-data","slug":"robust-graph-learning-from-noisy-data","title":"Robust Graph Learning from Noisy Data","date":"2018-12-17","arxiv_id":"1812.06673","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-graph-learning-for-anti-money","slug":"scalable-graph-learning-for-anti-money","title":"Scalable Graph Learning for Anti-Money Laundering: A First Look","date":"2018-11-30","arxiv_id":"1812.00076","repositories_listed":2,"syntology":null},{"url":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","repositories_listed":2,"syntology":null},{"url":"/paper/accurate-efficient-and-scalable-graph","slug":"accurate-efficient-and-scalable-graph","title":"Accurate, Efficient and Scalable Graph Embedding","date":"2018-10-28","arxiv_id":"1810.11899","repositories_listed":2,"syntology":null},{"url":"/paper/covariant-compositional-networks-for-learning","slug":"covariant-compositional-networks-for-learning","title":"Covariant Compositional Networks For Learning Graphs","date":"2018-01-07","arxiv_id":"1801.02144","repositories_listed":2,"syntology":null},{"url":"/paper/graph-learning-from-data-under-structural-and","slug":"graph-learning-from-data-under-structural-and","title":"Graph Learning from Data under Structural and Laplacian Constraints","date":"2016-11-16","arxiv_id":"1611.05181","repositories_listed":2,"syntology":null},{"url":"/paper/learning-laplacian-matrix-in-smooth-graph","slug":"learning-laplacian-matrix-in-smooth-graph","title":"Learning Laplacian Matrix in Smooth Graph Signal Representations","date":"2014-06-30","arxiv_id":"1406.7842","repositories_listed":2,"syntology":null},{"url":"/paper/graph-world-model","slug":"graph-world-model","title":"Graph World Model","date":"2025-07-14","arxiv_id":"2507.10539","repositories_listed":1,"syntology":null},{"url":"/paper/gdgb-a-benchmark-for-generative-dynamic-text","slug":"gdgb-a-benchmark-for-generative-dynamic-text","title":"GDGB: A Benchmark for Generative Dynamic Text-Attributed Graph Learning","date":"2025-07-04","arxiv_id":"2507.03267","repositories_listed":1,"syntology":null},{"url":"/paper/s2fgl-spatial-spectral-federated-graph","slug":"s2fgl-spatial-spectral-federated-graph","title":"S2FGL: Spatial Spectral Federated Graph Learning","date":"2025-07-03","arxiv_id":"2507.02409","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-learning-via-spectral","slug":"self-supervised-graph-learning-via-spectral","title":"Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations","date":"2025-06-25","arxiv_id":"2506.20362","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-graph-databases","slug":"higher-order-graph-databases","title":"Higher-Order Graph Databases","date":"2025-06-24","arxiv_id":"2506.19661","repositories_listed":1,"syntology":null},{"url":"/paper/delving-into-instance-dependent-label-noise","slug":"delving-into-instance-dependent-label-noise","title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","date":"2025-06-14","arxiv_id":"2506.12468","repositories_listed":1,"syntology":null},{"url":"/paper/trustglm-evaluating-the-robustness-of","slug":"trustglm-evaluating-the-robustness-of","title":"TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attacks","date":"2025-06-13","arxiv_id":"2506.11844","repositories_listed":1,"syntology":null},{"url":"/paper/evinet-evidential-reasoning-network-for","slug":"evinet-evidential-reasoning-network-for","title":"EviNet: Evidential Reasoning Network for Resilient Graph Learning in the Open and Noisy Environments","date":"2025-06-08","arxiv_id":"2506.07288","repositories_listed":1,"syntology":null}],"syntology_records":43,"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":193,"papers_where_code_ran_first_page":"/task/graph-learning/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":"archive","page":2,"of":16,"url":"/task/graph-learning/papers/2","json":"/task/graph-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":16,"url":"/task/graph-learning/papers/3","json":"/task/graph-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":16,"url":"/task/graph-learning/papers/4","json":"/task/graph-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":16,"url":"/task/graph-learning/papers/5","json":"/task/graph-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":16,"url":"/task/graph-learning/papers/6","json":"/task/graph-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":16,"url":"/task/graph-learning/papers/7","json":"/task/graph-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":16,"url":"/task/graph-learning/papers/8","json":"/task/graph-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":16,"url":"/task/graph-learning/papers/9","json":"/task/graph-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":16,"url":"/task/graph-learning/papers/10","json":"/task/graph-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":16,"url":"/task/graph-learning/papers/11","json":"/task/graph-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":16,"url":"/task/graph-learning/papers/12","json":"/task/graph-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":16,"url":"/task/graph-learning/papers/13","json":"/task/graph-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":16,"url":"/task/graph-learning/papers/14","json":"/task/graph-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":16,"url":"/task/graph-learning/papers/15","json":"/task/graph-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":16,"url":"/task/graph-learning/papers/16","json":"/task/graph-learning/papers/16.json","rows":70},{"order":"ran","page":1,"of":2,"url":"/task/graph-learning/papers/ran/1","json":"/task/graph-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/graph-learning/papers/ran/2","json":"/task/graph-learning/papers/ran/2.json","rows":93}],"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":"e885674689b6db608e2ce3b98a54b43abe578c4dd02da4c1ad15747f28023ccb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}