{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EE3TZZL3SZLBKI2NOIA3GRBGUX","short_pith_number":"pith:EE3TZZL3","schema_version":"1.0","canonical_sha256":"21373ce57b965615234d7201b34426a5f7353829c1a3fbdc48e7f55a049bd55f","source":{"kind":"arxiv","id":"1711.00126","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2017-10-31T22:05:47Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.00126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-31T22:05:47Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"136698c3c14b39296cc1b43688f416c1a7ed2d64e5b49d85d86f387e002f338a","abstract_canon_sha256":"c118d4ccd537ad77c141971fbb8510078fa4db7c1debd97a20c7fdf4831838f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.128882Z","signature_b64":"98Metr2gWJ21lft7tmHZo6O5JiBfl+gj51VaKTZmMgFral2Yc7mwb/VDSQzFahYDMSvcJ5zyYUB7BPj7LnnqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21373ce57b965615234d7201b34426a5f7353829c1a3fbdc48e7f55a049bd55f","last_reissued_at":"2026-05-18T00:31:35.128385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.128385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abolfazl Hashemi, Haris Vikalo","submitted_at":"2017-10-31T22:05:47Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00126","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.00126","created_at":"2026-05-18T00:31:35.128463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00126v1","created_at":"2026-05-18T00:31:35.128463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00126","created_at":"2026-05-18T00:31:35.128463+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE3TZZL3SZLB","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE3TZZL3SZLBKI2N","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE3TZZL3","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX","json":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX.json","graph_json":"https://pith.science/api/pith-number/EE3TZZL3SZLBKI2NOIA3GRBGUX/graph.json","events_json":"https://pith.science/api/pith-number/EE3TZZL3SZLBKI2NOIA3GRBGUX/events.json","paper":"https://pith.science/paper/EE3TZZL3"},"agent_actions":{"view_html":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX","download_json":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX.json","view_paper":"https://pith.science/paper/EE3TZZL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00126&json=true","fetch_graph":"https://pith.science/api/pith-number/EE3TZZL3SZLBKI2NOIA3GRBGUX/graph.json","fetch_events":"https://pith.science/api/pith-number/EE3TZZL3SZLBKI2NOIA3GRBGUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX/action/storage_attestation","attest_author":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX/action/author_attestation","sign_citation":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX/action/citation_signature","submit_replication":"https://pith.science/pith/EE3TZZL3SZLBKI2NOIA3GRBGUX/action/replication_record"}},"created_at":"2026-05-18T00:31:35.128463+00:00","updated_at":"2026-05-18T00:31:35.128463+00:00"}