{"url":"/sota/link-property-prediction-on-ogbl-ppa","task":{"name":"Link Property Prediction","url":"/task/link-property-prediction","note":null},"dataset":{"name":"ogbl-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 Hits@100","Validation Hits@100","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 Hits@100":null,"Validation Hits@100":null,"Number of params":"lower"}},"counts":{"rows":26,"rows_with_code":16,"rows_with_paper_page":20,"rows_dated":20,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"** E2N**","metrics":{"Ext. data":"No","Number of params":"526851","Test Hits@100":"0.8911 ± 0.1266","Validation Hits@100":"0.8857 ± 0.1331"},"uses_additional_data":false,"paper_date":"2023-11-06","paper":"/paper/edge2node-reducing-edge-prediction-to-node","paper_url":"https://arxiv.org/abs/2311.02921v3","paper_title":"Edge2Node: Reducing Edge Prediction to Node Classification","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"Refined-GAE","metrics":{"Ext. data":"No","Number of params":"295848449","Test Hits@100":"0.7334 ± 0.0092","Validation Hits@100":"0.7391 ± 0.0178"},"uses_additional_data":false,"paper_date":"2024-11-06","paper":"/paper/reconsidering-the-performance-of-gae-in-link","paper_url":"https://arxiv.org/abs/2411.03845v1","paper_title":"Reconsidering the Performance of GAE in Link Prediction","code":"https://github.com/GraphPKU/Refined-GAE","n_code_links":2,"syntology":null},{"rank_in_archive_order":3,"model":"GraphGPT(SMTP)","metrics":{"Ext. data":"No","Number of params":"145263360","Test Hits@100":"0.6876 ± 0.0067","Validation Hits@100":"0.7017 ± 0.0044"},"uses_additional_data":false,"paper_date":"2023-12-31","paper":"/paper/graphgpt-graph-learning-with-generative-pre","paper_url":"https://arxiv.org/abs/2401.00529v1","paper_title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","code":"https://github.com/alibaba/graph-gpt","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"MPLP","metrics":{"Ext. data":"No","Number of params":"147794531","Test Hits@100":"0.6524 ± 0.0150","Validation Hits@100":"0.6685 ± 0.0073"},"uses_additional_data":false,"paper_date":"2023-09-02","paper":"/paper/pure-message-passing-can-estimate-common","paper_url":"https://arxiv.org/abs/2309.00976v4","paper_title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","code":"https://github.com/Barcavin/efficient-node-labelling","n_code_links":1,"syntology":{"n_ran":5,"n_unverified":5,"n_samples":10,"n_pointer_only_licence":10}},{"rank_in_archive_order":5,"model":"GCN (node embedding)","metrics":{"Ext. data":"No","Number of params":"148144898","Test Hits@100":"0.6354 ± 0.0121","Validation Hits@100":"0.6524 ± 0.0096"},"uses_additional_data":false,"paper_date":"2024-11-22","paper":"/paper/can-gnns-learn-link-heuristics-a-concise","paper_url":"https://arxiv.org/abs/2411.14711v1","paper_title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","code":"https://github.com/astroming/GNNHE","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"SIEG","metrics":{"Ext. data":"No","Number of params":"1993965","Test Hits@100":"0.6322 ± 0.0174","Validation Hits@100":"0.6533 ± 0.0234"},"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":7,"model":"**Neural Common Neighbor **","metrics":{"Ext. data":"No","Number of params":"33538","Test Hits@100":"0.6119 ± 0.0085","Validation Hits@100":"0.6021 ± 0.0037"},"uses_additional_data":false,"paper_date":"2023-02-02","paper":"/paper/neural-common-neighbor-with-completion-for","paper_url":"https://arxiv.org/abs/2302.00890v4","paper_title":"Neural Common Neighbor with Completion for Link Prediction","code":"https://github.com/GraphPKU/NeuralCommonNeighbor","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"NGNN + SEAL","metrics":{"Ext. data":"No","Number of params":"735426","Test Hits@100":"0.5971 ± 0.0245","Validation Hits@100":"0.5995 ± 0.0205"},"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":9,"model":"SUREL+","metrics":{"Ext. data":"No","Number of params":"52802","Test Hits@100":"0.5432 ± 0.0044","Validation Hits@100":"0.5492 ± 0.0112"},"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":10,"model":"SUREL+","metrics":{"Ext. data":"No","Number of params":"52802","Test Hits@100":"0.5432 ± 0.0044","Validation Hits@100":"0.5492 ± 0.0112"},"uses_additional_data":false,"paper_date":"2023-03-06","paper":"/paper/surel-moving-from-walks-to-sets-for-scalable","paper_url":"https://arxiv.org/abs/2303.03379v3","paper_title":"SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning","code":"https://github.com/Graph-COM/SUREL_Plus","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"RA+Edge Proposal Set","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@100":"0.5324 ± 0.0000","Validation Hits@100":"0.5142 ± 0.0000"},"uses_additional_data":false,"paper_date":"2021-06-30","paper":"/paper/edge-proposal-sets-for-link-prediction","paper_url":"https://arxiv.org/abs/2106.15810v1","paper_title":"Edge Proposal Sets for Link Prediction","code":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"MLP+CN&RA&AA","metrics":{"Ext. data":"No","Number of params":"163330","Test Hits@100":"0.5062 ± 0.0035","Validation Hits@100":"0.4906 ± 0.0029"},"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":13,"model":"BUDDY","metrics":{"Ext. data":"No","Number of params":"644","Test Hits@100":"0.4934 ± 0.0098","Validation Hits@100":"0.4931 ± 0.0025"},"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":14,"model":"Resource Allocation","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@100":"0.4933 ± 0.0000","Validation Hits@100":"0.4722 ± 0.0000"},"uses_additional_data":false,"paper_date":"2009-01-05","paper":"/paper/09010553","paper_url":"http://arxiv.org/abs/0901.0553v2","paper_title":"Predicting Missing Links via Local Information","code":"https://github.com/fs302/EasyLink","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":15,"model":"SEAL","metrics":{"Ext. data":"No","Number of params":"709122","Test Hits@100":"0.4880 ± 0.0316","Validation Hits@100":"0.5125 ± 0.0252"},"uses_additional_data":false,"paper_date":"2020-10-30","paper":"/paper/revisiting-graph-neural-networks-for-link-1","paper_url":"https://arxiv.org/abs/2010.16103v5","paper_title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":1}},{"rank_in_archive_order":16,"model":"S3GRL (PoS Plus)","metrics":{"Ext. data":"No","Number of params":"32270001","Test Hits@100":"0.4242 ± 0.0180","Validation Hits@100":"0.6512 ± 0.0109"},"uses_additional_data":false,"paper_date":"2023-01-29","paper":"/paper/simplifying-subgraph-representation-learning","paper_url":"https://arxiv.org/abs/2301.12562v4","paper_title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","code":"https://github.com/venomouscyanide/s3grl","n_code_links":3,"syntology":null},{"rank_in_archive_order":17,"model":"AGDN","metrics":{"Ext. data":"No","Number of params":"36904259","Test Hits@100":"0.4123 ± 0.0159","Validation Hits@100":"0.4332 ± 0.0092"},"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":18,"model":"NGNN + GraphSAGE","metrics":{"Ext. data":"No","Number of params":"556033","Test Hits@100":"0.4005 ± 0.0138","Validation Hits@100":"0.4058 ± 0.0123"},"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":19,"model":"NGNN + GCN","metrics":{"Ext. data":"No","Number of params":"410113","Test Hits@100":"0.3683 ± 0.0099","Validation Hits@100":"0.3834 ± 0.0082"},"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":20,"model":"Adamic Adar","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@100":"0.3245 ± 0.0000","Validation Hits@100":"0.3268 ± 0.0000"},"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":"Matrix Factorization","metrics":{"Ext. data":"No","Number of params":"147662849","Test Hits@100":"0.3229 ± 0.0094","Validation Hits@100":"0.3228 ± 0.0428"},"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":22,"model":"Common Neighbor","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@100":"0.2765 ± 0.0000","Validation Hits@100":"0.2823 ± 0.0000"},"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":23,"model":"DeepWalk","metrics":{"Ext. data":"No","Number of params":"150138741","Test Hits@100":"0.2302 ± 0.0163","Validation Hits@100":"Please tell us"},"uses_additional_data":false,"paper_date":"2014-03-26","paper":"/paper/deepwalk-online-learning-of-social","paper_url":"http://arxiv.org/abs/1403.6652v2","paper_title":"DeepWalk: Online Learning of Social Representations","code":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/recall/deepwalk","n_code_links":14,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":24,"model":"Node2vec","metrics":{"Ext. data":"No","Number of params":"73878913","Test Hits@100":"0.2226 ± 0.0083","Validation Hits@100":"0.2253 ± 0.0088"},"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":25,"model":"GCN","metrics":{"Ext. data":"No","Number of params":"278529","Test Hits@100":"0.1867 ± 0.0132","Validation Hits@100":"0.1845 ± 0.0140"},"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":26,"model":"GraphSAGE","metrics":{"Ext. data":"No","Number of params":"424449","Test Hits@100":"0.1655 ± 0.0240","Validation Hits@100":"0.1724 ± 0.0264"},"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}}],"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,264 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":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"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":9,"rows_with_any_sample_ran":7,"distinct_papers_with_graph_line":9,"distinct_papers_with_any_sample_ran":7,"samples_over_distinct_papers":{"n_ran":53,"n_unverified":78,"n_samples":131,"n_pointer_only_licence":60,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":53,"n_unverified":78,"n_samples":131,"n_pointer_only_licence":60,"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"}}}