{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M66SIQMVSXUOUITQUEPCBYS4HX","short_pith_number":"pith:M66SIQMV","schema_version":"1.0","canonical_sha256":"67bd24419595e8ea2270a11e20e25c3dde36660bfc3586a896889952dbe69f97","source":{"kind":"arxiv","id":"1906.02916","version":2},"attestation_state":"computed","paper":{"title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hannaneh Hajishirzi, Luke Zettlemoyer, Sewon Min, Victor Zhong","submitted_at":"2019-06-07T06:22:17Z","abstract_excerpt":"Multi-hop Reading Comprehension (RC) requires reasoning and aggregation across several paragraphs. We propose a system for multi-hop RC that decomposes a compositional question into simpler sub-questions that can be answered by off-the-shelf single-hop RC models. Since annotations for such decomposition are expensive, we recast sub-question generation as a span prediction problem and show that our method, trained using only 400 labeled examples, generates sub-questions that are as effective as human-authored sub-questions. We also introduce a new global rescoring approach that considers each d"},"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":"1906.02916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-07T06:22:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2b26b72671cef90f799d43aebf3f8b64da34314fb990afd6fcb768a334f78e06","abstract_canon_sha256":"82eaa0f70679c463663b2d770b3dfb49dc2cc60aa9b80cddd9c8c3515ea2d574"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.874060Z","signature_b64":"B0V0At0ZIKUDzIeUjZgZ/xRBmT0J3S3qQhMvmTjnt7oZqsJm8zQdYyJ4vjujpGrFvoganqz2FfWWr5PGsmr8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67bd24419595e8ea2270a11e20e25c3dde36660bfc3586a896889952dbe69f97","last_reissued_at":"2026-05-17T23:41:52.873545Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.873545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hannaneh Hajishirzi, Luke Zettlemoyer, Sewon Min, Victor Zhong","submitted_at":"2019-06-07T06:22:17Z","abstract_excerpt":"Multi-hop Reading Comprehension (RC) requires reasoning and aggregation across several paragraphs. We propose a system for multi-hop RC that decomposes a compositional question into simpler sub-questions that can be answered by off-the-shelf single-hop RC models. Since annotations for such decomposition are expensive, we recast sub-question generation as a span prediction problem and show that our method, trained using only 400 labeled examples, generates sub-questions that are as effective as human-authored sub-questions. We also introduce a new global rescoring approach that considers each d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02916","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":""},"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":"1906.02916","created_at":"2026-05-17T23:41:52.873630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.02916v2","created_at":"2026-05-17T23:41:52.873630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02916","created_at":"2026-05-17T23:41:52.873630+00:00"},{"alias_kind":"pith_short_12","alias_value":"M66SIQMVSXUO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"M66SIQMVSXUOUITQ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"M66SIQMV","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX","json":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX.json","graph_json":"https://pith.science/api/pith-number/M66SIQMVSXUOUITQUEPCBYS4HX/graph.json","events_json":"https://pith.science/api/pith-number/M66SIQMVSXUOUITQUEPCBYS4HX/events.json","paper":"https://pith.science/paper/M66SIQMV"},"agent_actions":{"view_html":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX","download_json":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX.json","view_paper":"https://pith.science/paper/M66SIQMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.02916&json=true","fetch_graph":"https://pith.science/api/pith-number/M66SIQMVSXUOUITQUEPCBYS4HX/graph.json","fetch_events":"https://pith.science/api/pith-number/M66SIQMVSXUOUITQUEPCBYS4HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX/action/storage_attestation","attest_author":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX/action/author_attestation","sign_citation":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX/action/citation_signature","submit_replication":"https://pith.science/pith/M66SIQMVSXUOUITQUEPCBYS4HX/action/replication_record"}},"created_at":"2026-05-17T23:41:52.873630+00:00","updated_at":"2026-05-17T23:41:52.873630+00:00"}