{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:37MGYVFFVFUGNR3AJ4N4HHZABE","short_pith_number":"pith:37MGYVFF","canonical_record":{"source":{"id":"2010.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T10:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"736d052edd10e774d4ec580559cc31ecf379f4dce99f643ddd74be30b5ab3b2f","abstract_canon_sha256":"9fc929949aaeaba4004d51574425e48c4051008afd934827f445fd3eb8be46e3"},"schema_version":"1.0"},"canonical_sha256":"dfd86c54a5a96866c7604f1bc39f2009216c5c2e68003275f9a2aacd1937a7a4","source":{"kind":"arxiv","id":"2010.01899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01899","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01899v1","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01899","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"37MGYVFFVFUG","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_16","alias_value":"37MGYVFFVFUGNR3A","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_8","alias_value":"37MGYVFF","created_at":"2026-07-05T01:40:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:37MGYVFFVFUGNR3AJ4N4HHZABE","target":"record","payload":{"canonical_record":{"source":{"id":"2010.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T10:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"736d052edd10e774d4ec580559cc31ecf379f4dce99f643ddd74be30b5ab3b2f","abstract_canon_sha256":"9fc929949aaeaba4004d51574425e48c4051008afd934827f445fd3eb8be46e3"},"schema_version":"1.0"},"canonical_sha256":"dfd86c54a5a96866c7604f1bc39f2009216c5c2e68003275f9a2aacd1937a7a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:10.619414Z","signature_b64":"b+iLI1ocGQx4ZaCeontEeZFSHJjed8xF3+GfsjQIn2Iydr8Ath729xMRavPkDFDILobyWTwi0zWz5Xs8U8SVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd86c54a5a96866c7604f1bc39f2009216c5c2e68003275f9a2aacd1937a7a4","last_reissued_at":"2026-07-05T01:40:10.618963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:10.618963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.01899","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-05T01:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5RfgCuPbVftm7MflPk5r/b8VKdO9nVwULVabDB6ra0sQRYWwMsqQCwLQuR0G2SmO32LKtuyz6ic/FfOeVz1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:31:58.341514Z"},"content_sha256":"e9d00556e6b509dc89f307f2d4399d9c154bc3bc1783f2817a421a85b1b7885f","schema_version":"1.0","event_id":"sha256:e9d00556e6b509dc89f307f2d4399d9c154bc3bc1783f2817a421a85b1b7885f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:37MGYVFFVFUGNR3AJ4N4HHZABE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Kong, Juanzi Li, Lei Hou, Suhui Wu, Wei Zhang, Xin Lv, Xu Han, Yichi Zhang, Zhiyuan Liu","submitted_at":"2020-10-05T10:28:03Z","abstract_excerpt":"Multi-hop reasoning has been widely studied in recent years to seek an effective and interpretable method for knowledge graph (KG) completion. Most previous reasoning methods are designed for dense KGs with enough paths between entities, but cannot work well on those sparse KGs that only contain sparse paths for reasoning. On the one hand, sparse KGs contain less information, which makes it difficult for the model to choose correct paths. On the other hand, the lack of evidential paths to target entities also makes the reasoning process difficult. To solve these problems, we propose a multi-ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01899","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/2010.01899/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-05T01:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74oSKIwaCtxU95NZD1Ho4ZWA1hJajiKaBeMceux8IWZEM7JV9dXI+bYtkEFsTNapSOSWT2NuLB0OoX/rfuWqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:31:58.341971Z"},"content_sha256":"60196fa3c692fba8cb9e4b7f5ed6766b3e44844334f2229f641da02fbdb1c337","schema_version":"1.0","event_id":"sha256:60196fa3c692fba8cb9e4b7f5ed6766b3e44844334f2229f641da02fbdb1c337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/bundle.json","state_url":"https://pith.science/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/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-07-06T08:31:58Z","links":{"resolver":"https://pith.science/pith/37MGYVFFVFUGNR3AJ4N4HHZABE","bundle":"https://pith.science/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/bundle.json","state":"https://pith.science/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37MGYVFFVFUGNR3AJ4N4HHZABE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:37MGYVFFVFUGNR3AJ4N4HHZABE","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":"9fc929949aaeaba4004d51574425e48c4051008afd934827f445fd3eb8be46e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T10:28:03Z","title_canon_sha256":"736d052edd10e774d4ec580559cc31ecf379f4dce99f643ddd74be30b5ab3b2f"},"schema_version":"1.0","source":{"id":"2010.01899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.01899","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.01899v1","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01899","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"37MGYVFFVFUG","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_16","alias_value":"37MGYVFFVFUGNR3A","created_at":"2026-07-05T01:40:10Z"},{"alias_kind":"pith_short_8","alias_value":"37MGYVFF","created_at":"2026-07-05T01:40:10Z"}],"graph_snapshots":[{"event_id":"sha256:60196fa3c692fba8cb9e4b7f5ed6766b3e44844334f2229f641da02fbdb1c337","target":"graph","created_at":"2026-07-05T01:40:10Z","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/2010.01899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-hop reasoning has been widely studied in recent years to seek an effective and interpretable method for knowledge graph (KG) completion. Most previous reasoning methods are designed for dense KGs with enough paths between entities, but cannot work well on those sparse KGs that only contain sparse paths for reasoning. On the one hand, sparse KGs contain less information, which makes it difficult for the model to choose correct paths. On the other hand, the lack of evidential paths to target entities also makes the reasoning process difficult. To solve these problems, we propose a multi-ho","authors_text":"Hao Kong, Juanzi Li, Lei Hou, Suhui Wu, Wei Zhang, Xin Lv, Xu Han, Yichi Zhang, Zhiyuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T10:28:03Z","title":"Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01899","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:e9d00556e6b509dc89f307f2d4399d9c154bc3bc1783f2817a421a85b1b7885f","target":"record","created_at":"2026-07-05T01:40:10Z","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":"9fc929949aaeaba4004d51574425e48c4051008afd934827f445fd3eb8be46e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-05T10:28:03Z","title_canon_sha256":"736d052edd10e774d4ec580559cc31ecf379f4dce99f643ddd74be30b5ab3b2f"},"schema_version":"1.0","source":{"id":"2010.01899","kind":"arxiv","version":1}},"canonical_sha256":"dfd86c54a5a96866c7604f1bc39f2009216c5c2e68003275f9a2aacd1937a7a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfd86c54a5a96866c7604f1bc39f2009216c5c2e68003275f9a2aacd1937a7a4","first_computed_at":"2026-07-05T01:40:10.618963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:40:10.618963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b+iLI1ocGQx4ZaCeontEeZFSHJjed8xF3+GfsjQIn2Iydr8Ath729xMRavPkDFDILobyWTwi0zWz5Xs8U8SVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:40:10.619414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.01899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9d00556e6b509dc89f307f2d4399d9c154bc3bc1783f2817a421a85b1b7885f","sha256:60196fa3c692fba8cb9e4b7f5ed6766b3e44844334f2229f641da02fbdb1c337"],"state_sha256":"83713d120e09ab6d1d58ca26b287db69a19f1eebffb0e32eb30dba08e1391eb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4o2/pLUMl/a9SelFyPqMHkkILGKrDrM1YjAsvVlmTioOfZCzgNt18K7nXeUpusYnHoBoJc6feQJOAZAR1vzjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:31:58.344520Z","bundle_sha256":"66a934ec5381ad4815471e3530b5dd5fc6b9e3d4d6c1afe1b5ed8f7decf1d570"}}