{"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-property-prediction","name":"Graph Property Prediction","slug":"graph-property-prediction","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":56,"papers_with_code":47,"benchmarks":5,"benchmark_tables_in_archive":5,"benchmark_tables_shown":5,"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":3,"subtasks":7,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molhiv","slug":"graph-property-prediction-on-ogbg-molhiv","dataset":"ogbg-molhiv","dataset_url":"/dataset/ogb","rows_in_archive":43,"metrics":["Test ROC-AUC","Ext. data","Validation ROC-AUC","Number of params"],"first_row_in_archive_order":{"model":"HyperFusion","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molpcba","slug":"graph-property-prediction-on-ogbg-molpcba","dataset":"ogbg-molpcba","dataset_url":"/dataset/ogb","rows_in_archive":36,"metrics":["Test AP","Ext. data","Validation AP","Number of params"],"first_row_in_archive_order":{"model":"HyperFusino","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-code2","slug":"graph-property-prediction-on-ogbg-code2","dataset":"ogbg-code2","dataset_url":"/dataset/ogb","rows_in_archive":21,"metrics":["Test F1 score","Ext. data","Validation F1 score","Number of params"],"first_row_in_archive_order":{"model":"SAT++ with Magnetic Laplacian","paper_title":"Transformers Meet Directed Graphs","paper_url":"/paper/transformers-meet-directed-graphs","paper_date":"2023-01-31","arxiv_id":"2302.00049","code_links":[{"title":"deepmind/digraph_transformer","url":"https://github.com/deepmind/digraph_transformer"}],"syntology":null}},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-ppa","slug":"graph-property-prediction-on-ogbg-ppa","dataset":"ogbg-ppa","dataset_url":"/dataset/ogb","rows_in_archive":18,"metrics":["Ext. data","Test Accuracy","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GatedGCN+","paper_title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","paper_url":"/paper/unlocking-the-potential-of-classic-gnns-for","paper_date":"2025-02-13","arxiv_id":"2502.09263","code_links":[{"title":"LUOyk1999/GNNPlus","url":"https://github.com/LUOyk1999/GNNPlus"}],"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}},"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/graph-property-prediction-on-qm9","slug":"graph-property-prediction-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":10,"metrics":["Standardized MAE","logMAE","alpha (ma)","gap (meV)"],"first_row_in_archive_order":{"model":"GotenNet (Large)","paper_title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","paper_url":"/paper/gotennet-rethinking-efficient-3d-equivariant","paper_date":"2025-04-24","arxiv_id":null,"code_links":[{"title":"lucidrains/gotennet-pytorch","url":"https://github.com/lucidrains/gotennet-pytorch"},{"title":"sarpaykent/GotenNet","url":"https://github.com/sarpaykent/GotenNet"}],"syntology":null}}],"datasets":[{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000},{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/pcqm4mv2-lsc","name":"PCQM4Mv2-LSC","full_name":"","num_papers_in_archive":17}],"subtasks":[{"url":"/task/nd-regression","name":"ND regression"},{"url":"/task/neutron-pdf","name":"Neutron PDF"},{"url":"/task/neutron-pdf-regression","name":"Neutron PDF regression"},{"url":"/task/sans-regression","name":"SANS regression"},{"url":"/task/saxs-regression","name":"SAXS regression"},{"url":"/task/x-ray-pdf-regression","name":"X-ray PDF regression"},{"url":"/task/xrd-regression","name":"XRD regression"}],"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":56,"of":56,"of_with_code":47,"tagged_in_all":56,"counts":{"archive_papers_tagged":56,"with_a_code_link":47,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/generative-adversarial-networks","slug":"generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","arxiv_id":"1406.2661","repositories_listed":189,"syntology":{"n":55,"n_ran":46,"n_constructed":0,"n_ran_checked":28,"n_instrument":18,"n_unverified":9,"n_honours":4,"n_violates":1,"n_no_contract":23,"n_pointer_only":22,"phrase":"46 ran (of which 0 constructed an object rather than computing a result; 28 with no instrument failure: 4 honoured, 1 violated, 23 with no contract checked; 18 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/generative-adversarial-networks#ran","syntology_url":"https://syntology.ai/paper/1406.2661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.2661"}},"official":{"repos":["goodfeli/adversarial"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"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/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","repositories_listed":5,"syntology":null},{"url":"/paper/e-n-equivariant-graph-neural-networks","slug":"e-n-equivariant-graph-neural-networks","title":"E(n) Equivariant Graph Neural Networks","date":"2021-02-19","arxiv_id":"2102.09844","repositories_listed":5,"syntology":{"n":15,"n_ran":15,"n_constructed":7,"n_ran_checked":9,"n_instrument":6,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":7,"phrase":"15 ran (of which 7 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) · 0 unverified","sample_list":"/paper/e-n-equivariant-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2102.09844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09844"}},"official":{"repos":["vgsatorras/egnn"],"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":["listed","official"]}}},{"url":"/paper/equiformer-equivariant-graph-attention","slug":"equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equiformer-equivariant-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2206.11990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11990"}},"official":{"repos":["atomicarchitects/equiformer"],"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":["listed","official"]}}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"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/robust-deep-auc-maximization-a-new-surrogate","slug":"robust-deep-auc-maximization-a-new-surrogate","title":"Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification","date":"2020-12-06","arxiv_id":"2012.03173","repositories_listed":4,"syntology":null},{"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/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/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/gotennet-rethinking-efficient-3d-equivariant","slug":"gotennet-rethinking-efficient-3d-equivariant","title":"GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks","date":"2025-04-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/global-concept-explanations-for-graphs-by","slug":"global-concept-explanations-for-graphs-by","title":"Global Concept Explanations for Graphs by Contrastive Learning","date":"2024-04-25","arxiv_id":"2404.16532","repositories_listed":2,"syntology":null},{"url":"/paper/equiformerv2-improved-equivariant-transformer","slug":"equiformerv2-improved-equivariant-transformer","title":"EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations","date":"2023-06-21","arxiv_id":"2306.12059","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equiformerv2-improved-equivariant-transformer#ran","syntology_url":"https://syntology.ai/paper/2306.12059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12059"}},"official":{"repos":["atomicarchitects/equiformer_v2"],"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/a-new-perspective-on-building-efficient-and-1","slug":"a-new-perspective-on-building-efficient-and-1","title":"A new perspective on building efficient and expressive 3D equivariant graph neural networks","date":"2023-04-07","arxiv_id":"2304.04757","repositories_listed":2,"syntology":null},{"url":"/paper/nested-graph-neural-networks","slug":"nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","arxiv_id":"2110.13197","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/nested-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2110.13197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13197"}},"official":{"repos":["muhanzhang/nestedgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/geometric-and-physical-quantities-improve-e-3","slug":"geometric-and-physical-quantities-improve-e-3","title":"Geometric and Physical Quantities Improve E(3) Equivariant Message Passing","date":"2021-10-06","arxiv_id":"2110.02905","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/geometric-and-physical-quantities-improve-e-3#ran","syntology_url":"https://syntology.ai/paper/2110.02905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02905"}},"official":{"repos":["robdhess/steerable-e3-gnn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["listed"]}}},{"url":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","slug":"weisfeiler-and-lehman-go-cellular-cw-networks","title":"Weisfeiler and Lehman Go Cellular: CW Networks","date":"2021-06-23","arxiv_id":"2106.12575","repositories_listed":2,"syntology":null},{"url":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}},"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/virtual-nodes-can-help-tackling-distribution","slug":"virtual-nodes-can-help-tackling-distribution","title":"Virtual Nodes Can Help: Tackling Distribution Shifts in Federated Graph Learning","date":"2024-12-26","arxiv_id":"2412.19229","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-self-supervised-graph","slug":"data-driven-self-supervised-graph","title":"Data-Driven Self-Supervised Graph Representation Learning","date":"2024-12-24","arxiv_id":"2412.18316","repositories_listed":1,"syntology":null},{"url":"/paper/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":4,"n_no_contract":1,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"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":["official"]}}},{"url":"/paper/towards-neural-scaling-laws-for-foundation","slug":"towards-neural-scaling-laws-for-foundation","title":"Towards Neural Scaling Laws for Foundation Models on Temporal Graphs","date":"2024-06-14","arxiv_id":"2406.10426","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-neural-scaling-laws-for-foundation#ran","syntology_url":"https://syntology.ai/paper/2406.10426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10426"}},"official":{"repos":["benjaminnNgo/ScalingTGNs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-configuration","slug":"graph-neural-networks-with-configuration","title":"Graph neural networks with configuration cross-attention for tensor compilers","date":"2024-05-26","arxiv_id":"2405.16623","repositories_listed":1,"syntology":null},{"url":"/paper/contextualized-messages-boost-graph","slug":"contextualized-messages-boost-graph","title":"Contextualized Messages Boost Graph Representations","date":"2024-03-19","arxiv_id":"2403.12529","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformers-for-large-graphs","slug":"graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","arxiv_id":"2312.11109","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-transformers-for-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2312.11109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11109"}},"official":{"repos":["snap-research/largegt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tpugraphs-a-performance-prediction-dataset-on-1","slug":"tpugraphs-a-performance-prediction-dataset-on-1","title":"TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational Graphs","date":"2023-08-25","arxiv_id":"2308.13490","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/tpugraphs-a-performance-prediction-dataset-on-1#ran","syntology_url":"https://syntology.ai/paper/2308.13490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13490"}},"official":{"repos":["google-research-datasets/tpu_graphs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-large-graph-property-prediction-via","slug":"learning-large-graph-property-prediction-via","title":"Learning Large Graph Property Prediction via Graph Segment Training","date":"2023-05-21","arxiv_id":"2305.12322","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-large-graph-property-prediction-via#ran","syntology_url":"https://syntology.ai/paper/2305.12322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12322"}},"official":{"repos":["kaidic/gst"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"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) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/data-centric-learning-from-unlabeled-graphs-2","slug":"data-centric-learning-from-unlabeled-graphs-2","title":"Data-Centric Learning from Unlabeled Graphs with Diffusion Model","date":"2023-03-17","arxiv_id":"2303.10108","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/data-centric-learning-from-unlabeled-graphs-2#ran","syntology_url":"https://syntology.ai/paper/2303.10108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10108"}},"official":{"repos":["liugangcode/data_centric_transfer"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/transformers-meet-directed-graphs","slug":"transformers-meet-directed-graphs","title":"Transformers Meet Directed Graphs","date":"2023-01-31","arxiv_id":"2302.00049","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-over-directed-acyclic-graphs-1","slug":"transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","arxiv_id":"2210.13148","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transformers-over-directed-acyclic-graphs-1#ran","syntology_url":"https://syntology.ai/paper/2210.13148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13148"}},"official":null}},{"url":"/paper/graph-property-prediction-on-open-graph","slug":"graph-property-prediction-on-open-graph","title":"Graph Property Prediction on Open Graph Benchmark: A Winning Solution by Graph Neural Architecture Search","date":"2022-07-13","arxiv_id":"2207.06027","repositories_listed":1,"syntology":null},{"url":"/paper/shortest-path-networks-for-graph-property","slug":"shortest-path-networks-for-graph-property","title":"Shortest Path Networks for Graph Property Prediction","date":"2022-06-02","arxiv_id":"2206.01003","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-message-passing-by-retrieving","slug":"augmenting-message-passing-by-retrieving","title":"An Empirical Study of Retrieval-enhanced Graph Neural Networks","date":"2022-06-01","arxiv_id":"2206.00362","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-graphs-on-grassmann-manifold","slug":"embedding-graphs-on-grassmann-manifold","title":"Embedding Graphs on Grassmann Manifold","date":"2022-05-30","arxiv_id":"2205.15068","repositories_listed":1,"syntology":null},{"url":"/paper/torchmd-net-equivariant-transformers-for","slug":"torchmd-net-equivariant-transformers-for","title":"TorchMD-NET: Equivariant Transformers for Neural Network based Molecular Potentials","date":"2022-02-05","arxiv_id":"2202.02541","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-graph-level-predictions-with","slug":"explaining-graph-level-predictions-with","title":"GStarX: Explaining Graph Neural Networks with Structure-Aware Cooperative Games","date":"2022-01-28","arxiv_id":"2201.12380","repositories_listed":1,"syntology":null},{"url":"/paper/improving-spectral-graph-convolution-for","slug":"improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","arxiv_id":"2112.07160","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-spectral-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2112.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07160"}},"official":{"repos":["qslim/gnn-spectrum"],"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":["official"]}}},{"url":"/paper/very-deep-graph-neural-networks-via-noise","slug":"very-deep-graph-neural-networks-via-noise","title":"Simple GNN Regularisation for 3D Molecular Property Prediction & Beyond","date":"2021-06-15","arxiv_id":"2106.07971","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":1,"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/very-deep-graph-neural-networks-via-noise#ran","syntology_url":"https://syntology.ai/paper/2106.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07971"}},"official":null}},{"url":"/paper/molecular-representation-learning-by","slug":"molecular-representation-learning-by","title":"Molecular Representation Learning by Leveraging Chemical Information","date":"2021-03-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/identity-aware-graph-neural-networks","slug":"identity-aware-graph-neural-networks","title":"Identity-aware Graph Neural Networks","date":"2021-01-25","arxiv_id":"2101.10320","repositories_listed":1,"syntology":null},{"url":"/paper/directed-acyclic-graph-neural-networks-1","slug":"directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","arxiv_id":"2101.07965","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-expressive-bottlenecks-of-graph-1","slug":"breaking-the-expressive-bottlenecks-of-graph-1","title":"Breaking the Expressive Bottlenecks of Graph Neural Networks","date":"2020-12-14","arxiv_id":"2012.07219","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutions-that-can-finally-model","slug":"graph-convolutions-that-can-finally-model","title":"Graph convolutions that can finally model local structure","date":"2020-11-30","arxiv_id":"2011.15069","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-property-prediction-with","slug":"improving-graph-property-prediction-with","title":"Improving Graph Property Prediction with Generalized Readout Functions","date":"2020-09-21","arxiv_id":"2009.09919","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","repositories_listed":1,"syntology":null},{"url":null,"slug":"graph-positional-autoencoders-as-self","title":"Graph Positional Autoencoders as Self-supervised Learners","date":"2025-05-29","arxiv_id":"2505.23345","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-state-space-models-improving","title":"Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling","date":"2025-05-24","arxiv_id":"2505.18728","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-generative-pre-trained-transformer","title":"Graph Generative Pre-trained Transformer","date":"2025-01-02","arxiv_id":"2501.01073","repositories_listed":0,"syntology":null},{"url":null,"slug":"attacking-graph-neural-networks-with-bit","title":"Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent","date":"2023-11-02","arxiv_id":"2311.01205","repositories_listed":0,"syntology":null},{"url":"/paper/generalizing-topological-graph-neural","slug":"generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","arxiv_id":"2308.06838","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-go-forward-forward","title":"Graph Neural Networks Go Forward-Forward","date":"2023-02-10","arxiv_id":"2302.05282","repositories_listed":0,"syntology":null},{"url":null,"slug":"affinity-aware-graph-networks","title":"Affinity-Aware Graph Networks","date":"2022-06-23","arxiv_id":"2206.11941","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-over-smoothing-in-graph-neural","title":"Addressing Over-Smoothing in Graph Neural Networks via Deep Supervision","date":"2022-02-25","arxiv_id":"2202.12508","repositories_listed":0,"syntology":null},{"url":null,"slug":"bgl-gpu-efficient-gnn-training-by-optimizing","title":"BGL: GPU-Efficient GNN Training by Optimizing Graph Data I/O and Preprocessing","date":"2021-12-16","arxiv_id":"2112.08541","repositories_listed":0,"syntology":null}],"syntology_records":22,"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":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molhiv","since_archive":"/sota/graph-property-prediction-on-ogbg-molhiv#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molpcba","since_archive":"/sota/graph-property-prediction-on-ogbg-molpcba#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":21,"papers_where_code_ran_first_page":"/task/graph-property-prediction/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-property-prediction/papers/ran/1","json":"/task/graph-property-prediction/papers/ran/1.json","rows":21}],"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":"0640c4c160121b7383baed0c732e00efc0b079a19d576c88ea84dd334ac6abf5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}