---
title: "Who cites Answering Complex — 56 citing papers"
description: "56 papers of the Elamur Research library cite «Answering Complex Open-domain Questions Through Iterative Query Generation», found in their…"
canonical: "https://research.elamur.ai/free/en/papers/qi-2019-answering-complex-open-domain-questions/cited-by/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/qi-2019-answering-complex-open-domain-questions/cited-by/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [Answering Complex Open-domain Questions Through…](https://md.research.elamur.ai/free/en/papers/qi-2019-answering-complex-open-domain-questions/) / cited by

# Who cites «Answering Complex Open-domain Questions Through Iterative Query Generation»

56 papers of our library cite it (of the 141,840 whose bibliographies we read) · 7 with a page here, the most cited first · [← back to «Answering Complex Open-domain Questions Through Iterative Query Generation»](https://md.research.elamur.ai/free/en/papers/qi-2019-answering-complex-open-domain-questions/)

1. [**Learning to Retrieve Reasoning Paths over Wikipedia Graph for Question Answering arXiv:1911.10470**Akari Asai, Kazuma Hashimoto, Hannaneh Hajishirzi, et al.*2019 · 272 citations*](https://md.research.elamur.ai/free/en/papers/asai-2019-learning-retrieve-reasoning-paths-over/)
2. [**DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines arXiv:2310.03714**Omar Khattab, Arnav Singhvi, Paridhi Maheshwari, et al.*2023 · 261 citations*](https://md.research.elamur.ai/free/en/papers/khattab-2023-dspy-compiling-declarative-language-model/) **[Hierarchical Graph Network for Multi-hop Question Answering](https://md.research.elamur.ai/free/en/papers/fang-2020-hierarchical-graph-network-multi-hop/) [Conference on Empirical Methods in Natural Language Processing (EMNLP)](https://md.research.elamur.ai/free/en/venues/emnlp/)**Yuwei Fang, Siqi Sun, Zhe Gan, et al.*2020 · 241 citations* **[HoVer: A Dataset for Many-Hop Fact Extraction And Claim Verification](https://md.research.elamur.ai/free/en/papers/jiang-2020-hover-dataset-many-hop-fact/) [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/)**Yichen Jiang, Shikha Bordia, Zheng Zhong, et al.*2020 · 221 citations* **[Break It Down: A Question Understanding Benchmark](https://md.research.elamur.ai/free/en/papers/wolfson-2020-break-it-down-question-understanding/) [Transactions of the Association for Computational Linguistics (TACL)](https://md.research.elamur.ai/free/en/venues/tacl/)**Tomer Wolfson, Mor Geva, Ankit Gupta, et al.*2020 · 218 citations* **[Complex Claim Verification with Evidence Retrieved in the Wild](https://md.research.elamur.ai/free/en/papers/chen-2024-complex-claim-verification-evidence-retrieved/) [Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)](https://md.research.elamur.ai/free/en/venues/naacl/)**Jifan Chen, Grace Kim, Aniruddh Sriram, et al.*2024 · 84 citations*

49 more papers of our library cite it; they have no page here yet.

- [← back to](https://md.research.elamur.ai/free/en/papers/qi-2019-answering-complex-open-domain-questions/) — Answering Complex Open-domain Questions Through Iterative Query Generation