{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LS2KDW7AIHTUGO24IKM5XP3KGS","short_pith_number":"pith:LS2KDW7A","schema_version":"1.0","canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","source":{"kind":"arxiv","id":"1403.2330","version":3},"attestation_state":"computed","paper":{"title":"Subspace clustering using a symmetric low-rank representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hua Mao, Jie Chen, Yongsheng Sang, Zhang Yi","submitted_at":"2014-03-07T10:07:43Z","abstract_excerpt":"In this paper, we propose a low-rank representation with symmetric constraint (LRRSC) method for robust subspace clustering. Given a collection of data points approximately drawn from multiple subspaces, the proposed technique can simultaneously recover the dimension and members of each subspace. LRRSC extends the original low-rank representation algorithm by integrating a symmetric constraint into the low-rankness property of high-dimensional data representation. The symmetric low-rank representation, which preserves the subspace structures of high-dimensional data, guarantees weight consiste"},"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":"1403.2330","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-07T10:07:43Z","cross_cats_sorted":[],"title_canon_sha256":"a0c23f34af51eec91c3ae8b585c218f55840dbf16fead29ee1adc4c1b42b128c","abstract_canon_sha256":"ed927f2a28a276b794d36281895878084436703407982e55fa3eb73381e14266"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.470336Z","signature_b64":"5tDAAuByjQ54wJ97meYQr8m+WU198QKyZepwidjbO7HFCYBmMpfSD+2RtANfFb7JS8mpo0S+LYrtfE3aP8O4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","last_reissued_at":"2026-05-18T00:44:37.469825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.469825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace clustering using a symmetric low-rank representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hua Mao, Jie Chen, Yongsheng Sang, Zhang Yi","submitted_at":"2014-03-07T10:07:43Z","abstract_excerpt":"In this paper, we propose a low-rank representation with symmetric constraint (LRRSC) method for robust subspace clustering. Given a collection of data points approximately drawn from multiple subspaces, the proposed technique can simultaneously recover the dimension and members of each subspace. LRRSC extends the original low-rank representation algorithm by integrating a symmetric constraint into the low-rankness property of high-dimensional data representation. The symmetric low-rank representation, which preserves the subspace structures of high-dimensional data, guarantees weight consiste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2330","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.2330","created_at":"2026-05-18T00:44:37.469896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2330v3","created_at":"2026-05-18T00:44:37.469896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2330","created_at":"2026-05-18T00:44:37.469896+00:00"},{"alias_kind":"pith_short_12","alias_value":"LS2KDW7AIHTU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LS2KDW7AIHTUGO24","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LS2KDW7A","created_at":"2026-05-18T12:28:38.356838+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/LS2KDW7AIHTUGO24IKM5XP3KGS","json":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS.json","graph_json":"https://pith.science/api/pith-number/LS2KDW7AIHTUGO24IKM5XP3KGS/graph.json","events_json":"https://pith.science/api/pith-number/LS2KDW7AIHTUGO24IKM5XP3KGS/events.json","paper":"https://pith.science/paper/LS2KDW7A"},"agent_actions":{"view_html":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS","download_json":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS.json","view_paper":"https://pith.science/paper/LS2KDW7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2330&json=true","fetch_graph":"https://pith.science/api/pith-number/LS2KDW7AIHTUGO24IKM5XP3KGS/graph.json","fetch_events":"https://pith.science/api/pith-number/LS2KDW7AIHTUGO24IKM5XP3KGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/action/storage_attestation","attest_author":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/action/author_attestation","sign_citation":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/action/citation_signature","submit_replication":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/action/replication_record"}},"created_at":"2026-05-18T00:44:37.469896+00:00","updated_at":"2026-05-18T00:44:37.469896+00:00"}