HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering
Open accessAbstract
Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William Cohen, Ruslan Salakhutdinov, Christopher D. Manning. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. 2018.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
HotpotQA is a multi-hop reasoning benchmark in which each question requires synthesising evidence from exactly two disjoint supporting paragraphs.
“HotpotQA is a multi-hop reasoning benchmark in which each question requires synthesising evidence from exactly two disjoint supporting paragraphs.[3]”
From When Context Overwhelms: A Study of Long-Context vs. Retrieval-Based QA Under Noise (2026) · cites this paper as [3]
The Introduction and candidate-paragraph-pair sections describe HotpotQA as a multi-hop dataset built around pairs of supporting paragraphs. But Dataset Analysis says most—not every—question requires a fact from each paragraph; it estimates that about 6% of sampled questions can be answered from one paragraph and 2% are unanswerable. The claim’s universal requirement is therefore too strong. (LLM, conf=0.90)
Experimental — accuracy not yet measuredSQuAD and HotpotQA are two widely used datasets in QA and QG.
“We use SQuAD (Rajpurkar et al., 2016) and HotpotQA (Yang et al., 2018) as the base datasets, which are two widely used datasets in the field of QA and QG.”
From QGEval: Benchmarking Multi-dimensional Evaluation for Question Generation (2024) · cites this paper as Yang et al., 2018
The Abstract identifies HotpotQA as a QA dataset, and Section 6 (Related Work) discusses SQuAD as another QA dataset. The paper does not establish that HotpotQA is widely used or used in question generation (QG); the SQuAD citation is separate. (LLM, conf=0.84)
Experimental — accuracy not yet measuredThe majority of existing QA datasets are designed to answer questions based on short passages.
“The majority of existing QA datasets (Rajpurkar et al., 2018; Yang et al., 2018; Trivedi et al., 2022) are designed to answer questions based on short passages.”
From RULER: What's the Real Context Size of Your Long-Context Language Models? (2024) · cites this paper as Yang et al., 2018
The Introduction says SQuAD questions are designed around a single paragraph and that most TriviaQA and SearchQA questions can be answered from a few nearby sentences in one paragraph. It does not establish that a majority of existing QA datasets are designed around short passages; it describes TriviaQA and SearchQA as using multiple documents for context. (LLM, conf=0.83)
Experimental — accuracy not yet measuredExisting benchmarks such as HotpotQA, Bamboogle, and 2wiki typically involve only two information-seeking steps and are not explicitly structured to support long-horizon interactions that necessitate memory management.
“Existing benchmarks, such as HotpotQA [59], Bamboogle [38], and 2wiki [21], are often cited as multi-hop benchmarks, yet they typically involve only two information-seeking steps. Moreover, these datasets are not explicitly structured to support long-horizon interactions that necessitate the agent to manage the memory state.”
From MEM1: Learning to Synergize Memory and Reasoning for Efficient Long-Horizon Agents (2025) · cites this paper as [59]
In §3, “Processing and Benchmark Settings” (page unavailable), HotpotQA uses two gold paragraphs per question; §4, “Dataset Analysis” (page unavailable), describes a common two-hop reasoning pattern. This supports the characterization of HotpotQA as a typically two-hop benchmark, but two hops are not necessarily two information-seeking steps. The paper describes a question-answering task rather than long-horizon, memory-managed interactions, and it does not establish these claims for Bamboogle or 2wiki. (LLM, conf=0.84)
Experimental — accuracy not yet measuredMany benchmark sets do not allow for arbitrary generation of novel questions, or draw data from publicly available sources that LLM trainers have access to.
“Many benchmark sets do not allow for arbitrary generation of novel questions, or worse, draw data from publicly available sources-the same sources LLM trainers have access to [51, 39].”
From On the Self-Verification Limitations of Large Language Models on Reasoning and Planning Tasks (2024) · cites this paper as [51]
The Introduction and “KB-based multi-hop datasets” section say that fixed knowledge-base schemas limit the diversity of questions, supporting the point about restrictions on novel questions. The Data Collection section says HotpotQA uses Wikipedia, but the paper does not say that LLM trainers have access to those sources. (LLM, conf=0.87)
Experimental — accuracy not yet measured
The diversity and complexity of tasks make it difficult to represent them in a unified yet flexible manner.
“Specifically, each task can have different requirements, operations, and dependencies, which makes it difficult to represent them in a unified yet flexible manner (Chen et al., 2021;Cobbe et al., 2021;Yang et al., 2018;Luo et al., 2018).”
From AFlow: Automating Agentic Workflow Generation (2024) · cites this paper as Yang et al., 2018
Section 4 (Dataset Analysis; page unavailable) describes HotpotQA questions that require different reasoning operations, including chaining, checking multiple properties, and comparison. Section 5.2 (Results; page unavailable) reports that some question types are harder for the model. The paper does not say that this diversity makes tasks difficult to represent in a unified yet flexible manner; that broader representation claim is unsupported. (LLM, conf=0.82)
Experimental — accuracy not yet measuredRAG remains systematically fragile on tasks requiring multi-hop inference, a limitation well-documented on HotpotQA.
“Despite these advances, RAG remains systematically fragile on tasks requiring multi-hop inference, where the relevant evidence spans paragraphs that are individually unremarkable but jointly decisive , a limitation well-documented on HotpotQA.[3]”
From When Context Overwhelms: A Study of Long-Context vs. Retrieval-Based QA Under Noise (2026) · cites this paper as [3]
Section 4 says most HotpotQA questions require supporting facts from both paragraphs, and Section 5.2 reports substantially lower baseline performance in the full-wiki setting, calling it a challenge for retrieval-based question answering. The paper does not evaluate RAG systems or establish that RAG is systematically fragile; that extends its findings beyond the systems studied. Page numbers are unavailable in our copy. (LLM, conf=0.88)
Experimental — accuracy not yet measuredHotpotQA is particularly suitable for evaluating long-term memory storage and retrieval.
“This structure makes HotpotQA particularly suitable for evaluating long-term memory storage and retrieval.”
From Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents (2026) · cites this paper as Yang et al., 2018
Section 3 (Processing and Benchmark Settings) says the full-wiki benchmark tests a system’s ability to locate relevant facts, supporting the retrieval part of the claim. The paper describes HotpotQA as a test of multi-hop reasoning and information retrieval, but does not establish that it evaluates long-term memory storage. Page numbers were not available in our copy. (LLM, conf=0.82)
Experimental — accuracy not yet measuredPast k = 3, retrieval recall continues to grow but F1 degrades because low-relevance chunks contaminate the averaged state, and the linear composition operates beyond the regime where Theorem 1's exactness argument applies.
“Past k =3 , retrieval recall continues to grow but F1 degrades: low-relevance chunks at lower retrieval ranks contaminate the averaged state, and the linear composition operates beyond the regime where Theorem 1's exactness argument applies.”
From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [34]
Section 5.2 Results (page unavailable) reports lower F1 when moving from the distractor setting to the broader full-wiki setting. It does not report an F1 trend past k=3, continuing growth in retrieval recall, contamination of an averaged state, or a limit to Theorem 1's exactness argument. (LLM, conf=0.79)
Experimental — accuracy not yet measuredAt k = 1, F1 is bounded above by retrieval recall (approximately 65% of gold-supporting paragraphs appear at rank 1), and even when recall is achieved, single-chunk PRECOG cannot integrate the second supporting fact.
“At k =1 , F1 is bounded above by retrieval recall ( ∼ 65% of gold-supporting paragraphs appear at rank 1), and even when recall is achieved, single-chunk PRECOG cannot integrate the second supporting fact.”
From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [34]
Section 4 (Dataset Analysis; page not provided) says most questions require a supporting fact from each of two paragraphs, supporting the general concern about using only one chunk. But the paper does not evaluate PRECOG or report that approximately 65% of gold-supporting paragraphs appear at rank 1. Its Table 5 instead reports retrieval Hits@2 and Hits@10 for its own setting, so it does not establish the claimed F1 bound. (LLM, conf=0.84)
Experimental — accuracy not yet measuredThe empirically optimal k is corpus-dependent: k = 1 for single-paragraph evidence (SQuAD), and k = 2-3 for multi-hop (HotpotQA).
“The empirically optimal k is therefore corpus-dependent: k =1 for single-paragraph evidence (SQuAD), k =2 -3 for multi-hop (HotpotQA).”
From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [34]
The Introduction (page unavailable) describes SQuAD as using a single paragraph, and the Additional information section refers to two gold paragraphs for HotpotQA. These passages support the contrast in evidence structure, but the paper does not establish an empirically optimal k of 1 for SQuAD or 2–3 for HotpotQA; Section 5.2 instead says its model selects 10 candidate paragraphs. (LLM, conf=0.87)
Experimental — accuracy not yet measuredPast benchmarks for information retrieval mostly focus on easily found information and have become saturated by recent language models.
“While past benchmarks have measured the ability to retrieve information (Joshi et al., 2017;Yang et al., 2018;Thorne et al., 2018;Dinan et al., 2019;Fan et al., 2019;Mialon et al., 2023), most of these benchmarks focus on retrieving information that can be found easily, and hence have become saturated by recent language models.”
From BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agents (2025) · cites this paper as Yang et al., 2018
Section 3 (page unavailable) describes HotpotQA as a benchmark that tests locating relevant facts and requires information retrieval, supporting its inclusion among retrieval benchmarks. But it describes that task as challenging, and Section 5.2 (page unavailable) reports substantial retrieval difficulty. The paper does not establish that most such benchmarks involve easily found information or have become saturated by recent language models. (LLM, conf=0.86)
Experimental — accuracy not yet measuredHotpotQA offers multi-hop questions, but they are shallow in depth (2 hops), and the corpus is limited to Wikipedia.
“Although datasets like HotpotQA (Yang et al., 2018) offer multi-hop questions, they are shallow in depth (2 hops), and the corpus is limited to Wikipedia.”
From BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026) · cites this paper as Yang et al., 2018
The Introduction says HotpotQA contains multi-hop questions, and Data Collection says its corpus is the entire English Wikipedia dump. The Generating Candidate Paragraph Pairs section illustrates two-step reasoning, but Dataset Analysis says some questions require more than two supporting facts; the paper does not establish a strict two-hop limit or characterize the questions as shallow. (LLM, conf=0.83)
Experimental — accuracy not yet measuredHotpotQA is a multi-hop question answering dataset that requires reasoning over multiple Wikipedia paragraphs.
“HotpotQA (Yang et al., 2018) is a multi-hop question answering dataset that requires reasoning over multiple Wikipedia paragraphs.”
From Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents (2026) · cites this paper as Yang et al., 2018
Tasks like HotPotQA often benefit more from concise, high-level instructions than from long contexts.
“Tasks like HotPotQA (Yang et al., 2018) often benefit more from concise, high-level instructions ( e.g., how to retrieve and synthesize evidence) than from long contexts.”
From Agentic Context Engineering: Evolving Contexts for Self-Improving Language Models (2025) · cites this paper as Yang et al., 2018
Multi-hop QA benchmarks (HotpotQA, 2WikiMultiHopQA, MuSiQue) and long-document QA such as QuALITY test compositional retrieval and reasoning over a fixed corpus.
“Multi-hop QA benchmarks (HotpotQA [52], 2WikiMultiHopQA [16], MuSiQue [42]) and long-document QA such as QuALITY [33] test compositional retrieval and reasoning over a fixed corpus.”
From MemGym: a Long-Horizon Memory Environment for LLM Agents (2026) · cites this paper as [52]
HotpotQA primarily tests bridge reasoning and comparison reasoning.
“This dataset primarily tests bridge reasoning (connecting entity A to entity B) and comparison reasoning (e.g., 'Who is older, X or Y?').”
From Replace, Don't Expand: Mitigating Context Dilution in Multi-Hop RAG via Fixed-Budget Evidence Assembly (2025) · cites this paper as [29]
SQuAD and HotpotQA are representative of single-hop and multi-hop question answering tasks respectively.
“For QA, we augment SQuAD (Rajpurkar et al., 2018) and HotpotQA (Yang et al., 2018) to simulate long-context scenario. They are representative of single-hop and multi-hop question answering tasks respectively.”
From RULER: What's the Real Context Size of Your Long-Context Language Models? (2024) · cites this paper as Yang et al., 2018
HotpotQA's annotated supporting facts naturally provide structured contextual information for Stage 1 supervision.
“In our experiments, we use HotpotQA for reinforcement learning training, as its annotated supporting facts naturally provide structured contextual information for Stage 1 supervision.”
From Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents (2026) · cites this paper as Yang et al., 2018
BrowseComp-Plus retains the challenging nature of the original BrowseComp while providing a more controlled and transparent experimental setup.
“BrowseComp-Plus retains the challenging nature of the original BrowseComp while providing a more controlled and transparent experimental setup similar to early pivotal evaluation benchmarks like Natural Questions (NQ) (Kwiatkowski et al., 2019) and HotpotQA (Yang et al., 2018).”
From BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026) · cites this paper as Yang et al., 2018
In HotpotQA, only debate brings 3% gain while other topologies fail to improve or even degrade systematic performance.
“It is noticeable that not all topologies are beneficial to MAS design, whereas positively influenced topologies only represent a small fraction of the overall set, such that, in HotpotQA (Yang et al., 2018), only debate brings 3% gain while others fail to improve or even degrade systematic performance.”
From Multi-Agent Design: Optimizing Agents with Better Prompts and Topologies (2025) · cites this paper as Yang et al., 2018
On HotpotQA-distractor, F1 is non-monotonic in k: it peaks at k = 3 and then degrades as k increases further.
“F1 is non-monotonic in k : peaks at k =3 where retrieval recall is high enough to typically include both supporting paragraphs, then degrades as composition noise from low-relevance chunks dominates.”
From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [34]
Section 5.2 reports F1 for the distractor and full-wiki settings and says the full-wiki model uses a fixed 10 retrieved paragraphs. Neither those results nor the distractor ablation in Table 7 tests F1 across values of k. Searches for a peak at k = 3 and for retrieval or composition noise found no passage supporting the claimed trend or explanation. (LLM, conf=0.77)
Experimental — accuracy not yet measuredTopk composition with k = 2-3 recovers most of the multi-hop gap, improving F1 by +7.5 over top-1.
“Topk composition with k =2 -3 recovers most of this multi-hop gap ( +7 . 5 F1 over top-1).”
From Structured Memory for Edge Language Models: Persistent Context and Corpus Retrieval via O(1) SSM State Injection (2026) · cites this paper as [34]
Section 5.2 reports a top-10 paragraph retrieval setup and benchmark F1 scores, but no top-1 versus top-k composition comparison. Searches for “top-k composition” and “7.5 F1” found no passage supporting the claimed gain for k = 2–3. (LLM, conf=0.77)
Experimental — accuracy not yet measured3.7% of questions in SimpleQA Verified are classified as requiring reasoning and 7.3% are multi-step.
“3 . 7% of questions are classified as requiring reasoning and 7 . 3% are multi-step.”
From SimpleQA Verified: A Reliable Factuality Benchmark to Measure Parametric Knowledge (2025) · cites this paper as Yang et al., 2018
Section 4 (Dataset Analysis; page unavailable) reports reasoning categories and percentages for HotpotQA, not SimpleQA Verified. Searches for “3.7%,” “7.3%,” and “SimpleQA Verified” found no passage in our copy supporting the attributed figures. (LLM, conf=0.76)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 20 · Cited by 1,804
Research works printed but not linked: 15
- Christopher Clark and Matt Gardner. 2017. Simple and effective multi-paragraph reading comprehen- sion. In Proceedings of the 55th Annual Meeting of the Association of Computational Linguistics.
- Matthew Dunn, Levent Sagun, Mike Higgins, Ugur Guney, Volkan Cirik, and Kyunghyun Cho. 2017. SearchQA: A new Q&A dataset augmented with context from a search engine. arXiv preprint arXiv:1704.05179. · arXiv
- Xiaodong Liu, Yelong Shen, Kevin Duh, and Jianfeng Gao. 2018. Stochastic answer networks for ma- chine reading comprehension. In Proceedings of the 56th Annual Meeting of the Association for Compu- tational Linguistics.
- Christopher D. Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven J. Bethard, and David Mc- Closky. 2014. The Stanford CoreNLP natural lan- guage processing toolkit. In Association for Compu- tational Linguistics (ACL) System Demonstrations, pages 55-60.
- Alexander H Miller, Will Feng, Adam Fisch, Jiasen Lu, Dhruv Batra, Antoine Bordes, Devi Parikh, and Ja- son Weston. 2017. ParlAI: A dialog research soft- ware platform. arXiv preprint arXiv:1705.06476. · arXiv
- Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng. 2016. MS MARCO: A human generated machine reading comprehension dataset. In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS).
- Jekaterina Novikova, Ondřej Dušek, Amanda Cercas Curry, and Verena Rieser. 2017. Why we need new evaluation metrics for NLG. In Proceedings of the Conference on Empirical Methods in Natural Lan- guage Processing.
- Boyuan Pan, Hao Li, Zhou Zhao, Bin Cao, Deng Cai, and Xiaofei He. 2017. Memen: Multi-layer embed- ding with memory networks for machine compre- hension. arXiv preprint arXiv:1707.09098. · arXiv
- Pranav Rajpurkar, Robin Jia, and Percy Liang. 2018. Know what you don't know: Unanswerable ques- tions for SQuAD. In Proceedings of the 56th An- nual Meeting of the Association for Computational Linguistics.
- Pranav Rajpurkar, Jian Zhang, Konstantin Lopyrev, and Percy Liang. 2016. SQuAD: 100,000+ questions for machine comprehension of text. In Proceedings of the 2016 Conference on Empirical Methods in Nat- ural Language Processing (EMNLP).
- Shimi Salant and Jonathan Berant. 2018. Contextu- alized word representations for reading comprehen- sion. In Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics.
- Minjoon Seo, Aniruddha Kembhavi, Ali Farhadi, and Hannaneh Hajishirzi. 2017. Bidirectional attention flow for machine comprehension. In Proceedings of the International Conference on Learning Represen- tations.
- Wenhui Wang, Nan Yang, Furu Wei, Baobao Chang, and Ming Zhou. 2017. Gated self-matching net- works for reading comprehension and question an- swering. In Proceedings of the 55th Annual Meet- ing of the Association for Computational Linguistics (Volume 1: Long Papers), volume 1, pages 189-198.
- Caiming Xiong, Victor Zhong, and Richard Socher. 2018. DCN+: Mixed objective and deep residual coattention for question answering. In Proceedings of the International Conference on Learning Repre- sentations.
- Zhilin Yang, Saizheng Zhang, Jack Urbanek, Will Feng, Alexander H Miller, Arthur Szlam, Douwe Kiela, and Jason Weston. 2018. Mastering the dun- geon: Grounded language learning by mechanical turker descent. In Proceedings of the International Conference on Learning Representations.
- Authors
- Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W., Salakhutdinov, R., & Manning, C. D.
- Affiliations
- Mila - Quebec Artificial Intelligence Institute (CA)
- Google (United States) (US)
- Venue
- Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
- Published
- 2018
- Pages
- 2369-2380
- OpenAlex
- W2889787757
- Cited by
- 1,804
- References
- 20
- Citations by year
- 2026: 395 · 2025: 286 · 2024: 134 · 2023: 220 · 2022: 222 · 2021: 251 · 2020: 191 · 2019: 103 · 2018: 2
- FWCI
- 55.82
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- Locations
- Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
- Funders
- National Science Foundation (1514268)
- Nvidia
- Université de Montréal
- Defense Advanced Research Projects Agency
- Office of Naval Research (N000141812861)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Keywords
- multi-hop question answering, explainable question answering, question answering dataset, HotpotQA
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review