Datasets › OGB-LSC

OGB-LSC (OGB Large-Scale Challenge)

Introduced by Weihua Hu et al. in OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs17 Mar 2021 archive 2025-07-28

OGB Large-Scale Challenge (OGB-LSC) is a collection of three real-world datasets for advancing the state-of-the-art in large-scale graph ML. OGB-LSC provides graph datasets that are orders of magnitude larger than existing ones and covers three core graph learning tasks -- link prediction, graph regression, and node classification.

OGB-LSC consists of three datasets: MAG240M-LSC, WikiKG90M-LSC, and PCQM4M-LSC. Each dataset offers an independent task.

  • MAG240M-LSC is a heterogeneous academic graph, and the task is to predict the subject areas of papers situated in the heterogeneous graph (node classification).
  • WikiKG90M-LSC is a knowledge graph, and the task is to impute missing triplets (link prediction).
  • PCQM4M-LSC is a quantum chemistry dataset, and the task is to predict an important molecular property, the HOMO-LUMO gap, of a given molecule (graph regression).

Benchmarks archive 2025-07-28

All 3 leaderboards whose dataset resolves to this page shown (sort by any header). "First row" is the archive's own first row at snapshot, in the archive's row order; nothing here re-ranks and metric direction is not asserted.

First row (archive order)PaperCode
Graph Regression PCQM4M-LSC Graphormer Test MAE 13.28 Do Transformers Really Perform Bad for Graph Representation? microsoft/Graphormer +4 11 Compare
Knowledge Graphs WikiKG90M-LSC TransE-Concat Test MRR 85.48 OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs dmlc/dgl +5 4 Compare
Node Classification MAG240M-LSC R-GraphSAGE (NS) Test Accuracy 68.94 OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs dmlc/dgl +5 4 Compare

Papers archive 2025-07-28

papers with a benchmark row: 7 · with a code link: 7 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all papers with a benchmark rowonly where code ran (3 of 7 with a benchmark row: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 7 of 7 with a leaderboard row on this dataset's benchmarks, newest first by the archive's date (ties by slug; undated papers last).

The archive's own "papers using this dataset" list was never published, so this is the benchmark-backed subset, not that list; the archive's count for this dataset is 34. The Syntology column is from Syntology's graph, stated per sample; it is not part of any archive number. A line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified” (C is a part of N, never taken away from it); the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. When the archive marks a repository official for the paper, the cell starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

PaperCodeResultsDateSamples run Syntology
Graph Convolutions Enrich the Self-Attention in Transformers! 1 1 7 Dec 2023 official (archive's flag): 6 ran · 22 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 5 violated, 4 with no contract checked; 11 where Syntology's instrument failed) · 7 unverified (10 pointer-only for licence)
Graph Propagation Transformer for Graph Representation Learning 1 1 19 May 2023 official (archive's flag): 4 ran · 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result (8 pointer-only for licence)
O-GNN: Incorporating Ring Priors into Molecular Modeling 1 1 1 May 2023 not harvested
Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs 2 1 27 Oct 2021 official: harvested, nothing ran · 0 ran · 1 unverified (1 pointer-only for licence)
Global Self-Attention as a Replacement for Graph Convolution 3 1 7 Aug 2021 official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified
Do Transformers Really Perform Bad for Graph Representation? 5 1 9 Jun 2021 not harvested
OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs 6 13 17 Mar 2021 not harvested

Dataset loaders archive 2025-07-28

No loader listed in the archive.

Tasks archive 2025-07-28

License archive 2025-07-28

Unknown

Modalities archive 2025-07-28

Languages archive 2025-07-28

No language tagged.

Variants archive 2025-07-28

  • OGB-LSC
  • MAG240M-LSC
  • WikiKG90M-LSC
  • PCQM4M-LSC

4 variant names, as the archive lists them.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections