{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z4WR5XUW5ANUFVSORQKVWWEES5","short_pith_number":"pith:Z4WR5XUW","canonical_record":{"source":{"id":"1905.06933","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-16T17:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"6f4d20226d49ead47adfd7b3985b413113701a0c22e8f8d2ddb421f035fb8b0f","abstract_canon_sha256":"6b69d1eae08ef4f0c0cc1deaf33e9bbb534c3d6c04bb1853828fd95adcd5d02a"},"schema_version":"1.0"},"canonical_sha256":"cf2d1ede96e81b42d64e8c155b5884974784801790eaca0573ffc636957122d0","source":{"kind":"arxiv","id":"1905.06933","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06933","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06933v3","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06933","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"Z4WR5XUW5ANU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z4WR5XUW5ANUFVSO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z4WR5XUW","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z4WR5XUW5ANUFVSORQKVWWEES5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06933","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-16T17:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"6f4d20226d49ead47adfd7b3985b413113701a0c22e8f8d2ddb421f035fb8b0f","abstract_canon_sha256":"6b69d1eae08ef4f0c0cc1deaf33e9bbb534c3d6c04bb1853828fd95adcd5d02a"},"schema_version":"1.0"},"canonical_sha256":"cf2d1ede96e81b42d64e8c155b5884974784801790eaca0573ffc636957122d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:02.117775Z","signature_b64":"CGEhM8v5SbYhiiEfHz/wvdtgZK73wqQQuepcX35ztT8xfylk3owMaKYBFd4tpUlbLswNBOn6H2P5YQu2oCQABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf2d1ede96e81b42d64e8c155b5884974784801790eaca0573ffc636957122d0","last_reissued_at":"2026-05-17T23:44:02.117282Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:02.117282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06933","source_version":3,"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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+tbvvXb5YpSBpsy80bK6ugNuApfbjAgUl7ZxtvopjYSFdIvv6F0+Lop3Olgp6wiodzBwp3rnFmOnAju6ESuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:09.471943Z"},"content_sha256":"2dbb6d23378bce40c0149141a4ef47e2119ac47fd24a1f6bd196ceec124bcc63","schema_version":"1.0","event_id":"sha256:2dbb6d23378bce40c0149141a4ef47e2119ac47fd24a1f6bd196ceec124bcc63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z4WR5XUW5ANUFVSORQKVWWEES5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamically Fused Graph Network for Multi-hop Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Zhou, Lei Li, Lin Qiu, Weinan Zhang, Yanru Qu, Yong Yu, Yunxuan Xiao","submitted_at":"2019-05-16T17:51:44Z","abstract_excerpt":"Text-based question answering (TBQA) has been studied extensively in recent years. Most existing approaches focus on finding the answer to a question within a single paragraph. However, many difficult questions require multiple supporting evidence from scattered text among two or more documents. In this paper, we propose Dynamically Fused Graph Network(DFGN), a novel method to answer those questions requiring multiple scattered evidence and reasoning over them. Inspired by human's step-by-step reasoning behavior, DFGN includes a dynamic fusion layer that starts from the entities mentioned in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06933","kind":"arxiv","version":3},"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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/SqWn/LY+m8m1zOXWUTrLsWoDiJ1QKfrs/KtNv1dLo5PAYiDz32APRmJ7uFemjZDozcThf5CWpMWBHGzh+xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:09.472536Z"},"content_sha256":"c9dad51470adffb5ffc24a1a2a5306f3d10b233323d2cfcdcfaf3df35ad3f1be","schema_version":"1.0","event_id":"sha256:c9dad51470adffb5ffc24a1a2a5306f3d10b233323d2cfcdcfaf3df35ad3f1be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/bundle.json","state_url":"https://pith.science/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/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-06-06T19:30:09Z","links":{"resolver":"https://pith.science/pith/Z4WR5XUW5ANUFVSORQKVWWEES5","bundle":"https://pith.science/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/bundle.json","state":"https://pith.science/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4WR5XUW5ANUFVSORQKVWWEES5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z4WR5XUW5ANUFVSORQKVWWEES5","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":"6b69d1eae08ef4f0c0cc1deaf33e9bbb534c3d6c04bb1853828fd95adcd5d02a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-16T17:51:44Z","title_canon_sha256":"6f4d20226d49ead47adfd7b3985b413113701a0c22e8f8d2ddb421f035fb8b0f"},"schema_version":"1.0","source":{"id":"1905.06933","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06933","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06933v3","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06933","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"Z4WR5XUW5ANU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z4WR5XUW5ANUFVSO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z4WR5XUW","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c9dad51470adffb5ffc24a1a2a5306f3d10b233323d2cfcdcfaf3df35ad3f1be","target":"graph","created_at":"2026-05-17T23:44:02Z","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":"Text-based question answering (TBQA) has been studied extensively in recent years. Most existing approaches focus on finding the answer to a question within a single paragraph. However, many difficult questions require multiple supporting evidence from scattered text among two or more documents. In this paper, we propose Dynamically Fused Graph Network(DFGN), a novel method to answer those questions requiring multiple scattered evidence and reasoning over them. Inspired by human's step-by-step reasoning behavior, DFGN includes a dynamic fusion layer that starts from the entities mentioned in t","authors_text":"Hao Zhou, Lei Li, Lin Qiu, Weinan Zhang, Yanru Qu, Yong Yu, Yunxuan Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-16T17:51:44Z","title":"Dynamically Fused Graph Network for Multi-hop Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06933","kind":"arxiv","version":3},"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:2dbb6d23378bce40c0149141a4ef47e2119ac47fd24a1f6bd196ceec124bcc63","target":"record","created_at":"2026-05-17T23:44:02Z","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":"6b69d1eae08ef4f0c0cc1deaf33e9bbb534c3d6c04bb1853828fd95adcd5d02a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-16T17:51:44Z","title_canon_sha256":"6f4d20226d49ead47adfd7b3985b413113701a0c22e8f8d2ddb421f035fb8b0f"},"schema_version":"1.0","source":{"id":"1905.06933","kind":"arxiv","version":3}},"canonical_sha256":"cf2d1ede96e81b42d64e8c155b5884974784801790eaca0573ffc636957122d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf2d1ede96e81b42d64e8c155b5884974784801790eaca0573ffc636957122d0","first_computed_at":"2026-05-17T23:44:02.117282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:02.117282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGEhM8v5SbYhiiEfHz/wvdtgZK73wqQQuepcX35ztT8xfylk3owMaKYBFd4tpUlbLswNBOn6H2P5YQu2oCQABw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:02.117775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06933","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dbb6d23378bce40c0149141a4ef47e2119ac47fd24a1f6bd196ceec124bcc63","sha256:c9dad51470adffb5ffc24a1a2a5306f3d10b233323d2cfcdcfaf3df35ad3f1be"],"state_sha256":"c541f87499ea1964eea51f6e1c7dae9ce18630e886551ceeae0b29e2d3378575"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/SuK3Xepnsk99gkpvnHlVBczTISeyaGRL8s1oM9XfaemHvbfj+cx37sHt9a2H9thDSmvKUKE7w6dKPi5iXYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:30:09.475831Z","bundle_sha256":"dc4997c3fbcf0ff1f5cd02974a98bb59c29b80a2c0db764335d7aef449abece9"}}