{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BAQVJBE6CXSDKXATMBOKNHY7ZV","short_pith_number":"pith:BAQVJBE6","canonical_record":{"source":{"id":"1905.07374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-17T17:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"99b9e174ccdf51782e088f23bacb95f190f8529e31d8dd8555e4d56345f1481d","abstract_canon_sha256":"41997ec861e9844359ab7a255f9ce69200b8d864b59c64713a5600a655f75774"},"schema_version":"1.0"},"canonical_sha256":"082154849e15e4355c13605ca69f1fcd4fb9b39c85785d04032eb7d0c58e274f","source":{"kind":"arxiv","id":"1905.07374","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07374","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07374v2","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07374","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"BAQVJBE6CXSD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BAQVJBE6CXSDKXAT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BAQVJBE6","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BAQVJBE6CXSDKXATMBOKNHY7ZV","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-17T17:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"99b9e174ccdf51782e088f23bacb95f190f8529e31d8dd8555e4d56345f1481d","abstract_canon_sha256":"41997ec861e9844359ab7a255f9ce69200b8d864b59c64713a5600a655f75774"},"schema_version":"1.0"},"canonical_sha256":"082154849e15e4355c13605ca69f1fcd4fb9b39c85785d04032eb7d0c58e274f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.786716Z","signature_b64":"ZCOnq09G/PIuwnN3bHjlscdcCdB92E3ZwA5/7dLroZu92Uh8rM4NpS6KNhvzh1iw/yqMZ1VCevmMRbLqi9fYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"082154849e15e4355c13605ca69f1fcd4fb9b39c85785d04032eb7d0c58e274f","last_reissued_at":"2026-05-17T23:44:06.786079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.786079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07374","source_version":2,"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-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NW62njOvARWtpDzgylvCVhATdgZrROW4rQHJh9eM87nXDsOYwAddnjXjuqiAIb8ZLo53jSErKOu2J8bKEzuCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:31:31.043181Z"},"content_sha256":"dd6ed1aac0ca126be4df647b7e190249165594cbcc08886673ac64880673f319","schema_version":"1.0","event_id":"sha256:dd6ed1aac0ca126be4df647b7e190249165594cbcc08886673ac64880673f319"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BAQVJBE6CXSDKXATMBOKNHY7ZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bowen Zhou, Guangtao Wang, Jing Huang, Ming Tu, Xiaodong He, Yun Tang","submitted_at":"2019-05-17T17:03:11Z","abstract_excerpt":"Multi-hop reading comprehension (RC) across documents poses new challenge over single-document RC because it requires reasoning over multiple documents to reach the final answer. In this paper, we propose a new model to tackle the multi-hop RC problem. We introduce a heterogeneous graph with different types of nodes and edges, which is named as Heterogeneous Document-Entity (HDE) graph. The advantage of HDE graph is that it contains different granularity levels of information including candidates, documents and entities in specific document contexts. Our proposed model can do reasoning over th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07374","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"},"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-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"708t1e4eUxg7jZNvfiawZ0BP8HR6t3l5TGyktgmzmz7JaUCDw7ZBg9eQkKPM5egIdyoNme4ERP8ibJuln2BPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:31:31.043549Z"},"content_sha256":"aa9ef37e4a78a213a3394f68f382d7933579112f104aa1fe98406fe6868f81cb","schema_version":"1.0","event_id":"sha256:aa9ef37e4a78a213a3394f68f382d7933579112f104aa1fe98406fe6868f81cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/bundle.json","state_url":"https://pith.science/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/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-05-31T22:31:31Z","links":{"resolver":"https://pith.science/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV","bundle":"https://pith.science/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/bundle.json","state":"https://pith.science/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAQVJBE6CXSDKXATMBOKNHY7ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BAQVJBE6CXSDKXATMBOKNHY7ZV","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":"41997ec861e9844359ab7a255f9ce69200b8d864b59c64713a5600a655f75774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-17T17:03:11Z","title_canon_sha256":"99b9e174ccdf51782e088f23bacb95f190f8529e31d8dd8555e4d56345f1481d"},"schema_version":"1.0","source":{"id":"1905.07374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07374","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07374v2","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07374","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"BAQVJBE6CXSD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BAQVJBE6CXSDKXAT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BAQVJBE6","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:aa9ef37e4a78a213a3394f68f382d7933579112f104aa1fe98406fe6868f81cb","target":"graph","created_at":"2026-05-17T23:44: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"},"paper":{"abstract_excerpt":"Multi-hop reading comprehension (RC) across documents poses new challenge over single-document RC because it requires reasoning over multiple documents to reach the final answer. In this paper, we propose a new model to tackle the multi-hop RC problem. We introduce a heterogeneous graph with different types of nodes and edges, which is named as Heterogeneous Document-Entity (HDE) graph. The advantage of HDE graph is that it contains different granularity levels of information including candidates, documents and entities in specific document contexts. Our proposed model can do reasoning over th","authors_text":"Bowen Zhou, Guangtao Wang, Jing Huang, Ming Tu, Xiaodong He, Yun Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-17T17:03:11Z","title":"Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07374","kind":"arxiv","version":2},"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:dd6ed1aac0ca126be4df647b7e190249165594cbcc08886673ac64880673f319","target":"record","created_at":"2026-05-17T23:44: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":"41997ec861e9844359ab7a255f9ce69200b8d864b59c64713a5600a655f75774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-17T17:03:11Z","title_canon_sha256":"99b9e174ccdf51782e088f23bacb95f190f8529e31d8dd8555e4d56345f1481d"},"schema_version":"1.0","source":{"id":"1905.07374","kind":"arxiv","version":2}},"canonical_sha256":"082154849e15e4355c13605ca69f1fcd4fb9b39c85785d04032eb7d0c58e274f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"082154849e15e4355c13605ca69f1fcd4fb9b39c85785d04032eb7d0c58e274f","first_computed_at":"2026-05-17T23:44:06.786079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.786079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZCOnq09G/PIuwnN3bHjlscdcCdB92E3ZwA5/7dLroZu92Uh8rM4NpS6KNhvzh1iw/yqMZ1VCevmMRbLqi9fYDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.786716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd6ed1aac0ca126be4df647b7e190249165594cbcc08886673ac64880673f319","sha256:aa9ef37e4a78a213a3394f68f382d7933579112f104aa1fe98406fe6868f81cb"],"state_sha256":"bd897095bae1e27581e75a4bd57cc67b8f1b54e2ef908a87438c11cd2787bc18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBqpvOREOSJql4JpXckKvBCigrtklJn+QuxY480LhoKnHxbP61mySvkL0iru/bWSGHPg7rcs1f8lY8DXHhWcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:31:31.046030Z","bundle_sha256":"3695f5d0c6599f9953e6a773cdb141af0af3de9fa25ce7ee2a0000638c6ff88b"}}