{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UAIH72STIUI2R5WLH2XP4FRRPZ","short_pith_number":"pith:UAIH72ST","schema_version":"1.0","canonical_sha256":"a0107fea534511a8f6cb3eaefe16317e494ae08e7f00c5829da206ecc8713da5","source":{"kind":"arxiv","id":"2109.04101","version":1},"attestation_state":"computed","paper":{"title":"TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Haohai Sun, Jialun Zhong, Kun He, Yunpu Ma, Zhen Han","submitted_at":"2021-09-09T08:41:01Z","abstract_excerpt":"Temporal knowledge graph (TKG) reasoning is a crucial task that has gained increasing research interest in recent years. Most existing methods focus on reasoning at past timestamps to complete the missing facts, and there are only a few works of reasoning on known TKGs to forecast future facts. Compared with the completion task, the forecasting task is more difficult that faces two main challenges: (1) how to effectively model the time information to handle future timestamps? (2) how to make inductive inference to handle previously unseen entities that emerge over time? To address these challe"},"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":"2109.04101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-09T08:41:01Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"d4ae98d97fede9c8491c46ef3444b60f92fc5412385a468c1f67ce75e9ed0a0c","abstract_canon_sha256":"5285e4266725e27ee227c551ba0fd2fbe8b49056b8425d6eaa82a230f1b552f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:55.122679Z","signature_b64":"v2rsOJq2XxfZubMVVcjqA4Rf1DTdapdP5SPfxpei/Edu4+Xv1/xyFDPY8Gwz8CaeQ6z4C2fwv+/TGdKd/ySaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0107fea534511a8f6cb3eaefe16317e494ae08e7f00c5829da206ecc8713da5","last_reissued_at":"2026-07-05T03:12:55.122305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:55.122305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Haohai Sun, Jialun Zhong, Kun He, Yunpu Ma, Zhen Han","submitted_at":"2021-09-09T08:41:01Z","abstract_excerpt":"Temporal knowledge graph (TKG) reasoning is a crucial task that has gained increasing research interest in recent years. Most existing methods focus on reasoning at past timestamps to complete the missing facts, and there are only a few works of reasoning on known TKGs to forecast future facts. Compared with the completion task, the forecasting task is more difficult that faces two main challenges: (1) how to effectively model the time information to handle future timestamps? (2) how to make inductive inference to handle previously unseen entities that emerge over time? To address these challe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04101","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/2109.04101/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":"2109.04101","created_at":"2026-07-05T03:12:55.122376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.04101v1","created_at":"2026-07-05T03:12:55.122376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04101","created_at":"2026-07-05T03:12:55.122376+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAIH72STIUI2","created_at":"2026-07-05T03:12:55.122376+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAIH72STIUI2R5WL","created_at":"2026-07-05T03:12:55.122376+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAIH72ST","created_at":"2026-07-05T03:12:55.122376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19042","citing_title":"STK-Adapter: Incorporating Evolving Graph and Event Chain for Temporal Knowledge Graph Extrapolation","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ","json":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ.json","graph_json":"https://pith.science/api/pith-number/UAIH72STIUI2R5WLH2XP4FRRPZ/graph.json","events_json":"https://pith.science/api/pith-number/UAIH72STIUI2R5WLH2XP4FRRPZ/events.json","paper":"https://pith.science/paper/UAIH72ST"},"agent_actions":{"view_html":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ","download_json":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ.json","view_paper":"https://pith.science/paper/UAIH72ST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.04101&json=true","fetch_graph":"https://pith.science/api/pith-number/UAIH72STIUI2R5WLH2XP4FRRPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UAIH72STIUI2R5WLH2XP4FRRPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ/action/storage_attestation","attest_author":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ/action/author_attestation","sign_citation":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ/action/citation_signature","submit_replication":"https://pith.science/pith/UAIH72STIUI2R5WLH2XP4FRRPZ/action/replication_record"}},"created_at":"2026-07-05T03:12:55.122376+00:00","updated_at":"2026-07-05T03:12:55.122376+00:00"}