{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WYIMZ3IT6DN7UQZDKDMGV5LGAA","short_pith_number":"pith:WYIMZ3IT","schema_version":"1.0","canonical_sha256":"b610cced13f0dbfa432350d86af566001fbabc441fc4837b28cabb84026f3165","source":{"kind":"arxiv","id":"2009.12756","version":2},"attestation_state":"computed","paper":{"title":"Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Barlas O\\u{g}uz, Douwe Kiela, Jingfei Du, Patrick Lewis, Sebastian Riedel, Srini Iyer, Wenhan Xiong, Wen-tau Yih, William Yang Wang, Xiang Lorraine Li, Yashar Mehdad","submitted_at":"2020-09-27T06:12:29Z","abstract_excerpt":"We propose a simple and efficient multi-hop dense retrieval approach for answering complex open-domain questions, which achieves state-of-the-art performance on two multi-hop datasets, HotpotQA and multi-evidence FEVER. Contrary to previous work, our method does not require access to any corpus-specific information, such as inter-document hyperlinks or human-annotated entity markers, and can be applied to any unstructured text corpus. Our system also yields a much better efficiency-accuracy trade-off, matching the best published accuracy on HotpotQA while being 10 times faster at inference tim"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2009.12756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-09-27T06:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"bfbc3bb9c52b4958673afc670e6a31ec8949e54de4f53185e86136ef0e431b17","abstract_canon_sha256":"1ad85afd7712d2a55c8b230a034a1e965dff5c266325c17a5f4cc653a09273ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:49.300821Z","signature_b64":"4tptptlEziqGiRFL3SdNbiFgJF+lJQQMRu4yU7sJ8CKwFlhCojSv2vdMeQ3WT1WBqSzA3uDO49NfCemFAuMZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b610cced13f0dbfa432350d86af566001fbabc441fc4837b28cabb84026f3165","last_reissued_at":"2026-07-05T02:16:49.300309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:49.300309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Barlas O\\u{g}uz, Douwe Kiela, Jingfei Du, Patrick Lewis, Sebastian Riedel, Srini Iyer, Wenhan Xiong, Wen-tau Yih, William Yang Wang, Xiang Lorraine Li, Yashar Mehdad","submitted_at":"2020-09-27T06:12:29Z","abstract_excerpt":"We propose a simple and efficient multi-hop dense retrieval approach for answering complex open-domain questions, which achieves state-of-the-art performance on two multi-hop datasets, HotpotQA and multi-evidence FEVER. Contrary to previous work, our method does not require access to any corpus-specific information, such as inter-document hyperlinks or human-annotated entity markers, and can be applied to any unstructured text corpus. Our system also yields a much better efficiency-accuracy trade-off, matching the best published accuracy on HotpotQA while being 10 times faster at inference tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12756","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.12756/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.12756","created_at":"2026-07-05T02:16:49.300383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.12756v2","created_at":"2026-07-05T02:16:49.300383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12756","created_at":"2026-07-05T02:16:49.300383+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYIMZ3IT6DN7","created_at":"2026-07-05T02:16:49.300383+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYIMZ3IT6DN7UQZD","created_at":"2026-07-05T02:16:49.300383+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYIMZ3IT","created_at":"2026-07-05T02:16:49.300383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05712","citing_title":"Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20844","citing_title":"AtomicRAG: Atom-Entity Graphs for Retrieval-Augmented Generation","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":88,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA","json":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA.json","graph_json":"https://pith.science/api/pith-number/WYIMZ3IT6DN7UQZDKDMGV5LGAA/graph.json","events_json":"https://pith.science/api/pith-number/WYIMZ3IT6DN7UQZDKDMGV5LGAA/events.json","paper":"https://pith.science/paper/WYIMZ3IT"},"agent_actions":{"view_html":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA","download_json":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA.json","view_paper":"https://pith.science/paper/WYIMZ3IT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.12756&json=true","fetch_graph":"https://pith.science/api/pith-number/WYIMZ3IT6DN7UQZDKDMGV5LGAA/graph.json","fetch_events":"https://pith.science/api/pith-number/WYIMZ3IT6DN7UQZDKDMGV5LGAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA/action/storage_attestation","attest_author":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA/action/author_attestation","sign_citation":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA/action/citation_signature","submit_replication":"https://pith.science/pith/WYIMZ3IT6DN7UQZDKDMGV5LGAA/action/replication_record"}},"created_at":"2026-07-05T02:16:49.300383+00:00","updated_at":"2026-07-05T02:16:49.300383+00:00"}