{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DB4OEP3CBUVQNKKCL7XGWSYKSN","short_pith_number":"pith:DB4OEP3C","schema_version":"1.0","canonical_sha256":"1878e23f620d2b06a9425fee6b4b0a9343ee3f33a5b22094db3d5e6cbdb1dbef","source":{"kind":"arxiv","id":"1702.06879","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.06879","created_at":"2026-05-18T00:29:39.300820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06879v2","created_at":"2026-05-18T00:29:39.300820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06879","created_at":"2026-05-18T00:29:39.300820+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB4OEP3CBUVQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB4OEP3CBUVQNKKC","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB4OEP3C","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN","json":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN.json","graph_json":"https://pith.science/api/pith-number/DB4OEP3CBUVQNKKCL7XGWSYKSN/graph.json","events_json":"https://pith.science/api/pith-number/DB4OEP3CBUVQNKKCL7XGWSYKSN/events.json","paper":"https://pith.science/paper/DB4OEP3C"},"agent_actions":{"view_html":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN","download_json":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN.json","view_paper":"https://pith.science/paper/DB4OEP3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06879&json=true","fetch_graph":"https://pith.science/api/pith-number/DB4OEP3CBUVQNKKCL7XGWSYKSN/graph.json","fetch_events":"https://pith.science/api/pith-number/DB4OEP3CBUVQNKKCL7XGWSYKSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/action/storage_attestation","attest_author":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/action/author_attestation","sign_citation":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/action/citation_signature","submit_replication":"https://pith.science/pith/DB4OEP3CBUVQNKKCL7XGWSYKSN/action/replication_record"}},"created_at":"2026-05-18T00:29:39.300820+00:00","updated_at":"2026-05-18T00:29:39.300820+00:00"}