{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BHY7SPUPHQNYMNGVYUGK27OPJ3","short_pith_number":"pith:BHY7SPUP","canonical_record":{"source":{"id":"1301.2603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-11T21:05:23Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"c71bfd020841f66b5acdb0c72262c0d10ca88bde7fb8d5a1ee0cb3cfc042f426","abstract_canon_sha256":"1ae58c649477d8e45cb8d4a6fb18a1a75f2608446e509420c55eb94ffcbf5de8"},"schema_version":"1.0"},"canonical_sha256":"09f1f93e8f3c1b8634d5c50cad7dcf4ec9827d23d74970d11ddb9a93b4d4ab02","source":{"kind":"arxiv","id":"1301.2603","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2603","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2603v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2603","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"BHY7SPUPHQNY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BHY7SPUPHQNYMNGV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BHY7SPUP","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BHY7SPUPHQNYMNGVYUGK27OPJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-11T21:05:23Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"c71bfd020841f66b5acdb0c72262c0d10ca88bde7fb8d5a1ee0cb3cfc042f426","abstract_canon_sha256":"1ae58c649477d8e45cb8d4a6fb18a1a75f2608446e509420c55eb94ffcbf5de8"},"schema_version":"1.0"},"canonical_sha256":"09f1f93e8f3c1b8634d5c50cad7dcf4ec9827d23d74970d11ddb9a93b4d4ab02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:15.197878Z","signature_b64":"5GvSidOVymseHR5mbTHJYGkbtfnTnprP9F90/4p8xG0RFD+rwezdWD41maqNB0SMY4E1m3oi3RHLvW6qFUF3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f1f93e8f3c1b8634d5c50cad7dcf4ec9827d23d74970d11ddb9a93b4d4ab02","last_reissued_at":"2026-05-18T02:51:15.197412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:15.197412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2603","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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnFQmxHWu/+fj53oEU3wgi6F4TGsqureeQMi7mQJlYhlOaox2rkM6TH++lbM0cJyLOm6MIkBuVcEr2IzrklVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:13:51.010943Z"},"content_sha256":"83267f5271e7a7e8ca98ea8cf2f9785bc1109d1fbcf614d9ebe97eb86333ea8e","schema_version":"1.0","event_id":"sha256:83267f5271e7a7e8ca98ea8cf2f9785bc1109d1fbcf614d9ebe97eb86333ea8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BHY7SPUPHQNYMNGVYUGK27OPJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust subspace clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ehsan Elhamifar, Emmanuel J. Cand\\`es, Mahdi Soltanolkotabi","submitted_at":"2013-01-11T21:05:23Z","abstract_excerpt":"Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790-2797] to cluster noisy data, and develops some novel theory demonstrating its correctness. In particular, the theory uses ideas from geometric functional analysis to show that the algorithm can accurately recover the underlying subspaces under minimal requirements on their orientat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2603","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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8R8UkOQnFiEvXDFJ5SOomE+BGx4XpAlsbQT/9jkda6rlhlCUc2zfQSy9M7MfCBdf6Lu+phza1LqyZgc7kOFiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:13:51.011300Z"},"content_sha256":"959669591237cab02e919ccaf6360d3a665add69ca01ec39bf02cf71a6cca69b","schema_version":"1.0","event_id":"sha256:959669591237cab02e919ccaf6360d3a665add69ca01ec39bf02cf71a6cca69b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/bundle.json","state_url":"https://pith.science/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/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-06-01T11:13:51Z","links":{"resolver":"https://pith.science/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3","bundle":"https://pith.science/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/bundle.json","state":"https://pith.science/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHY7SPUPHQNYMNGVYUGK27OPJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BHY7SPUPHQNYMNGVYUGK27OPJ3","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":"1ae58c649477d8e45cb8d4a6fb18a1a75f2608446e509420c55eb94ffcbf5de8","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-11T21:05:23Z","title_canon_sha256":"c71bfd020841f66b5acdb0c72262c0d10ca88bde7fb8d5a1ee0cb3cfc042f426"},"schema_version":"1.0","source":{"id":"1301.2603","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2603","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2603v3","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2603","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"BHY7SPUPHQNY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BHY7SPUPHQNYMNGV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BHY7SPUP","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:959669591237cab02e919ccaf6360d3a665add69ca01ec39bf02cf71a6cca69b","target":"graph","created_at":"2026-05-18T02:51:15Z","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":"Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790-2797] to cluster noisy data, and develops some novel theory demonstrating its correctness. In particular, the theory uses ideas from geometric functional analysis to show that the algorithm can accurately recover the underlying subspaces under minimal requirements on their orientat","authors_text":"Ehsan Elhamifar, Emmanuel J. Cand\\`es, Mahdi Soltanolkotabi","cross_cats":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-11T21:05:23Z","title":"Robust subspace clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2603","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:83267f5271e7a7e8ca98ea8cf2f9785bc1109d1fbcf614d9ebe97eb86333ea8e","target":"record","created_at":"2026-05-18T02:51:15Z","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":"1ae58c649477d8e45cb8d4a6fb18a1a75f2608446e509420c55eb94ffcbf5de8","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-11T21:05:23Z","title_canon_sha256":"c71bfd020841f66b5acdb0c72262c0d10ca88bde7fb8d5a1ee0cb3cfc042f426"},"schema_version":"1.0","source":{"id":"1301.2603","kind":"arxiv","version":3}},"canonical_sha256":"09f1f93e8f3c1b8634d5c50cad7dcf4ec9827d23d74970d11ddb9a93b4d4ab02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09f1f93e8f3c1b8634d5c50cad7dcf4ec9827d23d74970d11ddb9a93b4d4ab02","first_computed_at":"2026-05-18T02:51:15.197412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:15.197412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GvSidOVymseHR5mbTHJYGkbtfnTnprP9F90/4p8xG0RFD+rwezdWD41maqNB0SMY4E1m3oi3RHLvW6qFUF3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:15.197878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2603","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83267f5271e7a7e8ca98ea8cf2f9785bc1109d1fbcf614d9ebe97eb86333ea8e","sha256:959669591237cab02e919ccaf6360d3a665add69ca01ec39bf02cf71a6cca69b"],"state_sha256":"70c09f5c14367bf810718db44f317d6967166a10e277938088de0d9e754b7b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfQp/hF8wsNCPUN2xL3wrfrHVQlsVTRmM0DcJP20/rEIlRn4UQCuXcG5rPNO7+oXlUF49WDtEPXjp1TPEufcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:13:51.013448Z","bundle_sha256":"7e7d5ed847c0c46b3026b77056ddd292f2ec7eaf79f9aec5611442afabe54402"}}