{"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":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","description_markdown":"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. \r\n\r\nOGB-LSC consists of three datasets: MAG240M-LSC, WikiKG90M-LSC, and PCQM4M-LSC. Each dataset offers an independent task.\r\n\r\n* 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).\r\n* WikiKG90M-LSC is a knowledge graph, and the task is to impute missing triplets (link prediction).\r\n* 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).","description_withheld":null,"homepage":"https://ogb.stanford.edu/kddcup2021/","introduced_date":"2021-03-17","introduced_date_note":null,"introduced_by":{"paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","first_author":"Weihua Hu","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Knowledge Graphs","url":"/task/knowledge-graphs","datasets_with_task":"/datasets/task/knowledge-graphs"},{"name":"Graph Regression","url":"/task/graph-regression","datasets_with_task":"/datasets/task/graph-regression"}],"languages":[],"variants":["OGB-LSC","MAG240M-LSC","WikiKG90M-LSC","PCQM4M-LSC"],"data_loaders":[],"num_papers_in_archive":34,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-regression-on-pcqm4m-lsc","task":"Graph Regression","dataset_variant":"PCQM4M-LSC","rows":11,"metrics":["Test MAE","Validation MAE"],"first_row_in_archive_order":{"model":"Graphormer","paper":"/paper/do-transformers-really-perform-bad-for-graph","metrics":{"Test MAE":"13.28","Validation MAE":"0.1234"},"code_links":[{"title":"microsoft/Graphormer","url":"https://github.com/microsoft/Graphormer"},{"title":"Microsoft/Graphormer","url":"https://github.com/Microsoft/Graphormer"},{"title":"dpstart/graphormer_new","url":"https://github.com/dpstart/graphormer_new"},{"title":"ytchx1999/Graphormer","url":"https://github.com/ytchx1999/Graphormer/tree/main/examples/ogb"},{"title":"yangyucheng000/University","url":"https://github.com/yangyucheng000/University/tree/main/model-2/graphormer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","task":"Knowledge Graphs","dataset_variant":"WikiKG90M-LSC","rows":4,"metrics":["Test MRR","Validation MRR"],"first_row_in_archive_order":{"model":"TransE-Concat","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","metrics":{"Test MRR":"85.48","Validation MRR":"0.8494"},"code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"graphcore/ogb-lsc-pcqm4mv2","url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"graphcore/distributed-kge-poplar","url":"https://github.com/graphcore/distributed-kge-poplar"},{"title":"lars-research/3d-pgt","url":"https://github.com/lars-research/3d-pgt"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-mag240m-lsc","task":"Node Classification","dataset_variant":"MAG240M-LSC","rows":4,"metrics":["Test Accuracy","Validation Accuracy"],"first_row_in_archive_order":{"model":"R-GraphSAGE (NS)","paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","metrics":{"Test Accuracy":"68.94"},"code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"graphcore/ogb-lsc-pcqm4mv2","url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"graphcore/distributed-kge-poplar","url":"https://github.com/graphcore/distributed-kge-poplar"},{"title":"lars-research/3d-pgt","url":"https://github.com/lars-research/3d-pgt"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":7,"of":7,"counts":{"papers_with_a_benchmark_row":7,"with_a_code_link":7,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/graph-convolutions-enrich-the-self-attention","slug":"graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","arxiv_id":"2312.04234","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":29,"samples_ran":22,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":11,"samples_unverified":7,"pointer_only_for_licence":10,"official":{"repos":["jeongwhanchoi/gfsa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-convolutions-enrich-the-self-attention#ran","syntology_url":"https://syntology.ai/paper/2312.04234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04234"}}}},{"paper":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":8,"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}}}},{"paper":"/paper/o-gnn-incorporating-ring-priors-into","slug":"o-gnn-incorporating-ring-priors-into","title":"O-GNN: Incorporating Ring Priors into Molecular Modeling","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transformers-generalize-deepsets-and-can-be","slug":"transformers-generalize-deepsets-and-can-be","title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","date":"2021-10-27","arxiv_id":"2110.14416","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["jw9730/hot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformers-generalize-deepsets-and-can-be#ran","syntology_url":"https://syntology.ai/paper/2110.14416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14416"}}}},{"paper":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}}}},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","rows_on_this_dataset":13,"code_links":6,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/graph-convolutions-enrich-the-self-attention","slug":"graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","arxiv_id":"2312.04234","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":29,"samples_ran":22,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":11,"samples_unverified":7,"pointer_only_for_licence":10,"official":{"repos":["jeongwhanchoi/gfsa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-convolutions-enrich-the-self-attention#ran","syntology_url":"https://syntology.ai/paper/2312.04234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04234"}}}},{"paper":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":8,"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}}}},{"paper":"/paper/o-gnn-incorporating-ring-priors-into","slug":"o-gnn-incorporating-ring-priors-into","title":"O-GNN: Incorporating Ring Priors into Molecular Modeling","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transformers-generalize-deepsets-and-can-be","slug":"transformers-generalize-deepsets-and-can-be","title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","date":"2021-10-27","arxiv_id":"2110.14416","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["jw9730/hot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformers-generalize-deepsets-and-can-be#ran","syntology_url":"https://syntology.ai/paper/2110.14416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14416"}}}},{"paper":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}}}},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","rows_on_this_dataset":13,"code_links":6,"syntology":null}],"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/dataset/ogb-lsc/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/ogb-lsc/papers/ran/1","json":"/dataset/ogb-lsc/papers/ran/1.json","rows":3}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":4,"samples_harvested":42,"samples_ran":29,"samples_constructed":4,"samples_ran_checked":18,"samples_ran_instrument_failed":11,"samples_unverified":13,"pointer_only_for_licence":19,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":3,"papers_with_a_run_with_no_instrument_failure":3,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"7aa595f0d50e0e54e646eee63d06554ccaf1f6326c79d6e516989897dc2729c8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}