{"url":"/task/multi-hop-reading-comprehension","name":"Multi-Hop Reading Comprehension","slug":"multi-hop-reading-comprehension","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":19,"papers_with_code":9,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/medhop","name":"MedHop","full_name":"MedHop","num_papers_in_archive":14},{"url":"/dataset/simran-arora","name":"ConcurrentQA Benchmark","full_name":"","num_papers_in_archive":3},{"url":"/dataset/codequeries","name":"CodeQueries","full_name":"","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[{"url":"/task/reading-comprehension","name":"Reading Comprehension"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":9,"of":9,"tagged_in_all":19,"items":[{"url":"/paper/multi-hop-reading-comprehension-through","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","date":"2019-06-07","arxiv_id":"1906.02916","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","repositories_listed":2,"syntology":{"n":9,"n_ran":5,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/how-well-do-multi-hop-reading-comprehension-1","title":"How Well Do Multi-hop Reading Comprehension Models Understand Date Information?","date":"2022-10-11","arxiv_id":"2210.05208","repositories_listed":1,"syntology":null},{"url":"/paper/summarize-then-answer-generating-concise","title":"Summarize-then-Answer: Generating Concise Explanations for Multi-hop Reading Comprehension","date":"2021-09-14","arxiv_id":"2109.06853","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_unverified":3,"n_pointer_only":4}},{"url":"/paper/select-answer-and-explain-interpretable-multi","title":"Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documents","date":"2019-11-01","arxiv_id":"1911.00484","repositories_listed":1,"syntology":{"n":15,"n_ran":0,"n_unverified":15,"n_pointer_only":0}},{"url":"/paper/explore-propose-and-assemble-an-interpretable","title":"Explore, Propose, and Assemble: An Interpretable Model for Multi-Hop Reading Comprehension","date":"2019-06-12","arxiv_id":"1906.05210","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/compositional-questions-do-not-necessitate","title":"Compositional Questions Do Not Necessitate Multi-hop Reasoning","date":"2019-06-07","arxiv_id":"1906.02900","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/multi-hop-reading-comprehension-via-deep","title":"Multi-hop Reading Comprehension via Deep Reinforcement Learning based Document Traversal","date":"2019-05-23","arxiv_id":"1905.09438","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-explicit-paths-for-multi-hop","title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension","date":"2018-11-02","arxiv_id":"1811.01127","repositories_listed":1,"syntology":null}],"syntology_records":6,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}