{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GS23I7XJIYTO75E5T34KVS7YYU","short_pith_number":"pith:GS23I7XJ","schema_version":"1.0","canonical_sha256":"34b5b47ee94626eff49d9ef8aacbf8c50451406f23ea9b9bb197b66138ed038d","source":{"kind":"arxiv","id":"1806.07297","version":1},"attestation_state":"computed","paper":{"title":"Canonical Tensor Decomposition for Knowledge Base Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Guillaume Obozinski, Nicolas Usunier, Timoth\\'ee Lacroix","submitted_at":"2018-06-19T14:57:18Z","abstract_excerpt":"The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, current implementations of CP on standard Knowledge Base Completion benchmarks are lagging behind their competitors. In this work, we attempt to understand the limits of CP for knowledge base completion. First, we motivate and test a novel regularizer, based on tensor nuclear $p$-norms. Then, we present a reformulation of the problem that makes it invariant to arbitrary choices in"},"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":"1806.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-19T14:57:18Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"0fe889d5df288ac670f34e5174afc103fd3cf795b59f5bb2afe3a72c767c8d41","abstract_canon_sha256":"9221358b18785afb02b3e0b0411a5bf51e17b2bb73092a4715b9364b1c05ad76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.371044Z","signature_b64":"sE45f9hAMNpuHp9L0CH6ugjWro4vwCManTAwQSkzd74K1bj3Ee0TOEqVel1ekUJ8sp1ChRwIkh/YZPxEsDJ2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34b5b47ee94626eff49d9ef8aacbf8c50451406f23ea9b9bb197b66138ed038d","last_reissued_at":"2026-05-18T00:12:51.370510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.370510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonical Tensor Decomposition for Knowledge Base Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Guillaume Obozinski, Nicolas Usunier, Timoth\\'ee Lacroix","submitted_at":"2018-06-19T14:57:18Z","abstract_excerpt":"The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, current implementations of CP on standard Knowledge Base Completion benchmarks are lagging behind their competitors. In this work, we attempt to understand the limits of CP for knowledge base completion. First, we motivate and test a novel regularizer, based on tensor nuclear $p$-norms. Then, we present a reformulation of the problem that makes it invariant to arbitrary choices in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07297","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.07297","created_at":"2026-05-18T00:12:51.370581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07297v1","created_at":"2026-05-18T00:12:51.370581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07297","created_at":"2026-05-18T00:12:51.370581+00:00"},{"alias_kind":"pith_short_12","alias_value":"GS23I7XJIYTO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GS23I7XJIYTO75E5","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GS23I7XJ","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17669","citing_title":"Multimodal Cultural Heritage Knowledge Graph Extension with Language and Vision Models","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.22176","citing_title":"FixV2W: Correcting Invalid CVE-CWE Mappings with Knowledge Graph Embeddings","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU","json":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU.json","graph_json":"https://pith.science/api/pith-number/GS23I7XJIYTO75E5T34KVS7YYU/graph.json","events_json":"https://pith.science/api/pith-number/GS23I7XJIYTO75E5T34KVS7YYU/events.json","paper":"https://pith.science/paper/GS23I7XJ"},"agent_actions":{"view_html":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU","download_json":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU.json","view_paper":"https://pith.science/paper/GS23I7XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07297&json=true","fetch_graph":"https://pith.science/api/pith-number/GS23I7XJIYTO75E5T34KVS7YYU/graph.json","fetch_events":"https://pith.science/api/pith-number/GS23I7XJIYTO75E5T34KVS7YYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU/action/storage_attestation","attest_author":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU/action/author_attestation","sign_citation":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU/action/citation_signature","submit_replication":"https://pith.science/pith/GS23I7XJIYTO75E5T34KVS7YYU/action/replication_record"}},"created_at":"2026-05-18T00:12:51.370581+00:00","updated_at":"2026-05-18T00:12:51.370581+00:00"}