{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CAOPINPGK72UBORTPWYPKE7S3X","short_pith_number":"pith:CAOPINPG","schema_version":"1.0","canonical_sha256":"101cf435e657f540ba337db0f513f2dddc1a6704f2c3577acdcc3e8e58193d3d","source":{"kind":"arxiv","id":"1410.8618","version":2},"attestation_state":"computed","paper":{"title":"Symmetric low-rank representation for subspace clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haixian Zhang, Hua Mao, Jie Chen, Yongsheng Sang, Zhang Yi","submitted_at":"2014-10-31T02:14:03Z","abstract_excerpt":"We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple subspaces through the self-expressiveness property of the data. In particular, the SLRR method considers a collaborative representation combined with low-rank matrix recovery techniques as a low-rank representation to learn a symmetric low-rank representation, which preserves the subspace structures of high-dimensional data. In contrast to performing iterative"},"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":"1410.8618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-31T02:14:03Z","cross_cats_sorted":[],"title_canon_sha256":"751e43033cf986e80505ec064beb39d3fe1f842f0b813f756deb6cc596097654","abstract_canon_sha256":"c6145fcad71380a073cc1cb6b26e4c8a7926f88c764d72dd0bb97fb6cdfb729d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:18.915451Z","signature_b64":"D0BKHQj0lPiVPyTZYDwlLZr1woLUH/Weq60BWiGf0mrLcS/ksf9vCahyUyeAnDgB/cc5JQjX+fQKNXTFAldiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"101cf435e657f540ba337db0f513f2dddc1a6704f2c3577acdcc3e8e58193d3d","last_reissued_at":"2026-05-18T01:26:18.914724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:18.914724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric low-rank representation for subspace clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haixian Zhang, Hua Mao, Jie Chen, Yongsheng Sang, Zhang Yi","submitted_at":"2014-10-31T02:14:03Z","abstract_excerpt":"We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple subspaces through the self-expressiveness property of the data. In particular, the SLRR method considers a collaborative representation combined with low-rank matrix recovery techniques as a low-rank representation to learn a symmetric low-rank representation, which preserves the subspace structures of high-dimensional data. In contrast to performing iterative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8618","kind":"arxiv","version":2},"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":"1410.8618","created_at":"2026-05-18T01:26:18.914832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8618v2","created_at":"2026-05-18T01:26:18.914832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8618","created_at":"2026-05-18T01:26:18.914832+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAOPINPGK72U","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAOPINPGK72UBORT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAOPINPG","created_at":"2026-05-18T12:28:22.404517+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/CAOPINPGK72UBORTPWYPKE7S3X","json":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X.json","graph_json":"https://pith.science/api/pith-number/CAOPINPGK72UBORTPWYPKE7S3X/graph.json","events_json":"https://pith.science/api/pith-number/CAOPINPGK72UBORTPWYPKE7S3X/events.json","paper":"https://pith.science/paper/CAOPINPG"},"agent_actions":{"view_html":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X","download_json":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X.json","view_paper":"https://pith.science/paper/CAOPINPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8618&json=true","fetch_graph":"https://pith.science/api/pith-number/CAOPINPGK72UBORTPWYPKE7S3X/graph.json","fetch_events":"https://pith.science/api/pith-number/CAOPINPGK72UBORTPWYPKE7S3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X/action/storage_attestation","attest_author":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X/action/author_attestation","sign_citation":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X/action/citation_signature","submit_replication":"https://pith.science/pith/CAOPINPGK72UBORTPWYPKE7S3X/action/replication_record"}},"created_at":"2026-05-18T01:26:18.914832+00:00","updated_at":"2026-05-18T01:26:18.914832+00:00"}