{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OFZTG7TA7QMHOIFCEDIJF752O5","short_pith_number":"pith:OFZTG7TA","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"},"canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","source":{"kind":"arxiv","id":"1002.4935","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4935","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4935v3","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4935","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"OFZTG7TA7QMH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OFZTG7TA7QMHOIFC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OFZTG7TA","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OFZTG7TA7QMHOIFCEDIJF752O5","target":"record","payload":{"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"},"canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","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"},"source_kind":"arxiv","source_id":"1002.4935","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qR8TxL3WZQZByV4toYFUvMFp481XhDsYhew0UGND5801nxRj8Jpj6bcL2gVc5gvTVgJw7YFiilFttK/uPkkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:55:57.320294Z"},"content_sha256":"9d85abb8f3c95e4113297372364d351ec824f9f8fa2d6f70b474e3148d07b945","schema_version":"1.0","event_id":"sha256:9d85abb8f3c95e4113297372364d351ec824f9f8fa2d6f70b474e3148d07b945"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OFZTG7TA7QMHOIFCEDIJF752O5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Do74DL+dMnMCNBcftXmP3DGm/VFKzUZI3vUJB57VqFf2ZSNPze66OingHdGw6QZ3yRfaXJsfIatH+RN9suWLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:55:57.320652Z"},"content_sha256":"c133f4ebc1bd3b8c05646694daa8c7fc70c13c587bb12b7dc030f553af5689f1","schema_version":"1.0","event_id":"sha256:c133f4ebc1bd3b8c05646694daa8c7fc70c13c587bb12b7dc030f553af5689f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/bundle.json","state_url":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFZTG7TA7QMHOIFCEDIJF752O5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T11:55:57Z","links":{"resolver":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5","bundle":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/bundle.json","state":"https://pith.science/pith/OFZTG7TA7QMHOIFCEDIJF752O5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFZTG7TA7QMHOIFCEDIJF752O5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OFZTG7TA7QMHOIFCEDIJF752O5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"68cf4d9913d589e3d4ac7c25aa2516e3aa900409f97e72c654a579bb2635d0bc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-02-26T08:00:08Z","title_canon_sha256":"7549d279a02bdbe2df6b109a571f2c45a4d8d49851cb77dc18fcc6af7ca93bf7"},"schema_version":"1.0","source":{"id":"1002.4935","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4935","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4935v3","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4935","created_at":"2026-05-18T02:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"OFZTG7TA7QMH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OFZTG7TA7QMHOIFC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OFZTG7TA","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:c133f4ebc1bd3b8c05646694daa8c7fc70c13c587bb12b7dc030f553af5689f1","target":"graph","created_at":"2026-05-18T02:08:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Lek-Heng Lim, Pierre Comon","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-02-26T08:00:08Z","title":"Multiarray Signal Processing: Tensor decomposition meets compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4935","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d85abb8f3c95e4113297372364d351ec824f9f8fa2d6f70b474e3148d07b945","target":"record","created_at":"2026-05-18T02:08:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"68cf4d9913d589e3d4ac7c25aa2516e3aa900409f97e72c654a579bb2635d0bc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-02-26T08:00:08Z","title_canon_sha256":"7549d279a02bdbe2df6b109a571f2c45a4d8d49851cb77dc18fcc6af7ca93bf7"},"schema_version":"1.0","source":{"id":"1002.4935","kind":"arxiv","version":3}},"canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7173337e60fc187720a220d092ffba776648593743021bcc4b569ae12968b5be","first_computed_at":"2026-05-18T02:08:56.506463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:56.506463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"44ZKXVeAlZkBghMwqgyLypwFLsreQhkZ/w7JSAdUeDvn3iN+FexCiU7xYuorJQHc+odpgphFW4sbabaAJ3nbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:56.507254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.4935","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d85abb8f3c95e4113297372364d351ec824f9f8fa2d6f70b474e3148d07b945","sha256:c133f4ebc1bd3b8c05646694daa8c7fc70c13c587bb12b7dc030f553af5689f1"],"state_sha256":"0c611775d443ccd2867433a08888a5be8943a6b160b60aba3524a2a22bd3a00d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPgw7hkSH7+IHeDtoOT4/aBlOkAY9rm2qGU/Pui59TM6HswuaVZ3pLEYpauiGyyceqqqUGRjJ/P1I15vAezWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:55:57.322664Z","bundle_sha256":"5f31e21a7ef58fab06cfdf5084fbb288d629501a92a5d4fbae182d6fe18161e8"}}