{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BMHRANSLJDZOWA5TJHL3RHLO36","short_pith_number":"pith:BMHRANSL","schema_version":"1.0","canonical_sha256":"0b0f10364b48f2eb03b349d7b89d6edf96fb4625d6dcf986073e8c5023ac5bb0","source":{"kind":"arxiv","id":"2010.07620","version":3},"attestation_state":"computed","paper":{"title":"GMH: A General Multi-hop Reasoning Model for KG Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Adam Jatowt, Hongru Liang, Ning Jiang, Wenqiang Lei, Xin Wei, Yao Zhang, Zhenglu Yang","submitted_at":"2020-10-15T09:30:46Z","abstract_excerpt":"Knowledge graphs are essential for numerous downstream natural language processing applications, but are typically incomplete with many facts missing. This results in research efforts on multi-hop reasoning task, which can be formulated as a search process and current models typically perform short distance reasoning. However, the long-distance reasoning is also vital with the ability to connect the superficially unrelated entities. To the best of our knowledge, there lacks a general framework that approaches multi-hop reasoning in mixed long-short distance reasoning scenarios. We argue that t"},"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":"2010.07620","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2020-10-15T09:30:46Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"1840e0be7a46960e4aa8d717ae873f91b19c1e2526eb1171192ac64c47598e30","abstract_canon_sha256":"a90971994d3e47056da336650f13c01b33b158c83bcac8fa4d1bb136bb231284"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:50.466607Z","signature_b64":"xRf+SaHJ6c3I6I+Y6C1upRyP3/he7heYcZ7FOaObZM3Bgz4l0tcVPmoqRGhEKh4vAw1RS0k/y8EiiopGuiz2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0f10364b48f2eb03b349d7b89d6edf96fb4625d6dcf986073e8c5023ac5bb0","last_reissued_at":"2026-07-05T03:10:50.466171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:50.466171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GMH: A General Multi-hop Reasoning Model for KG Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Adam Jatowt, Hongru Liang, Ning Jiang, Wenqiang Lei, Xin Wei, Yao Zhang, Zhenglu Yang","submitted_at":"2020-10-15T09:30:46Z","abstract_excerpt":"Knowledge graphs are essential for numerous downstream natural language processing applications, but are typically incomplete with many facts missing. This results in research efforts on multi-hop reasoning task, which can be formulated as a search process and current models typically perform short distance reasoning. However, the long-distance reasoning is also vital with the ability to connect the superficially unrelated entities. To the best of our knowledge, there lacks a general framework that approaches multi-hop reasoning in mixed long-short distance reasoning scenarios. We argue that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.07620/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.07620","created_at":"2026-07-05T03:10:50.466236+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.07620v3","created_at":"2026-07-05T03:10:50.466236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07620","created_at":"2026-07-05T03:10:50.466236+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMHRANSLJDZO","created_at":"2026-07-05T03:10:50.466236+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMHRANSLJDZOWA5T","created_at":"2026-07-05T03:10:50.466236+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMHRANSL","created_at":"2026-07-05T03:10:50.466236+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36","json":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36.json","graph_json":"https://pith.science/api/pith-number/BMHRANSLJDZOWA5TJHL3RHLO36/graph.json","events_json":"https://pith.science/api/pith-number/BMHRANSLJDZOWA5TJHL3RHLO36/events.json","paper":"https://pith.science/paper/BMHRANSL"},"agent_actions":{"view_html":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36","download_json":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36.json","view_paper":"https://pith.science/paper/BMHRANSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.07620&json=true","fetch_graph":"https://pith.science/api/pith-number/BMHRANSLJDZOWA5TJHL3RHLO36/graph.json","fetch_events":"https://pith.science/api/pith-number/BMHRANSLJDZOWA5TJHL3RHLO36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36/action/storage_attestation","attest_author":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36/action/author_attestation","sign_citation":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36/action/citation_signature","submit_replication":"https://pith.science/pith/BMHRANSLJDZOWA5TJHL3RHLO36/action/replication_record"}},"created_at":"2026-07-05T03:10:50.466236+00:00","updated_at":"2026-07-05T03:10:50.466236+00:00"}