{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YCCIRQWE2KGN7UNXPVKROH7RCW","short_pith_number":"pith:YCCIRQWE","schema_version":"1.0","canonical_sha256":"c08488c2c4d28cdfd1b77d55171ff11587872c12fdada40c6592c8dcf159bec6","source":{"kind":"arxiv","id":"1301.4602","version":1},"attestation_state":"computed","paper":{"title":"On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part I: Basic Results and Uniqueness of One Factor Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Ignat Domanov, Lieven De Lathauwer","submitted_at":"2013-01-19T21:59:31Z","abstract_excerpt":"Canonical Polyadic Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. We give an overview of existing results concerning uniqueness. We present new, relaxed, conditions that guarantee uniqueness of one factor matrix. These conditions involve Khatri-Rao products of compound matrices. We make links with existing results involving ranks and k-ranks of factor matrices. We give a shorter proof, based on properties of second compound matrices, of existing results concerning overall CPD uniqueness in the case where one factor matrix has full column ra"},"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":"1301.4602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2013-01-19T21:59:31Z","cross_cats_sorted":[],"title_canon_sha256":"96b668aa5fb25b6ed60307d3a7803ccecd8651f899ae142d02c623a2cc2e31bf","abstract_canon_sha256":"b5beb1203b9c2eab1a6b417f5c4b58f0e11a87ce96ff709bb9b84a4f8a2c43ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:22.333422Z","signature_b64":"J3L3Vzln047mv/qs8YvHeYxXwaoPBBhK1UqN3rTo1mxB6C1ce+QUOIfi0CWOCbeyKFY/kyNrvT9Y+HTukuUQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08488c2c4d28cdfd1b77d55171ff11587872c12fdada40c6592c8dcf159bec6","last_reissued_at":"2026-05-18T03:19:22.332719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:22.332719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part I: Basic Results and Uniqueness of One Factor Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Ignat Domanov, Lieven De Lathauwer","submitted_at":"2013-01-19T21:59:31Z","abstract_excerpt":"Canonical Polyadic Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. We give an overview of existing results concerning uniqueness. We present new, relaxed, conditions that guarantee uniqueness of one factor matrix. These conditions involve Khatri-Rao products of compound matrices. We make links with existing results involving ranks and k-ranks of factor matrices. We give a shorter proof, based on properties of second compound matrices, of existing results concerning overall CPD uniqueness in the case where one factor matrix has full column ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4602","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":"1301.4602","created_at":"2026-05-18T03:19:22.332815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4602v1","created_at":"2026-05-18T03:19:22.332815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4602","created_at":"2026-05-18T03:19:22.332815+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCCIRQWE2KGN","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCCIRQWE2KGN7UNX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCCIRQWE","created_at":"2026-05-18T12:28:06.772260+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/YCCIRQWE2KGN7UNXPVKROH7RCW","json":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW.json","graph_json":"https://pith.science/api/pith-number/YCCIRQWE2KGN7UNXPVKROH7RCW/graph.json","events_json":"https://pith.science/api/pith-number/YCCIRQWE2KGN7UNXPVKROH7RCW/events.json","paper":"https://pith.science/paper/YCCIRQWE"},"agent_actions":{"view_html":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW","download_json":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW.json","view_paper":"https://pith.science/paper/YCCIRQWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4602&json=true","fetch_graph":"https://pith.science/api/pith-number/YCCIRQWE2KGN7UNXPVKROH7RCW/graph.json","fetch_events":"https://pith.science/api/pith-number/YCCIRQWE2KGN7UNXPVKROH7RCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW/action/storage_attestation","attest_author":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW/action/author_attestation","sign_citation":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW/action/citation_signature","submit_replication":"https://pith.science/pith/YCCIRQWE2KGN7UNXPVKROH7RCW/action/replication_record"}},"created_at":"2026-05-18T03:19:22.332815+00:00","updated_at":"2026-05-18T03:19:22.332815+00:00"}