{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CG2L6DTN64PVGZUYUUKT3EJREK","short_pith_number":"pith:CG2L6DTN","schema_version":"1.0","canonical_sha256":"11b4bf0e6df71f536698a5153d9131229439d034a8ddd74ac565cb8965f398e9","source":{"kind":"arxiv","id":"2412.16557","version":1},"attestation_state":"computed","paper":{"title":"CognTKE: A Cognitive Temporal Knowledge Extrapolation Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Huaiyu Wan, Mengqi Liao, Shuhan Wu, Wei Chen, Youfang Lin, Yuting Wu, Zhiyu Zhang","submitted_at":"2024-12-21T09:50:55Z","abstract_excerpt":"Reasoning future unknowable facts on temporal knowledge graphs (TKGs) is a challenging task, holding significant academic and practical values for various fields. Existing studies exploring explainable reasoning concentrate on modeling comprehensible temporal paths relevant to the query. Yet, these path-based methods primarily focus on local temporal paths appearing in recent times, failing to capture the complex temporal paths in TKG and resulting in the loss of longer historical relations related to the query. Motivated by the Dual Process Theory in cognitive science, we propose a \\textbf{Co"},"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":"2412.16557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-21T09:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"e5c2c111c0e4810fdd5cd88cc5e73022c1502c06299295854b60e4356caa494c","abstract_canon_sha256":"aec5222078a32119a45a1dd7d227e2a7b233e4e7a2dc2284db887d43b360fa04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:49.492837Z","signature_b64":"kgqYq1StZHP06bOxJch0Mco3YRHseSJWRhyTfZDnL5pOfSIe0hdqGfoAY/XKlJkg2TvNGol+fUK5RHIqC3QMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b4bf0e6df71f536698a5153d9131229439d034a8ddd74ac565cb8965f398e9","last_reissued_at":"2026-07-05T09:52:49.492407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:49.492407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CognTKE: A Cognitive Temporal Knowledge Extrapolation Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Huaiyu Wan, Mengqi Liao, Shuhan Wu, Wei Chen, Youfang Lin, Yuting Wu, Zhiyu Zhang","submitted_at":"2024-12-21T09:50:55Z","abstract_excerpt":"Reasoning future unknowable facts on temporal knowledge graphs (TKGs) is a challenging task, holding significant academic and practical values for various fields. Existing studies exploring explainable reasoning concentrate on modeling comprehensible temporal paths relevant to the query. Yet, these path-based methods primarily focus on local temporal paths appearing in recent times, failing to capture the complex temporal paths in TKG and resulting in the loss of longer historical relations related to the query. Motivated by the Dual Process Theory in cognitive science, we propose a \\textbf{Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16557","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/2412.16557/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":"2412.16557","created_at":"2026-07-05T09:52:49.492455+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16557v1","created_at":"2026-07-05T09:52:49.492455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16557","created_at":"2026-07-05T09:52:49.492455+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG2L6DTN64PV","created_at":"2026-07-05T09:52:49.492455+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG2L6DTN64PVGZUY","created_at":"2026-07-05T09:52:49.492455+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG2L6DTN","created_at":"2026-07-05T09:52:49.492455+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04083","citing_title":"A Generative Adaptive Replay Continual Learning Model for Temporal Knowledge Graph Reasoning","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK","json":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK.json","graph_json":"https://pith.science/api/pith-number/CG2L6DTN64PVGZUYUUKT3EJREK/graph.json","events_json":"https://pith.science/api/pith-number/CG2L6DTN64PVGZUYUUKT3EJREK/events.json","paper":"https://pith.science/paper/CG2L6DTN"},"agent_actions":{"view_html":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK","download_json":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK.json","view_paper":"https://pith.science/paper/CG2L6DTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16557&json=true","fetch_graph":"https://pith.science/api/pith-number/CG2L6DTN64PVGZUYUUKT3EJREK/graph.json","fetch_events":"https://pith.science/api/pith-number/CG2L6DTN64PVGZUYUUKT3EJREK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK/action/storage_attestation","attest_author":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK/action/author_attestation","sign_citation":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK/action/citation_signature","submit_replication":"https://pith.science/pith/CG2L6DTN64PVGZUYUUKT3EJREK/action/replication_record"}},"created_at":"2026-07-05T09:52:49.492455+00:00","updated_at":"2026-07-05T09:52:49.492455+00:00"}