{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJD5I4ER2UVDHL7OJYCKTSC34W","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":"ca800477cc8a10311e92fb8508e4d77b9e7eedb5302661f5504f6fc5b19fe766","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T18:33:31Z","title_canon_sha256":"8af280805230bfca11a50c2030fc9cb8a340ab6204e69d826583fb39944da37f"},"schema_version":"1.0","source":{"id":"1612.03450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03450","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03450v2","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03450","created_at":"2026-05-18T00:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"HJD5I4ER2UVD","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJD5I4ER2UVDHL7O","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJD5I4ER","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:87dfb1089defbcb462a75ea83babbe56066fb7f8864c330b55a0725727980e2b","target":"graph","created_at":"2026-05-18T00:13:53Z","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":"Sparsity-based subspace clustering algorithms have attracted significant attention thanks to their excellent performance in practical applications. A prominent example is the sparse subspace clustering (SSC) algorithm by Elhamifar and Vidal, which performs spectral clustering based on an adjacency matrix obtained by sparsely representing each data point in terms of all the other data points via the Lasso. When the number of data points is large or the dimension of the ambient space is high, the computational complexity of SSC quickly becomes prohibitive. Dyer et al. observed that SSC-OMP obtai","authors_text":"Helmut B\\\"olcskei, Michael Tschannen","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T18:33:31Z","title":"Noisy subspace clustering via matching pursuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03450","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:1414937c2a2e21f1128e6f5aa0b76db0024ff3668a51f1f2913eac2065a1a629","target":"record","created_at":"2026-05-18T00:13:53Z","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":"ca800477cc8a10311e92fb8508e4d77b9e7eedb5302661f5504f6fc5b19fe766","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T18:33:31Z","title_canon_sha256":"8af280805230bfca11a50c2030fc9cb8a340ab6204e69d826583fb39944da37f"},"schema_version":"1.0","source":{"id":"1612.03450","kind":"arxiv","version":2}},"canonical_sha256":"3a47d47091d52a33afee4e04a9c85be5acaec3ab224f19282d7fa2d29fac708a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a47d47091d52a33afee4e04a9c85be5acaec3ab224f19282d7fa2d29fac708a","first_computed_at":"2026-05-18T00:13:53.630590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:53.630590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Q1fCXywJq2kqXLVHBGldvuQ3YJS9XzJdacDCYo+YD0lCfxJwHjneW96Ygq1haSp2RCCSp1oOUsC9QHOvdubBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:53.631338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1414937c2a2e21f1128e6f5aa0b76db0024ff3668a51f1f2913eac2065a1a629","sha256:87dfb1089defbcb462a75ea83babbe56066fb7f8864c330b55a0725727980e2b"],"state_sha256":"2499f7a5b8eb246eeda9babccddef7da0206f274f69e7aad2ebe62dc72103054"}