{"url":"/sota/node-property-prediction-on-ogbn-papers100m","task":{"name":"Node Property Prediction","url":"/task/node-property-prediction","note":null},"dataset":{"name":"ogbn-papers100M","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":["Test Accuracy","Ext. data","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":{"Test Accuracy":"higher","Ext. data":null,"Validation Accuracy":"higher","Number of params":"lower"}},"counts":{"rows":20,"rows_with_code":18,"rows_with_paper_page":18,"rows_dated":18,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GLEM+GIANT+GAMLP","metrics":{"Ext. data":"Yes","Number of params":"154775375","Test Accuracy":"0.7037 ± 0.0002","Validation Accuracy":"0.7354 ± 0.0001"},"uses_additional_data":false,"paper_date":"2022-10-26","paper":"/paper/learning-on-large-scale-text-attributed","paper_url":"https://arxiv.org/abs/2210.14709v2","paper_title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","code":"https://github.com/andyjzhao/glem","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":2,"model":"GIANT-XRT+GAMLP+RLU (use raw text)","metrics":{"Ext. data":"Yes","Number of params":"21551631","Test Accuracy":"0.6967 ± 0.0005","Validation Accuracy":"0.7305 ± 0.0004"},"uses_additional_data":false,"paper_date":"2021-10-29","paper":"/paper/node-feature-extraction-by-self-supervised-1","paper_url":"https://arxiv.org/abs/2111.00064v3","paper_title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","code":"https://github.com/amzn/pecos","n_code_links":4,"syntology":{"n_ran":7,"n_unverified":13,"n_samples":20,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"GAMLP+RLU+SCR","metrics":{"Ext. data":"No","Number of params":"67560875","Test Accuracy":"0.6842 ± 0.0015","Validation Accuracy":"0.7188 ± 0.0007"},"uses_additional_data":false,"paper_date":"2021-12-08","paper":"/paper/improving-the-training-of-graph-neural","paper_url":"https://arxiv.org/abs/2112.04319v2","paper_title":"SCR: Training Graph Neural Networks with Consistency Regularization","code":"https://github.com/THUDM/SCR","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":4,"model":"SAGN+SLE (4 stages)","metrics":{"Ext. data":"No","Number of params":"8556888","Test Accuracy":"0.6830 ± 0.0008","Validation Accuracy":"0.7163 ± 0.0007"},"uses_additional_data":false,"paper_date":"2021-04-19","paper":"/paper/scalable-and-adaptive-graph-neural-networks","paper_url":"https://arxiv.org/abs/2104.09376v3","paper_title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","code":"https://github.com/skepsun/SAGN_with_SLE","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"GAMLP+RLU","metrics":{"Ext. data":"No","Number of params":"16308751","Test Accuracy":"0.6825 ± 0.0011","Validation Accuracy":"0.7159 ± 0.0005"},"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":6,"model":"GAMLP+SCR-m","metrics":{"Ext. data":"No","Number of params":"67560875","Test Accuracy":"0.6816 ± 0.0012","Validation Accuracy":"0.7186 ± 0.0008"},"uses_additional_data":false,"paper_date":"2021-12-08","paper":"/paper/improving-the-training-of-graph-neural","paper_url":"https://arxiv.org/abs/2112.04319v2","paper_title":"SCR: Training Graph Neural Networks with Consistency Regularization","code":"https://github.com/THUDM/SCR","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":7,"model":"GAMLP+SCR","metrics":{"Ext. data":"No","Number of params":"67560875","Test Accuracy":"0.6814 ± 0.0008","Validation Accuracy":"0.7190 ± 0.0007"},"uses_additional_data":false,"paper_date":"2021-12-08","paper":"/paper/improving-the-training-of-graph-neural","paper_url":"https://arxiv.org/abs/2112.04319v2","paper_title":"SCR: Training Graph Neural Networks with Consistency Regularization","code":"https://github.com/THUDM/SCR","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":8,"model":"FSGNN","metrics":{"Ext. data":"No","Number of params":"16453301","Test Accuracy":"0.6807 ± 0.0006","Validation Accuracy":"0.7175 ± 0.0007"},"uses_additional_data":false,"paper_date":"2021-05-17","paper":"/paper/improving-graph-neural-networks-with-simple","paper_url":"https://arxiv.org/abs/2105.07634v1","paper_title":"Improving Graph Neural Networks with Simple Architecture Design","code":"https://github.com/sunilkmaurya/FSGNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"SAGN+SLE","metrics":{"Ext. data":"No","Number of params":"8556888","Test Accuracy":"0.6800 ± 0.0015","Validation Accuracy":"0.7131 ± 0.0010"},"uses_additional_data":false,"paper_date":"2021-04-19","paper":"/paper/scalable-and-adaptive-graph-neural-networks","paper_url":"https://arxiv.org/abs/2104.09376v3","paper_title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","code":"https://github.com/skepsun/SAGN_with_SLE","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"GAMLP","metrics":{"Ext. data":"No","Number of params":"16308751","Test Accuracy":"0.6771 ± 0.0020","Validation Accuracy":"0.7117 ± 0.0014"},"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":11,"model":"TransformerConv","metrics":{"Ext. data":"No","Number of params":"883378","Test Accuracy":"0.6736 ± 0.0010","Validation Accuracy":"0.7172 ± 0.0005"},"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":4,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"shaDow-GAT","metrics":{"Ext. data":"No","Number of params":"4205544","Test Accuracy":"0.6708±0.0017","Validation Accuracy":"0.7073± 0.0011"},"uses_additional_data":false,"paper_date":"2022-01-19","paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","paper_url":"https://arxiv.org/abs/2201.07858v1","paper_title":"Decoupling the Depth and Scope of Graph Neural Networks","code":"https://github.com/facebookresearch/shaDow_GNN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":13,"model":"GraphSAGE_res_incep","metrics":{"Ext. data":"No","Number of params":"5755172","Test Accuracy":"0.6706 ± 0.0017","Validation Accuracy":"0.7032 ± 0.0011"},"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":14,"model":"SAGN","metrics":{"Ext. data":"No","Number of params":"6098092","Test Accuracy":"0.6675 ± 0.0084","Validation Accuracy":"0.7034 ± 0.0099"},"uses_additional_data":false,"paper_date":"2021-04-19","paper":"/paper/scalable-and-adaptive-graph-neural-networks","paper_url":"https://arxiv.org/abs/2104.09376v3","paper_title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","code":"https://github.com/skepsun/SAGN_with_SLE","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"SIGN-XL","metrics":{"Ext. data":"No","Number of params":"7180460","Test Accuracy":"0.6606 ± 0.0019","Validation Accuracy":"0.6984 ± 0.0006"},"uses_additional_data":false,"paper_date":"2020-04-23","paper":"/paper/sign-scalable-inception-graph-neural-networks","paper_url":"https://arxiv.org/abs/2004.11198v3","paper_title":"SIGN: Scalable Inception Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sign","n_code_links":5,"syntology":{"n_ran":4,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"PCAPass + LightGBM","metrics":{"Ext. data":"No","Number of params":"0","Test Accuracy":"0.6591 ± 0.0003","Validation Accuracy":"0.6982 ± 0.0002"},"uses_additional_data":false,"paper_date":"2022-02-01","paper":"/paper/dimensionality-reduction-meets-message","paper_url":"https://arxiv.org/abs/2202.00408v2","paper_title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","code":"https://github.com/ksadowski13/PCAPass","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"SIGN","metrics":{"Ext. data":"No","Number of params":"1008812","Test Accuracy":"0.6568 ± 0.0006","Validation Accuracy":"0.6932 ± 0.0006"},"uses_additional_data":false,"paper_date":"2020-04-23","paper":"/paper/sign-scalable-inception-graph-neural-networks","paper_url":"https://arxiv.org/abs/2004.11198v3","paper_title":"SIGN: Scalable Inception Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sign","n_code_links":5,"syntology":{"n_ran":4,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"SGC","metrics":{"Ext. data":"No","Number of params":"144044","Test Accuracy":"0.6329 ± 0.0019","Validation Accuracy":"0.6648 ± 0.0020"},"uses_additional_data":false,"paper_date":"2019-02-19","paper":"/paper/simplifying-graph-convolutional-networks","paper_url":"https://arxiv.org/abs/1902.07153v2","paper_title":"Simplifying Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sgc","n_code_links":7,"syntology":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"Node2vec","metrics":{"Ext. data":"No","Number of params":"14215818412","Test Accuracy":"0.5560 ± 0.0023","Validation Accuracy":"0.5807 ± 0.0028"},"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}},{"rank_in_archive_order":20,"model":"MLP","metrics":{"Ext. data":"No","Number of params":"144044","Test Accuracy":"0.4724 ± 0.0031","Validation Accuracy":"0.4960 ± 0.0029"},"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":12,"n_unverified":5,"n_samples":17,"n_pointer_only_licence":15}}],"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,821 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":6821,"papers_extracted_not_yet_verified":65,"boards_without_verdict":29,"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":16,"rows_with_any_sample_ran":15,"distinct_papers_with_graph_line":11,"distinct_papers_with_any_sample_ran":10,"samples_over_distinct_papers":{"n_ran":45,"n_unverified":56,"n_samples":101,"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":55,"n_unverified":71,"n_samples":126,"n_pointer_only_licence":29,"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"}}}