{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IIK4B7P5IC76M3W7E3A7W6LVQW","short_pith_number":"pith:IIK4B7P5","schema_version":"1.0","canonical_sha256":"4215c0fdfd40bfe66edf26c1fb797585be22baca6e9fce808396910d1b46d329","source":{"kind":"arxiv","id":"1010.2955","version":6},"attestation_state":"computed","paper":{"title":"Robust Recovery of Subspace Structures by Low-Rank Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Guangcan Liu, Ju Sun, Shuicheng Yan, Yi Ma, Yong Yu, Zhouchen Lin","submitted_at":"2010-10-14T15:38:48Z","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"},"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":"1010.2955","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-14T15:38:48Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"title_canon_sha256":"3257cac4bfc351608535ade055e19846723aaf6562c4505656b1517c57f230ed","abstract_canon_sha256":"d5c3dd0cbe6bb9d702353df730a2ecde068504d2adee3cb5c50fd4f855c80f5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:26.523246Z","signature_b64":"/GLxdQ9137jWl6coF+fniJ1N7wumb0r+oOxKErmUuafRINBlMXbBdT5AYSJUczQZvJV6a1emtQotW3jo48iqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4215c0fdfd40bfe66edf26c1fb797585be22baca6e9fce808396910d1b46d329","last_reissued_at":"2026-05-18T03:35:26.522603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:26.522603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Recovery of Subspace Structures by Low-Rank Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Guangcan Liu, Ju Sun, Shuicheng Yan, Yi Ma, Yong Yu, Zhouchen Lin","submitted_at":"2010-10-14T15:38:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2955","kind":"arxiv","version":6},"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":"1010.2955","created_at":"2026-05-18T03:35:26.522691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2955v6","created_at":"2026-05-18T03:35:26.522691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2955","created_at":"2026-05-18T03:35:26.522691+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIK4B7P5IC76","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIK4B7P5IC76M3W7","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIK4B7P5","created_at":"2026-05-18T12:26:09.077623+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/IIK4B7P5IC76M3W7E3A7W6LVQW","json":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW.json","graph_json":"https://pith.science/api/pith-number/IIK4B7P5IC76M3W7E3A7W6LVQW/graph.json","events_json":"https://pith.science/api/pith-number/IIK4B7P5IC76M3W7E3A7W6LVQW/events.json","paper":"https://pith.science/paper/IIK4B7P5"},"agent_actions":{"view_html":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW","download_json":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW.json","view_paper":"https://pith.science/paper/IIK4B7P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2955&json=true","fetch_graph":"https://pith.science/api/pith-number/IIK4B7P5IC76M3W7E3A7W6LVQW/graph.json","fetch_events":"https://pith.science/api/pith-number/IIK4B7P5IC76M3W7E3A7W6LVQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW/action/storage_attestation","attest_author":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW/action/author_attestation","sign_citation":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW/action/citation_signature","submit_replication":"https://pith.science/pith/IIK4B7P5IC76M3W7E3A7W6LVQW/action/replication_record"}},"created_at":"2026-05-18T03:35:26.522691+00:00","updated_at":"2026-05-18T03:35:26.522691+00:00"}