{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4WYOIF2A2HCPL4RMEG5JJHNLYS","short_pith_number":"pith:4WYOIF2A","canonical_record":{"source":{"id":"1809.03202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T09:17:04Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"874dd923f961fd63c4066c30f8804782cefa146f9854242a82af07539d91f75b","abstract_canon_sha256":"6e9b44000f6bfcea67575b9a63264853375d70ba86cd79f5345597f9227c1007"},"schema_version":"1.0"},"canonical_sha256":"e5b0e41740d1c4f5f22c21ba949dabc4a15e53f20ab82965fa80e1e00d90dcac","source":{"kind":"arxiv","id":"1809.03202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03202","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03202v1","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03202","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"4WYOIF2A2HCP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4WYOIF2A2HCPL4RM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4WYOIF2A","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4WYOIF2A2HCPL4RMEG5JJHNLYS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T09:17:04Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"874dd923f961fd63c4066c30f8804782cefa146f9854242a82af07539d91f75b","abstract_canon_sha256":"6e9b44000f6bfcea67575b9a63264853375d70ba86cd79f5345597f9227c1007"},"schema_version":"1.0"},"canonical_sha256":"e5b0e41740d1c4f5f22c21ba949dabc4a15e53f20ab82965fa80e1e00d90dcac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:09.684626Z","signature_b64":"H2+nCK3nyGLn834CeptxJMRAO2zmuxUZ4j+ICwVlv9k2sm0Azx/YxcgJayV5fZgyO19nsdisgcW9xDcfNWjgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b0e41740d1c4f5f22c21ba949dabc4a15e53f20ab82965fa80e1e00d90dcac","last_reissued_at":"2026-05-18T00:06:09.683977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:09.683977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03202","source_version":1,"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-05-18T00:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+WGQzcnrKER2d3QaxJwhrsRC55t6ZjK+9lhg0BANJe45P+NJVY/XhOzwcp5aSWHMC0xreJsvxg1vNEpAY90Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:01:49.357964Z"},"content_sha256":"f4a6c72c1dff47e4274f56437f60f6baab773aef696f0bcbb3e90989946e4362","schema_version":"1.0","event_id":"sha256:f4a6c72c1dff47e4274f56437f60f6baab773aef696f0bcbb3e90989946e4362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4WYOIF2A2HCPL4RMEG5JJHNLYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Alberto Garc\\'ia-Dur\\'an, Mathias Niepert, Sebastijan Duman\\v{c}i\\'c","submitted_at":"2018-09-10T09:17:04Z","abstract_excerpt":"Research on link prediction in knowledge graphs has mainly focused on static multi-relational data. In this work we consider temporal knowledge graphs where relations between entities may only hold for a time interval or a specific point in time. In line with previous work on static knowledge graphs, we propose to address this problem by learning latent entity and relation type representations. To incorporate temporal information, we utilize recurrent neural networks to learn time-aware representations of relation types which can be used in conjunction with existing latent factorization method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03202","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":""},"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-05-18T00:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wa7+J0AffOCJHRJQWsdP3/2wZKktXD/CWi1rerkM8Ehlgur6ldo7e0NthI8UC+HeRIs5dTU1TxNCv0i/xW/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:01:49.358618Z"},"content_sha256":"f08d863e20511901f298d5e62436a20a58bc942f470b16edbe83e9f17ec379c1","schema_version":"1.0","event_id":"sha256:f08d863e20511901f298d5e62436a20a58bc942f470b16edbe83e9f17ec379c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/bundle.json","state_url":"https://pith.science/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/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-05-26T06:01:49Z","links":{"resolver":"https://pith.science/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS","bundle":"https://pith.science/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/bundle.json","state":"https://pith.science/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WYOIF2A2HCPL4RMEG5JJHNLYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4WYOIF2A2HCPL4RMEG5JJHNLYS","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":"6e9b44000f6bfcea67575b9a63264853375d70ba86cd79f5345597f9227c1007","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T09:17:04Z","title_canon_sha256":"874dd923f961fd63c4066c30f8804782cefa146f9854242a82af07539d91f75b"},"schema_version":"1.0","source":{"id":"1809.03202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03202","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03202v1","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03202","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"4WYOIF2A2HCP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4WYOIF2A2HCPL4RM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4WYOIF2A","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:f08d863e20511901f298d5e62436a20a58bc942f470b16edbe83e9f17ec379c1","target":"graph","created_at":"2026-05-18T00:06:09Z","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"},"paper":{"abstract_excerpt":"Research on link prediction in knowledge graphs has mainly focused on static multi-relational data. In this work we consider temporal knowledge graphs where relations between entities may only hold for a time interval or a specific point in time. In line with previous work on static knowledge graphs, we propose to address this problem by learning latent entity and relation type representations. To incorporate temporal information, we utilize recurrent neural networks to learn time-aware representations of relation types which can be used in conjunction with existing latent factorization method","authors_text":"Alberto Garc\\'ia-Dur\\'an, Mathias Niepert, Sebastijan Duman\\v{c}i\\'c","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T09:17:04Z","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03202","kind":"arxiv","version":1},"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:f4a6c72c1dff47e4274f56437f60f6baab773aef696f0bcbb3e90989946e4362","target":"record","created_at":"2026-05-18T00:06:09Z","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":"6e9b44000f6bfcea67575b9a63264853375d70ba86cd79f5345597f9227c1007","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T09:17:04Z","title_canon_sha256":"874dd923f961fd63c4066c30f8804782cefa146f9854242a82af07539d91f75b"},"schema_version":"1.0","source":{"id":"1809.03202","kind":"arxiv","version":1}},"canonical_sha256":"e5b0e41740d1c4f5f22c21ba949dabc4a15e53f20ab82965fa80e1e00d90dcac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5b0e41740d1c4f5f22c21ba949dabc4a15e53f20ab82965fa80e1e00d90dcac","first_computed_at":"2026-05-18T00:06:09.683977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:09.683977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H2+nCK3nyGLn834CeptxJMRAO2zmuxUZ4j+ICwVlv9k2sm0Azx/YxcgJayV5fZgyO19nsdisgcW9xDcfNWjgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:09.684626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4a6c72c1dff47e4274f56437f60f6baab773aef696f0bcbb3e90989946e4362","sha256:f08d863e20511901f298d5e62436a20a58bc942f470b16edbe83e9f17ec379c1"],"state_sha256":"fb750947de1a90424a8fd164f4d969a90597217926e440cf1dc8427a27f6c89f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlFoRxm0HrrtxOZIW3EzrdRWDFQGrJVTT23zzU82MddoNVz1KC19Om6DbUYr3gXsNUV70FAdoBBdC1EHeTL0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:01:49.362326Z","bundle_sha256":"2b29979c3948ebb55d2e40767be338ca71326271c206f9d58091f64dab79da9c"}}