OGB
ogbg-ppa
Structure
158,100Graphs
243Nodes
2,266Edges
37Classes
7Edge Feature Dim
Coverage
43Results
1Variants
15Papers
- When does global attention help: a unified empirical study on atomistic graph learning When does global attention help: a unified empirical study on atomistic graph learning
- Adaptive Canonicalization with Application to Invariant Anisotropic Geometric Networks Adaptive Canonicalization with Application to Invariant Anisotropic Geometric Networks
- WWW 2025: Graph Self-Supervised Learning with Learnable Structural and Positional Encodings Graph Self-Supervised Learning with Learnable Structural and Positional Encodings WWW 2025
- Differential Encoding for Improved Representation Learning Over Graphs Differential Encoding for Improved Representation Learning Over Graphs
- Graph in Graph Neural Network Graph in Graph Neural Network
- AAAI 2024: A Scalable and Effective Alternative to Graph Transformers A Scalable and Effective Alternative to Graph Transformers AAAI 2024
- ICML 2023: Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering ICML 2023
- ICML 2023: On the Connection Between MPNN and Graph Transformer On the Connection Between MPNN and Graph Transformer ICML 2023
- Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective
- LoG 2022: Expander Graph Propagation Expander Graph Propagation LoG 2022
- ICLR 2022: Agent-based Graph Neural Networks Agent-based Graph Neural Networks ICLR 2022
- TMLR 2022: Empowering GNNs via Edge-Aware Weisfeiler-Leman Algorithm Empowering GNNs via Edge-Aware Weisfeiler-Leman Algorithm TMLR 2022
- ICML 2022: Structure-Aware Transformer for Graph Representation Learning Structure-Aware Transformer for Graph Representation Learning ICML 2022
- Parameterized Hypercomplex Graph Neural Networks for Graph Classification Parameterized Hypercomplex Graph Neural Networks for Graph Classification
- Multi-Level Attention Pooling for Graph Neural Networks: Unifying Graph Representations with Multiple Localities Multi-Level Attention Pooling for Graph Neural Networks: Unifying Graph Representations with Multiple Localities
37-class graph classification Given a protein-association neighborhood, predict the broad taxonomic group of its source species. Nodes carry no intrinsic biological feature in the standard artifact. Evaluated by Accuracy.
Dataset details
Task
Given a protein-association neighborhood, predict the broad taxonomic group of its source species. The output is one of 37 classes and is scored by accuracy.
Data
OGB samples 100 center proteins from each of 1,581 STRING species, extracts their two-hop association neighborhoods, removes the center, and subsamples graphs to fewer than 300 protein nodes. The resulting 158,100 graphs cover diverse branches of the tree of life.
Features
Nodes carry no intrinsic biological feature in the standard artifact. Each association edge has seven confidence values for evidence channels such as co-expression, gene neighborhood, co-occurrence, and gene fusion.
Splits and evaluation
Validation and test graphs come from species absent from training while remaining within the same 37 taxonomic groups. Accuracy therefore measures cross-species generalization rather than memorization of neighborhoods from the same organism.
Quirks and pitfalls
The target is the graph’s taxonomic origin, not a protein function. STRING edges mix experimental and computational evidence, and the seven confidence channels can encode species-specific collection patterns. Random graph splits would leak species identity and materially change the task.
Sources
OGB species split.
SOTA Progression
new SOTA
matches SOTA at that time
other proposed result
other baseline result
Leaderboard
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | A-NLSF | 0.8149
±
0.0067 | |
| 2 | differential encoding | 0.8096
±
0.0029 | |
| 3 | MPNN + VN + NoPE | 0.8055
±
0.0038 | |
| 4 | CNNs | 0.8017 | |
| 5 | GPS | 0.8015
±
0.0033 | |
| 6 | PDF | 0.8010
±
0.0052 | |
| 7 | GECO | 0.7982
±
0.0042 | |
| 8 | ExpC | 0.7976 | |
| 9 | regularization term | 0.7800
±
0.0037 | |
| 10 | DeeperGCN+FLAG | 0.7752
±
0.0069 | |
| 11 | OAP+GatedGCN | 0.7745
±
0.0098 | |
| 12 | GEN | 0.7712
±
0.0071 | |
| 13 | DeeperGCN | 0.7712
±
0.0071 | |
| 14 | DeeperG | 0.7712
±
0.0071 | |
| 15 | PHC-GNN | 0.7561 | |
| 16 | GatedGCN | 0.7531
±
0.0083 | |
| 17 | SAT | 0.7522
±
0.0056 | |
| 18 | KS-SAT | 0.7522
±
0.0056 | |
| 19 | K-Subtree SAT | 0.7522
±
0.0056 | |
| 20 | k-subtree SAT-GCN | 0.7522
±
0.0056 | |
| 21 | k-subtree SAT-PNA | 0.7522
±
0.0056 | |
| 22 | k-subtree SAT-GIN | 0.7306
±
0.0076 | |
| 23 | GIN+VN+Flag | 0.7245
±
0.0114 | |
| 24 | AgentNet | 0.7233
±
0.0062 | |
| 25 | JK | 0.7198
±
0.0013 | |
| 26 | NC-GNN | 0.7194
±
0.0043 | |
| 27 | naive | 0.7184
±
0.0011 | |
| 28 | MLAP | 0.7183
±
0.0012 | |
| 29 | StructPosGSSL-FA | 0.7090
±
0.0186 | |
| 30 | StructPosGSSL-SA | 0.7081
±
0.0145 | |
| 31 | GraphSNN | 0.7066
±
0.0165 | |
| 32 | GIN + 3-cycle count feature | 0.7058
±
0.0064 | |
| 33 | GIN+VN | 0.7037
±
0.0107 | |
| 34 | GIN+virtual node | 0.7037
±
0.0107 | |
| 35 | GIN + EGP | 0.7027
±
0.0159 | |
| 36 | CRaWl | 0.7025
±
0.0052 | |
| 37 | GIN | 0.6892
±
0.0100 | |
| 38 | GCN+virtual node | 0.6857
±
0.0061 | |
| 39 | GCN | 0.6839
±
0.0084 | |
| 40 | S4 | 0.6701 | |
| 41 | S1 | 0.6524 | |
| 42 | S2 | 0.6375 | |
| 43 | S3 | 0.5324 |
SOTA performance
set a new SOTA at the time
matched the SOTA at the time