{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QSEMUPJJ7CVUXML63ASIXFPO5V","short_pith_number":"pith:QSEMUPJJ","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"},"canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","source":{"kind":"arxiv","id":"1904.05530","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05530","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05530v4","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05530","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"QSEMUPJJ7CVU","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_16","alias_value":"QSEMUPJJ7CVUXML6","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_8","alias_value":"QSEMUPJJ","created_at":"2026-07-05T01:40:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QSEMUPJJ7CVUXML63ASIXFPO5V","target":"record","payload":{"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"},"canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","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"},"source_kind":"arxiv","source_id":"1904.05530","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Fl4BrJDI6KZx7fHtwRsCiY4zaD94uOAgHCrFcG5TCajNF6DnKjfmmXxC32FNZupc21MAHpTjWDiZDi/qAHkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:35:39.221457Z"},"content_sha256":"ef1e4b92d168a4ec6516d81dd8dd50ac4340819ef3e9b869d64510d6c1ea1f67","schema_version":"1.0","event_id":"sha256:ef1e4b92d168a4ec6516d81dd8dd50ac4340819ef3e9b869d64510d6c1ea1f67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QSEMUPJJ7CVUXML63ASIXFPO5V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2uEmutQF+VRGE4BVz7DXWMTv6cXpiR4Zvnn4xLjeyKte8mK/NwSv6kmjhiBX9xX60I8mpLcArJAKqWMJavrkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:35:39.222094Z"},"content_sha256":"c0221b031edbac24febda2a0c439a1a029b4a73f57397c7492bd557d418fc375","schema_version":"1.0","event_id":"sha256:c0221b031edbac24febda2a0c439a1a029b4a73f57397c7492bd557d418fc375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/bundle.json","state_url":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T06:35:39Z","links":{"resolver":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V","bundle":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/bundle.json","state":"https://pith.science/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSEMUPJJ7CVUXML63ASIXFPO5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QSEMUPJJ7CVUXML63ASIXFPO5V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d414a320119e1a3b0b2118020dad1bdf3354ac48601d7f30105a4aaa9f4c62a4","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T04:45:42Z","title_canon_sha256":"319be9fc5958596f641ad6f470637f6493aab000fe7da3b7072ac84499e831b5"},"schema_version":"1.0","source":{"id":"1904.05530","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05530","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05530v4","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05530","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"QSEMUPJJ7CVU","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_16","alias_value":"QSEMUPJJ7CVUXML6","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_8","alias_value":"QSEMUPJJ","created_at":"2026-07-05T01:40:55Z"}],"graph_snapshots":[{"event_id":"sha256:c0221b031edbac24febda2a0c439a1a029b4a73f57397c7492bd557d418fc375","target":"graph","created_at":"2026-07-05T01:40:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1904.05530/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Meng Qu, Woojeong Jin, Xiang Ren, Xisen Jin","cross_cats":["cs.AI","cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T04:45:42Z","title":"Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05530","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef1e4b92d168a4ec6516d81dd8dd50ac4340819ef3e9b869d64510d6c1ea1f67","target":"record","created_at":"2026-07-05T01:40:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d414a320119e1a3b0b2118020dad1bdf3354ac48601d7f30105a4aaa9f4c62a4","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T04:45:42Z","title_canon_sha256":"319be9fc5958596f641ad6f470637f6493aab000fe7da3b7072ac84499e831b5"},"schema_version":"1.0","source":{"id":"1904.05530","kind":"arxiv","version":4}},"canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8488ca3d29f8ab4bb17ed8248b95eeed4c5b3dc636ed6cd43731d02b77c8a833","first_computed_at":"2026-07-05T01:40:55.337881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:40:55.337881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EuuA55imZP4LOJck/oCRMxvmeFTkxz6Mg1UUn3vRZIqglEn44cM6u9+QDhc+Bl/4+aEt9eckvuEos0EwX/iKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:40:55.338493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05530","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef1e4b92d168a4ec6516d81dd8dd50ac4340819ef3e9b869d64510d6c1ea1f67","sha256:c0221b031edbac24febda2a0c439a1a029b4a73f57397c7492bd557d418fc375"],"state_sha256":"ced18a2203f0e0086f09ffe5f9f9b861674cfd978abd2ccf806351c85de30f66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLkZ5IXum53tVL3W4uf9tqgRxbm2OYSuFPBQEl9knxynyY7wIAVZxdiZxTZCPNfxoT97ddWy22od83u7UeRzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T06:35:39.226933Z","bundle_sha256":"47bcaeb0e19d09b1c553e27f450f5bfe65bc61f320c5364448e4b4d8f387e622"}}