{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KA5YPFUNOWVGWUBWMQN4VBYZK2","short_pith_number":"pith:KA5YPFUN","schema_version":"1.0","canonical_sha256":"503b87968d75aa6b5036641bca8719569c569db027bb5e20c713b9c91a38aa41","source":{"kind":"arxiv","id":"2011.05435","version":1},"attestation_state":"computed","paper":{"title":"Don't Read Too Much into It: Adaptive Computation for Open-Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Pasquale Minervini, Pontus Stenetorp, Sebastian Riedel, Yuxiang WU","submitted_at":"2020-11-10T22:37:56Z","abstract_excerpt":"Most approaches to Open-Domain Question Answering consist of a light-weight retriever that selects a set of candidate passages, and a computationally expensive reader that examines the passages to identify the correct answer. Previous works have shown that as the number of retrieved passages increases, so does the performance of the reader. However, they assume all retrieved passages are of equal importance and allocate the same amount of computation to them, leading to a substantial increase in computational cost. To reduce this cost, we propose the use of adaptive computation to control the "},"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":"2011.05435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-11-10T22:37:56Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b5780beeacf3e70ff0567ac64b2eb2e5ba614b046f6c30f9a1b0a6ef24397e4e","abstract_canon_sha256":"895a359a222253da19eab17fa0844de16153ccc72db03246ba6b03ff6ba012ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:49.940595Z","signature_b64":"pVoN/7++nRr8n1GjZRXH4rypF1l5hv5nOFgn/8B3QIp9UgHD/OIllPRJZHgdx4r/lFJ4orvPNAINGLzXs4XACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"503b87968d75aa6b5036641bca8719569c569db027bb5e20c713b9c91a38aa41","last_reissued_at":"2026-07-05T01:50:49.940181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:49.940181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Don't Read Too Much into It: Adaptive Computation for Open-Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Pasquale Minervini, Pontus Stenetorp, Sebastian Riedel, Yuxiang WU","submitted_at":"2020-11-10T22:37:56Z","abstract_excerpt":"Most approaches to Open-Domain Question Answering consist of a light-weight retriever that selects a set of candidate passages, and a computationally expensive reader that examines the passages to identify the correct answer. Previous works have shown that as the number of retrieved passages increases, so does the performance of the reader. However, they assume all retrieved passages are of equal importance and allocate the same amount of computation to them, leading to a substantial increase in computational cost. To reduce this cost, we propose the use of adaptive computation to control the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.05435/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":"2011.05435","created_at":"2026-07-05T01:50:49.940235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.05435v1","created_at":"2026-07-05T01:50:49.940235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05435","created_at":"2026-07-05T01:50:49.940235+00:00"},{"alias_kind":"pith_short_12","alias_value":"KA5YPFUNOWVG","created_at":"2026-07-05T01:50:49.940235+00:00"},{"alias_kind":"pith_short_16","alias_value":"KA5YPFUNOWVGWUBW","created_at":"2026-07-05T01:50:49.940235+00:00"},{"alias_kind":"pith_short_8","alias_value":"KA5YPFUN","created_at":"2026-07-05T01:50:49.940235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2","json":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2.json","graph_json":"https://pith.science/api/pith-number/KA5YPFUNOWVGWUBWMQN4VBYZK2/graph.json","events_json":"https://pith.science/api/pith-number/KA5YPFUNOWVGWUBWMQN4VBYZK2/events.json","paper":"https://pith.science/paper/KA5YPFUN"},"agent_actions":{"view_html":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2","download_json":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2.json","view_paper":"https://pith.science/paper/KA5YPFUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.05435&json=true","fetch_graph":"https://pith.science/api/pith-number/KA5YPFUNOWVGWUBWMQN4VBYZK2/graph.json","fetch_events":"https://pith.science/api/pith-number/KA5YPFUNOWVGWUBWMQN4VBYZK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2/action/storage_attestation","attest_author":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2/action/author_attestation","sign_citation":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2/action/citation_signature","submit_replication":"https://pith.science/pith/KA5YPFUNOWVGWUBWMQN4VBYZK2/action/replication_record"}},"created_at":"2026-07-05T01:50:49.940235+00:00","updated_at":"2026-07-05T01:50:49.940235+00:00"}