{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HDHSOC565CXSJGAUQJS53CSTKD","short_pith_number":"pith:HDHSOC56","schema_version":"1.0","canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","source":{"kind":"arxiv","id":"1412.7260","version":2},"attestation_state":"computed","paper":{"title":"Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\\ell_1$-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ehsan Elhamifar, Mahdi Soltanolkotabi, Shankar Sastry","submitted_at":"2014-12-23T06:10:34Z","abstract_excerpt":"High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to. Finding sparse representations of data points in a dictionary built using the collection of data helps to uncover low-dimensional subspaces and address problems such as clustering, classification, subset selection and more. In this paper, we address the problem of recovering sparse representations for noisy data points in a dictionary whose columns correspond to corrupted data lying close to a union of subspaces. We consider a constrained $\\ell_1$-minimization and study conditions un"},"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":"1412.7260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-23T06:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"6c6537a4e586eebce1f05b05e060866c84b91687e39e1a8f01c3231231f12d8e","abstract_canon_sha256":"822030c844e395a62201eab8435d49829d0a805e75f272d02ba3da1fffc90289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:53.963302Z","signature_b64":"fAOXsiLUWwID9YYAyLs1LBhIz9E3hYx+LBvJX++EO9gi/uApu3VuTskP02eb4FXeqpyyBLekJ3NF1SV7eT6DAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","last_reissued_at":"2026-05-18T01:20:53.962695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:53.962695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\\ell_1$-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ehsan Elhamifar, Mahdi Soltanolkotabi, Shankar Sastry","submitted_at":"2014-12-23T06:10:34Z","abstract_excerpt":"High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to. Finding sparse representations of data points in a dictionary built using the collection of data helps to uncover low-dimensional subspaces and address problems such as clustering, classification, subset selection and more. In this paper, we address the problem of recovering sparse representations for noisy data points in a dictionary whose columns correspond to corrupted data lying close to a union of subspaces. We consider a constrained $\\ell_1$-minimization and study conditions un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7260","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.7260","created_at":"2026-05-18T01:20:53.962791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7260v2","created_at":"2026-05-18T01:20:53.962791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7260","created_at":"2026-05-18T01:20:53.962791+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDHSOC565CXS","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDHSOC565CXSJGAU","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDHSOC56","created_at":"2026-05-18T12:28:30.664211+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/HDHSOC565CXSJGAUQJS53CSTKD","json":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD.json","graph_json":"https://pith.science/api/pith-number/HDHSOC565CXSJGAUQJS53CSTKD/graph.json","events_json":"https://pith.science/api/pith-number/HDHSOC565CXSJGAUQJS53CSTKD/events.json","paper":"https://pith.science/paper/HDHSOC56"},"agent_actions":{"view_html":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD","download_json":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD.json","view_paper":"https://pith.science/paper/HDHSOC56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7260&json=true","fetch_graph":"https://pith.science/api/pith-number/HDHSOC565CXSJGAUQJS53CSTKD/graph.json","fetch_events":"https://pith.science/api/pith-number/HDHSOC565CXSJGAUQJS53CSTKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/action/storage_attestation","attest_author":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/action/author_attestation","sign_citation":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/action/citation_signature","submit_replication":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/action/replication_record"}},"created_at":"2026-05-18T01:20:53.962791+00:00","updated_at":"2026-05-18T01:20:53.962791+00:00"}