{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","arxiv_id":"2103.09430","date":"2021-03-17","proceeding":null,"authors":["Weihua Hu","Matthias Fey","Hongyu Ren","Maho Nakata","Yuxiao Dong","Jure Leskovec"],"abstract":"Enabling effective and efficient machine learning (ML) over large-scale graph data (e.g., graphs with billions of edges) can have a great impact on both industrial and scientific applications. However, existing efforts to advance large-scale graph ML have been largely limited by the lack of a suitable public benchmark. Here we present OGB Large-Scale Challenge (OGB-LSC), a collection of three real-world datasets for facilitating the advancements in large-scale graph ML. The OGB-LSC datasets are orders of magnitude larger than existing ones, covering three core graph learning tasks -- link prediction, graph regression, and node classification. Furthermore, we provide dedicated baseline experiments, scaling up expressive graph ML models to the massive datasets. We show that expressive models significantly outperform simple scalable baselines, indicating an opportunity for dedicated efforts to further improve graph ML at scale. Moreover, OGB-LSC datasets were deployed at ACM KDD Cup 2021 and attracted more than 500 team registrations globally, during which significant performance improvements were made by a variety of innovative techniques. We summarize the common techniques used by the winning solutions and highlight the current best practices in large-scale graph ML. Finally, we describe how we have updated the datasets after the KDD Cup to further facilitate research advances. The OGB-LSC datasets, baseline code, and all the information about the KDD Cup are available at https://ogb.stanford.edu/docs/lsc/ .","url_abs":"https://arxiv.org/abs/2103.09430v3","url_pdf":"https://arxiv.org/pdf/2103.09430v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/snap-stanford/ogb","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/graphcore/distributed-kge-poplar","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/lars-research/3d-pgt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/shamim-hussain/egt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ogb-lsc-a-large-scale-challenge-for-machine","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":"graph-regression","task_name":"Graph Regression"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[{"slug":"ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge"},{"slug":"pcqm4mv2-lsc","name":"PCQM4Mv2-LSC","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset":"PCQM4M-LSC","model":"GIN-virtual","rank_in_archive_order":2,"of":11,"metrics":{"Test MAE":"14.87","Validation MAE":"0.1396"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset":"PCQM4M-LSC","model":"GCN-Virtual","rank_in_archive_order":3,"of":11,"metrics":{"Test MAE":"15.79","Validation MAE":"0.1536"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset":"PCQM4M-LSC","model":"GIN","rank_in_archive_order":4,"of":11,"metrics":{"Test MAE":"16.78"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset":"PCQM4M-LSC","model":"GCN","rank_in_archive_order":5,"of":11,"metrics":{"Test MAE":"18.38","Validation MAE":"0.1684"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset":"PCQM4M-LSC","model":"MLP-fingerprint","rank_in_archive_order":6,"of":11,"metrics":{"Test MAE":"20.68","Validation MAE":"0.2044"},"uses_additional_data":false},{"leaderboard":"/sota/graph-regression-on-pcqm4mv2-lsc","task":"Graph Regression","dataset":"PCQM4Mv2-LSC","model":"MLP-Fingerprint","rank_in_archive_order":20,"of":20,"metrics":{"Test MAE":"0.1760","Validation MAE":"0.1753"},"uses_additional_data":false},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","task":"Knowledge Graphs","dataset":"WikiKG90M-LSC","model":"TransE-Concat","rank_in_archive_order":1,"of":4,"metrics":{"Test MRR":"85.48","Validation MRR":"0.8494"},"uses_additional_data":false},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","task":"Knowledge Graphs","dataset":"WikiKG90M-LSC","model":"ComplEx-Concat","rank_in_archive_order":2,"of":4,"metrics":{"Test MRR":"0.8637","Validation MRR":"0.8425"},"uses_additional_data":false},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","task":"Knowledge Graphs","dataset":"WikiKG90M-LSC","model":"ComplEx-RoBERTa","rank_in_archive_order":3,"of":4,"metrics":{"Test MRR":"0.7186","Validation MRR":"0.7052"},"uses_additional_data":false},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","task":"Knowledge Graphs","dataset":"WikiKG90M-LSC","model":"TransE-RoBERTa","rank_in_archive_order":4,"of":4,"metrics":{"Test MRR":"0.6288","Validation MRR":"0.6039"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","task":"Node Classification","dataset":"MAG240M-LSC","model":"R-GraphSAGE (NS)","rank_in_archive_order":1,"of":4,"metrics":{"Test Accuracy":"68.94"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","task":"Node Classification","dataset":"MAG240M-LSC","model":"GAT (NS)","rank_in_archive_order":2,"of":4,"metrics":{"Test Accuracy":"66.63"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","task":"Node Classification","dataset":"MAG240M-LSC","model":"GraphSAGE (NS)","rank_in_archive_order":3,"of":4,"metrics":{"Test Accuracy":"66.25"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","task":"Node Classification","dataset":"MAG240M-LSC","model":"SIGN","rank_in_archive_order":4,"of":4,"metrics":{"Test Accuracy":"66.09","Validation Accuracy":"66.64"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2103.09430","atlas_url":"https://app.syntology.ai/?focus=2103.09430","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2103.09430"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2103.09430\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2103.09430"},"call":"get_concepts_for_paper(arxiv_id=\"2103.09430\")"}],"by_repo":[{"repo":"snap-stanford/ogb","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.03148"],"harvested_for_calls":[{"arxiv_id":"2406.03148","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.03148"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.03148\")"}]},{"repo":"graphcore/distributed-kge-poplar","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2211.12281"],"harvested_for_calls":[{"arxiv_id":"2211.12281","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2211.12281"},"call":"get_harvested_code_for_paper(arxiv_id=\"2211.12281\")"}]},{"repo":"graphcore/ogb-lsc-pcqm4mv2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2205.12454","2212.02229"],"harvested_for_calls":[{"arxiv_id":"2205.12454","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2205.12454"},"call":"get_harvested_code_for_paper(arxiv_id=\"2205.12454\")"},{"arxiv_id":"2212.02229","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.02229"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.02229\")"}]},{"repo":"lars-research/3d-pgt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2306.07812"],"harvested_for_calls":[{"arxiv_id":"2306.07812","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.07812"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.07812\")"}]},{"repo":"shamim-hussain/egt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2108.03348"],"harvested_for_calls":[{"arxiv_id":"2108.03348","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.03348"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.03348\")"}]},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"834511c7b652dfa24996e9a6d15a483f996c6db93632abd4407b33ac53b31566","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}