{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JA7TZLGAN5GLYA3SHASNY35X7V","short_pith_number":"pith:JA7TZLGA","canonical_record":{"source":{"id":"1303.4778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-19T22:17:20Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"7dbbd31212ac9c0fa6431f175504f336c1ab7f038696f2d85baa48d69fc7387a","abstract_canon_sha256":"35553ca09007a32f38fa8716afc260aa496f282266749b6167f3000048b3c23d"},"schema_version":"1.0"},"canonical_sha256":"483f3cacc06f4cbc03723824dc6fb7fd75b5146ce0693c81404feb17bd5236b7","source":{"kind":"arxiv","id":"1303.4778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4778","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4778v2","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4778","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"JA7TZLGAN5GL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JA7TZLGAN5GLYA3S","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JA7TZLGA","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JA7TZLGAN5GLYA3SHASNY35X7V","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-19T22:17:20Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"7dbbd31212ac9c0fa6431f175504f336c1ab7f038696f2d85baa48d69fc7387a","abstract_canon_sha256":"35553ca09007a32f38fa8716afc260aa496f282266749b6167f3000048b3c23d"},"schema_version":"1.0"},"canonical_sha256":"483f3cacc06f4cbc03723824dc6fb7fd75b5146ce0693c81404feb17bd5236b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.107601Z","signature_b64":"XPuUzAf8J1+jFHvkkQlzbcX6ofnGiwR0WZVxwk0J5+AjpjzDm15nrYWsFVtnoOEVn8Mu1Ro7w8wv1hnV4dMxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"483f3cacc06f4cbc03723824dc6fb7fd75b5146ce0693c81404feb17bd5236b7","last_reissued_at":"2026-05-18T01:01:09.107010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.107010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4778","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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8r+MMPIeVoiZto0xsNpAb+XHMB2+qRBLsHlBvynSSTL1AKRUzax3Ne23/p6SglLF4bNmXYnoLZgXBAqA5ZIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:50.180806Z"},"content_sha256":"7f7a45c5a5322de82a4a8da4a74d437766af9439c4943fd110685860d793a33a","schema_version":"1.0","event_id":"sha256:7f7a45c5a5322de82a4a8da4a74d437766af9439c4943fd110685860d793a33a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JA7TZLGAN5GLYA3SHASNY35X7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Feature Selection for Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aswin C. Sankaranarayanan, Eva L. Dyer, Richard G. Baraniuk","submitted_at":"2013-03-19T22:17:20Z","abstract_excerpt":"Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same subspace must be identified in order to obtain accurate estimates of the subspace structures present in the data. Recently, sparse recovery methods have been shown to provide a provable and robust strategy for exact feature selection (EFS)--recovering subsets of points from the ensemble that live in the same subspace. In parallel with recent studies of EFS with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4778","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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNToOL7e2LnIiQft6I1X9xJ9Figrj5+z6o3Rj6awwYEkrpHt9prPNY8YRrufgwsHN3IJqVOflU7+CEkUqdgjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:50.181150Z"},"content_sha256":"073cc89fec42df360205fc3a40655a8cc953a25a32cf05fa00b4e53d298fd37b","schema_version":"1.0","event_id":"sha256:073cc89fec42df360205fc3a40655a8cc953a25a32cf05fa00b4e53d298fd37b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA7TZLGAN5GLYA3SHASNY35X7V/bundle.json","state_url":"https://pith.science/pith/JA7TZLGAN5GLYA3SHASNY35X7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA7TZLGAN5GLYA3SHASNY35X7V/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-30T05:08:50Z","links":{"resolver":"https://pith.science/pith/JA7TZLGAN5GLYA3SHASNY35X7V","bundle":"https://pith.science/pith/JA7TZLGAN5GLYA3SHASNY35X7V/bundle.json","state":"https://pith.science/pith/JA7TZLGAN5GLYA3SHASNY35X7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA7TZLGAN5GLYA3SHASNY35X7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JA7TZLGAN5GLYA3SHASNY35X7V","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":"35553ca09007a32f38fa8716afc260aa496f282266749b6167f3000048b3c23d","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-19T22:17:20Z","title_canon_sha256":"7dbbd31212ac9c0fa6431f175504f336c1ab7f038696f2d85baa48d69fc7387a"},"schema_version":"1.0","source":{"id":"1303.4778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4778","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4778v2","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4778","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"JA7TZLGAN5GL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JA7TZLGAN5GLYA3S","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JA7TZLGA","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:073cc89fec42df360205fc3a40655a8cc953a25a32cf05fa00b4e53d298fd37b","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same subspace must be identified in order to obtain accurate estimates of the subspace structures present in the data. Recently, sparse recovery methods have been shown to provide a provable and robust strategy for exact feature selection (EFS)--recovering subsets of points from the ensemble that live in the same subspace. In parallel with recent studies of EFS with","authors_text":"Aswin C. Sankaranarayanan, Eva L. Dyer, Richard G. Baraniuk","cross_cats":["math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-19T22:17:20Z","title":"Greedy Feature Selection for Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4778","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:7f7a45c5a5322de82a4a8da4a74d437766af9439c4943fd110685860d793a33a","target":"record","created_at":"2026-05-18T01:01:09Z","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":"35553ca09007a32f38fa8716afc260aa496f282266749b6167f3000048b3c23d","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-19T22:17:20Z","title_canon_sha256":"7dbbd31212ac9c0fa6431f175504f336c1ab7f038696f2d85baa48d69fc7387a"},"schema_version":"1.0","source":{"id":"1303.4778","kind":"arxiv","version":2}},"canonical_sha256":"483f3cacc06f4cbc03723824dc6fb7fd75b5146ce0693c81404feb17bd5236b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"483f3cacc06f4cbc03723824dc6fb7fd75b5146ce0693c81404feb17bd5236b7","first_computed_at":"2026-05-18T01:01:09.107010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.107010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XPuUzAf8J1+jFHvkkQlzbcX6ofnGiwR0WZVxwk0J5+AjpjzDm15nrYWsFVtnoOEVn8Mu1Ro7w8wv1hnV4dMxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.107601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f7a45c5a5322de82a4a8da4a74d437766af9439c4943fd110685860d793a33a","sha256:073cc89fec42df360205fc3a40655a8cc953a25a32cf05fa00b4e53d298fd37b"],"state_sha256":"8c66c6c8bb9499fdd53e3cf4b86f79a5f7fc4dff1c1fe55b14075b3fbd7e2bf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEt4tWE/BA4wunYHRw5eTp5YXytZ5hkCvJAikQ4Knw3Rz5X/xGLMlTmLgv9TFXlcW0nNJtrpKDo3rNlZTeRsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:08:50.183183Z","bundle_sha256":"d7df4ae4a717a7655ebcf06d13acb43c493056ae593a3409a72b1dcb924eceb8"}}