{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YPYBG4BVQKRBZJVB6HQXRBYXCF","short_pith_number":"pith:YPYBG4BV","schema_version":"1.0","canonical_sha256":"c3f013703582a21ca6a1f1e17887171141057d1b91ae6c60fe70318eb9257a8a","source":{"kind":"arxiv","id":"1905.05733","version":1},"attestation_state":"computed","paper":{"title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Manzil Zaheer, Rajarshi Das, Shehzaad Dhuliawala","submitted_at":"2019-05-14T17:27:08Z","abstract_excerpt":"This paper introduces a new framework for open-domain question answering in which the retriever and the reader iteratively interact with each other. The framework is agnostic to the architecture of the machine reading model, only requiring access to the token-level hidden representations of the reader. The retriever uses fast nearest neighbor search to scale to corpora containing millions of paragraphs. A gated recurrent unit updates the query at each step conditioned on the state of the reader and the reformulated query is used to re-rank the paragraphs by the retriever. We conduct analysis a"},"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":"1905.05733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-14T17:27:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5cc07590a7e7d88050d78282eb43bb180f7bc957bd49f96c7893be21a8e486e3","abstract_canon_sha256":"476b51dc513dd1446920f64694db412d36a8e6ff8f0f4a428b535fc630584bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:13.697336Z","signature_b64":"XaFopOlvW7zWf4avZKH7ogOBxkj4oX/nb6/j1Sud/+0/bIqlEEWxDgBvogLBD6y/x4Fs0oI8hnOnSz9nG1EIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f013703582a21ca6a1f1e17887171141057d1b91ae6c60fe70318eb9257a8a","last_reissued_at":"2026-05-17T23:46:13.696847Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:13.696847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Manzil Zaheer, Rajarshi Das, Shehzaad Dhuliawala","submitted_at":"2019-05-14T17:27:08Z","abstract_excerpt":"This paper introduces a new framework for open-domain question answering in which the retriever and the reader iteratively interact with each other. The framework is agnostic to the architecture of the machine reading model, only requiring access to the token-level hidden representations of the reader. The retriever uses fast nearest neighbor search to scale to corpora containing millions of paragraphs. A gated recurrent unit updates the query at each step conditioned on the state of the reader and the reformulated query is used to re-rank the paragraphs by the retriever. We conduct analysis a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05733","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1905.05733","created_at":"2026-05-17T23:46:13.696920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05733v1","created_at":"2026-05-17T23:46:13.696920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05733","created_at":"2026-05-17T23:46:13.696920+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPYBG4BVQKRB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPYBG4BVQKRBZJVB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPYBG4BV","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16117","citing_title":"SGR: A Stepwise Reasoning Framework for LLMs with External Subgraph Generation","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF","json":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF.json","graph_json":"https://pith.science/api/pith-number/YPYBG4BVQKRBZJVB6HQXRBYXCF/graph.json","events_json":"https://pith.science/api/pith-number/YPYBG4BVQKRBZJVB6HQXRBYXCF/events.json","paper":"https://pith.science/paper/YPYBG4BV"},"agent_actions":{"view_html":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF","download_json":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF.json","view_paper":"https://pith.science/paper/YPYBG4BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05733&json=true","fetch_graph":"https://pith.science/api/pith-number/YPYBG4BVQKRBZJVB6HQXRBYXCF/graph.json","fetch_events":"https://pith.science/api/pith-number/YPYBG4BVQKRBZJVB6HQXRBYXCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF/action/storage_attestation","attest_author":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF/action/author_attestation","sign_citation":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF/action/citation_signature","submit_replication":"https://pith.science/pith/YPYBG4BVQKRBZJVB6HQXRBYXCF/action/replication_record"}},"created_at":"2026-05-17T23:46:13.696920+00:00","updated_at":"2026-05-17T23:46:13.696920+00:00"}