{"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/record","name":"ReCoRD","full_name":"ReCoRD","description_markdown":"**Reading Comprehension with Commonsense Reasoning Dataset** (ReCoRD) is a large-scale reading comprehension dataset which requires commonsense reasoning. ReCoRD consists of queries automatically generated from CNN/Daily Mail news articles; the answer to each query is a text span from a summarizing passage of the corresponding news. The goal of ReCoRD is to evaluate a machine's ability of commonsense reasoning in reading comprehension. ReCoRD is pronounced as [ˈrɛkərd].\r\n\r\nImage Source: [Zhang et al](https://arxiv.org/pdf/1810.12885v1.pdf)","description_withheld":null,"homepage":"https://sheng-z.github.io/ReCoRD-explorer/","introduced_date":"2018-10-30","introduced_date_note":null,"introduced_by":{"paper":"/paper/record-bridging-the-gap-between-human-and","title":"ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehension","first_author":"Sheng Zhang","url":null},"license":{"name":"Custom","url":"https://sheng-z.github.io/ReCoRD-explorer/"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Common Sense Reasoning","url":"/task/common-sense-reasoning","datasets_with_task":"/datasets/task/common-sense-reasoning"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["ReCoRD"],"data_loaders":[],"num_papers_in_archive":111,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/common-sense-reasoning-on-record","task":"Common Sense Reasoning","dataset_variant":"ReCoRD","rows":45,"metrics":["EM","F1"],"first_row_in_archive_order":{"model":"Turing NLR v5 XXL 5.4B (fine-tuned)","paper":"/paper/toward-efficient-language-model-pretraining","metrics":{"EM":"95.9","F1":"96.4"},"code_links":[]},"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":20,"of":20,"counts":{"papers_with_a_benchmark_row":20,"with_a_code_link":14,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":20,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/integrating-a-heterogeneous-graph-with-entity","slug":"integrating-a-heterogeneous-graph-with-entity","title":"Integrating a Heterogeneous Graph with Entity-aware Self-attention using Relative Position Labels for Reading Comprehension Model","date":"2023-07-19","arxiv_id":"2307.10443","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bloomberggpt-a-large-language-model-for","slug":"bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","arxiv_id":"2303.17564","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/luke-graph-a-transformer-based-approach-with","slug":"luke-graph-a-transformer-based-approach-with","title":"LUKE-Graph: A Transformer-based Approach with Gated Relational Graph Attention for Cloze-style Reading Comprehension","date":"2023-03-12","arxiv_id":"2303.06675","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/toward-efficient-language-model-pretraining","slug":"toward-efficient-language-model-pretraining","title":"Toward Efficient Language Model Pretraining and Downstream Adaptation via Self-Evolution: A Case Study on SuperGLUE","date":"2022-12-04","arxiv_id":"2212.01853","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/alexatm-20b-few-shot-learning-using-a-large","slug":"alexatm-20b-few-shot-learning-using-a-large","title":"AlexaTM 20B: Few-Shot Learning Using a Large-Scale Multilingual Seq2Seq Model","date":"2022-08-02","arxiv_id":"2208.01448","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/alexatm-20b-few-shot-learning-using-a-large#ran","syntology_url":"https://syntology.ai/paper/2208.01448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01448"}}}},{"paper":"/paper/n-grammer-augmenting-transformers-with-latent-1","slug":"n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","arxiv_id":"2207.06366","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/lingvo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n-grammer-augmenting-transformers-with-latent-1#ran","syntology_url":"https://syntology.ai/paper/2207.06366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06366"}}}},{"paper":"/paper/large-language-models-are-zero-shot-reasoners","slug":"large-language-models-are-zero-shot-reasoners","title":"Large Language Models are Zero-Shot Reasoners","date":"2022-05-24","arxiv_id":"2205.11916","rows_on_this_dataset":1,"code_links":4,"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":1,"official":{"repos":["kojima-takeshi188/zero_shot_cot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/large-language-models-are-zero-shot-reasoners#ran","syntology_url":"https://syntology.ai/paper/2205.11916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11916"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"paper":"/paper/efficient-language-modeling-with-sparse-all","slug":"efficient-language-modeling-with-sparse-all","title":"Efficient Language Modeling with Sparse all-MLP","date":"2022-03-14","arxiv_id":"2203.06850","rows_on_this_dataset":5,"code_links":0,"syntology":null},{"paper":"/paper/designing-effective-sparse-expert-models","slug":"designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","arxiv_id":"2202.08906","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["tensorflow/mesh"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/designing-effective-sparse-expert-models#ran","syntology_url":"https://syntology.ai/paper/2202.08906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08906"}}}},{"paper":"/paper/kelm-knowledge-enhanced-pre-trained-language","slug":"kelm-knowledge-enhanced-pre-trained-language","title":"KELM: Knowledge Enhanced Pre-Trained Language Representations with Message Passing on Hierarchical Relational Graphs","date":"2021-09-09","arxiv_id":"2109.04223","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["nlp-anonymous-happy/anonymous-kg-guided-nlp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kelm-knowledge-enhanced-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2109.04223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04223"}}}},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":2,"code_links":8,"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":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/luke-deep-contextualized-entity","slug":"luke-deep-contextualized-entity","title":"LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attention","date":"2020-10-02","arxiv_id":"2010.01057","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["studio-ousia/luke"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/luke-deep-contextualized-entity#ran","syntology_url":"https://syntology.ai/paper/2010.01057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01057"}}}},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/pingan-smart-health-and-sjtu-at-coin-shared","slug":"pingan-smart-health-and-sjtu-at-coin-shared","title":"Pingan Smart Health and SJTU at COIN - Shared Task: utilizing Pre-trained Language Models and Common-sense Knowledge in Machine Reading Tasks","date":"2019-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":2,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/record-bridging-the-gap-between-human-and","slug":"record-bridging-the-gap-between-human-and","title":"ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehension","date":"2018-10-30","arxiv_id":"1810.12885","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/bert-pre-training-of-deep-bidirectional","slug":"bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","arxiv_id":"1810.04805","rows_on_this_dataset":1,"code_links":534,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":234,"samples_ran_instrument_failed":66,"samples_unverified":359,"pointer_only_for_licence":164,"official":{"repos":["google-research/bert"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert-pre-training-of-deep-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1810.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04805"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/integrating-a-heterogeneous-graph-with-entity","slug":"integrating-a-heterogeneous-graph-with-entity","title":"Integrating a Heterogeneous Graph with Entity-aware Self-attention using Relative Position Labels for Reading Comprehension Model","date":"2023-07-19","arxiv_id":"2307.10443","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bloomberggpt-a-large-language-model-for","slug":"bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","arxiv_id":"2303.17564","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/luke-graph-a-transformer-based-approach-with","slug":"luke-graph-a-transformer-based-approach-with","title":"LUKE-Graph: A Transformer-based Approach with Gated Relational Graph Attention for Cloze-style Reading Comprehension","date":"2023-03-12","arxiv_id":"2303.06675","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/toward-efficient-language-model-pretraining","slug":"toward-efficient-language-model-pretraining","title":"Toward Efficient Language Model Pretraining and Downstream Adaptation via Self-Evolution: A Case Study on SuperGLUE","date":"2022-12-04","arxiv_id":"2212.01853","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/alexatm-20b-few-shot-learning-using-a-large","slug":"alexatm-20b-few-shot-learning-using-a-large","title":"AlexaTM 20B: Few-Shot Learning Using a Large-Scale Multilingual Seq2Seq Model","date":"2022-08-02","arxiv_id":"2208.01448","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/alexatm-20b-few-shot-learning-using-a-large#ran","syntology_url":"https://syntology.ai/paper/2208.01448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01448"}}}},{"paper":"/paper/n-grammer-augmenting-transformers-with-latent-1","slug":"n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","arxiv_id":"2207.06366","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/lingvo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n-grammer-augmenting-transformers-with-latent-1#ran","syntology_url":"https://syntology.ai/paper/2207.06366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06366"}}}},{"paper":"/paper/large-language-models-are-zero-shot-reasoners","slug":"large-language-models-are-zero-shot-reasoners","title":"Large Language Models are Zero-Shot Reasoners","date":"2022-05-24","arxiv_id":"2205.11916","rows_on_this_dataset":1,"code_links":4,"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":1,"official":{"repos":["kojima-takeshi188/zero_shot_cot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/large-language-models-are-zero-shot-reasoners#ran","syntology_url":"https://syntology.ai/paper/2205.11916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11916"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"paper":"/paper/efficient-language-modeling-with-sparse-all","slug":"efficient-language-modeling-with-sparse-all","title":"Efficient Language Modeling with Sparse all-MLP","date":"2022-03-14","arxiv_id":"2203.06850","rows_on_this_dataset":5,"code_links":0,"syntology":null},{"paper":"/paper/designing-effective-sparse-expert-models","slug":"designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","arxiv_id":"2202.08906","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["tensorflow/mesh"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/designing-effective-sparse-expert-models#ran","syntology_url":"https://syntology.ai/paper/2202.08906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08906"}}}},{"paper":"/paper/kelm-knowledge-enhanced-pre-trained-language","slug":"kelm-knowledge-enhanced-pre-trained-language","title":"KELM: Knowledge Enhanced Pre-Trained Language Representations with Message Passing on Hierarchical Relational Graphs","date":"2021-09-09","arxiv_id":"2109.04223","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["nlp-anonymous-happy/anonymous-kg-guided-nlp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kelm-knowledge-enhanced-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2109.04223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04223"}}}},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":2,"code_links":8,"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":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/luke-deep-contextualized-entity","slug":"luke-deep-contextualized-entity","title":"LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attention","date":"2020-10-02","arxiv_id":"2010.01057","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["studio-ousia/luke"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/luke-deep-contextualized-entity#ran","syntology_url":"https://syntology.ai/paper/2010.01057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01057"}}}},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/pingan-smart-health-and-sjtu-at-coin-shared","slug":"pingan-smart-health-and-sjtu-at-coin-shared","title":"Pingan Smart Health and SJTU at COIN - Shared Task: utilizing Pre-trained Language Models and Common-sense Knowledge in Machine Reading Tasks","date":"2019-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":2,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/record-bridging-the-gap-between-human-and","slug":"record-bridging-the-gap-between-human-and","title":"ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehension","date":"2018-10-30","arxiv_id":"1810.12885","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/bert-pre-training-of-deep-bidirectional","slug":"bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","arxiv_id":"1810.04805","rows_on_this_dataset":1,"code_links":534,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":234,"samples_ran_instrument_failed":66,"samples_unverified":359,"pointer_only_for_licence":164,"official":{"repos":["google-research/bert"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert-pre-training-of-deep-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1810.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04805"}}}}],"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/dataset/record/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/record/papers/ran/1","json":"/dataset/record/papers/ran/1.json","rows":11}],"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":12,"samples_harvested":838,"samples_ran":426,"samples_constructed":93,"samples_ran_checked":338,"samples_ran_instrument_failed":88,"samples_unverified":412,"pointer_only_for_licence":181,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":11,"papers_with_a_run_with_no_instrument_failure":10,"papers_where_every_run_was_an_instrument_failure":1,"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":"bffba9292f363b0f368be34fdadbdbbb0ea7673570093f8152ad12456362066d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}