{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7NHTY5NTY3NNCJXFJRXTJQEDUP","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":"cdcb495dd3bbc9f84c144bacaa027b523efed8738b2cb82470a598e013846c94","cross_cats_sorted":["cs.CV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-08T07:51:54Z","title_canon_sha256":"4715fe9f155c72a284955403faab6c378e534129c00dc04e5fb6c15bc581baa8"},"schema_version":"1.0","source":{"id":"1109.1646","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1646","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1646v3","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1646","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"7NHTY5NTY3NN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7NHTY5NTY3NNCJXF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7NHTY5NT","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:cc6a8055263e59e835fb142c4e15b07a96217d76e3a7b2fe818ea0fd1ee55fa8","target":"graph","created_at":"2026-05-18T02:55:18Z","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":"In this work, we address the following matrix recovery problem: suppose we are given a set of data points containing two parts, one part consists of samples drawn from a union of multiple subspaces and the other part consists of outliers. We do not know which data points are outliers, or how many outliers there are. The rank and number of the subspaces are unknown either. Can we detect the outliers and segment the samples into their right subspaces, efficiently and exactly? We utilize a so-called {\\em Low-Rank Representation} (LRR) method to solve this problem, and prove that under mild techni","authors_text":"Guangcan Liu, Huan Xu, Shuicheng Yan","cross_cats":["cs.CV","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-08T07:51:54Z","title":"Exact Subspace Segmentation and Outlier Detection by Low-Rank Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1646","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:f4ca875043424d70990e8a543a470301633765f459e6c9c50fdcfba43ec30022","target":"record","created_at":"2026-05-18T02:55:18Z","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":"cdcb495dd3bbc9f84c144bacaa027b523efed8738b2cb82470a598e013846c94","cross_cats_sorted":["cs.CV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-08T07:51:54Z","title_canon_sha256":"4715fe9f155c72a284955403faab6c378e534129c00dc04e5fb6c15bc581baa8"},"schema_version":"1.0","source":{"id":"1109.1646","kind":"arxiv","version":3}},"canonical_sha256":"fb4f3c75b3c6dad126e54c6f34c083a3dbe4d37be8178f034889f7207f06df96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb4f3c75b3c6dad126e54c6f34c083a3dbe4d37be8178f034889f7207f06df96","first_computed_at":"2026-05-18T02:55:18.816991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:18.816991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n+GQMi21hD/Pv/SqF+u6TC67UqKLpEZZRj1KvqM1Y82WK9rqvLJP7s7XB2ID/okUL+PIKtlb2qrQmeQCb2CaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:18.817406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1646","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4ca875043424d70990e8a543a470301633765f459e6c9c50fdcfba43ec30022","sha256:cc6a8055263e59e835fb142c4e15b07a96217d76e3a7b2fe818ea0fd1ee55fa8"],"state_sha256":"5451e6b93459f6b185a00794c418d0ceeeaaf8953b21151b0fdddc4f73c3cfd3"}