{"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/hotpotqa","name":"HotpotQA","full_name":null,"description_markdown":"**HotpotQA** is a question answering dataset collected on the English Wikipedia, containing about 113K crowd-sourced questions that are constructed to require the introduction paragraphs of two Wikipedia articles to answer. Each question in the dataset comes with the two gold paragraphs, as well as a list of sentences in these paragraphs that crowdworkers identify as supporting facts necessary to answer the question. \r\n\r\nA diverse range of reasoning strategies are featured in HotpotQA, including questions involving missing entities in the question, intersection questions (What satisfies property A and property B?), and comparison questions, where two entities are compared by a common attribute, among others. In the few-document distractor setting, the QA models are given ten paragraphs in which the gold paragraphs are guaranteed to be found; in the open-domain fullwiki setting, the models are only given the question and the entire Wikipedia. Models are evaluated on their answer accuracy and explainability, where the former is measured as overlap between the predicted and gold answers with exact match (EM) and unigram F1, and the latter concerns how well the predicted supporting fact sentences match human annotation (Supporting Fact EM/F1). A joint metric is also reported on this dataset, which encourages systems to perform well on both tasks simultaneously.\r\n\r\nSource: [Answering Complex Open-domain Questions Through Iterative Query Generation](https://arxiv.org/abs/1910.07000)\r\nImage Source: [Yang et al](https://arxiv.org/pdf/1809.09600v1.pdf)","description_withheld":null,"homepage":"https://hotpotqa.github.io/","introduced_date":"2018-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/hotpotqa-a-dataset-for-diverse-explainable","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","first_author":"Zhilin Yang","url":null},"license":{"name":"CC BY-SA 4.0","url":"https://creativecommons.org/licenses/by-sa/4.0/"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Reading Comprehension","url":"/task/reading-comprehension","datasets_with_task":"/datasets/task/reading-comprehension"},{"name":"Retrieval","url":"/task/retrieval","datasets_with_task":"/datasets/task/retrieval"},{"name":"Text Retrieval","url":"/task/text-retrieval","datasets_with_task":"/datasets/task/text-retrieval"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["HotpotQA","hotpot_qa"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/vincentkoc/hotpot_qa_archive","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/hotpotqa/hotpot_qa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/hotpot_qa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/facebookresearch/ParlAI","url":"https://parl.ai/docs/tasks.html#hotpotqa","frameworks":["pytorch"]}],"num_papers_in_archive":933,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-hotpotqa","task":"Question Answering","dataset_variant":"HotpotQA","rows":72,"metrics":["JOINT-F1","ANS-EM","ANS-F1","SUP-EM","SUP-F1","JOINT-EM"],"first_row_in_archive_order":{"model":"Beam Retrieval","paper":"/paper/beam-retrieval-general-end-to-end-retrieval","metrics":{"ANS-EM":"0.727","ANS-F1":"0.850","JOINT-EM":"0.505","JOINT-F1":"0.775","SUP-EM":"0.663","SUP-F1":"0.901"},"code_links":[{"title":"ShayekhBinIslam/openrag","url":"https://github.com/ShayekhBinIslam/openrag"},{"title":"canghongjian/beam_retriever","url":"https://github.com/canghongjian/beam_retriever"},{"title":"Alab-NII/2wikimultihop","url":"https://github.com/Alab-NII/2wikimultihop"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/retrieval-on-hotpotqa","task":"Retrieval","dataset_variant":"HotpotQA","rows":3,"metrics":["Queries per second"],"first_row_in_archive_order":{"model":"BM25S","paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","metrics":{"Queries per second":"20.88"},"code_links":[{"title":"xhluca/bm25s","url":"https://github.com/xhluca/bm25s"},{"title":"xhluca/bm25-benchmarks","url":"https://github.com/xhluca/bm25-benchmarks"},{"title":"conda-forge/bm25s-feedstock","url":"https://github.com/conda-forge/bm25s-feedstock"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-retrieval-on-hotpotqa","task":"Text Retrieval","dataset_variant":"HotpotQA","rows":1,"metrics":["nDCG@10"],"first_row_in_archive_order":{"model":"Lucene (BM25S)","paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","metrics":{"nDCG@10":"62.9"},"code_links":[{"title":"xhluca/bm25s","url":"https://github.com/xhluca/bm25s"},{"title":"xhluca/bm25-benchmarks","url":"https://github.com/xhluca/bm25-benchmarks"},{"title":"conda-forge/bm25s-feedstock","url":"https://github.com/conda-forge/bm25s-feedstock"}]},"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":22,"of":22,"counts":{"papers_with_a_benchmark_row":22,"with_a_code_link":17,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/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-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"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":7,"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/beam-retrieval-general-end-to-end-retrieval","slug":"beam-retrieval-general-end-to-end-retrieval","title":"End-to-End Beam Retrieval for Multi-Hop Question Answering","date":"2023-08-17","arxiv_id":"2308.08973","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["Alab-NII/2wikimultihop","canghongjian/beam_retriever"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/beam-retrieval-general-end-to-end-retrieval#ran","syntology_url":"https://syntology.ai/paper/2308.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08973"}}}},{"paper":"/paper/chain-of-skills-a-configurable-model-for-open","slug":"chain-of-skills-a-configurable-model-for-open","title":"Chain-of-Skills: A Configurable Model for Open-domain Question Answering","date":"2023-05-04","arxiv_id":"2305.03130","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-information-seeking-for-open-domain","slug":"adaptive-information-seeking-for-open-domain","title":"Adaptive Information Seeking for Open-Domain Question Answering","date":"2021-09-14","arxiv_id":"2109.06747","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hopretriever-retrieve-hops-over-wikipedia-to","slug":"hopretriever-retrieve-hops-over-wikipedia-to","title":"HopRetriever: Retrieve Hops over Wikipedia to Answer Complex Questions","date":"2020-12-31","arxiv_id":"2012.15534","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/retrieve-rerank-read-then-iterate-answering","slug":"retrieve-rerank-read-then-iterate-answering","title":"Answering Open-Domain Questions of Varying Reasoning Steps from Text","date":"2020-10-23","arxiv_id":"2010.12527","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+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":["beerqa/irrr"],"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/retrieve-rerank-read-then-iterate-answering#ran","syntology_url":"https://syntology.ai/paper/2010.12527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12527"}}}},{"paper":"/paper/answering-complex-open-domain-questions-with","slug":"answering-complex-open-domain-questions-with","title":"Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval","date":"2020-09-27","arxiv_id":"2009.12756","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ddrqa-dynamic-document-reranking-for-open","slug":"ddrqa-dynamic-document-reranking-for-open","title":"Answering Any-hop Open-domain Questions with Iterative Document Reranking","date":"2020-09-16","arxiv_id":"2009.07465","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/transformer-xh-multi-evidence-reasoning-with","slug":"transformer-xh-multi-evidence-reasoning-with","title":"Transformer-XH: Multi-Evidence Reasoning with eXtra Hop Attention","date":"2020-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-simple-yet-strong-pipeline-for-hotpotqa","slug":"a-simple-yet-strong-pipeline-for-hotpotqa","title":"A Simple Yet Strong Pipeline for HotpotQA","date":"2020-04-14","arxiv_id":"2004.06753","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-to-retrieve-reasoning-paths-over-1","slug":"learning-to-retrieve-reasoning-paths-over-1","title":"Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering","date":"2019-11-24","arxiv_id":"1911.10470","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":5,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["AkariAsai/learning_to_retrieve_reasoning_paths"],"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/learning-to-retrieve-reasoning-paths-over-1#ran","syntology_url":"https://syntology.ai/paper/1911.10470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10470"}}}},{"paper":"/paper/hierarchical-graph-network-for-multi-hop","slug":"hierarchical-graph-network-for-multi-hop","title":"Hierarchical Graph Network for Multi-hop Question Answering","date":"2019-11-09","arxiv_id":"1911.03631","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["yuwfan/HGN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-network-for-multi-hop#ran","syntology_url":"https://syntology.ai/paper/1911.03631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03631"}}}},{"paper":"/paper/multi-paragraph-reasoning-with-knowledge","slug":"multi-paragraph-reasoning-with-knowledge","title":"Multi-Paragraph Reasoning with Knowledge-enhanced Graph Neural Network","date":"2019-11-06","arxiv_id":"1911.02170","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/answering-complex-open-domain-questions","slug":"answering-complex-open-domain-questions","title":"Answering Complex Open-domain Questions Through Iterative Query Generation","date":"2019-10-15","arxiv_id":"1910.07000","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":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["qipeng/golden-retriever"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/answering-complex-open-domain-questions#ran","syntology_url":"https://syntology.ai/paper/1910.07000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07000"}}}},{"paper":"/paper/revealing-the-importance-of-semantic","slug":"revealing-the-importance-of-semantic","title":"Revealing the Importance of Semantic Retrieval for Machine Reading at Scale","date":"2019-09-17","arxiv_id":"1909.08041","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["easonnie/semanticRetrievalMRS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/revealing-the-importance-of-semantic#ran","syntology_url":"https://syntology.ai/paper/1909.08041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08041"}}}},{"paper":"/paper/multi-hop-paragraph-retrieval-for-open-domain","slug":"multi-hop-paragraph-retrieval-for-open-domain","title":"Multi-Hop Paragraph Retrieval for Open-Domain Question Answering","date":"2019-06-15","arxiv_id":"1906.06606","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":5,"official":{"repos":["yairf11/MUPPET"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-hop-paragraph-retrieval-for-open-domain#ran","syntology_url":"https://syntology.ai/paper/1906.06606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06606"}}}},{"paper":"/paper/multi-hop-reading-comprehension-through","slug":"multi-hop-reading-comprehension-through","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","date":"2019-06-07","arxiv_id":"1906.02916","rows_on_this_dataset":1,"code_links":2,"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":1,"official":{"repos":["shmsw25/DecompRC"],"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/multi-hop-reading-comprehension-through#ran","syntology_url":"https://syntology.ai/paper/1906.02916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02916"}}}},{"paper":"/paper/answering-while-summarizing-multi-task","slug":"answering-while-summarizing-multi-task","title":"Answering while Summarizing: Multi-task Learning for Multi-hop QA with Evidence Extraction","date":"2019-05-21","arxiv_id":"1905.08511","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dynamically-fused-graph-network-for-multi-hop","slug":"dynamically-fused-graph-network-for-multi-hop","title":"Dynamically Fused Graph Network for Multi-hop Reasoning","date":"2019-05-16","arxiv_id":"1905.06933","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["woshiyyya/DFGN-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamically-fused-graph-network-for-multi-hop#ran","syntology_url":"https://syntology.ai/paper/1905.06933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06933"}}}},{"paper":"/paper/cognitive-graph-for-multi-hop-reading","slug":"cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["THUDM/CogQA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cognitive-graph-for-multi-hop-reading#ran","syntology_url":"https://syntology.ai/paper/1905.05460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05460"}}}},{"paper":"/paper/hotpotqa-a-dataset-for-diverse-explainable","slug":"hotpotqa-a-dataset-for-diverse-explainable","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","date":"2018-09-25","arxiv_id":"1809.09600","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["hotpotqa/hotpot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hotpotqa-a-dataset-for-diverse-explainable#ran","syntology_url":"https://syntology.ai/paper/1809.09600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.09600"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"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-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"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":7,"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/beam-retrieval-general-end-to-end-retrieval","slug":"beam-retrieval-general-end-to-end-retrieval","title":"End-to-End Beam Retrieval for Multi-Hop Question Answering","date":"2023-08-17","arxiv_id":"2308.08973","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["Alab-NII/2wikimultihop","canghongjian/beam_retriever"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/beam-retrieval-general-end-to-end-retrieval#ran","syntology_url":"https://syntology.ai/paper/2308.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08973"}}}},{"paper":"/paper/chain-of-skills-a-configurable-model-for-open","slug":"chain-of-skills-a-configurable-model-for-open","title":"Chain-of-Skills: A Configurable Model for Open-domain Question Answering","date":"2023-05-04","arxiv_id":"2305.03130","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-information-seeking-for-open-domain","slug":"adaptive-information-seeking-for-open-domain","title":"Adaptive Information Seeking for Open-Domain Question Answering","date":"2021-09-14","arxiv_id":"2109.06747","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hopretriever-retrieve-hops-over-wikipedia-to","slug":"hopretriever-retrieve-hops-over-wikipedia-to","title":"HopRetriever: Retrieve Hops over Wikipedia to Answer Complex Questions","date":"2020-12-31","arxiv_id":"2012.15534","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/retrieve-rerank-read-then-iterate-answering","slug":"retrieve-rerank-read-then-iterate-answering","title":"Answering Open-Domain Questions of Varying Reasoning Steps from Text","date":"2020-10-23","arxiv_id":"2010.12527","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+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":["beerqa/irrr"],"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/retrieve-rerank-read-then-iterate-answering#ran","syntology_url":"https://syntology.ai/paper/2010.12527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12527"}}}},{"paper":"/paper/answering-complex-open-domain-questions-with","slug":"answering-complex-open-domain-questions-with","title":"Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval","date":"2020-09-27","arxiv_id":"2009.12756","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ddrqa-dynamic-document-reranking-for-open","slug":"ddrqa-dynamic-document-reranking-for-open","title":"Answering Any-hop Open-domain Questions with Iterative Document Reranking","date":"2020-09-16","arxiv_id":"2009.07465","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/transformer-xh-multi-evidence-reasoning-with","slug":"transformer-xh-multi-evidence-reasoning-with","title":"Transformer-XH: Multi-Evidence Reasoning with eXtra Hop Attention","date":"2020-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-simple-yet-strong-pipeline-for-hotpotqa","slug":"a-simple-yet-strong-pipeline-for-hotpotqa","title":"A Simple Yet Strong Pipeline for HotpotQA","date":"2020-04-14","arxiv_id":"2004.06753","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-to-retrieve-reasoning-paths-over-1","slug":"learning-to-retrieve-reasoning-paths-over-1","title":"Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering","date":"2019-11-24","arxiv_id":"1911.10470","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":5,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["AkariAsai/learning_to_retrieve_reasoning_paths"],"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/learning-to-retrieve-reasoning-paths-over-1#ran","syntology_url":"https://syntology.ai/paper/1911.10470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10470"}}}},{"paper":"/paper/hierarchical-graph-network-for-multi-hop","slug":"hierarchical-graph-network-for-multi-hop","title":"Hierarchical Graph Network for Multi-hop Question Answering","date":"2019-11-09","arxiv_id":"1911.03631","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["yuwfan/HGN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-network-for-multi-hop#ran","syntology_url":"https://syntology.ai/paper/1911.03631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03631"}}}},{"paper":"/paper/multi-paragraph-reasoning-with-knowledge","slug":"multi-paragraph-reasoning-with-knowledge","title":"Multi-Paragraph Reasoning with Knowledge-enhanced Graph Neural Network","date":"2019-11-06","arxiv_id":"1911.02170","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/answering-complex-open-domain-questions","slug":"answering-complex-open-domain-questions","title":"Answering Complex Open-domain Questions Through Iterative Query Generation","date":"2019-10-15","arxiv_id":"1910.07000","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":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["qipeng/golden-retriever"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/answering-complex-open-domain-questions#ran","syntology_url":"https://syntology.ai/paper/1910.07000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07000"}}}},{"paper":"/paper/revealing-the-importance-of-semantic","slug":"revealing-the-importance-of-semantic","title":"Revealing the Importance of Semantic Retrieval for Machine Reading at Scale","date":"2019-09-17","arxiv_id":"1909.08041","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["easonnie/semanticRetrievalMRS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/revealing-the-importance-of-semantic#ran","syntology_url":"https://syntology.ai/paper/1909.08041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08041"}}}},{"paper":"/paper/multi-hop-paragraph-retrieval-for-open-domain","slug":"multi-hop-paragraph-retrieval-for-open-domain","title":"Multi-Hop Paragraph Retrieval for Open-Domain Question Answering","date":"2019-06-15","arxiv_id":"1906.06606","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":5,"official":{"repos":["yairf11/MUPPET"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-hop-paragraph-retrieval-for-open-domain#ran","syntology_url":"https://syntology.ai/paper/1906.06606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06606"}}}},{"paper":"/paper/multi-hop-reading-comprehension-through","slug":"multi-hop-reading-comprehension-through","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","date":"2019-06-07","arxiv_id":"1906.02916","rows_on_this_dataset":1,"code_links":2,"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":1,"official":{"repos":["shmsw25/DecompRC"],"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/multi-hop-reading-comprehension-through#ran","syntology_url":"https://syntology.ai/paper/1906.02916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02916"}}}},{"paper":"/paper/answering-while-summarizing-multi-task","slug":"answering-while-summarizing-multi-task","title":"Answering while Summarizing: Multi-task Learning for Multi-hop QA with Evidence Extraction","date":"2019-05-21","arxiv_id":"1905.08511","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dynamically-fused-graph-network-for-multi-hop","slug":"dynamically-fused-graph-network-for-multi-hop","title":"Dynamically Fused Graph Network for Multi-hop Reasoning","date":"2019-05-16","arxiv_id":"1905.06933","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["woshiyyya/DFGN-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamically-fused-graph-network-for-multi-hop#ran","syntology_url":"https://syntology.ai/paper/1905.06933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06933"}}}},{"paper":"/paper/cognitive-graph-for-multi-hop-reading","slug":"cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["THUDM/CogQA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cognitive-graph-for-multi-hop-reading#ran","syntology_url":"https://syntology.ai/paper/1905.05460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05460"}}}},{"paper":"/paper/hotpotqa-a-dataset-for-diverse-explainable","slug":"hotpotqa-a-dataset-for-diverse-explainable","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","date":"2018-09-25","arxiv_id":"1809.09600","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["hotpotqa/hotpot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hotpotqa-a-dataset-for-diverse-explainable#ran","syntology_url":"https://syntology.ai/paper/1809.09600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.09600"}}}}],"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/dataset/hotpotqa/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/hotpotqa/papers/ran/1","json":"/dataset/hotpotqa/papers/ran/1.json","rows":12}],"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":13,"samples_harvested":109,"samples_ran":81,"samples_constructed":1,"samples_ran_checked":60,"samples_ran_instrument_failed":21,"samples_unverified":28,"pointer_only_for_licence":31,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":12,"papers_with_a_run_with_no_instrument_failure":10,"papers_where_every_run_was_an_instrument_failure":2,"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":22,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/question-answering-on-hotpotqa","since_archive":"/sota/question-answering-on-hotpotqa#since-judged","papers_judged":19,"placed":0},{"leaderboard":"/sota/text-retrieval-on-hotpotqa","since_archive":"/sota/text-retrieval-on-hotpotqa#since-judged","papers_judged":3,"placed":0}]},"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":"42a674eefa90511f84ff3c4f6d2a1ed51fcaf72abdca2bfb2f4f735dc26e52bb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}