{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OFZTG7TA7QMHOIFCEDIJF752O5","short_pith_number":"pith:OFZTG7TA","schema_version":"1.0","canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","source":{"kind":"arxiv","id":"1002.4935","version":3},"attestation_state":"computed","paper":{"title":"Multiarray Signal Processing: Tensor decomposition meets compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Lek-Heng Lim, Pierre Comon","submitted_at":"2010-02-26T08:00:08Z","abstract_excerpt":"We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a measure of separation between radiating sources called coherence, one could always guarantee the existence and uniqueness of a best rank-r approximation of the tensor representing the signal. We also deduce a computationally feasible variant of Kruskal's uniqueness condition, where the coherence appears as a proxy for k-rank. Problems of sparsest recovery wit"},"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":"1002.4935","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-02-26T08:00:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7549d279a02bdbe2df6b109a571f2c45a4d8d49851cb77dc18fcc6af7ca93bf7","abstract_canon_sha256":"68cf4d9913d589e3d4ac7c25aa2516e3aa900409f97e72c654a579bb2635d0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:56.507254Z","signature_b64":"44ZKXVeAlZkBghMwqgyLypwFLsreQhkZ/w7JSAdUeDvn3iN+FexCiU7xYuorJQHc+odpgphFW4sbabaAJ3nbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","last_reissued_at":"2026-05-18T02:08:56.506463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:56.506463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiarray Signal Processing: Tensor decomposition meets compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Lek-Heng Lim, Pierre Comon","submitted_at":"2010-02-26T08:00:08Z","abstract_excerpt":"We discuss how recently discovered techniques and tools from compressed sensing can be used in tensor decompositions, with a view towards modeling signals from multiple arrays of multiple sensors. We show that with appropriate bounds on a measure of separation between radiating sources called coherence, one could always guarantee the existence and uniqueness of a best rank-r approximation of the tensor representing the signal. We also deduce a computationally feasible variant of Kruskal's uniqueness condition, where the coherence appears as a proxy for k-rank. Problems of sparsest recovery wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4935","kind":"arxiv","version":3},"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":"1002.4935","created_at":"2026-05-18T02:08:56.506596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.4935v3","created_at":"2026-05-18T02:08:56.506596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4935","created_at":"2026-05-18T02:08:56.506596+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFZTG7TA7QMH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFZTG7TA7QMHOIFC","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFZTG7TA","created_at":"2026-05-18T12:26:12.377268+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/OFZTG7TA7QMHOIFCEDIJF752O5","json":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5.json","graph_json":"https://pith.science/api/pith-number/OFZTG7TA7QMHOIFCEDIJF752O5/graph.json","events_json":"https://pith.science/api/pith-number/OFZTG7TA7QMHOIFCEDIJF752O5/events.json","paper":"https://pith.science/paper/OFZTG7TA"},"agent_actions":{"view_html":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5","download_json":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5.json","view_paper":"https://pith.science/paper/OFZTG7TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.4935&json=true","fetch_graph":"https://pith.science/api/pith-number/OFZTG7TA7QMHOIFCEDIJF752O5/graph.json","fetch_events":"https://pith.science/api/pith-number/OFZTG7TA7QMHOIFCEDIJF752O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/action/storage_attestation","attest_author":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/action/author_attestation","sign_citation":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/action/citation_signature","submit_replication":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/action/replication_record"}},"created_at":"2026-05-18T02:08:56.506596+00:00","updated_at":"2026-05-18T02:08:56.506596+00:00"}