{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OKZYOZFQOEUYGPNBGIBIDTLIZZ","short_pith_number":"pith:OKZYOZFQ","canonical_record":{"source":{"id":"2203.09073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-17T04:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a153408987700089ba2557ebc34f65b140f7d055d6e52ca91a9d1251498fc92","abstract_canon_sha256":"64ee6cf031de97a1a74bebf4261f8f534fe7bfa32d6913c8706868ce219041c8"},"schema_version":"1.0"},"canonical_sha256":"72b38764b07129833da1320281cd68ce54223574e89f5199e9be260a99a49f4f","source":{"kind":"arxiv","id":"2203.09073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.09073","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2203.09073v1","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.09073","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"OKZYOZFQOEUY","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"OKZYOZFQOEUYGPNB","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"OKZYOZFQ","created_at":"2026-07-05T04:06:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OKZYOZFQOEUYGPNBGIBIDTLIZZ","target":"record","payload":{"canonical_record":{"source":{"id":"2203.09073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-17T04:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a153408987700089ba2557ebc34f65b140f7d055d6e52ca91a9d1251498fc92","abstract_canon_sha256":"64ee6cf031de97a1a74bebf4261f8f534fe7bfa32d6913c8706868ce219041c8"},"schema_version":"1.0"},"canonical_sha256":"72b38764b07129833da1320281cd68ce54223574e89f5199e9be260a99a49f4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:06.958304Z","signature_b64":"YBho9QyWsL1naO8BSOsDXgVi3uQaFf1UaBPLk6vGdVZPRJOuaSH/pjCqBNX5hrCt0CbKtowWTBges5REAXcyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72b38764b07129833da1320281cd68ce54223574e89f5199e9be260a99a49f4f","last_reissued_at":"2026-07-05T04:06:06.957920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:06.957920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.09073","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnx9wqth+LroTYg+zlCTdvtTNeWZtMkKAkDC1UiEzJAm3Y758+4PbzsoKsMCUxDEPlXp9+gln+KjJ338Ui1zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:54:11.049457Z"},"content_sha256":"e091bf055cd7514b9f8c68c1184f29e631522217ccfec1f673a120fdc9d00ce9","schema_version":"1.0","event_id":"sha256:e091bf055cd7514b9f8c68c1184f29e631522217ccfec1f673a120fdc9d00ce9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OKZYOZFQOEUYGPNBGIBIDTLIZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ask to Understand: Question Generation for Multi-hop Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiawei Li, Mucheng Ren, Yang Gao, Yizhe Yang","submitted_at":"2022-03-17T04:02:29Z","abstract_excerpt":"Multi-hop Question Answering (QA) requires the machine to answer complex questions by finding scattering clues and reasoning from multiple documents. Graph Network (GN) and Question Decomposition (QD) are two common approaches at present. The former uses the \"black-box\" reasoning process to capture the potential relationship between entities and sentences, thus achieving good performance. At the same time, the latter provides a clear reasoning logical route by decomposing multi-hop questions into simple single-hop sub-questions. In this paper, we propose a novel method to complete multi-hop QA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.09073","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/2203.09073/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmPAnmWVhpVwN/wt5XqTIQYOc0I3spz+7ZTiCHuUnOCAUPA8rtq703evnmggfJ6NH0i2u3oKAtzv2w+Y6x7pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:54:11.050009Z"},"content_sha256":"6e99e5fc59b173ea7700ed055f87ffeb0826fa9c47781c6d689c820d413f76cb","schema_version":"1.0","event_id":"sha256:6e99e5fc59b173ea7700ed055f87ffeb0826fa9c47781c6d689c820d413f76cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/bundle.json","state_url":"https://pith.science/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T19:54:11Z","links":{"resolver":"https://pith.science/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ","bundle":"https://pith.science/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/bundle.json","state":"https://pith.science/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKZYOZFQOEUYGPNBGIBIDTLIZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OKZYOZFQOEUYGPNBGIBIDTLIZZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64ee6cf031de97a1a74bebf4261f8f534fe7bfa32d6913c8706868ce219041c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-17T04:02:29Z","title_canon_sha256":"5a153408987700089ba2557ebc34f65b140f7d055d6e52ca91a9d1251498fc92"},"schema_version":"1.0","source":{"id":"2203.09073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.09073","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2203.09073v1","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.09073","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"OKZYOZFQOEUY","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"OKZYOZFQOEUYGPNB","created_at":"2026-07-05T04:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"OKZYOZFQ","created_at":"2026-07-05T04:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:6e99e5fc59b173ea7700ed055f87ffeb0826fa9c47781c6d689c820d413f76cb","target":"graph","created_at":"2026-07-05T04:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.09073/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-hop Question Answering (QA) requires the machine to answer complex questions by finding scattering clues and reasoning from multiple documents. Graph Network (GN) and Question Decomposition (QD) are two common approaches at present. The former uses the \"black-box\" reasoning process to capture the potential relationship between entities and sentences, thus achieving good performance. At the same time, the latter provides a clear reasoning logical route by decomposing multi-hop questions into simple single-hop sub-questions. In this paper, we propose a novel method to complete multi-hop QA","authors_text":"Jiawei Li, Mucheng Ren, Yang Gao, Yizhe Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-17T04:02:29Z","title":"Ask to Understand: Question Generation for Multi-hop Question Answering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.09073","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e091bf055cd7514b9f8c68c1184f29e631522217ccfec1f673a120fdc9d00ce9","target":"record","created_at":"2026-07-05T04:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64ee6cf031de97a1a74bebf4261f8f534fe7bfa32d6913c8706868ce219041c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-17T04:02:29Z","title_canon_sha256":"5a153408987700089ba2557ebc34f65b140f7d055d6e52ca91a9d1251498fc92"},"schema_version":"1.0","source":{"id":"2203.09073","kind":"arxiv","version":1}},"canonical_sha256":"72b38764b07129833da1320281cd68ce54223574e89f5199e9be260a99a49f4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72b38764b07129833da1320281cd68ce54223574e89f5199e9be260a99a49f4f","first_computed_at":"2026-07-05T04:06:06.957920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:06.957920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YBho9QyWsL1naO8BSOsDXgVi3uQaFf1UaBPLk6vGdVZPRJOuaSH/pjCqBNX5hrCt0CbKtowWTBges5REAXcyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:06.958304Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.09073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e091bf055cd7514b9f8c68c1184f29e631522217ccfec1f673a120fdc9d00ce9","sha256:6e99e5fc59b173ea7700ed055f87ffeb0826fa9c47781c6d689c820d413f76cb"],"state_sha256":"d436613469cb57557f927d44f8d418bc7946460db3a5a4b188cf16517aad706c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSow5r2/oCCD0j3ufa9u3JOVPLQHwNXHV6yade5rY8mM129881tugSRh554auA0f2OzSyKX4ik5HJslVZZ6+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:54:11.054091Z","bundle_sha256":"9c03134b5e1fc412d12d79fbe8eae2e4750a7c654365309877cb248387613d2e"}}