{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GSLF3HKWJPNRJR356CSBDBKSXT","short_pith_number":"pith:GSLF3HKW","canonical_record":{"source":{"id":"1610.05211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-17T17:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"5942e0a4b0f891c1d1930c64ed4074d6a960f9f9f565829e2c968a408b123daa","abstract_canon_sha256":"7a1b9ef9f83bab32acd0bf390f6d57703b6505ea236e28007adb2702b728949f"},"schema_version":"1.0"},"canonical_sha256":"34965d9d564bdb14c77df0a4118552bceb735da662773c5a14f33c5d2dc04f06","source":{"kind":"arxiv","id":"1610.05211","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05211","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05211v2","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05211","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"GSLF3HKWJPNR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GSLF3HKWJPNRJR35","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GSLF3HKW","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GSLF3HKWJPNRJR356CSBDBKSXT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-17T17:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"5942e0a4b0f891c1d1930c64ed4074d6a960f9f9f565829e2c968a408b123daa","abstract_canon_sha256":"7a1b9ef9f83bab32acd0bf390f6d57703b6505ea236e28007adb2702b728949f"},"schema_version":"1.0"},"canonical_sha256":"34965d9d564bdb14c77df0a4118552bceb735da662773c5a14f33c5d2dc04f06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:59.416474Z","signature_b64":"uvvt7lXJS1T9xlKOK2FcmI9JQAAevRsFyibv5i17W9RFTMJNACrMf5iRfPvoSDNVsWRtoKUMXiZW+r7DYO39Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34965d9d564bdb14c77df0a4118552bceb735da662773c5a14f33c5d2dc04f06","last_reissued_at":"2026-05-18T00:46:59.415957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:59.415957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05211","source_version":2,"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:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSS3S8vMoe173/hdxZ13KeA3P01VCBaT8cu9uuYTo15xrSsCYfZivDPXN8jyqCWFuG/MIRi/8b/Pf1BJkSmLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:35:40.812509Z"},"content_sha256":"c4986fa48f7f20c33912e80f577e9899108b550257607cbbbb880b9f1cf52309","schema_version":"1.0","event_id":"sha256:c4986fa48f7f20c33912e80f577e9899108b550257607cbbbb880b9f1cf52309"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GSLF3HKWJPNRJR356CSBDBKSXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chong You, Chun-Guang Li, Ren\\'e Vidal","submitted_at":"2016-10-17T17:08:48Z","abstract_excerpt":"Subspace clustering refers to the problem of segmenting data drawn from a union of subspaces. State-of-the-art approaches for solving this problem follow a two-stage approach. In the first step, an affinity matrix is learned from the data using sparse or low-rank minimization techniques. In the second step, the segmentation is found by applying spectral clustering to this affinity. While this approach has led to state-of-the-art results in many applications, it is sub-optimal because it does not exploit the fact that the affinity and the segmentation depend on each other. In this paper, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05211","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"},"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:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQwwt+/yBmdSPXTzp14oCuhPkh3xuKRHekzjdYOPiw5GXJNY0gFqaEylUhZxonq8JDaiVnYi71ZQlj7KNZSjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:35:40.813167Z"},"content_sha256":"e78725d34f2cc7b0172b79a3afc33a80a152935750c954ed78e18be80dceef5e","schema_version":"1.0","event_id":"sha256:e78725d34f2cc7b0172b79a3afc33a80a152935750c954ed78e18be80dceef5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSLF3HKWJPNRJR356CSBDBKSXT/bundle.json","state_url":"https://pith.science/pith/GSLF3HKWJPNRJR356CSBDBKSXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSLF3HKWJPNRJR356CSBDBKSXT/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-06T12:35:40Z","links":{"resolver":"https://pith.science/pith/GSLF3HKWJPNRJR356CSBDBKSXT","bundle":"https://pith.science/pith/GSLF3HKWJPNRJR356CSBDBKSXT/bundle.json","state":"https://pith.science/pith/GSLF3HKWJPNRJR356CSBDBKSXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSLF3HKWJPNRJR356CSBDBKSXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GSLF3HKWJPNRJR356CSBDBKSXT","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":"7a1b9ef9f83bab32acd0bf390f6d57703b6505ea236e28007adb2702b728949f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-17T17:08:48Z","title_canon_sha256":"5942e0a4b0f891c1d1930c64ed4074d6a960f9f9f565829e2c968a408b123daa"},"schema_version":"1.0","source":{"id":"1610.05211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05211","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05211v2","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05211","created_at":"2026-05-18T00:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"GSLF3HKWJPNR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GSLF3HKWJPNRJR35","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GSLF3HKW","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:e78725d34f2cc7b0172b79a3afc33a80a152935750c954ed78e18be80dceef5e","target":"graph","created_at":"2026-05-18T00:46:59Z","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 problem of segmenting data drawn from a union of subspaces. State-of-the-art approaches for solving this problem follow a two-stage approach. In the first step, an affinity matrix is learned from the data using sparse or low-rank minimization techniques. In the second step, the segmentation is found by applying spectral clustering to this affinity. While this approach has led to state-of-the-art results in many applications, it is sub-optimal because it does not exploit the fact that the affinity and the segmentation depend on each other. In this paper, we pro","authors_text":"Chong You, Chun-Guang Li, Ren\\'e Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-17T17:08:48Z","title":"Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05211","kind":"arxiv","version":2},"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:c4986fa48f7f20c33912e80f577e9899108b550257607cbbbb880b9f1cf52309","target":"record","created_at":"2026-05-18T00:46:59Z","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":"7a1b9ef9f83bab32acd0bf390f6d57703b6505ea236e28007adb2702b728949f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-17T17:08:48Z","title_canon_sha256":"5942e0a4b0f891c1d1930c64ed4074d6a960f9f9f565829e2c968a408b123daa"},"schema_version":"1.0","source":{"id":"1610.05211","kind":"arxiv","version":2}},"canonical_sha256":"34965d9d564bdb14c77df0a4118552bceb735da662773c5a14f33c5d2dc04f06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34965d9d564bdb14c77df0a4118552bceb735da662773c5a14f33c5d2dc04f06","first_computed_at":"2026-05-18T00:46:59.415957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:59.415957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uvvt7lXJS1T9xlKOK2FcmI9JQAAevRsFyibv5i17W9RFTMJNACrMf5iRfPvoSDNVsWRtoKUMXiZW+r7DYO39Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:59.416474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4986fa48f7f20c33912e80f577e9899108b550257607cbbbb880b9f1cf52309","sha256:e78725d34f2cc7b0172b79a3afc33a80a152935750c954ed78e18be80dceef5e"],"state_sha256":"3f187722531f68c8c24ebe8b0cd3e408002c0ee6494f18621c58fe6a2c4d20f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkHq/rAal6aO0F7qVt9wqcG0Ma97l2c54LbGgB3qhhcEMapPq98IXbiSeeuuGVw5S/AXe0uhMVGwJaYvduDrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:35:40.817274Z","bundle_sha256":"0cb48dd0df461861bbfd35098672adba45ea13d1657dc25b7a5c35cd28b0696e"}}