{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IIK4B7P5IC76M3W7E3A7W6LVQW","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":"d5c3dd0cbe6bb9d702353df730a2ecde068504d2adee3cb5c50fd4f855c80f5b","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-14T15:38:48Z","title_canon_sha256":"3257cac4bfc351608535ade055e19846723aaf6562c4505656b1517c57f230ed"},"schema_version":"1.0","source":{"id":"1010.2955","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2955","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2955v6","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2955","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"pith_short_12","alias_value":"IIK4B7P5IC76","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IIK4B7P5IC76M3W7","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IIK4B7P5","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:4716c43d75250c2802ce6f40670ec96030a2f7748dd37ac40e933a887d563e9d","target":"graph","created_at":"2026-05-18T03:35:26Z","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 subspace recovery problem. Given a set of data samples (vectors) approximately drawn from a union of multiple subspaces, our goal is to segment the samples into their respective subspaces and correct the possible errors as well. To this end, we propose a novel method termed Low-Rank Representation (LRR), which seeks the lowest-rank representation among all the candidates that can represent the data samples as linear combinations of the bases in a given dictionary. It is shown that LRR well solves the subspace recovery problem: when the data is clean, we prove that L","authors_text":"Guangcan Liu, Ju Sun, Shuicheng Yan, Yi Ma, Yong Yu, Zhouchen Lin","cross_cats":["cs.CV","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-14T15:38:48Z","title":"Robust Recovery of Subspace Structures by Low-Rank Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2955","kind":"arxiv","version":6},"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:56e2f214e2c87aff15401250b12c83eda3e1531896aa6946fa0dfee7eeeb0044","target":"record","created_at":"2026-05-18T03:35:26Z","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":"d5c3dd0cbe6bb9d702353df730a2ecde068504d2adee3cb5c50fd4f855c80f5b","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-14T15:38:48Z","title_canon_sha256":"3257cac4bfc351608535ade055e19846723aaf6562c4505656b1517c57f230ed"},"schema_version":"1.0","source":{"id":"1010.2955","kind":"arxiv","version":6}},"canonical_sha256":"4215c0fdfd40bfe66edf26c1fb797585be22baca6e9fce808396910d1b46d329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4215c0fdfd40bfe66edf26c1fb797585be22baca6e9fce808396910d1b46d329","first_computed_at":"2026-05-18T03:35:26.522603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:26.522603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/GLxdQ9137jWl6coF+fniJ1N7wumb0r+oOxKErmUuafRINBlMXbBdT5AYSJUczQZvJV6a1emtQotW3jo48iqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:26.523246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2955","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56e2f214e2c87aff15401250b12c83eda3e1531896aa6946fa0dfee7eeeb0044","sha256:4716c43d75250c2802ce6f40670ec96030a2f7748dd37ac40e933a887d563e9d"],"state_sha256":"16398d78ec1ce0f438abe698f54904779c7256733ee63112e3809295483a5eff"}