{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EE3TZZL3SZLBKI2NOIA3GRBGUX","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":"c118d4ccd537ad77c141971fbb8510078fa4db7c1debd97a20c7fdf4831838f2","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-31T22:05:47Z","title_canon_sha256":"136698c3c14b39296cc1b43688f416c1a7ed2d64e5b49d85d86f387e002f338a"},"schema_version":"1.0","source":{"id":"1711.00126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00126","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00126v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00126","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"EE3TZZL3SZLB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EE3TZZL3SZLBKI2N","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EE3TZZL3","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:537ee3d3d4324331c4c57e866c87d1559d97544953ea88408af9598fc986441a","target":"graph","created_at":"2026-05-18T00:31: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":"State-of-the-art algorithms for sparse subspace clustering perform spectral clustering on a similarity matrix typically obtained by representing each data point as a sparse combination of other points using either basis pursuit (BP) or orthogonal matching pursuit (OMP). BP-based methods are often prohibitive in practice while the performance of OMP-based schemes are unsatisfactory, especially in settings where data points are highly similar. In this paper, we propose a novel algorithm that exploits an accelerated variant of orthogonal least-squares to efficiently find the underlying subspaces.","authors_text":"Abolfazl Hashemi, Haris Vikalo","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-31T22:05:47Z","title":"Accelerated Sparse Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00126","kind":"arxiv","version":1},"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:fe3850bcb6a317f65b7056272e7ec67e7eb5ce0e7475ad8f70d9de90769d70a6","target":"record","created_at":"2026-05-18T00:31: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":"c118d4ccd537ad77c141971fbb8510078fa4db7c1debd97a20c7fdf4831838f2","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-31T22:05:47Z","title_canon_sha256":"136698c3c14b39296cc1b43688f416c1a7ed2d64e5b49d85d86f387e002f338a"},"schema_version":"1.0","source":{"id":"1711.00126","kind":"arxiv","version":1}},"canonical_sha256":"21373ce57b965615234d7201b34426a5f7353829c1a3fbdc48e7f55a049bd55f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21373ce57b965615234d7201b34426a5f7353829c1a3fbdc48e7f55a049bd55f","first_computed_at":"2026-05-18T00:31:35.128385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.128385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"98Metr2gWJ21lft7tmHZo6O5JiBfl+gj51VaKTZmMgFral2Yc7mwb/VDSQzFahYDMSvcJ5zyYUB7BPj7LnnqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.128882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe3850bcb6a317f65b7056272e7ec67e7eb5ce0e7475ad8f70d9de90769d70a6","sha256:537ee3d3d4324331c4c57e866c87d1559d97544953ea88408af9598fc986441a"],"state_sha256":"ddefeff89ceebaeaf9c3244a4b62941f5fd09cc8faba951f6c0007896365178b"}