{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WUIPOBQ6MJQUX4GIYYGI7XKHGE","short_pith_number":"pith:WUIPOBQ6","canonical_record":{"source":{"id":"1203.1005","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-05T18:58:32Z","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"bb2da1f33720dd5755af49cb0b76db5fab2c2096dbb4a45b782e8fb7a64c94ce","abstract_canon_sha256":"e2a3600d42f7749e6efc905e71ac0bbea161adfdf00944abc770f665598ca3de"},"schema_version":"1.0"},"canonical_sha256":"b510f7061e62614bf0c8c60c8fdd4731315287e4d63b2ea47b7e549359b72ed6","source":{"kind":"arxiv","id":"1203.1005","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1005","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1005v3","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1005","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUIPOBQ6MJQU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WUIPOBQ6MJQUX4GI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WUIPOBQ6","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WUIPOBQ6MJQUX4GIYYGI7XKHGE","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1005","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-05T18:58:32Z","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"bb2da1f33720dd5755af49cb0b76db5fab2c2096dbb4a45b782e8fb7a64c94ce","abstract_canon_sha256":"e2a3600d42f7749e6efc905e71ac0bbea161adfdf00944abc770f665598ca3de"},"schema_version":"1.0"},"canonical_sha256":"b510f7061e62614bf0c8c60c8fdd4731315287e4d63b2ea47b7e549359b72ed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:35.707020Z","signature_b64":"thNsEvsEw1Ro6GpzPDjIOPG/gyyahLYBKwvIl+ULUxv6MKnXZu44oSeytbKh/GTDpqCEsa6+wrLH7ofPTtCwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b510f7061e62614bf0c8c60c8fdd4731315287e4d63b2ea47b7e549359b72ed6","last_reissued_at":"2026-05-18T03:34:35.706430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:35.706430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1005","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-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6Iyt0yEicOiu5gRawn6H5qj+rB0+j7g2ppZvtC8nETSGTqKJ5HKP+Qj6Hp+PVSti1jgqf1qL3ZQQ+ge3fNWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:34:29.901847Z"},"content_sha256":"f8754f929b7d9aea2688d5c3da9e054b6516df040feff1b206b408288d17bb23","schema_version":"1.0","event_id":"sha256:f8754f929b7d9aea2688d5c3da9e054b6516df040feff1b206b408288d17bb23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WUIPOBQ6MJQUX4GIYYGI7XKHGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"cs.CV","authors_text":"Ehsan Elhamifar, Rene Vidal","submitted_at":"2012-03-05T18:58:32Z","abstract_excerpt":"In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we propose and study an algorithm, called Sparse Subspace Clustering (SSC), to cluster data points that lie in a union of low-dimensional subspaces. The key idea is that, among infinitely many possible representations of a data point in terms of other points, a sparse representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1005","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-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgyRkUpctgokM3Bi1LfN9AmfQF0Oxz1OW1/qg+2FPP2yCTfhkVvc9uanQ9lC2rCRqwWnia+Fm/qIrRWJw3jADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:34:29.902524Z"},"content_sha256":"4870dc45363d88182f89da67b49699c80c8debdae439f4a9d6ac2ab1625095d3","schema_version":"1.0","event_id":"sha256:4870dc45363d88182f89da67b49699c80c8debdae439f4a9d6ac2ab1625095d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/bundle.json","state_url":"https://pith.science/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/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-30T06:34:29Z","links":{"resolver":"https://pith.science/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE","bundle":"https://pith.science/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/bundle.json","state":"https://pith.science/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUIPOBQ6MJQUX4GIYYGI7XKHGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WUIPOBQ6MJQUX4GIYYGI7XKHGE","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":"e2a3600d42f7749e6efc905e71ac0bbea161adfdf00944abc770f665598ca3de","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-05T18:58:32Z","title_canon_sha256":"bb2da1f33720dd5755af49cb0b76db5fab2c2096dbb4a45b782e8fb7a64c94ce"},"schema_version":"1.0","source":{"id":"1203.1005","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1005","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1005v3","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1005","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUIPOBQ6MJQU","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WUIPOBQ6MJQUX4GI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WUIPOBQ6","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:4870dc45363d88182f89da67b49699c80c8debdae439f4a9d6ac2ab1625095d3","target":"graph","created_at":"2026-05-18T03:34:35Z","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 many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we propose and study an algorithm, called Sparse Subspace Clustering (SSC), to cluster data points that lie in a union of low-dimensional subspaces. The key idea is that, among infinitely many possible representations of a data point in terms of other points, a sparse representatio","authors_text":"Ehsan Elhamifar, Rene Vidal","cross_cats":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-05T18:58:32Z","title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1005","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:f8754f929b7d9aea2688d5c3da9e054b6516df040feff1b206b408288d17bb23","target":"record","created_at":"2026-05-18T03:34:35Z","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":"e2a3600d42f7749e6efc905e71ac0bbea161adfdf00944abc770f665598ca3de","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-05T18:58:32Z","title_canon_sha256":"bb2da1f33720dd5755af49cb0b76db5fab2c2096dbb4a45b782e8fb7a64c94ce"},"schema_version":"1.0","source":{"id":"1203.1005","kind":"arxiv","version":3}},"canonical_sha256":"b510f7061e62614bf0c8c60c8fdd4731315287e4d63b2ea47b7e549359b72ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b510f7061e62614bf0c8c60c8fdd4731315287e4d63b2ea47b7e549359b72ed6","first_computed_at":"2026-05-18T03:34:35.706430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:35.706430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"thNsEvsEw1Ro6GpzPDjIOPG/gyyahLYBKwvIl+ULUxv6MKnXZu44oSeytbKh/GTDpqCEsa6+wrLH7ofPTtCwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:35.707020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1005","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8754f929b7d9aea2688d5c3da9e054b6516df040feff1b206b408288d17bb23","sha256:4870dc45363d88182f89da67b49699c80c8debdae439f4a9d6ac2ab1625095d3"],"state_sha256":"71ba5d9f2d8adaef0105e96485c43971212b1fa2fb42a2f5885100b04ecefb1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2H9AbgExhFoNR/M/bIRfQcJn3/MIipbzc+tO3wtwscp7nSw5GSperOXc/R24g4mJNNifvRXgaPZBh2kGGqVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:34:29.906227Z","bundle_sha256":"cfeb0acd4e69d947dd023e074b2737b24b2ebb0f5c95beb496280b64b0294d5b"}}