{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LL2NPHJANNF36WDCSFPNS5CQ2P","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":"03d5b561d32b9565d00270ed4ceb2f324d50a497553dce4b753f07ba20480756","cross_cats_sorted":["math.OA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-08-27T21:34:58Z","title_canon_sha256":"8e8ec154280b8d4086682a8585e81f52a57332fda8fd140e519d3ce7b4dd8ac4"},"schema_version":"1.0","source":{"id":"1008.4811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4811","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4811v1","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4811","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"LL2NPHJANNF3","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LL2NPHJANNF36WDC","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LL2NPHJA","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:7cc182c2d7db87c7bc7ab9718456d92b4cf26e83baefab607435c643d8eca310","target":"graph","created_at":"2026-05-18T04:41:43Z","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":"Given a set of vectors $\\F=\\{f_1,\\dots,f_m\\}$ in a Hilbert space $\\HH$, and given a family $\\CC$ of closed subspaces of $\\HH$, the {\\it subspace clustering problem} consists in finding a union of subspaces in $\\CC$ that best approximates (models) the data $\\F$.\n  This problem has applications and connections to many areas of mathematics, computer science and engineering such as the Generalized Principle Component Analysis (GPCA), learning theory, compressed sensing, and sampling with finite rate of innovation. In this paper, we characterize families of subspaces $\\CC$ for which such a best app","authors_text":"Akram Aldroubi, Romain Tessera","cross_cats":["math.OA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-08-27T21:34:58Z","title":"On the existence of Optimal Subspace Clustering Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4811","kind":"arxiv","version":1},"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:9e64b4f8469188d6016fed8a1e0b4debe6091a898dc23a558e2fed57c8ad6852","target":"record","created_at":"2026-05-18T04:41:43Z","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":"03d5b561d32b9565d00270ed4ceb2f324d50a497553dce4b753f07ba20480756","cross_cats_sorted":["math.OA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-08-27T21:34:58Z","title_canon_sha256":"8e8ec154280b8d4086682a8585e81f52a57332fda8fd140e519d3ce7b4dd8ac4"},"schema_version":"1.0","source":{"id":"1008.4811","kind":"arxiv","version":1}},"canonical_sha256":"5af4d79d206b4bbf5862915ed97450d3fa04d399429a248b3313ee68cbf41953","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5af4d79d206b4bbf5862915ed97450d3fa04d399429a248b3313ee68cbf41953","first_computed_at":"2026-05-18T04:41:43.627371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:43.627371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJmc7KN5gDRfcMLLYy8TmLhnWG0y5EldBRNFK+X/M+/11aiKpfC7q90KSAfPkDmJAz/JW2Votmnf9n/kAB+hAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:43.627766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e64b4f8469188d6016fed8a1e0b4debe6091a898dc23a558e2fed57c8ad6852","sha256:7cc182c2d7db87c7bc7ab9718456d92b4cf26e83baefab607435c643d8eca310"],"state_sha256":"68d19bda6630e21f225d4a725f6d01ac816216a01737bb6c027c7b58a58abe71"}