{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UF66LCK6LG4LCNNUHVNOGDTXNU","short_pith_number":"pith:UF66LCK6","schema_version":"1.0","canonical_sha256":"a17de5895e59b8b135b43d5ae30e776d334b753ef11d9c91553ffe7ebb128a7f","source":{"kind":"arxiv","id":"1507.01238","version":3},"attestation_state":"computed","paper":{"title":"Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong You, Daniel P. Robinson, Rene Vidal","submitted_at":"2015-07-05T16:29:31Z","abstract_excerpt":"Subspace clustering methods based on $\\ell_1$, $\\ell_2$ or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, $\\ell_1$ regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from different subspaces) under broad conditions (e.g., arbitrary subspaces and corrupted data). However, it requires solving a large scale convex optimization problem. On the other hand, $\\ell_2"},"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":"1507.01238","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-05T16:29:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"39bf11f9b73f0f37b3fd2cbeb2cebc2b3a10db66cfe821bbb1b144b3cd03942e","abstract_canon_sha256":"dff36238d4375bcf730f03828c01fb7f3a39af6836c8c87dcc7a0eb9462121d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:32.509159Z","signature_b64":"UZDg7hYUZP6aHuFwmwsZVLXJwjIuj8ZPyIdK9WARWDrSIZ8oO5/JBK6rd+35L0I55oYkaUZtfScNreSSpq+EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17de5895e59b8b135b43d5ae30e776d334b753ef11d9c91553ffe7ebb128a7f","last_reissued_at":"2026-05-18T01:15:32.508551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:32.508551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong You, Daniel P. Robinson, Rene Vidal","submitted_at":"2015-07-05T16:29:31Z","abstract_excerpt":"Subspace clustering methods based on $\\ell_1$, $\\ell_2$ or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, $\\ell_1$ regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from different subspaces) under broad conditions (e.g., arbitrary subspaces and corrupted data). However, it requires solving a large scale convex optimization problem. On the other hand, $\\ell_2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01238","kind":"arxiv","version":3},"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":"1507.01238","created_at":"2026-05-18T01:15:32.508647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01238v3","created_at":"2026-05-18T01:15:32.508647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01238","created_at":"2026-05-18T01:15:32.508647+00:00"},{"alias_kind":"pith_short_12","alias_value":"UF66LCK6LG4L","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UF66LCK6LG4LCNNU","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UF66LCK6","created_at":"2026-05-18T12:29:44.643036+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/UF66LCK6LG4LCNNUHVNOGDTXNU","json":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU.json","graph_json":"https://pith.science/api/pith-number/UF66LCK6LG4LCNNUHVNOGDTXNU/graph.json","events_json":"https://pith.science/api/pith-number/UF66LCK6LG4LCNNUHVNOGDTXNU/events.json","paper":"https://pith.science/paper/UF66LCK6"},"agent_actions":{"view_html":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU","download_json":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU.json","view_paper":"https://pith.science/paper/UF66LCK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01238&json=true","fetch_graph":"https://pith.science/api/pith-number/UF66LCK6LG4LCNNUHVNOGDTXNU/graph.json","fetch_events":"https://pith.science/api/pith-number/UF66LCK6LG4LCNNUHVNOGDTXNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU/action/storage_attestation","attest_author":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU/action/author_attestation","sign_citation":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU/action/citation_signature","submit_replication":"https://pith.science/pith/UF66LCK6LG4LCNNUHVNOGDTXNU/action/replication_record"}},"created_at":"2026-05-18T01:15:32.508647+00:00","updated_at":"2026-05-18T01:15:32.508647+00:00"}