{"url":"/sota/node-property-prediction-on-ogbn-proteins","task":{"name":"Node Property Prediction","url":"/task/node-property-prediction","note":null},"dataset":{"name":"ogbn-proteins","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 ROC-AUC","Validation ROC-AUC","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 ROC-AUC":"higher","Validation ROC-AUC":"higher","Number of params":"lower"}},"counts":{"rows":26,"rows_with_code":22,"rows_with_paper_page":23,"rows_dated":23,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"LD+GAT","metrics":{"Ext. data":"Yes","Number of params":"664233700","Test ROC-AUC":"0.8942 ± 0.0007","Validation ROC-AUC":"0.9527 ± 0.0007"},"uses_additional_data":false,"paper_date":"2023-09-26","paper":"/paper/label-deconvolution-for-node-representation","paper_url":"https://arxiv.org/abs/2309.14907v1","paper_title":"Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Bias","code":"https://github.com/MIRALab-USTC/LD","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"GIPA(Wide&Deep)","metrics":{"Ext. data":"No","Number of params":"17438716","Test ROC-AUC":"0.8917 ± 0.0007","Validation ROC-AUC":"0.9472 ± 0.0020"},"uses_additional_data":false,"paper_date":"2023-01-19","paper":"/paper/gipa-a-general-information-propagation","paper_url":"https://arxiv.org/abs/2301.08209v2","paper_title":"GIPA: A General Information Propagation Algorithm for Graph Learning","code":"https://github.com/houyili/gipa_wide_deep","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"AGDN","metrics":{"Ext. data":"No","Number of params":"8605486","Test ROC-AUC":"0.8865 ± 0.0013","Validation ROC-AUC":"0.9418 ± 0.0005"},"uses_additional_data":false,"paper_date":"2020-12-30","paper":"/paper/adaptive-graph-diffusion-networks-with-hop","paper_url":"https://arxiv.org/abs/2012.15024v2","paper_title":"Adaptive Graph Diffusion Networks","code":"https://github.com/skepsun/SAGN_with_SLE","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"RevGNN-Wide","metrics":{"Ext. data":"No","Number of params":"68471608","Test ROC-AUC":"0.8824 ± 0.0015","Validation ROC-AUC":"0.9450 ± 0.0008"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/training-graph-neural-networks-with-1000","paper_url":"https://arxiv.org/abs/2106.07476v3","paper_title":"Training Graph Neural Networks with 1000 Layers","code":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb_eff/ogbn_arxiv_dgl","n_code_links":4,"syntology":{"n_ran":1,"n_unverified":10,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"GAT+BOT+NGNN","metrics":{"Ext. data":"No","Number of params":"11740552","Test ROC-AUC":"0.8809 ± 0.0016","Validation ROC-AUC":"0.9375 ± 0.0019"},"uses_additional_data":false,"paper_date":"2021-11-23","paper":"/paper/network-in-graph-neural-network","paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"RevGNN-Deep","metrics":{"Ext. data":"No","Number of params":"20031384","Test ROC-AUC":"0.8774 ± 0.0013","Validation ROC-AUC":"0.9326 ± 0.0006"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/training-graph-neural-networks-with-1000","paper_url":"https://arxiv.org/abs/2106.07476v3","paper_title":"Training Graph Neural Networks with 1000 Layers","code":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb_eff/ogbn_arxiv_dgl","n_code_links":4,"syntology":{"n_ran":1,"n_unverified":10,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"GAT+BoT","metrics":{"Ext. data":"No","Number of params":"2484192","Test ROC-AUC":"0.8765 ± 0.0008","Validation ROC-AUC":"0.9280 ± 0.0008"},"uses_additional_data":false,"paper_date":"2021-03-24","paper":"/paper/bag-of-tricks-of-semi-supervised","paper_url":"https://arxiv.org/abs/2103.13355v4","paper_title":"Bag of Tricks for Node Classification with Graph Neural Networks","code":"https://github.com/orion-wyc/gaga","n_code_links":2,"syntology":null},{"rank_in_archive_order":8,"model":"GAT + labels + node2vec","metrics":{"Ext. data":"No","Number of params":"6360470","Test ROC-AUC":"0.8711 ± 0.0007","Validation ROC-AUC":"0.9217 ± 0.0011"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":9,"model":"GIPA","metrics":{"Ext. data":"No","Number of params":"4831056","Test ROC-AUC":"0.8700 ± 0.0010","Validation ROC-AUC":"0.9187 ± 0.0003"},"uses_additional_data":false,"paper_date":"2021-05-13","paper":"/paper/gipa-general-information-propagation","paper_url":"https://arxiv.org/abs/2105.06035v2","paper_title":"GIPA: General Information Propagation Algorithm for Graph Learning","code":"https://github.com/houyili/gipa_wide_deep","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"UniMP+CrossEdgeFeat","metrics":{"Ext. data":"No","Number of params":"1959984","Test ROC-AUC":"0.8691 ± 0.0018","Validation ROC-AUC":"0.9258 ± 0.0009"},"uses_additional_data":false,"paper_date":"2020-09-08","paper":"/paper/masked-label-prediction-unified-massage","paper_url":"https://arxiv.org/abs/2009.03509v5","paper_title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","code":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/unimp","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":4,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"GAT+EdgeFeatureAtt","metrics":{"Ext. data":"No","Number of params":"2475232","Test ROC-AUC":"0.8682 ± 0.0021","Validation ROC-AUC":"0.9194 ± 0.0003"},"uses_additional_data":false,"paper_date":"2021-03-24","paper":"/paper/bag-of-tricks-of-semi-supervised","paper_url":"https://arxiv.org/abs/2103.13355v4","paper_title":"Bag of Tricks for Node Classification with Graph Neural Networks","code":"https://github.com/orion-wyc/gaga","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"UniMP","metrics":{"Ext. data":"No","Number of params":"1909104","Test ROC-AUC":"0.8642 ± 0.0008","Validation ROC-AUC":"0.9175 ± 0.0006"},"uses_additional_data":false,"paper_date":"2020-09-08","paper":"/paper/masked-label-prediction-unified-massage","paper_url":"https://arxiv.org/abs/2009.03509v5","paper_title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","code":"https://github.com/PaddlePaddle/PGL/tree/main/ogb_examples/nodeproppred/unimp","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":4,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"DeeperGCN+FLAG","metrics":{"Ext. data":"No","Number of params":"2374568","Test ROC-AUC":"0.8596 ± 0.0027","Validation ROC-AUC":"0.9132 ± 0.0022"},"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":14,"model":"DeeperGCN","metrics":{"Ext. data":"No","Number of params":"2374568","Test ROC-AUC":"0.8580 ± 0.0017","Validation ROC-AUC":"0.9106 ± 0.0016"},"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":15,"model":"GAT","metrics":{"Ext. data":"No","Number of params":"2943472","Test ROC-AUC":"0.8501 ± 0.0046","Validation ROC-AUC":"0.9067 ± 0.0043"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","code":"https://github.com/LUOyk1999/tunedGNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"DeepGCN","metrics":{"Ext. data":"No","Number of params":"2374456","Test ROC-AUC":"0.8496 ± 0.0028","Validation ROC-AUC":"0.8971 ± 0.0011"},"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":17,"model":"MWE-DGCN","metrics":{"Ext. data":"No","Number of params":"538544","Test ROC-AUC":"0.8436 ± 0.0065","Validation ROC-AUC":"0.8973 ± 0.0057"},"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":18,"model":"GEN + FLAG + node2vec","metrics":{"Ext. data":"No","Number of params":"487436","Test ROC-AUC":"0.8251 ± 0.0043","Validation ROC-AUC":"0.8656 ± 0.0037"},"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":19,"model":"GraphSAGE","metrics":{"Ext. data":"No","Number of params":"2444896","Test ROC-AUC":"0.8221 ± 0.0032","Validation ROC-AUC":"0.8831 ± 0.0044"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","paper_url":"https://arxiv.org/abs/2406.08993v2","paper_title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","code":"https://github.com/LUOyk1999/tunedGNN","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":7,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"DVCNN","metrics":{"Ext. data":"No","Number of params":"90608","Test ROC-AUC":"0.7916 ± 0.0086","Validation ROC-AUC":"0.8256 ± 0.0057"},"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":21,"model":"GeniePath-BS","metrics":{"Ext. data":"No","Number of params":"316754","Test ROC-AUC":"0.7825 ± 0.0035","Validation ROC-AUC":"Please tell us"},"uses_additional_data":false,"paper_date":"2020-06-10","paper":"/paper/bandit-samplers-for-training-graph-neural","paper_url":"https://arxiv.org/abs/2006.05806v2","paper_title":"Bandit Samplers for Training Graph Neural Networks","code":"https://github.com/xavierzw/ogb-geniepath-bs","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"GaAN","metrics":{"Ext. data":"No","Number of params":"Please tell us","Test ROC-AUC":"0.7803 ± 0.0073","Validation ROC-AUC":"Please tell us"},"uses_additional_data":false,"paper_date":"2018-03-20","paper":"/paper/gaan-gated-attention-networks-for-learning-on","paper_url":"http://arxiv.org/abs/1803.07294v1","paper_title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","code":"https://github.com/jennyzhang0215/GaAN","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"GraphSAGE","metrics":{"Ext. data":"No","Number of params":"193136","Test ROC-AUC":"0.7768 ± 0.0020","Validation ROC-AUC":"0.8334 ± 0.0013"},"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":24,"model":"GCN","metrics":{"Ext. data":"No","Number of params":"96880","Test ROC-AUC":"0.7251 ± 0.0035","Validation ROC-AUC":"0.7921 ± 0.0018"},"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":31,"n_unverified":27,"n_samples":58,"n_pointer_only_licence":22}},{"rank_in_archive_order":25,"model":"MLP","metrics":{"Ext. data":"No","Number of params":"96880","Test ROC-AUC":"0.7204 ± 0.0048","Validation ROC-AUC":"0.7706 ± 0.0014"},"uses_additional_data":false,"paper_date":"2020-05-02","paper":"/paper/open-graph-benchmark-datasets-for-machine","paper_url":"https://arxiv.org/abs/2005.00687v7","paper_title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","code":"https://github.com/snap-stanford/ogb","n_code_links":21,"syntology":{"n_ran":2,"n_unverified":15,"n_samples":17,"n_pointer_only_licence":15}},{"rank_in_archive_order":26,"model":"Node2vec","metrics":{"Ext. data":"No","Number of params":"17094000","Test ROC-AUC":"0.6881 ± 0.0065","Validation ROC-AUC":"0.7007 ± 0.0053"},"uses_additional_data":false,"paper_date":"2016-07-03","paper":"/paper/node2vec-scalable-feature-learning-for","paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec","n_code_links":20,"syntology":{"n_ran":8,"n_unverified":17,"n_samples":25,"n_pointer_only_licence":3}}],"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,795 of the 9,581 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":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"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":13,"distinct_papers_with_graph_line":10,"distinct_papers_with_any_sample_ran":10,"samples_over_distinct_papers":{"n_ran":106,"n_unverified":155,"n_samples":261,"n_pointer_only_licence":88,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":112,"n_unverified":176,"n_samples":288,"n_pointer_only_licence":88,"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"}}}