{"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/natural-questions/papers/ran/1","list_of":"/dataset/natural-questions","dataset":"Natural Questions","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,25],"of":25,"counts":{"papers_with_a_benchmark_row":49,"with_a_code_link":41,"where_syntology_ran_a_sample":25,"not_listed_spam_title":0,"listed":49,"listed_where_code_ran":25,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":22,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":22,"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/natural-questions/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","slug":"bm25s-orders-of-magnitude-faster-lexical","title":"BM25S: Orders of magnitude faster lexical search via eager sparse scoring","date":"2024-07-04","arxiv_id":"2407.03618","rows_on_this_dataset":4,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":15,"samples_ran_instrument_failed":0,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["xhluca/bm25s"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bm25s-orders-of-magnitude-faster-lexical#ran","syntology_url":"https://syntology.ai/paper/2407.03618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03618"}}}},{"paper":"/paper/understand-what-llm-needs-dual-preference","slug":"understand-what-llm-needs-dual-preference","title":"Understand What LLM Needs: Dual Preference Alignment for Retrieval-Augmented Generation","date":"2024-06-26","arxiv_id":"2406.18676","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["dongguanting/dpa-rag"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/understand-what-llm-needs-dual-preference#ran","syntology_url":"https://syntology.ai/paper/2406.18676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18676"}}}},{"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/mistral-7b","slug":"mistral-7b","title":"Mistral 7B","date":"2023-10-10","arxiv_id":"2310.06825","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["mistralai/mistral-src"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mistral-7b#ran","syntology_url":"https://syntology.ai/paper/2310.06825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06825"}}}},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":22,"samples_ran_instrument_failed":11,"samples_unverified":19,"pointer_only_for_licence":20,"official":{"repos":["facebookresearch/llama"],"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/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"official":{"repos":["facebookresearch/llama"],"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/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"paper":"/paper/replug-retrieval-augmented-black-box-language","slug":"replug-retrieval-augmented-black-box-language","title":"REPLUG: Retrieval-Augmented Black-Box Language Models","date":"2023-01-30","arxiv_id":"2301.12652","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":13,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/replug-retrieval-augmented-black-box-language#ran","syntology_url":"https://syntology.ai/paper/2301.12652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12652"}}}},{"paper":"/paper/ask-me-anything-a-simple-strategy-for","slug":"ask-me-anything-a-simple-strategy-for","title":"Ask Me Anything: A simple strategy for prompting language models","date":"2022-10-05","arxiv_id":"2210.02441","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/ama_prompting"],"state":"official (archive's flag): 2 ran","n_ran":2,"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/ask-me-anything-a-simple-strategy-for#ran","syntology_url":"https://syntology.ai/paper/2210.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02441"}}}},{"paper":"/paper/few-shot-learning-with-retrieval-augmented","slug":"few-shot-learning-with-retrieval-augmented","title":"Atlas: Few-shot Learning with Retrieval Augmented Language Models","date":"2022-08-05","arxiv_id":"2208.03299","rows_on_this_dataset":4,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/atlas"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"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/few-shot-learning-with-retrieval-augmented#ran","syntology_url":"https://syntology.ai/paper/2208.03299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03299"}}}},{"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":3,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+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/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}}}},{"paper":"/paper/sgpt-gpt-sentence-embeddings-for-semantic","slug":"sgpt-gpt-sentence-embeddings-for-semantic","title":"SGPT: GPT Sentence Embeddings for Semantic Search","date":"2022-02-17","arxiv_id":"2202.08904","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":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["muennighoff/sgpt"],"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/sgpt-gpt-sentence-embeddings-for-semantic#ran","syntology_url":"https://syntology.ai/paper/2202.08904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08904"}}}},{"paper":"/paper/improving-language-models-by-retrieving-from","slug":"improving-language-models-by-retrieving-from","title":"Improving language models by retrieving from trillions of tokens","date":"2021-12-08","arxiv_id":"2112.04426","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":23,"samples_ran":16,"samples_constructed":5,"samples_ran_checked":14,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-language-models-by-retrieving-from#ran","syntology_url":"https://syntology.ai/paper/2112.04426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04426"}}}},{"paper":"/paper/end-to-end-training-of-multi-document-reader","slug":"end-to-end-training-of-multi-document-reader","title":"End-to-End Training of Multi-Document Reader and Retriever for Open-Domain Question Answering","date":"2021-06-09","arxiv_id":"2106.05346","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":4,"official":{"repos":["DevSinghSachan/emdr2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-training-of-multi-document-reader#ran","syntology_url":"https://syntology.ai/paper/2106.05346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05346"}}}},{"paper":"/paper/beir-a-heterogenous-benchmark-for-zero-shot","slug":"beir-a-heterogenous-benchmark-for-zero-shot","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","date":"2021-04-17","arxiv_id":"2104.08663","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+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":["UKPLab/beir"],"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/beir-a-heterogenous-benchmark-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2104.08663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08663"}}}},{"paper":"/paper/approximate-nearest-neighbor-negative","slug":"approximate-nearest-neighbor-negative","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","date":"2020-07-01","arxiv_id":"2007.00808","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["microsoft/ANCE"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/approximate-nearest-neighbor-negative#ran","syntology_url":"https://syntology.ai/paper/2007.00808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00808"}}}},{"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/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-09-28T10:30:06+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":40,"samples_ran_instrument_failed":5,"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/retrieval-augmented-generation-for-knowledge","slug":"retrieval-augmented-generation-for-knowledge","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","date":"2020-05-22","arxiv_id":"2005.11401","rows_on_this_dataset":1,"code_links":18,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":3,"samples_ran_checked":5,"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/retrieval-augmented-generation-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2005.11401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11401"}}}},{"paper":"/paper/dense-passage-retrieval-for-open-domain","slug":"dense-passage-retrieval-for-open-domain","title":"Dense Passage Retrieval for Open-Domain Question Answering","date":"2020-04-10","arxiv_id":"2004.04906","rows_on_this_dataset":2,"code_links":19,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":6,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":9,"official":{"repos":["facebookresearch/DPR"],"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/dense-passage-retrieval-for-open-domain#ran","syntology_url":"https://syntology.ai/paper/2004.04906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04906"}}}},{"paper":"/paper/realm-retrieval-augmented-language-model-pre","slug":"realm-retrieval-augmented-language-model-pre","title":"REALM: Retrieval-Augmented Language Model Pre-Training","date":"2020-02-10","arxiv_id":"2002.08909","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":1,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["google-research/language"],"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/realm-retrieval-augmented-language-model-pre#ran","syntology_url":"https://syntology.ai/paper/2002.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08909"}}}},{"paper":"/paper/reformer-the-efficient-transformer-1","slug":"reformer-the-efficient-transformer-1","title":"Reformer: The Efficient Transformer","date":"2020-01-13","arxiv_id":"2001.04451","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["google/trax"],"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/reformer-the-efficient-transformer-1#ran","syntology_url":"https://syntology.ai/paper/2001.04451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04451"}}}},{"paper":"/paper/190410509","slug":"190410509","title":"Generating Long Sequences with Sparse Transformers","date":"2019-04-23","arxiv_id":"1904.10509","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["openai/sparse_attention"],"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/190410509#ran","syntology_url":"https://syntology.ai/paper/1904.10509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10509"}}}},{"paper":"/paper/a-bert-baseline-for-the-natural-questions","slug":"a-bert-baseline-for-the-natural-questions","title":"A BERT Baseline for the Natural Questions","date":"2019-01-24","arxiv_id":"1901.08634","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["google-research/language"],"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/a-bert-baseline-for-the-natural-questions#ran","syntology_url":"https://syntology.ai/paper/1901.08634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08634"}}}},{"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":1,"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"}}}}],"record_sha256":"9890ab7a1464245c6c5717bca7dedfe48fb240d6aa4c25968bf56785fa537c2c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}