{"url":"/sota/graph-regression-on-peptides-struct","task":{"name":"Graph Regression","url":"/task/graph-regression","note":null},"dataset":{"name":"Peptides-struct","url":"/dataset/pascalvoc-sp"},"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":39,"rows_with_code":36,"rows_with_paper_page":39,"rows_dated":39,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"ESA + RWSE (Edge set attention, Random Walk Structural Encoding, tuned)","metrics":{"MAE":"0.2393±0.0004"},"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":"GatedGCN-HSG","metrics":{"MAE":"0.2421±0.0007"},"uses_additional_data":false,"paper_date":"2024-06-22","paper":"/paper/next-level-message-passing-with-hierarchical","paper_url":"https://arxiv.org/abs/2406.15852v2","paper_title":"Next Level Message-Passing with Hierarchical Support Graphs","code":"https://github.com/carlosinator/support-graphs","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":6,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"GCN+","metrics":{"MAE":"0.2421 ± 0.0016"},"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":4,"model":"ECFP + LightGBM","metrics":{"MAE":"0.2432"},"uses_additional_data":false,"paper_date":"2025-01-29","paper":"/paper/molecular-fingerprints-are-strong-models-for","paper_url":"https://arxiv.org/abs/2501.17901v1","paper_title":"Molecular Fingerprints Are Strong Models for Peptide Function Prediction","code":"https://github.com/arch4ngel21/scikit-fingerprints","n_code_links":4,"syntology":null},{"rank_in_archive_order":5,"model":"TT + LightGBM","metrics":{"MAE":"0.2438"},"uses_additional_data":false,"paper_date":"2025-01-29","paper":"/paper/molecular-fingerprints-are-strong-models-for","paper_url":"https://arxiv.org/abs/2501.17901v1","paper_title":"Molecular Fingerprints Are Strong Models for Peptide Function Prediction","code":"https://github.com/arch4ngel21/scikit-fingerprints","n_code_links":4,"syntology":null},{"rank_in_archive_order":6,"model":"Graph ViT","metrics":{"MAE":"0.2449±0.0016"},"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":7,"model":"MGT+WavePE","metrics":{"MAE":"0.2453±0.0025"},"uses_additional_data":false,"paper_date":"2023-02-17","paper":"/paper/multiresolution-graph-transformers-and","paper_url":"https://arxiv.org/abs/2302.08647v4","paper_title":"Multiresolution Graph Transformers and Wavelet Positional Encoding for Learning Hierarchical Structures","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"ESA (Edge set attention, no positional encodings, not tuned)","metrics":{"MAE":"0.2453±0.0003"},"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":9,"model":"RDKit + LightGBM","metrics":{"MAE":"0.2459"},"uses_additional_data":false,"paper_date":"2025-01-29","paper":"/paper/molecular-fingerprints-are-strong-models-for","paper_url":"https://arxiv.org/abs/2501.17901v1","paper_title":"Molecular Fingerprints Are Strong Models for Peptide Function Prediction","code":"https://github.com/arch4ngel21/scikit-fingerprints","n_code_links":4,"syntology":null},{"rank_in_archive_order":10,"model":"GRIT","metrics":{"MAE":"0.2460±0.0012"},"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":11,"model":"GCN-tuned","metrics":{"MAE":"0.2460±0.0007"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"Graph Diffuser","metrics":{"MAE":"0.2461±0.0010"},"uses_additional_data":false,"paper_date":"2023-03-01","paper":"/paper/diffusing-graph-attention","paper_url":"https://arxiv.org/abs/2303.00613v1","paper_title":"Diffusing Graph Attention","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"NeuralWalker","metrics":{"MAE":"0.2463 ± 0.0005"},"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":14,"model":"GINE-tuned","metrics":{"MAE":"0.2473±0.0017"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"GraphMLPMixer","metrics":{"MAE":"0.2475±0.0015"},"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":16,"model":"GatedGCN-tuned","metrics":{"MAE":"0.2477±0.0009"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":17,"model":"CKGCN","metrics":{"MAE":"0.2477"},"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":18,"model":"Exphormer","metrics":{"MAE":"0.2481±0.0007"},"uses_additional_data":false,"paper_date":"2023-03-10","paper":"/paper/exphormer-sparse-transformers-for-graphs","paper_url":"https://arxiv.org/abs/2303.06147v2","paper_title":"Exphormer: Sparse Transformers for Graphs","code":"https://github.com/hamed1375/exphormer","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"TIGT","metrics":{"MAE":"0.2485"},"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":20,"model":"GCN+virtual node","metrics":{"MAE":"0.2488±0.0021"},"uses_additional_data":false,"paper_date":"2023-01-27","paper":"/paper/on-the-connection-between-mpnn-and-graph","paper_url":"https://arxiv.org/abs/2301.11956v4","paper_title":"On the Connection Between MPNN and Graph Transformer","code":"https://github.com/chen-cai-osu/mpnn-gt-connection","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"TokenGT","metrics":{"MAE":"0.2489±0.0013"},"uses_additional_data":false,"paper_date":"2022-07-06","paper":"/paper/pure-transformers-are-powerful-graph-learners","paper_url":"https://arxiv.org/abs/2207.02505v2","paper_title":"Pure Transformers are Powerful Graph Learners","code":"https://github.com/jw9730/tokengt","n_code_links":2,"syntology":{"n_ran":7,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":22,"model":"GPS","metrics":{"MAE":"0.2500±0.0005"},"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":23,"model":"BoP","metrics":{"MAE":"0.25"},"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":24,"model":"GPS-tuned","metrics":{"MAE":"0.2509±0.0014"},"uses_additional_data":false,"paper_date":"2023-09-01","paper":"/paper/where-did-the-gap-go-reassessing-the-long","paper_url":"https://arxiv.org/abs/2309.00367v2","paper_title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","code":"https://github.com/toenshoff/lrgb","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":7,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":25,"model":"CIN++-500k","metrics":{"MAE":"0.2523"},"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":26,"model":"Transformer+LapPE","metrics":{"MAE":"0.2529±0.0016"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":27,"model":"DRew-GCN+LapPE","metrics":{"MAE":"0.2536±0.0015"},"uses_additional_data":false,"paper_date":"2023-05-13","paper":"/paper/drew-dynamically-rewired-message-passing-with","paper_url":"https://arxiv.org/abs/2305.08018v2","paper_title":"DRew: Dynamically Rewired Message Passing with Delay","code":"https://github.com/bengutteridge/drew","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":28,"model":"SAN+RWSE","metrics":{"MAE":"0.2545±0.0012"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":29,"model":"PathNN","metrics":{"MAE":"0.2545±0.0032"},"uses_additional_data":false,"paper_date":"2023-06-09","paper":"/paper/path-neural-networks-expressive-and-accurate","paper_url":"https://arxiv.org/abs/2306.05955v1","paper_title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","code":"https://github.com/gasmichel/pathnns_expressive","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":30,"model":"ViT-PS","metrics":{"MAE":"0.2559"},"uses_additional_data":true,"paper_date":"2023-06-05","paper":"/paper/learning-probabilistic-symmetrization-for-1","paper_url":"https://arxiv.org/abs/2306.02866v3","paper_title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","code":"https://github.com/jw9730/lps","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":13,"n_samples":13,"n_pointer_only_licence":0}},{"rank_in_archive_order":31,"model":"NPQ+GATv2","metrics":{"MAE":"0.2589±0.0031"},"uses_additional_data":false,"paper_date":"2023-07-18","paper":"/paper/neural-priority-queues-for-graph-neural","paper_url":"https://arxiv.org/abs/2307.09660v1","paper_title":"Neural Priority Queues for Graph Neural Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":32,"model":"EIGENFORMER","metrics":{"MAE":"0.2599"},"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":33,"model":"SAN+LapPE","metrics":{"MAE":"0.2683±0.0043"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":34,"model":"GCN + PANDA","metrics":{"MAE":"0.3272±0.0001"},"uses_additional_data":false,"paper_date":"2024-06-06","paper":"/paper/panda-expanded-width-aware-message-passing","paper_url":"https://arxiv.org/abs/2406.03671v2","paper_title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","code":"https://github.com/jeongwhanchoi/panda","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":2,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":35,"model":"GatedGCN+RWSE","metrics":{"MAE":"0.3357±0.0006"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":36,"model":"GatedGCN","metrics":{"MAE":"0.3420±0.0013"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":37,"model":"GCNII","metrics":{"MAE":"0.3471±0.0010"},"uses_additional_data":false,"paper_date":"2020-07-04","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","code":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv","n_code_links":4,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":4}},{"rank_in_archive_order":38,"model":"GCN","metrics":{"MAE":"0.3496±0.0013"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null},{"rank_in_archive_order":39,"model":"GINE","metrics":{"MAE":"0.3547±0.0045"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/long-range-graph-benchmark","paper_url":"https://arxiv.org/abs/2206.08164v4","paper_title":"Long Range Graph Benchmark","code":"https://github.com/vijaydwivedi75/lrgb","n_code_links":2,"syntology":null}],"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":21,"rows_with_any_sample_ran":20,"distinct_papers_with_graph_line":17,"distinct_papers_with_any_sample_ran":16,"samples_over_distinct_papers":{"n_ran":86,"n_unverified":82,"n_samples":168,"n_pointer_only_licence":43,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":103,"n_unverified":104,"n_samples":207,"n_pointer_only_licence":43,"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"}}}