{"url":"/sota/graph-regression-on-zinc","task":{"name":"Graph Regression","url":"/task/graph-regression","note":null},"dataset":{"name":"ZINC","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":27,"rows_with_code":25,"rows_with_paper_page":27,"rows_dated":27,"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":"TIGT","metrics":{"MAE":"0.057"},"uses_additional_data":false,"paper_date":"2024-02-03","paper":"/paper/topology-informed-graph-transformer","paper_url":"https://arxiv.org/abs/2402.02005v1","paper_title":"Topology-Informed Graph Transformer","code":"https://github.com/leemingo/tigt","n_code_links":2,"syntology":{"n_ran":14,"n_unverified":7,"n_samples":21,"n_pointer_only_licence":21}},{"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":"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":6,"model":"CKGCN","metrics":{"MAE":"0.059"},"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}},{"rank_in_archive_order":7,"model":"NeuralWalker","metrics":{"MAE":"0.065 ± 0.001"},"uses_additional_data":false,"paper_date":"2024-06-05","paper":"/paper/learning-long-range-dependencies-on-graphs","paper_url":"https://arxiv.org/abs/2406.03386v2","paper_title":"Learning Long Range Dependencies on Graphs via Random Walks","code":"https://github.com/borgwardtlab/neuralwalker","n_code_links":1,"syntology":{"n_ran":13,"n_unverified":0,"n_samples":13,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"PDF","metrics":{"MAE":"0.066 ± 0.002"},"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":9,"model":"GPS","metrics":{"MAE":"0.070 ± 0.002"},"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":10,"model":"GINE","metrics":{"MAE":"0.070 ± 0.004"},"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":11,"model":"SAGNN","metrics":{"MAE":"0.072±0.002"},"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":12,"model":"CIN++","metrics":{"MAE":"0.074"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/cin-enhancing-topological-message-passing","paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","code":"https://github.com/twitter-research/cwn","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"GraphMLPMixer","metrics":{"MAE":"0.075 ± 0.001"},"uses_additional_data":false,"paper_date":"2022-12-27","paper":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","paper_url":"https://arxiv.org/abs/2212.13350v2","paper_title":"A Generalization of ViT/MLP-Mixer to Graphs","code":"https://github.com/XiaoxinHe/Graph-ViT-MLPMixer","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"CIN++-500k","metrics":{"MAE":"0.077"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/cin-enhancing-topological-message-passing","paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","code":"https://github.com/twitter-research/cwn","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"EIGENFORMER","metrics":{"MAE":"0.077"},"uses_additional_data":false,"paper_date":"2024-01-31","paper":"/paper/graph-transformers-without-positional","paper_url":"https://arxiv.org/abs/2401.17791v3","paper_title":"Graph Transformers without Positional Encodings","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"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":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":"CIN++-small","metrics":{"MAE":"0.091"},"uses_additional_data":false,"paper_date":"2023-06-06","paper":"/paper/cin-enhancing-topological-message-passing","paper_url":"https://arxiv.org/abs/2306.03561v1","paper_title":"CIN++: Enhancing Topological Message Passing","code":"https://github.com/twitter-research/cwn","n_code_links":1,"syntology":null},{"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":"PIN","metrics":{"MAE":"0.096"},"uses_additional_data":false,"paper_date":"2023-08-13","paper":"/paper/generalizing-topological-graph-neural","paper_url":"https://arxiv.org/abs/2308.06838v6","paper_title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","code":null,"n_code_links":0,"syntology":null},{"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":"PNA","metrics":{"MAE":"0.142"},"uses_additional_data":false,"paper_date":"2020-04-12","paper":"/paper/principal-neighbourhood-aggregation-for-graph","paper_url":"https://arxiv.org/abs/2004.05718v5","paper_title":"Principal Neighbourhood Aggregation for Graph Nets","code":"https://github.com/rusty1s/pytorch_geometric","n_code_links":8,"syntology":{"n_ran":33,"n_unverified":22,"n_samples":55,"n_pointer_only_licence":48}},{"rank_in_archive_order":23,"model":"MMA","metrics":{"MAE":"0.156"},"uses_additional_data":false,"paper_date":"2022-11-24","paper":"/paper/multi-mask-aggregators-for-graph-neural","paper_url":"https://openreview.net/forum?id=hZ3b8CskgC","paper_title":"Multi-Mask Aggregators for Graph Neural Networks","code":"https://github.com/asarigun/mma","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"BoP","metrics":{"MAE":"0.297"},"uses_additional_data":false,"paper_date":"2024-11-17","paper":"/paper/from-primes-to-paths-enabling-fast-multi","paper_url":"https://arxiv.org/abs/2411.11149v1","paper_title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","code":"https://github.com/kbogas/PAM_BoP","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"ChebNet","metrics":{"MAE":"0.360"},"uses_additional_data":false,"paper_date":"2020-12-18","paper":"/paper/an-experimental-study-of-the-transferability","paper_url":"https://arxiv.org/abs/2012.10258v1","paper_title":"An Experimental Study of the Transferability of Spectral Graph Networks","code":"https://github.com/Axeln78/Transferability-of-spectral-gnns","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":26,"model":"FactorGCN","metrics":{"MAE":"0.366"},"uses_additional_data":false,"paper_date":"2020-10-12","paper":"/paper/factorizable-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/2010.05421v1","paper_title":"Factorizable Graph Convolutional Networks","code":"https://github.com/ihollywhy/FactorGCN.PyTorch","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":27,"model":"Graph-JEPA","metrics":{"MAE":"0.434"},"uses_additional_data":false,"paper_date":"2023-09-27","paper":"/paper/graph-level-representation-learning-with","paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","code":"https://github.com/geriskenderi/graph-jepa","n_code_links":1,"syntology":{"n_ran":10,"n_unverified":1,"n_samples":11,"n_pointer_only_licence":0}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+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":13,"rows_with_any_sample_ran":11,"distinct_papers_with_graph_line":12,"distinct_papers_with_any_sample_ran":10,"samples_over_distinct_papers":{"n_ran":92,"n_unverified":69,"n_samples":161,"n_pointer_only_licence":81,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":95,"n_unverified":87,"n_samples":182,"n_pointer_only_licence":81,"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"}}}