{"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/papers/ran/1","list_of":"/dataset/hotpotqa","dataset":"HotpotQA","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,12],"of":12,"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"},"first_page":"/dataset/hotpotqa/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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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/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-09-28T10:30:06+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-09-28T10:30:06+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/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-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":["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-09-28T10:30:06+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-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-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":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/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-09-28T10:30:06+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-09-28T10:30:06+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-09-28T10:30:06+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"}}}}],"record_sha256":"cdb12b2017556a1ae94d37a1068b013ac79e5dae0ee359fbb8e08d000bd976ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}