{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IDP6EQG3HHNC5PRDJWO2BE7FW3","short_pith_number":"pith:IDP6EQG3","schema_version":"1.0","canonical_sha256":"40dfe240db39da2ebe234d9da093e5b6ded9a68fc2a14ceb98be2b37935575de","source":{"kind":"arxiv","id":"2304.12604","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Path-Memory Network for Temporal Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Dong, Pengfei Wang, Pengyang Wang, Yanjie Fu, Yuanchun Zhou, Zhiyuan Ning, Ziyue Qiao","submitted_at":"2023-04-25T06:33:08Z","abstract_excerpt":"Temporal knowledge graph (TKG) reasoning aims to predict the future missing facts based on historical information and has gained increasing research interest recently. Lots of works have been made to model the historical structural and temporal characteristics for the reasoning task. Most existing works model the graph structure mainly depending on entity representation. However, the magnitude of TKG entities in real-world scenarios is considerable, and an increasing number of new entities will arise as time goes on. Therefore, we propose a novel architecture modeling with relation feature of "},"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":"2304.12604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-04-25T06:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"4ae4b3af87794dc6900ec90d562bfc7859611fe6b001d3eb3c3a4b27e26bb162","abstract_canon_sha256":"6d33fa66ad997155f334154bb9b3ea5abefa15f9aec23a427d990ad8c6243861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:18.729705Z","signature_b64":"RiYsr6CIOM1YWJruTO2tZLy8H58iHLBpdTmwdaiHYfWXjcatdjt+/pqtUv4wjo95i1IlPjUd67GVjVlvn+RSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40dfe240db39da2ebe234d9da093e5b6ded9a68fc2a14ceb98be2b37935575de","last_reissued_at":"2026-07-05T06:04:18.729251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:18.729251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Path-Memory Network for Temporal Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Dong, Pengfei Wang, Pengyang Wang, Yanjie Fu, Yuanchun Zhou, Zhiyuan Ning, Ziyue Qiao","submitted_at":"2023-04-25T06:33:08Z","abstract_excerpt":"Temporal knowledge graph (TKG) reasoning aims to predict the future missing facts based on historical information and has gained increasing research interest recently. Lots of works have been made to model the historical structural and temporal characteristics for the reasoning task. Most existing works model the graph structure mainly depending on entity representation. However, the magnitude of TKG entities in real-world scenarios is considerable, and an increasing number of new entities will arise as time goes on. Therefore, we propose a novel architecture modeling with relation feature of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12604","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/2304.12604/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":"2304.12604","created_at":"2026-07-05T06:04:18.729320+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.12604v1","created_at":"2026-07-05T06:04:18.729320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12604","created_at":"2026-07-05T06:04:18.729320+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDP6EQG3HHNC","created_at":"2026-07-05T06:04:18.729320+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDP6EQG3HHNC5PRD","created_at":"2026-07-05T06:04:18.729320+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDP6EQG3","created_at":"2026-07-05T06:04:18.729320+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05866","citing_title":"Beyond Paper-to-Paper: Structured Profiling and Rubric Scoring for Paper-Reviewer Matching","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3","json":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3.json","graph_json":"https://pith.science/api/pith-number/IDP6EQG3HHNC5PRDJWO2BE7FW3/graph.json","events_json":"https://pith.science/api/pith-number/IDP6EQG3HHNC5PRDJWO2BE7FW3/events.json","paper":"https://pith.science/paper/IDP6EQG3"},"agent_actions":{"view_html":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3","download_json":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3.json","view_paper":"https://pith.science/paper/IDP6EQG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.12604&json=true","fetch_graph":"https://pith.science/api/pith-number/IDP6EQG3HHNC5PRDJWO2BE7FW3/graph.json","fetch_events":"https://pith.science/api/pith-number/IDP6EQG3HHNC5PRDJWO2BE7FW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3/action/storage_attestation","attest_author":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3/action/author_attestation","sign_citation":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3/action/citation_signature","submit_replication":"https://pith.science/pith/IDP6EQG3HHNC5PRDJWO2BE7FW3/action/replication_record"}},"created_at":"2026-07-05T06:04:18.729320+00:00","updated_at":"2026-07-05T06:04:18.729320+00:00"}