{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FNTMAY5B3I42DRZZTKJJEDYG2X","short_pith_number":"pith:FNTMAY5B","schema_version":"1.0","canonical_sha256":"2b66c063a1da39a1c7399a92920f06d5fa015123dab6364001001c2d5683620a","source":{"kind":"arxiv","id":"2012.15537","version":5},"attestation_state":"computed","paper":{"title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Peng Chen, Volker Tresp, Yunpu Ma, Zhen Han","submitted_at":"2020-12-31T10:41:01Z","abstract_excerpt":"Modeling time-evolving knowledge graphs (KGs) has recently gained increasing interest. Here, graph representation learning has become the dominant paradigm for link prediction on temporal KGs. However, the embedding-based approaches largely operate in a black-box fashion, lacking the ability to interpret their predictions. This paper provides a link forecasting framework that reasons over query-relevant subgraphs of temporal KGs and jointly models the structural dependencies and the temporal dynamics. Especially, we propose a temporal relational attention mechanism and a novel reverse represen"},"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":"2012.15537","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-31T10:41:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5ecbda446c3b343df19b583dc539716260074432fc3a558905d7f593f77e1f7a","abstract_canon_sha256":"c05ba3006114de6e428887c4385838b75f89b5c2a62adcaf22b085a796cc3b09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:19.652385Z","signature_b64":"9n6yCEgJt1lcxFU0MSmovyr2WiYX2LJwXc8sHAT/76Im7B6ghRSooSTZH0OZqtMRVyWWvl+AUG78MuQr+Ro4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b66c063a1da39a1c7399a92920f06d5fa015123dab6364001001c2d5683620a","last_reissued_at":"2026-07-05T02:28:19.651874Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:19.651874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Peng Chen, Volker Tresp, Yunpu Ma, Zhen Han","submitted_at":"2020-12-31T10:41:01Z","abstract_excerpt":"Modeling time-evolving knowledge graphs (KGs) has recently gained increasing interest. Here, graph representation learning has become the dominant paradigm for link prediction on temporal KGs. However, the embedding-based approaches largely operate in a black-box fashion, lacking the ability to interpret their predictions. This paper provides a link forecasting framework that reasons over query-relevant subgraphs of temporal KGs and jointly models the structural dependencies and the temporal dynamics. Especially, we propose a temporal relational attention mechanism and a novel reverse represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15537","kind":"arxiv","version":5},"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/2012.15537/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":"2012.15537","created_at":"2026-07-05T02:28:19.651931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.15537v5","created_at":"2026-07-05T02:28:19.651931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15537","created_at":"2026-07-05T02:28:19.651931+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNTMAY5B3I42","created_at":"2026-07-05T02:28:19.651931+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNTMAY5B3I42DRZZ","created_at":"2026-07-05T02:28:19.651931+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNTMAY5B","created_at":"2026-07-05T02:28:19.651931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.18977","citing_title":"Towards Improving Long-Tail Entity Predictions in Temporal Knowledge Graphs through Global Similarity and Weighted Sampling","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X","json":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X.json","graph_json":"https://pith.science/api/pith-number/FNTMAY5B3I42DRZZTKJJEDYG2X/graph.json","events_json":"https://pith.science/api/pith-number/FNTMAY5B3I42DRZZTKJJEDYG2X/events.json","paper":"https://pith.science/paper/FNTMAY5B"},"agent_actions":{"view_html":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X","download_json":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X.json","view_paper":"https://pith.science/paper/FNTMAY5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.15537&json=true","fetch_graph":"https://pith.science/api/pith-number/FNTMAY5B3I42DRZZTKJJEDYG2X/graph.json","fetch_events":"https://pith.science/api/pith-number/FNTMAY5B3I42DRZZTKJJEDYG2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X/action/storage_attestation","attest_author":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X/action/author_attestation","sign_citation":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X/action/citation_signature","submit_replication":"https://pith.science/pith/FNTMAY5B3I42DRZZTKJJEDYG2X/action/replication_record"}},"created_at":"2026-07-05T02:28:19.651931+00:00","updated_at":"2026-07-05T02:28:19.651931+00:00"}