{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GA2Q55VSYAKBYEWIUJI4TCKEFP","short_pith_number":"pith:GA2Q55VS","schema_version":"1.0","canonical_sha256":"30350ef6b2c0141c12c8a251c989442bd0bb75cd5d0d8153f5ec45c162001bdb","source":{"kind":"arxiv","id":"1110.1988","version":1},"attestation_state":"computed","paper":{"title":"Are diverging CP components always nearly proportional?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alwin Stegeman, Lieven De Lathauwer","submitted_at":"2011-10-10T10:23:11Z","abstract_excerpt":"Fitting a Candecomp/Parafac (CP) decomposition (also known as Canonical Polyadic decomposition) to a multi-way array or higher-order tensor, is equivalent to finding a best low-rank approximation to the multi-way array or higher-order tensor, where the rank is defined as the outer-product rank. However, such a best low-rank approximation may not exist due to the fact that the set of multi-way arrays with rank at most $R$ is not closed for $R\\ge 2$. Nonexistence of a best low-rank approximation results in (groups of) diverging rank-1 components when an attempt is made to compute the approximati"},"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":"1110.1988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-10-10T10:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"1790bf9cdfa62b15124ddb1f5deb1e71b98f7b5be713597736ceee31e0fe7f5c","abstract_canon_sha256":"cc9f1da1f1f90bc4f7809aad60127b89907b15764bebe7185f48a14f8fad2108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.177223Z","signature_b64":"MZ7FSg8VuKdt2JEVYmZhTptWkCWplh4L9wZ0EmgqRIavFXNIkZbLSM2oaiEfv7IimceWUqHD3vbHxf9U8ZJYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30350ef6b2c0141c12c8a251c989442bd0bb75cd5d0d8153f5ec45c162001bdb","last_reissued_at":"2026-05-18T04:11:19.176741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.176741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are diverging CP components always nearly proportional?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alwin Stegeman, Lieven De Lathauwer","submitted_at":"2011-10-10T10:23:11Z","abstract_excerpt":"Fitting a Candecomp/Parafac (CP) decomposition (also known as Canonical Polyadic decomposition) to a multi-way array or higher-order tensor, is equivalent to finding a best low-rank approximation to the multi-way array or higher-order tensor, where the rank is defined as the outer-product rank. However, such a best low-rank approximation may not exist due to the fact that the set of multi-way arrays with rank at most $R$ is not closed for $R\\ge 2$. Nonexistence of a best low-rank approximation results in (groups of) diverging rank-1 components when an attempt is made to compute the approximati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1988","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":"1110.1988","created_at":"2026-05-18T04:11:19.176807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1988v1","created_at":"2026-05-18T04:11:19.176807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1988","created_at":"2026-05-18T04:11:19.176807+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA2Q55VSYAKB","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA2Q55VSYAKBYEWI","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA2Q55VS","created_at":"2026-05-18T12:26:28.662955+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/GA2Q55VSYAKBYEWIUJI4TCKEFP","json":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP.json","graph_json":"https://pith.science/api/pith-number/GA2Q55VSYAKBYEWIUJI4TCKEFP/graph.json","events_json":"https://pith.science/api/pith-number/GA2Q55VSYAKBYEWIUJI4TCKEFP/events.json","paper":"https://pith.science/paper/GA2Q55VS"},"agent_actions":{"view_html":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP","download_json":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP.json","view_paper":"https://pith.science/paper/GA2Q55VS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1988&json=true","fetch_graph":"https://pith.science/api/pith-number/GA2Q55VSYAKBYEWIUJI4TCKEFP/graph.json","fetch_events":"https://pith.science/api/pith-number/GA2Q55VSYAKBYEWIUJI4TCKEFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP/action/storage_attestation","attest_author":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP/action/author_attestation","sign_citation":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP/action/citation_signature","submit_replication":"https://pith.science/pith/GA2Q55VSYAKBYEWIUJI4TCKEFP/action/replication_record"}},"created_at":"2026-05-18T04:11:19.176807+00:00","updated_at":"2026-05-18T04:11:19.176807+00:00"}