{"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/squad/papers/ran/1","list_of":"/dataset/squad","dataset":"SQuAD","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","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,"rows":[1,32],"of":32,"counts":{"papers_with_a_benchmark_row":82,"with_a_code_link":63,"where_syntology_ran_a_sample":32,"not_listed_spam_title":0,"listed":82,"listed_where_code_ran":32,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":29,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":29,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"first_page":"/dataset/squad/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/blended-rag-improving-rag-retriever-augmented","slug":"blended-rag-improving-rag-retriever-augmented","title":"Blended RAG: Improving RAG (Retriever-Augmented Generation) Accuracy with Semantic Search and Hybrid Query-Based Retrievers","date":"2024-03-22","arxiv_id":"2404.07220","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["ibm-ecosystem-engineering/blended-rag"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/blended-rag-improving-rag-retriever-augmented#ran","syntology_url":"https://syntology.ai/paper/2404.07220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07220"}}}},{"paper":"/paper/textbox-2-0-a-text-generation-library-with","slug":"textbox-2-0-a-text-generation-library-with","title":"TextBox 2.0: A Text Generation Library with Pre-trained Language Models","date":"2022-12-26","arxiv_id":"2212.13005","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["RUCAIBox/TextBox"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/textbox-2-0-a-text-generation-library-with#ran","syntology_url":"https://syntology.ai/paper/2212.13005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13005"}}}},{"paper":"/paper/dyrex-dynamic-query-representation-for","slug":"dyrex-dynamic-query-representation-for","title":"DyREx: Dynamic Query Representation for Extractive Question Answering","date":"2022-10-26","arxiv_id":"2210.15048","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["urchade/dyrex"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dyrex-dynamic-query-representation-for#ran","syntology_url":"https://syntology.ai/paper/2210.15048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15048"}}}},{"paper":"/paper/linkbert-pretraining-language-models-with","slug":"linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","arxiv_id":"2203.15827","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":11,"pointer_only_for_licence":0,"official":{"repos":["michiyasunaga/LinkBERT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/linkbert-pretraining-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2203.15827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15827"}}}},{"paper":"/paper/zerogen-efficient-zero-shot-learning-via","slug":"zerogen-efficient-zero-shot-learning-via","title":"ZeroGen: Efficient Zero-shot Learning via Dataset Generation","date":"2022-02-16","arxiv_id":"2202.07922","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":7,"official":{"repos":["HKUNLP/zerogen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/zerogen-efficient-zero-shot-learning-via#ran","syntology_url":"https://syntology.ai/paper/2202.07922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07922"}}}},{"paper":"/paper/pay-attention-to-mlps","slug":"pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","arxiv_id":"2105.08050","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":44,"samples_ran":34,"samples_constructed":15,"samples_ran_checked":31,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":11,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pay-attention-to-mlps#ran","syntology_url":"https://syntology.ai/paper/2105.08050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08050"}}}},{"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":7,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+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-09-28T10:30:06+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/generating-diverse-and-consistent-qa-pairs","slug":"generating-diverse-and-consistent-qa-pairs","title":"Generating Diverse and Consistent QA pairs from Contexts with Information-Maximizing Hierarchical Conditional VAEs","date":"2020-05-28","arxiv_id":"2005.13837","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":3,"official":{"repos":["seanie12/Info-HCVAE"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generating-diverse-and-consistent-qa-pairs#ran","syntology_url":"https://syntology.ai/paper/2005.13837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13837"}}}},{"paper":"/paper/unilmv2-pseudo-masked-language-models-for","slug":"unilmv2-pseudo-masked-language-models-for","title":"UniLMv2: Pseudo-Masked Language Models for Unified Language Model Pre-Training","date":"2020-02-28","arxiv_id":"2002.12804","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+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":{"repos":["microsoft/unilm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unilmv2-pseudo-masked-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2002.12804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12804"}}}},{"paper":"/paper/dice-loss-for-data-imbalanced-nlp-tasks","slug":"dice-loss-for-data-imbalanced-nlp-tasks","title":"Dice Loss for Data-imbalanced NLP Tasks","date":"2019-11-07","arxiv_id":"1911.02855","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ShannonAI/dice_loss_for_NLP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dice-loss-for-data-imbalanced-nlp-tasks#ran","syntology_url":"https://syntology.ai/paper/1911.02855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02855"}}}},{"paper":"/paper/bart-denoising-sequence-to-sequence-pre","slug":"bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","arxiv_id":"1910.13461","rows_on_this_dataset":1,"code_links":47,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":53,"samples_ran":40,"samples_constructed":7,"samples_ran_checked":31,"samples_ran_instrument_failed":9,"samples_unverified":13,"pointer_only_for_licence":13,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bart-denoising-sequence-to-sequence-pre#ran","syntology_url":"https://syntology.ai/paper/1910.13461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13461"}}}},{"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":5,"code_links":57,"syntology":{"read_at":"2026-09-28T10:30:06+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/distilbert-a-distilled-version-of-bert","slug":"distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","arxiv_id":"1910.01108","rows_on_this_dataset":2,"code_links":37,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":27,"samples_ran":21,"samples_constructed":5,"samples_ran_checked":13,"samples_ran_instrument_failed":8,"samples_unverified":6,"pointer_only_for_licence":2,"official":{"repos":["huggingface/swift-coreml-transformers","huggingface/transformers"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilbert-a-distilled-version-of-bert#ran","syntology_url":"https://syntology.ai/paper/1910.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01108"}}}},{"paper":"/paper/albert-a-lite-bert-for-self-supervised","slug":"albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","arxiv_id":"1909.11942","rows_on_this_dataset":6,"code_links":48,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":126,"samples_ran":81,"samples_constructed":17,"samples_ran_checked":59,"samples_ran_instrument_failed":22,"samples_unverified":45,"pointer_only_for_licence":28,"official":{"repos":["google-research/ALBERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/albert-a-lite-bert-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/1909.11942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11942"}}}},{"paper":"/paper/semantics-aware-bert-for-language","slug":"semantics-aware-bert-for-language","title":"Semantics-aware BERT for Language Understanding","date":"2019-09-05","arxiv_id":"1909.02209","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":3,"official":{"repos":["cooelf/SemBERT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semantics-aware-bert-for-language#ran","syntology_url":"https://syntology.ai/paper/1909.02209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02209"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"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/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":3,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":4,"code_links":27,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/reducing-bert-pre-training-time-from-3-days","slug":"reducing-bert-pre-training-time-from-3-days","title":"Large Batch Optimization for Deep Learning: Training BERT in 76 minutes","date":"2019-04-01","arxiv_id":"1904.00962","rows_on_this_dataset":1,"code_links":32,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":9,"official":{"repos":["tensorflow/addons"],"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/reducing-bert-pre-training-time-from-3-days#ran","syntology_url":"https://syntology.ai/paper/1904.00962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00962"}}}},{"paper":"/paper/end-to-end-open-domain-question-answering","slug":"end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","arxiv_id":"1902.01718","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["rsvp-ai/bertserini"],"state":"official (archive's flag): 8 ran","n_ran":8,"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/end-to-end-open-domain-question-answering#ran","syntology_url":"https://syntology.ai/paper/1902.01718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01718"}}}},{"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":6,"code_links":534,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":235,"samples_ran_instrument_failed":65,"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"}}}},{"paper":"/paper/qanet-combining-local-convolution-with-global","slug":"qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","arxiv_id":"1804.09541","rows_on_this_dataset":4,"code_links":15,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":19,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":4,"samples_unverified":5,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/qanet-combining-local-convolution-with-global#ran","syntology_url":"https://syntology.ai/paper/1804.09541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09541"}}}},{"paper":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","rows_on_this_dataset":4,"code_links":46,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":58,"samples_ran":30,"samples_constructed":12,"samples_ran_checked":24,"samples_ran_instrument_failed":6,"samples_unverified":28,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-contextualized-word-representations#ran","syntology_url":"https://syntology.ai/paper/1802.05365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05365"}}}},{"paper":"/paper/simple-and-effective-multi-paragraph-reading","slug":"simple-and-effective-multi-paragraph-reading","title":"Simple and Effective Multi-Paragraph Reading Comprehension","date":"2017-10-29","arxiv_id":"1710.10723","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["allenai/document-qa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-effective-multi-paragraph-reading#ran","syntology_url":"https://syntology.ai/paper/1710.10723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10723"}}}},{"paper":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","rows_on_this_dataset":2,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["asappresearch/sru"],"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/simple-recurrent-units-for-highly#ran","syntology_url":"https://syntology.ai/paper/1709.02755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.02755"}}}},{"paper":"/paper/learned-in-translation-contextualized-word","slug":"learned-in-translation-contextualized-word","title":"Learned in Translation: Contextualized Word Vectors","date":"2017-08-01","arxiv_id":"1708.00107","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["salesforce/cove"],"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/learned-in-translation-contextualized-word#ran","syntology_url":"https://syntology.ai/paper/1708.00107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00107"}}}},{"paper":"/paper/neural-question-generation-from-text-a","slug":"neural-question-generation-from-text-a","title":"Neural Question Generation from Text: A Preliminary Study","date":"2017-04-06","arxiv_id":"1704.01792","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+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":1,"official":{"repos":["magic282/NQG"],"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/neural-question-generation-from-text-a#ran","syntology_url":"https://syntology.ai/paper/1704.01792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01792"}}}},{"paper":"/paper/reading-wikipedia-to-answer-open-domain","slug":"reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","rows_on_this_dataset":3,"code_links":10,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["facebookresearch/DrQA"],"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/reading-wikipedia-to-answer-open-domain#ran","syntology_url":"https://syntology.ai/paper/1704.00051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.00051"}}}},{"paper":"/paper/making-neural-qa-as-simple-as-possible-but","slug":"making-neural-qa-as-simple-as-possible-but","title":"Making Neural QA as Simple as Possible but not Simpler","date":"2017-03-14","arxiv_id":"1703.04816","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/making-neural-qa-as-simple-as-possible-but#ran","syntology_url":"https://syntology.ai/paper/1703.04816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04816"}}}},{"paper":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","rows_on_this_dataset":3,"code_links":27,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":7,"official":{"repos":["allenai/bi-att-flow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}}}},{"paper":"/paper/machine-comprehension-using-match-lstm-and","slug":"machine-comprehension-using-match-lstm-and","title":"Machine Comprehension Using Match-LSTM and Answer Pointer","date":"2016-08-29","arxiv_id":"1608.07905","rows_on_this_dataset":5,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["shuohangwang/SeqMatchSeq"],"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":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/machine-comprehension-using-match-lstm-and#ran","syntology_url":"https://syntology.ai/paper/1608.07905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.07905"}}}}],"record_sha256":"ab2d51e8cb372b749757bb8ce4284b0165268fb75b8792c32ce0b8b9a9ff1c6e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}