{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QSEMUPJJ7CVUXML63ASIXFPO5V","short_pith_number":"pith:QSEMUPJJ","schema_version":"1.0","canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","source":{"kind":"arxiv","id":"1904.05530","version":4},"attestation_state":"computed","paper":{"title":"Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Meng Qu, Woojeong Jin, Xiang Ren, Xisen Jin","submitted_at":"2019-04-11T04:45:42Z","abstract_excerpt":"Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on reasoning at past timestamps and they are not able to predict facts happening in the future. This paper proposes Recurrent Event Network (RE-NET), a novel autoregressive architecture for predicting future interactions. The occurrence of a fact (event) is modeled as a probability distribution conditioned on temporal sequences of past knowledge graphs. Specifically, our RE-NET em"},"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":"1904.05530","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T04:45:42Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"319be9fc5958596f641ad6f470637f6493aab000fe7da3b7072ac84499e831b5","abstract_canon_sha256":"d414a320119e1a3b0b2118020dad1bdf3354ac48601d7f30105a4aaa9f4c62a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:55.338493Z","signature_b64":"EuuA55imZP4LOJck/oCRMxvmeFTkxz6Mg1UUn3vRZIqglEn44cM6u9+QDhc+Bl/4+aEt9eckvuEos0EwX/iKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","last_reissued_at":"2026-07-05T01:40:55.337881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:55.337881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Meng Qu, Woojeong Jin, Xiang Ren, Xisen Jin","submitted_at":"2019-04-11T04:45:42Z","abstract_excerpt":"Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on reasoning at past timestamps and they are not able to predict facts happening in the future. This paper proposes Recurrent Event Network (RE-NET), a novel autoregressive architecture for predicting future interactions. The occurrence of a fact (event) is modeled as a probability distribution conditioned on temporal sequences of past knowledge graphs. Specifically, our RE-NET em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05530","kind":"arxiv","version":4},"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/1904.05530/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":"1904.05530","created_at":"2026-07-05T01:40:55.337967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05530v4","created_at":"2026-07-05T01:40:55.337967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05530","created_at":"2026-07-05T01:40:55.337967+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSEMUPJJ7CVU","created_at":"2026-07-05T01:40:55.337967+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSEMUPJJ7CVUXML6","created_at":"2026-07-05T01:40:55.337967+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSEMUPJJ","created_at":"2026-07-05T01:40:55.337967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19042","citing_title":"STK-Adapter: Incorporating Evolving Graph and Event Chain for Temporal Knowledge Graph Extrapolation","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10164","citing_title":"Inductive Reasoning for Temporal Knowledge Graphs with Emerging Entities","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V","json":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V.json","graph_json":"https://pith.science/api/pith-number/QSEMUPJJ7CVUXML63ASIXFPO5V/graph.json","events_json":"https://pith.science/api/pith-number/QSEMUPJJ7CVUXML63ASIXFPO5V/events.json","paper":"https://pith.science/paper/QSEMUPJJ"},"agent_actions":{"view_html":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V","download_json":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V.json","view_paper":"https://pith.science/paper/QSEMUPJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05530&json=true","fetch_graph":"https://pith.science/api/pith-number/QSEMUPJJ7CVUXML63ASIXFPO5V/graph.json","fetch_events":"https://pith.science/api/pith-number/QSEMUPJJ7CVUXML63ASIXFPO5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/action/storage_attestation","attest_author":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/action/author_attestation","sign_citation":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/action/citation_signature","submit_replication":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/action/replication_record"}},"created_at":"2026-07-05T01:40:55.337967+00:00","updated_at":"2026-07-05T01:40:55.337967+00:00"}