{"url":"/sota/graph-property-prediction-on-ogbg-ppa","task":{"name":"Graph Property Prediction","url":"/task/graph-property-prediction","note":null},"dataset":{"name":"ogbg-ppa","url":"/dataset/ogb"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":null,"description_from":null,"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":["Ext. data","Test Accuracy","Validation Accuracy","Number of params"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Ext. data":null,"Test Accuracy":"higher","Validation Accuracy":"higher","Number of params":"lower"}},"counts":{"rows":18,"rows_with_code":14,"rows_with_paper_page":14,"rows_dated":14,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GatedGCN+","metrics":{"Ext. data":"No","Number of params":"5547557","Test Accuracy":"0.8258 ± 0.0055","Validation Accuracy":"0.7815 ± 0.0043"},"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":2,"model":"PAS+F2GNN","metrics":{"Ext. data":"No","Number of params":"16346166","Test Accuracy":"0.8201 ± 0.0019","Validation Accuracy":"0.7720 ± 0.0023"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"ExpC*+bag of tricks","metrics":{"Ext. data":"No","Number of params":"3758642","Test Accuracy":"0.8140 ± 0.0028","Validation Accuracy":"0.7811 ± 0.0012"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":4,"model":"GIN+","metrics":{"Ext. data":"No","Number of params":"8173605","Test Accuracy":"0.8107 ± 0.0053","Validation Accuracy":"0.7786 ± 0.0095"},"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":5,"model":"GCN+","metrics":{"Ext. data":"No","Number of params":"5549605","Test Accuracy":"0.8077 ± 0.0041","Validation Accuracy":"0.7586 ± 0.0032"},"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":6,"model":"GPS","metrics":{"Ext. data":"No","Number of params":"3434533","Test Accuracy":"0.8015","Validation Accuracy":"0.7556 ± 0.0027"},"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":7,"model":"ExpC","metrics":{"Ext. data":"No","Number of params":"1369397","Test Accuracy":"0.7976 ± 0.0072","Validation Accuracy":"0.7518 ± 0.0080"},"uses_additional_data":false,"paper_date":"2020-12-14","paper":"/paper/breaking-the-expressive-bottlenecks-of-graph-1","paper_url":"https://arxiv.org/abs/2012.07219v1","paper_title":"Breaking the Expressive Bottlenecks of Graph Neural Networks","code":"https://github.com/qslim/epcb-gnns","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"PAS","metrics":{"Ext. data":"No","Number of params":"3717160","Test Accuracy":"0.7828 ± 0.0024","Validation Accuracy":"0.7523 ± 0.0028"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"DeeperGCN+FLAG","metrics":{"Ext. data":"No","Number of params":"2336421","Test Accuracy":"0.7752 ± 0.0069","Validation Accuracy":"0.7484 ± 0.0052"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"DeeperGCN","metrics":{"Ext. data":"No","Number of params":"2336421","Test Accuracy":"0.7712 ± 0.0071","Validation Accuracy":"0.7313 ± 0.0078"},"uses_additional_data":false,"paper_date":"2020-06-13","paper":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","paper_url":"https://arxiv.org/abs/2006.07739v1","paper_title":"DeeperGCN: All You Need to Train Deeper GCNs","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/deepergcn","n_code_links":3,"syntology":null},{"rank_in_archive_order":11,"model":"GC-T+MCL(6.0)","metrics":{"Ext. data":"No","Number of params":"4006704","Test Accuracy":"0.7432 ± 0.0033","Validation Accuracy":"0.6989 ± 0.0037"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":12,"model":"GIN+virtual node+FLAG","metrics":{"Ext. data":"No","Number of params":"3288042","Test Accuracy":"0.7245 ± 0.0114","Validation Accuracy":"0.6789 ± 0.0079"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"GIN+virtual node","metrics":{"Ext. data":"No","Number of params":"3288042","Test Accuracy":"0.7037 ± 0.0107","Validation Accuracy":"0.6678 ± 0.0105"},"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":14,"model":"GCN+virtual node+FLAG","metrics":{"Ext. data":"No","Number of params":"1930537","Test Accuracy":"0.6944 ± 0.0052","Validation Accuracy":"0.6638 ± 0.0055"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"GIN+FLAG","metrics":{"Ext. data":"No","Number of params":"1836942","Test Accuracy":"0.6905 ± 0.0092","Validation Accuracy":"0.6465 ± 0.0070"},"uses_additional_data":false,"paper_date":"2020-10-19","paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","paper_url":"https://arxiv.org/abs/2010.09891v3","paper_title":"Robust Optimization as Data Augmentation for Large-scale Graphs","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":12,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"GIN","metrics":{"Ext. data":"No","Number of params":"1836942","Test Accuracy":"0.6892 ± 0.0100","Validation Accuracy":"0.6562 ± 0.0107"},"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":17,"model":"GCN+virtual node","metrics":{"Ext. data":"No","Number of params":"1930537","Test Accuracy":"0.6857 ± 0.0061","Validation Accuracy":"0.6511 ± 0.0048"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":18,"model":"GCN","metrics":{"Ext. data":"No","Number of params":"479437","Test Accuracy":"0.6839 ± 0.0084","Validation Accuracy":"0.6497 ± 0.0034"},"uses_additional_data":false,"paper_date":"2016-09-09","paper":"/paper/semi-supervised-classification-with-graph","paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn","n_code_links":55,"syntology":{"n_ran":32,"n_unverified":26,"n_samples":58,"n_pointer_only_licence":22}}],"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":12,"rows_with_any_sample_ran":12,"distinct_papers_with_graph_line":5,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":45,"n_unverified":71,"n_samples":116,"n_pointer_only_licence":27,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":97,"n_unverified":156,"n_samples":253,"n_pointer_only_licence":54,"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"}}}