{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2RZYBAUQPJS2DYBWGK7EUW3SNE","short_pith_number":"pith:2RZYBAUQ","schema_version":"1.0","canonical_sha256":"d4738082907a65a1e03632be4a5b726908e391e8b8b8e730fc4133cf9d15a98d","source":{"kind":"arxiv","id":"2010.12527","version":4},"attestation_state":"computed","paper":{"title":"Answering Open-Domain Questions of Varying Reasoning Steps from Text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Haejun Lee, Oghenetegiri \"TG\" Sido, Peng Qi","submitted_at":"2020-10-23T16:51:09Z","abstract_excerpt":"We develop a unified system to answer directly from text open-domain questions that may require a varying number of retrieval steps. We employ a single multi-task transformer model to perform all the necessary subtasks -- retrieving supporting facts, reranking them, and predicting the answer from all retrieved documents -- in an iterative fashion. We avoid crucial assumptions of previous work that do not transfer well to real-world settings, including exploiting knowledge of the fixed number of retrieval steps required to answer each question or using structured metadata like knowledge bases o"},"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":"2010.12527","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-23T16:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"2169390213b5dbe81f0c23faeb718c88b3d0bd137a3fec66c2ee43a6647d3dec","abstract_canon_sha256":"cc183ccb01bbae44f4388e188371ad9267c71760ed2108821bbb2c53ca866e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:57.682863Z","signature_b64":"pbRhsUYVEB1s5tCimib73dzCPKUyJ7/3AwJSCd0mKLtgHZdP+IqV0G8RvY0+UNU+vb0koSi3+1VU2t7dZ4D4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4738082907a65a1e03632be4a5b726908e391e8b8b8e730fc4133cf9d15a98d","last_reissued_at":"2026-07-05T03:26:57.682366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:57.682366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering Open-Domain Questions of Varying Reasoning Steps from Text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Haejun Lee, Oghenetegiri \"TG\" Sido, Peng Qi","submitted_at":"2020-10-23T16:51:09Z","abstract_excerpt":"We develop a unified system to answer directly from text open-domain questions that may require a varying number of retrieval steps. We employ a single multi-task transformer model to perform all the necessary subtasks -- retrieving supporting facts, reranking them, and predicting the answer from all retrieved documents -- in an iterative fashion. We avoid crucial assumptions of previous work that do not transfer well to real-world settings, including exploiting knowledge of the fixed number of retrieval steps required to answer each question or using structured metadata like knowledge bases o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12527","kind":"arxiv","version":4},"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/2010.12527/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":"2010.12527","created_at":"2026-07-05T03:26:57.682427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.12527v4","created_at":"2026-07-05T03:26:57.682427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12527","created_at":"2026-07-05T03:26:57.682427+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RZYBAUQPJS2","created_at":"2026-07-05T03:26:57.682427+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RZYBAUQPJS2DYBW","created_at":"2026-07-05T03:26:57.682427+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RZYBAUQ","created_at":"2026-07-05T03:26:57.682427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.03714","citing_title":"DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE","json":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE.json","graph_json":"https://pith.science/api/pith-number/2RZYBAUQPJS2DYBWGK7EUW3SNE/graph.json","events_json":"https://pith.science/api/pith-number/2RZYBAUQPJS2DYBWGK7EUW3SNE/events.json","paper":"https://pith.science/paper/2RZYBAUQ"},"agent_actions":{"view_html":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE","download_json":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE.json","view_paper":"https://pith.science/paper/2RZYBAUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.12527&json=true","fetch_graph":"https://pith.science/api/pith-number/2RZYBAUQPJS2DYBWGK7EUW3SNE/graph.json","fetch_events":"https://pith.science/api/pith-number/2RZYBAUQPJS2DYBWGK7EUW3SNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE/action/storage_attestation","attest_author":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE/action/author_attestation","sign_citation":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE/action/citation_signature","submit_replication":"https://pith.science/pith/2RZYBAUQPJS2DYBWGK7EUW3SNE/action/replication_record"}},"created_at":"2026-07-05T03:26:57.682427+00:00","updated_at":"2026-07-05T03:26:57.682427+00:00"}