{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LS2KDW7AIHTUGO24IKM5XP3KGS","short_pith_number":"pith:LS2KDW7A","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"},"canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","source":{"kind":"arxiv","id":"1403.2330","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2330","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2330v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2330","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS2KDW7AIHTU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LS2KDW7AIHTUGO24","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LS2KDW7A","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LS2KDW7AIHTUGO24IKM5XP3KGS","target":"record","payload":{"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"},"canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","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"},"source_kind":"arxiv","source_id":"1403.2330","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qT8PV3SmX/EzrKujmkJ+x3rYuCEviOGYnFj2FJBW937/O03yirIU+FL1uPtVHkxRhZNGjHj2Bf31ahikz1AXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:02:08.383692Z"},"content_sha256":"bcbbd4e6a3b44cadbade5f0c98a9aea72193b69fd67f9f897e8962c8b7cd7ecb","schema_version":"1.0","event_id":"sha256:bcbbd4e6a3b44cadbade5f0c98a9aea72193b69fd67f9f897e8962c8b7cd7ecb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LS2KDW7AIHTUGO24IKM5XP3KGS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlBhPmXzYK/8t+KBjrvKlxUAZv0DUbDOJcIoKsL1E4suTnuZPBI+LjDRnA9sDxNv4/L76RC1hGDYuB8e38jjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:02:08.384111Z"},"content_sha256":"1fac35deb9d6aefa5088e59c299ff168c3ab6d16cfd382ec8bf1faac4f031283","schema_version":"1.0","event_id":"sha256:1fac35deb9d6aefa5088e59c299ff168c3ab6d16cfd382ec8bf1faac4f031283"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/bundle.json","state_url":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:02:08Z","links":{"resolver":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS","bundle":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/bundle.json","state":"https://pith.science/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS2KDW7AIHTUGO24IKM5XP3KGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LS2KDW7AIHTUGO24IKM5XP3KGS","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":"ed927f2a28a276b794d36281895878084436703407982e55fa3eb73381e14266","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-07T10:07:43Z","title_canon_sha256":"a0c23f34af51eec91c3ae8b585c218f55840dbf16fead29ee1adc4c1b42b128c"},"schema_version":"1.0","source":{"id":"1403.2330","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2330","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2330v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2330","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS2KDW7AIHTU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LS2KDW7AIHTUGO24","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LS2KDW7A","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:1fac35deb9d6aefa5088e59c299ff168c3ab6d16cfd382ec8bf1faac4f031283","target":"graph","created_at":"2026-05-18T00:44:37Z","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 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","authors_text":"Hua Mao, Jie Chen, Yongsheng Sang, Zhang Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-07T10:07:43Z","title":"Subspace clustering using a symmetric low-rank representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2330","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:bcbbd4e6a3b44cadbade5f0c98a9aea72193b69fd67f9f897e8962c8b7cd7ecb","target":"record","created_at":"2026-05-18T00:44:37Z","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":"ed927f2a28a276b794d36281895878084436703407982e55fa3eb73381e14266","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-07T10:07:43Z","title_canon_sha256":"a0c23f34af51eec91c3ae8b585c218f55840dbf16fead29ee1adc4c1b42b128c"},"schema_version":"1.0","source":{"id":"1403.2330","kind":"arxiv","version":3}},"canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cb4a1dbe041e7433b5c4299dbbf6a34b89807628ab6f8fb656555ca3b54c413","first_computed_at":"2026-05-18T00:44:37.469825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.469825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tDAAuByjQ54wJ97meYQr8m+WU198QKyZepwidjbO7HFCYBmMpfSD+2RtANfFb7JS8mpo0S+LYrtfE3aP8O4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.470336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2330","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcbbd4e6a3b44cadbade5f0c98a9aea72193b69fd67f9f897e8962c8b7cd7ecb","sha256:1fac35deb9d6aefa5088e59c299ff168c3ab6d16cfd382ec8bf1faac4f031283"],"state_sha256":"0f0636cfc4d98c275827368c24388a395913ba28ac2fdd3a90e187d7ef64e773"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FA+xuVcPzShwha8yesVLRM2nUCO430jQpmGF7gFmaHY3n9eiGhIAL2IYCacEseePtDhketeBvlFGQd8Dn0ktBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:02:08.387153Z","bundle_sha256":"5f77bb7c04d071b95975284ec2b297cd1016adaffd2bf50643faea7a5b78df02"}}