{"url":"/sota/graph-regression-on-zinc-500k","task":{"name":"Graph Regression","url":"/task/graph-regression","note":null},"dataset":{"name":"ZINC-500k","url":"/dataset/zinc"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"The regression task is similar to graph classification but using different loss function and performance metric.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["MAE"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"MAE":"lower"}},"counts":{"rows":36,"rows_with_code":35,"rows_with_paper_page":36,"rows_dated":36,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"ESA + rings + NodeRWSE + EdgeRWSE","metrics":{"MAE":"0.051"},"uses_additional_data":false,"paper_date":"2024-02-16","paper":"/paper/masked-attention-is-all-you-need-for-graphs","paper_url":"https://arxiv.org/abs/2402.10793v2","paper_title":"An end-to-end attention-based approach for learning on graphs","code":"https://github.com/davidbuterez/edge-set-attention","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"CSA","metrics":{"MAE":"0.056"},"uses_additional_data":false,"paper_date":"2023-04-21","paper":"/paper/self-attention-in-colors-another-take-on","paper_url":"https://arxiv.org/abs/2304.10933v1","paper_title":"Self-Attention in Colors: Another Take on Encoding Graph Structure in Transformers","code":"https://github.com/inria-thoth/csa","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"N2-GNN","metrics":{"MAE":"0.059"},"uses_additional_data":false,"paper_date":"2023-06-05","paper":"/paper/extending-the-design-space-of-graph-neural-1","paper_url":"https://arxiv.org/abs/2306.03266v3","paper_title":"Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman","code":"https://github.com/jiaruifeng/n2gnn","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"GRIT","metrics":{"MAE":"0.059"},"uses_additional_data":false,"paper_date":"2023-05-27","paper":"/paper/graph-inductive-biases-in-transformers","paper_url":"https://arxiv.org/abs/2305.17589v1","paper_title":"Graph Inductive Biases in Transformers without Message Passing","code":"https://github.com/liamma/grit","n_code_links":2,"syntology":{"n_ran":6,"n_unverified":6,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"GraphGPS + HDSE","metrics":{"MAE":"0.062"},"uses_additional_data":false,"paper_date":"2023-08-22","paper":"/paper/transformers-for-capturing-multi-level-graph","paper_url":"https://arxiv.org/abs/2308.11129v4","paper_title":"Enhancing Graph Transformers with Hierarchical Distance Structural Encoding","code":"https://github.com/luoyk1999/hdse","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"MFN (CGN)","metrics":{"MAE":"0.063"},"uses_additional_data":false,"paper_date":"2023-10-16","paper":"/paper/equivariant-matrix-function-neural-networks","paper_url":"https://arxiv.org/abs/2310.10434v2","paper_title":"Equivariant Matrix Function Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"GIN+","metrics":{"MAE":"0.065"},"uses_additional_data":false,"paper_date":"2025-02-13","paper":"/paper/unlocking-the-potential-of-classic-gnns-for","paper_url":"https://arxiv.org/abs/2502.09263v1","paper_title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","code":"https://github.com/LUOyk1999/GNNPlus","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":8,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"B-PEARL","metrics":{"MAE":"0.0655"},"uses_additional_data":false,"paper_date":"2025-02-03","paper":"/paper/learning-efficient-positional-encodings-with","paper_url":"https://arxiv.org/abs/2502.01122","paper_title":"Learning Efficient Positional Encodings with Graph Neural Networks","code":"https://github.com/ehejin/Pearl-PE","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"PDF","metrics":{"MAE":"0.066"},"uses_additional_data":false,"paper_date":"2023-05-10","paper":"/paper/towards-better-graph-representation-learning","paper_url":"https://arxiv.org/abs/2305.06102v1","paper_title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","code":"https://github.com/qslim/PDF","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"R-PEARL","metrics":{"MAE":"0.0696"},"uses_additional_data":false,"paper_date":"2025-02-03","paper":"/paper/learning-efficient-positional-encodings-with","paper_url":"https://arxiv.org/abs/2502.01122","paper_title":"Learning Efficient Positional Encodings with Graph Neural Networks","code":"https://github.com/ehejin/Pearl-PE","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"Spec-GN","metrics":{"MAE":"0.0698"},"uses_additional_data":false,"paper_date":"2021-12-14","paper":"/paper/improving-spectral-graph-convolution-for","paper_url":"https://arxiv.org/abs/2112.07160v2","paper_title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","code":"https://github.com/qslim/gnn-spectrum","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"GPS","metrics":{"MAE":"0.070"},"uses_additional_data":false,"paper_date":"2022-05-25","paper":"/paper/recipe-for-a-general-powerful-scalable-graph","paper_url":"https://arxiv.org/abs/2205.12454v4","paper_title":"Recipe for a General, Powerful, Scalable Graph Transformer","code":"https://github.com/rampasek/GraphGPS","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":18,"n_samples":21,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"SAGNN","metrics":{"MAE":"0.072"},"uses_additional_data":false,"paper_date":"2023-06-26","paper":"/paper/substructure-aware-graph-neural-networks","paper_url":"https://ojs.aaai.org/index.php/AAAI/article/view/26318","paper_title":"Substructure Aware Graph Neural Networks","code":"https://github.com/BlackHalo-Drake/SAGNN-Substructure-Aware-Graph-Neural-Networks","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"GPTrans-Nano","metrics":{"MAE":"0.077"},"uses_additional_data":false,"paper_date":"2023-05-19","paper":"/paper/graph-propagation-transformer-for-graph","paper_url":"https://arxiv.org/abs/2305.11424v3","paper_title":"Graph Propagation Transformer for Graph Representation Learning","code":"https://github.com/czczup/gptrans","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":4,"n_samples":8,"n_pointer_only_licence":8}},{"rank_in_archive_order":15,"model":"CIN","metrics":{"MAE":"0.079"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_url":"https://arxiv.org/abs/2106.12575v3","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","code":"https://github.com/twitter-research/cwn","n_code_links":2,"syntology":null},{"rank_in_archive_order":16,"model":"PNA-SignNet","metrics":{"MAE":"0.084"},"uses_additional_data":false,"paper_date":"2022-02-25","paper":"/paper/sign-and-basis-invariant-networks-for","paper_url":"https://arxiv.org/abs/2202.13013v4","paper_title":"Sign and Basis Invariant Networks for Spectral Graph Representation Learning","code":"https://github.com/cptq/SignNet-BasisNet","n_code_links":2,"syntology":null},{"rank_in_archive_order":17,"model":"CRaWl+VN","metrics":{"MAE":"0.088"},"uses_additional_data":false,"paper_date":"2021-02-17","paper":"/paper/graph-learning-with-1d-convolutions-on-random","paper_url":"https://arxiv.org/abs/2102.08786v3","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","code":"https://github.com/toenshoff/CRaWl","n_code_links":1,"syntology":null},{"rank_in_archive_order":18,"model":"GatedGCN-LSPE","metrics":{"MAE":"0.090"},"uses_additional_data":false,"paper_date":"2021-10-15","paper":"/paper/graph-neural-networks-with-learnable-1","paper_url":"https://arxiv.org/abs/2110.07875v2","paper_title":"Graph Neural Networks with Learnable Structural and Positional Representations","code":"https://github.com/vijaydwivedi75/gnn-lspe","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"CIN-small","metrics":{"MAE":"0.094"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","paper_url":"https://arxiv.org/abs/2106.12575v3","paper_title":"Weisfeiler and Lehman Go Cellular: CW Networks","code":"https://github.com/twitter-research/cwn","n_code_links":2,"syntology":null},{"rank_in_archive_order":20,"model":"PNA-LSPE","metrics":{"MAE":"0.095"},"uses_additional_data":false,"paper_date":"2021-10-15","paper":"/paper/graph-neural-networks-with-learnable-1","paper_url":"https://arxiv.org/abs/2110.07875v2","paper_title":"Graph Neural Networks with Learnable Structural and Positional Representations","code":"https://github.com/vijaydwivedi75/gnn-lspe","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"CRaWl","metrics":{"MAE":"0.101"},"uses_additional_data":false,"paper_date":"2021-02-17","paper":"/paper/graph-learning-with-1d-convolutions-on-random","paper_url":"https://arxiv.org/abs/2102.08786v3","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","code":"https://github.com/toenshoff/CRaWl","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"GSN","metrics":{"MAE":"0.101"},"uses_additional_data":false,"paper_date":"2020-06-16","paper":"/paper/improving-graph-neural-network-expressivity","paper_url":"https://arxiv.org/abs/2006.09252v3","paper_title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","code":"https://github.com/gbouritsas/gsn","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":23,"model":"SAN-LSPE","metrics":{"MAE":"0.104"},"uses_additional_data":false,"paper_date":"2021-10-15","paper":"/paper/graph-neural-networks-with-learnable-1","paper_url":"https://arxiv.org/abs/2110.07875v2","paper_title":"Graph Neural Networks with Learnable Structural and Positional Representations","code":"https://github.com/vijaydwivedi75/gnn-lspe","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":24,"model":"EGT","metrics":{"MAE":"0.108"},"uses_additional_data":false,"paper_date":"2021-08-07","paper":"/paper/edge-augmented-graph-transformers-global-self","paper_url":"https://arxiv.org/abs/2108.03348v3","paper_title":"Global Self-Attention as a Replacement for Graph Convolution","code":"https://github.com/shamim-hussain/egt_pytorch","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":25,"model":"Graphormer-SLIM","metrics":{"MAE":"0.122"},"uses_additional_data":false,"paper_date":"2021-06-09","paper":"/paper/do-transformers-really-perform-bad-for-graph","paper_url":"https://arxiv.org/abs/2106.05234v5","paper_title":"Do Transformers Really Perform Bad for Graph Representation?","code":"https://github.com/microsoft/Graphormer","n_code_links":5,"syntology":null},{"rank_in_archive_order":26,"model":"MPNN (sum)","metrics":{"MAE":"0.145 "},"uses_additional_data":false,"paper_date":"2017-04-04","paper":"/paper/neural-message-passing-for-quantum-chemistry","paper_url":"http://arxiv.org/abs/1704.01212v2","paper_title":"Neural Message Passing for Quantum Chemistry","code":"https://github.com/Microsoft/gated-graph-neural-network-samples","n_code_links":20,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":27,"model":"GatedGCN-PE","metrics":{"MAE":"0.214"},"uses_additional_data":false,"paper_date":"2020-03-02","paper":"/paper/benchmarking-graph-neural-networks","paper_url":"https://arxiv.org/abs/2003.00982v5","paper_title":"Benchmarking Graph Neural Networks","code":"https://github.com/graphdeeplearning/benchmarking-gnns","n_code_links":15,"syntology":{"n_ran":8,"n_unverified":15,"n_samples":23,"n_pointer_only_licence":0}},{"rank_in_archive_order":28,"model":"GatedGCN-E-PE","metrics":{"MAE":"0.214"},"uses_additional_data":false,"paper_date":"2020-03-02","paper":"/paper/benchmarking-graph-neural-networks","paper_url":"https://arxiv.org/abs/2003.00982v5","paper_title":"Benchmarking Graph Neural Networks","code":"https://github.com/graphdeeplearning/benchmarking-gnns","n_code_links":15,"syntology":{"n_ran":8,"n_unverified":15,"n_samples":23,"n_pointer_only_licence":0}},{"rank_in_archive_order":29,"model":"MPNN (max)","metrics":{"MAE":"0.252"},"uses_additional_data":false,"paper_date":"2017-04-04","paper":"/paper/neural-message-passing-for-quantum-chemistry","paper_url":"http://arxiv.org/abs/1704.01212v2","paper_title":"Neural Message Passing for Quantum Chemistry","code":"https://github.com/Microsoft/gated-graph-neural-network-samples","n_code_links":20,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":30,"model":"GatedGCN","metrics":{"MAE":"0.282 "},"uses_additional_data":false,"paper_date":"2017-11-20","paper":"/paper/residual-gated-graph-convnets","paper_url":"http://arxiv.org/abs/1711.07553v2","paper_title":"Residual Gated Graph ConvNets","code":"https://github.com/xbresson/spatial_graph_convnets","n_code_links":1,"syntology":null},{"rank_in_archive_order":31,"model":"MoNet","metrics":{"MAE":"0.292"},"uses_additional_data":false,"paper_date":"2016-11-25","paper":"/paper/geometric-deep-learning-on-graphs-and","paper_url":"http://arxiv.org/abs/1611.08402v3","paper_title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/monet","n_code_links":4,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":32,"model":"3WLGNN","metrics":{"MAE":"0.303"},"uses_additional_data":false,"paper_date":"2019-05-27","paper":"/paper/provably-powerful-graph-networks","paper_url":"https://arxiv.org/abs/1905.11136v4","paper_title":"Provably Powerful Graph Networks","code":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks_torch","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":6,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":33,"model":"RingGNN","metrics":{"MAE":"0.353"},"uses_additional_data":false,"paper_date":"2019-05-29","paper":"/paper/on-the-equivalence-between-graph-isomorphism","paper_url":"https://arxiv.org/abs/1905.12560v2","paper_title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","code":"https://github.com/leichen2018/Ring-GNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":34,"model":"GraphSage","metrics":{"MAE":"0.398 "},"uses_additional_data":false,"paper_date":"2017-06-07","paper":"/paper/inductive-representation-learning-on-large","paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py","n_code_links":20,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":35,"model":"GIN","metrics":{"MAE":"0.526"},"uses_additional_data":false,"paper_date":"2018-10-01","paper":"/paper/how-powerful-are-graph-neural-networks","paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin","n_code_links":19,"syntology":{"n_ran":3,"n_unverified":7,"n_samples":10,"n_pointer_only_licence":5}},{"rank_in_archive_order":36,"model":"CKGCN","metrics":{"MAE":"5.9"},"uses_additional_data":false,"paper_date":"2024-04-21","paper":"/paper/ckgconv-general-graph-convolution-with","paper_url":"https://arxiv.org/abs/2404.13604v2","paper_title":"CKGConv: General Graph Convolution with Continuous Kernels","code":"https://github.com/networkslab/ckgconv","n_code_links":1,"syntology":{"n_ran":8,"n_unverified":3,"n_samples":11,"n_pointer_only_licence":11}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":23,"rows_with_any_sample_ran":16,"distinct_papers_with_graph_line":19,"distinct_papers_with_any_sample_ran":12,"samples_over_distinct_papers":{"n_ran":52,"n_unverified":96,"n_samples":148,"n_pointer_only_licence":30,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":75,"n_unverified":113,"n_samples":188,"n_pointer_only_licence":31,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}