{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YE2C2Q3KRBYQGXZ6MR3JAWPUYF","short_pith_number":"pith:YE2C2Q3K","schema_version":"1.0","canonical_sha256":"c1342d436a8871035f3e64769059f4c15b6ac559291250dbcc0520aef0f5ffcb","source":{"kind":"arxiv","id":"1808.06528","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Document Retrieval for Deep Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bernhard Kratzwald, Stefan Feuerriegel","submitted_at":"2018-08-20T15:53:32Z","abstract_excerpt":"State-of-the-art systems in deep question answering proceed as follows: (1) an initial document retrieval selects relevant documents, which (2) are then processed by a neural network in order to extract the final answer. Yet the exact interplay between both components is poorly understood, especially concerning the number of candidate documents that should be retrieved. We show that choosing a static number of documents -- as used in prior research -- suffers from a noise-information trade-off and yields suboptimal results. As a remedy, we propose an adaptive document retrieval model. This lea"},"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":"1808.06528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-20T15:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"3e4b063590253e43dc958a2f5d453a25d01d869f4f33da5714c21d49c62eeaf1","abstract_canon_sha256":"e6d50bea5245649fe091dbbe926e7b1c18873296e9df245aa8ad89f85901dbfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:44.581475Z","signature_b64":"flWwnn+LQgv5jf1chSUXYZnOq6vOGIxl6g7znsXYWJacj2ntJ68IbM5Cg+Q4T78bU20navYCxDZANckFVQtzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1342d436a8871035f3e64769059f4c15b6ac559291250dbcc0520aef0f5ffcb","last_reissued_at":"2026-05-18T00:07:44.580863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:44.580863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Document Retrieval for Deep Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bernhard Kratzwald, Stefan Feuerriegel","submitted_at":"2018-08-20T15:53:32Z","abstract_excerpt":"State-of-the-art systems in deep question answering proceed as follows: (1) an initial document retrieval selects relevant documents, which (2) are then processed by a neural network in order to extract the final answer. Yet the exact interplay between both components is poorly understood, especially concerning the number of candidate documents that should be retrieved. We show that choosing a static number of documents -- as used in prior research -- suffers from a noise-information trade-off and yields suboptimal results. As a remedy, we propose an adaptive document retrieval model. This lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06528","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":"1808.06528","created_at":"2026-05-18T00:07:44.580970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06528v1","created_at":"2026-05-18T00:07:44.580970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06528","created_at":"2026-05-18T00:07:44.580970+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE2C2Q3KRBYQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE2C2Q3KRBYQGXZ6","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE2C2Q3K","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04069","citing_title":"Beyond Independent Passages: Adaptive Passage Combination Retrieval for Retrieval Augmented Open-Domain Question Answering","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF","json":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF.json","graph_json":"https://pith.science/api/pith-number/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/graph.json","events_json":"https://pith.science/api/pith-number/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/events.json","paper":"https://pith.science/paper/YE2C2Q3K"},"agent_actions":{"view_html":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF","download_json":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF.json","view_paper":"https://pith.science/paper/YE2C2Q3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06528&json=true","fetch_graph":"https://pith.science/api/pith-number/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/graph.json","fetch_events":"https://pith.science/api/pith-number/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/action/storage_attestation","attest_author":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/action/author_attestation","sign_citation":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/action/citation_signature","submit_replication":"https://pith.science/pith/YE2C2Q3KRBYQGXZ6MR3JAWPUYF/action/replication_record"}},"created_at":"2026-05-18T00:07:44.580970+00:00","updated_at":"2026-05-18T00:07:44.580970+00:00"}