OGB
ogbl-collab
Structure
1Graphs
235,868Nodes
1,285,465Edges
128Node Feature Dim
2Edge Feature Dim
Coverage
166Results
1Variants
28Papers
- ICML 2025: GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning ICML 2025
- Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning
- NeurIPS 2025: Bridging Theory and Practice in Link Representation with Graph Neural Networks Bridging Theory and Practice in Link Representation with Graph Neural Networks NeurIPS 2025
- Weak Models Can be Good Teachers: A Case Study on Link Prediction with MLPs Weak Models Can be Good Teachers: A Case Study on Link Prediction with MLPs
- ICML 2025: Beyond Message Passing: Neural Graph Pattern Machine Beyond Message Passing: Neural Graph Pattern Machine ICML 2025
- TMLR 2024: PROXI: Challenging the GNNs for Link Prediction PROXI: Challenging the GNNs for Link Prediction TMLR 2024
- NeurIPS 2024: On the Impact of Feature Heterophily on Link Prediction with Graph Neural Networks On the Impact of Feature Heterophily on Link Prediction with Graph Neural Networks NeurIPS 2024
- Link Prediction with Untrained Message Passing Layers Link Prediction with Untrained Message Passing Layers
- ICLR 2024: Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning ICLR 2024
- KDD 2023: LPFormer: An Adaptive Graph Transformer for Link Prediction LPFormer: An Adaptive Graph Transformer for Link Prediction KDD 2023
- Efficient Link Prediction via GNN Layers Induced by Negative Sampling Efficient Link Prediction via GNN Layers Induced by Negative Sampling
- KDD 2023: Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization KDD 2023
- JMLR 2023: Improving Graph Neural Networks on Multi-node Tasks with the Labeling Trick Improving Graph Neural Networks on Multi-node Tasks with the Labeling Trick JMLR 2023
- SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning
- Asymmetric Learning for Graph Neural Network based Link Prediction Asymmetric Learning for Graph Neural Network based Link Prediction
- JMLR 2023: GNNBenchmark GNNBenchmark JMLR 2023
- Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection
- NeurIPS 2022: Geodesic Graph Neural Network for Efficient Graph Representation Learning Geodesic Graph Neural Network for Efficient Graph Representation Learning NeurIPS 2022
- GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction
- NeurIPS 2022: Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction NeurIPS 2022
- ICLR 2022: Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks ICLR 2022
- NeurIPS 2022: Decoupling the Depth and Scope of Graph Neural Networks Decoupling the Depth and Scope of Graph Neural Networks NeurIPS 2022
- MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs
- Pairwise Learning for Neural Link Prediction Pairwise Learning for Neural Link Prediction
- NeurIPS 2021: VQ-GNN: A Universal Framework to Scale-up Graph Neural Networks using Vector Quantization VQ-GNN: A Universal Framework to Scale-up Graph Neural Networks using Vector Quantization NeurIPS 2021
- NeurIPS 2020: Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning NeurIPS 2020
- Formatting Instructions for ICLR 2021 Conference Submissions Formatting Instructions for ICLR 2021 Conference Submissions
- NeurIPS 2020: OGB OGB NeurIPS 2020
Link prediction Rank future author-author collaboration edges above sampled non-edges, given collaborations observed in earlier years. Each author has a 128-dimensional vector obtained by averaging word embeddings over that author’s papers. Evaluated by Hits@50.
Dataset details
Task
Rank future author-author collaboration edges above sampled non-edges, given collaborations observed in earlier years. The official score is Hits@50 against 100,000 sampled negative pairs per positive edge.
Data
The undirected graph is a MAG subset with 235,868 author nodes. Multiple collaborations between the same authors in different years remain separate temporal edges; edge weight records the number of jointly authored papers in that year.
Features
Each author has a 128-dimensional vector obtained by averaging word embeddings over that author’s papers. Edges carry year and collaboration-count metadata.
Splits and evaluation
Edges through 2017 are training data, 2018 collaborations validate the model, and 2019 collaborations form test. OGB permits adding validation edges when making test predictions, so evaluation code must state which historical graph is used.
Quirks and pitfalls
Sampled-negative Hits@50 is not equivalent to ranking every absent edge, and absence of an edge does not prove two authors will never collaborate. Treating yearly parallel edges as one static edge loses timing and weight information. Random edge splits leak future collaboration patterns.
Sources
SOTA Progression
new SOTA
matches SOTA at that time
other proposed result
other baseline result
Leaderboard
| # | Model | Hits@50 ↑ | MRR | Paper |
|---|---|---|---|---|
| 1 | PROXI | 0.7650
±
0.0027 | — | |
| 2 | OGB Leader | 0.7129
±
0.0018 | — | |
| 3 | GIDN | 0.7096
±
0.0055 | — | |
| 4 | PLNLP | 0.7059
±
0.0029 | — | |
| 5 | HOP-Rec | 0.7012
±
0.0016 | — | |
| 6 | LPFormer | 0.6814
±
0.0051 | — | |
| 7 | GILT (5-shot) | 0.6783
±
0.0034 | — | |
| 8 | BUDDY-SIGN | 0.6664
±
0.0064 | — | |
| 9 | GCN | 0.6621
±
0.0033 | — | |
| 10 | Neo-GNN | 0.6613
±
0.0061 | — | |
| 11 | YinYanGNN | 0.6610
±
0.0020 | — | |
| 12 | BUDDY-NoFeat | 0.6606
±
0.0022 | — | |
| 13 | NCNC | 0.6597
±
0.0103 | — | |
| 14 | BUDDY | 0.6594
±
0.0058 | — | |
| 15 | NCNC (GIN) | 0.6587
±
0.0074 | — | |
| 16 | AA+Proposal Set | 0.6548
±
0.0000 | — | |
| 17 | SNCNC (SGCN) | 0.6540
±
0.0046 | — | |
| 18 | SEAL-PS2 | 0.6483
±
0.0054 | — | |
| 19 | NCN | 0.6476
±
0.0087 | — | |
| 20 | SEAL | 0.6474
±
0.0043 | — | |
| 21 | BUDDY | 0.6459
±
0.0046 | — | |
| 22 | GCN+DE | 0.6444
±
0.0029 | — | |
| 23 | GCN+DRNL | 0.6440
±
0.0045 | — | |
| 24 | AA | 0.6435
±
0.0000 | — | |
| 25 | NID_GCN | 0.6431
±
0.0048 | — | |
| 26 | AA | 0.6417
±
0.0000 | — | |
| 27 | SUREL | 0.6410
±
0.0106 | — | |
| 28 | GCN | 0.6405
±
0.0063 | — | |
| 29 | RA | 0.6400
±
0.0000 | — | |
| 30 | RA | 0.6381
±
0.0000 | — | |
| 31 | SEAL | 0.6364
±
0.0071 | — | |
| 32 | CN | 0.6137
±
0.0000 | — | |
| 33 | SAGE | 0.5944
±
0.0137 | — | |
| 34 | Best GNN | 0.5914
±
0.0164 | — | |
| 35 | UniLP (5-shot) | 0.5800
±
0.0310 | — | |
| 36 | DE-GNN | 0.5787
±
0.0079 | — | |
| 37 | AML | 0.5760
±
0.0071 | — | |
| 38 | SEAL | 0.5755
±
0.0072 | — | |
| 39 | Neo-GNN (w/ GCN) | 0.5752
±
0.0037 | — | |
| 40 | Neo-GNN | 0.5752
±
0.0037 | — | |
| 41 | AA | 0.5649
±
0.0000 | — | |
| 42 | CN | 0.5644
±
0.0000 | — | |
| 43 | GAT | 0.5643
±
0.0086 | — | |
| 44 | GraphSage-PS2 | 0.5571
±
0.0093 | — | |
| 45 | GCN | 0.5558
±
0.0384 | — | |
| 46 | shaDow-SAGE | 0.5492
±
0.0022 | — | |
| 47 | GDGNN-Vert | 0.5474
±
0.0048 | — | |
| 48 | MGAE-GCN | 0.5474
±
0.0106 | — | |
| 49 | GDGNN | 0.5474
±
0.0048 | — | |
| 50 | SEAL | 0.5471
±
0.0001 | — |
SOTA performance
set a new SOTA at the time
matched the SOTA at the time