{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DB4OEP3CBUVQNKKCL7XGWSYKSN","short_pith_number":"pith:DB4OEP3C","canonical_record":{"source":{"id":"1702.06879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-22T16:28:11Z","cross_cats_sorted":["cs.LG","math.SP","stat.ML"],"title_canon_sha256":"2820e3798fe14e3697300537992efe3bdfc3339c884d24f4b99321f9287ab452","abstract_canon_sha256":"82c33647b10deada936e35e8d411f229fc7cad694b0f0731e9e5ff57ac7d06db"},"schema_version":"1.0"},"canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","source":{"kind":"arxiv","id":"1702.06879","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06879","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06879v2","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06879","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"DB4OEP3CBUVQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DB4OEP3CBUVQNKKC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DB4OEP3C","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DB4OEP3CBUVQNKKCL7XGWSYKSN","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-22T16:28:11Z","cross_cats_sorted":["cs.LG","math.SP","stat.ML"],"title_canon_sha256":"2820e3798fe14e3697300537992efe3bdfc3339c884d24f4b99321f9287ab452","abstract_canon_sha256":"82c33647b10deada936e35e8d411f229fc7cad694b0f0731e9e5ff57ac7d06db"},"schema_version":"1.0"},"canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:39.301131Z","signature_b64":"XPcjAYVqiZydtAUGShvx6JlCNQ55utrdhRRmHf0HPmD2YyDv2tUfqwh6643hpR6Y9WdrFKhLZQP6p7D4U6v6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","last_reissued_at":"2026-05-18T00:29:39.300763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:39.300763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06879","source_version":2,"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpScMEikRFwZZZcSJ2ga6mM4RhrRjYAUEtRzygkLJvESHUY1qIgoAymBTeuPeeEKz4Bcc8whbbsfBG9SqpXqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:36:49.925481Z"},"content_sha256":"e56636994b716b44fa7da1ad677f9ae9243dc1e119872b540d1fa7b0bb3cc1ff","schema_version":"1.0","event_id":"sha256:e56636994b716b44fa7da1ad677f9ae9243dc1e119872b540d1fa7b0bb3cc1ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DB4OEP3CBUVQNKKCL7XGWSYKSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Knowledge Graph Completion via Complex Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.SP","stat.ML"],"primary_cat":"cs.AI","authors_text":"Christopher R. Dance, \\'Eric Gaussier, Guillaume Bouchard, Johannes Welbl, Sebastian Riedel, Th\\'eo Trouillon","submitted_at":"2017-02-22T16:28:11Z","abstract_excerpt":"In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, and time and space complexity. We reconcile both expressiveness and complexity through the use of complex-valued embeddings and explore the link between such complex-valued embeddings and unitary diagonalization. We corroborate our approach theoretically and show that all real sq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06879","kind":"arxiv","version":2},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nydSjbMkr1/hQsTtutAWVLiEzYj9pBUxWFhiiFdGhJM+SaSc/8paFYYmSo25jSivIGTC9vHm6TeNIzhI4optBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:36:49.925829Z"},"content_sha256":"b86bd34e39e0cc65713e452ba86af932f63a426c2dd697294334e61b546fdf61","schema_version":"1.0","event_id":"sha256:b86bd34e39e0cc65713e452ba86af932f63a426c2dd697294334e61b546fdf61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/bundle.json","state_url":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/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-06-03T03:36:49Z","links":{"resolver":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN","bundle":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/bundle.json","state":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DB4OEP3CBUVQNKKCL7XGWSYKSN","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":"82c33647b10deada936e35e8d411f229fc7cad694b0f0731e9e5ff57ac7d06db","cross_cats_sorted":["cs.LG","math.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-22T16:28:11Z","title_canon_sha256":"2820e3798fe14e3697300537992efe3bdfc3339c884d24f4b99321f9287ab452"},"schema_version":"1.0","source":{"id":"1702.06879","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06879","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06879v2","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06879","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"DB4OEP3CBUVQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DB4OEP3CBUVQNKKC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DB4OEP3C","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:b86bd34e39e0cc65713e452ba86af932f63a426c2dd697294334e61b546fdf61","target":"graph","created_at":"2026-05-18T00:29:39Z","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":"In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, and time and space complexity. We reconcile both expressiveness and complexity through the use of complex-valued embeddings and explore the link between such complex-valued embeddings and unitary diagonalization. We corroborate our approach theoretically and show that all real sq","authors_text":"Christopher R. Dance, \\'Eric Gaussier, Guillaume Bouchard, Johannes Welbl, Sebastian Riedel, Th\\'eo Trouillon","cross_cats":["cs.LG","math.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-22T16:28:11Z","title":"Knowledge Graph Completion via Complex Tensor Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06879","kind":"arxiv","version":2},"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:e56636994b716b44fa7da1ad677f9ae9243dc1e119872b540d1fa7b0bb3cc1ff","target":"record","created_at":"2026-05-18T00:29:39Z","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":"82c33647b10deada936e35e8d411f229fc7cad694b0f0731e9e5ff57ac7d06db","cross_cats_sorted":["cs.LG","math.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-22T16:28:11Z","title_canon_sha256":"2820e3798fe14e3697300537992efe3bdfc3339c884d24f4b99321f9287ab452"},"schema_version":"1.0","source":{"id":"1702.06879","kind":"arxiv","version":2}},"canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","first_computed_at":"2026-05-18T00:29:39.300763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:39.300763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XPcjAYVqiZydtAUGShvx6JlCNQ55utrdhRRmHf0HPmD2YyDv2tUfqwh6643hpR6Y9WdrFKhLZQP6p7D4U6v6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:39.301131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06879","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e56636994b716b44fa7da1ad677f9ae9243dc1e119872b540d1fa7b0bb3cc1ff","sha256:b86bd34e39e0cc65713e452ba86af932f63a426c2dd697294334e61b546fdf61"],"state_sha256":"265c0e301f5ad9fc0b73ac0b5574d46e338e8365f4b329d85e87078e9a549e99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pt0i5r3je3Of4O7zYd5tUfiSUJU7F1q4Qbddt4trx9Du3uDanYmTjbP2fAVIQyNzcyeKqVJKX/oCk4LgtmH4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:36:49.928011Z","bundle_sha256":"c4c9adb927275a6ac05f7dc715c1feb009a5b3fa0bbe666fe83146dbafdb99f3"}}