{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HDHSOC565CXSJGAUQJS53CSTKD","short_pith_number":"pith:HDHSOC56","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"},"canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","source":{"kind":"arxiv","id":"1412.7260","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7260","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7260v2","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7260","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"pith_short_12","alias_value":"HDHSOC565CXS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDHSOC565CXSJGAU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDHSOC56","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HDHSOC565CXSJGAUQJS53CSTKD","target":"record","payload":{"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"},"canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","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"},"source_kind":"arxiv","source_id":"1412.7260","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9vUiyyhB2Ikzrmzj8YQzXdGMTku/nIzlzxFQXboxHqmf7UKAsGB8dQvUgvPoMj1oaZLUMqBpD+zdydQnkiJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:50:37.148852Z"},"content_sha256":"0e2cc73e00fa8221a03e38bdb39ff1c13e3822cd04ecd77b61d275e8b2ce9406","schema_version":"1.0","event_id":"sha256:0e2cc73e00fa8221a03e38bdb39ff1c13e3822cd04ecd77b61d275e8b2ce9406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HDHSOC565CXSJGAUQJS53CSTKD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiV2twbrNeuYI/W2zFwPJARf4zfTHYILrt8ggktD+vJjjdO8lL29cP4koNOeH0S3DU54Fag6ai4Y7M64YnovDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:50:37.149514Z"},"content_sha256":"b8282b230f7db8537aa5837e40cb412b27880a860495d90d030b6907e1301b9c","schema_version":"1.0","event_id":"sha256:b8282b230f7db8537aa5837e40cb412b27880a860495d90d030b6907e1301b9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/bundle.json","state_url":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDHSOC565CXSJGAUQJS53CSTKD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T18:50:37Z","links":{"resolver":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD","bundle":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/bundle.json","state":"https://pith.science/pith/HDHSOC565CXSJGAUQJS53CSTKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDHSOC565CXSJGAUQJS53CSTKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HDHSOC565CXSJGAUQJS53CSTKD","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":"822030c844e395a62201eab8435d49829d0a805e75f272d02ba3da1fffc90289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-23T06:10:34Z","title_canon_sha256":"6c6537a4e586eebce1f05b05e060866c84b91687e39e1a8f01c3231231f12d8e"},"schema_version":"1.0","source":{"id":"1412.7260","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7260","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7260v2","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7260","created_at":"2026-05-18T01:20:53Z"},{"alias_kind":"pith_short_12","alias_value":"HDHSOC565CXS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDHSOC565CXSJGAU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDHSOC56","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:b8282b230f7db8537aa5837e40cb412b27880a860495d90d030b6907e1301b9c","target":"graph","created_at":"2026-05-18T01:20: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":"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","authors_text":"Ehsan Elhamifar, Mahdi Soltanolkotabi, Shankar Sastry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-23T06:10:34Z","title":"Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\\ell_1$-Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7260","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:0e2cc73e00fa8221a03e38bdb39ff1c13e3822cd04ecd77b61d275e8b2ce9406","target":"record","created_at":"2026-05-18T01:20: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":"822030c844e395a62201eab8435d49829d0a805e75f272d02ba3da1fffc90289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-23T06:10:34Z","title_canon_sha256":"6c6537a4e586eebce1f05b05e060866c84b91687e39e1a8f01c3231231f12d8e"},"schema_version":"1.0","source":{"id":"1412.7260","kind":"arxiv","version":2}},"canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38cf270bbee8af2498148265dd8a5350c47173ddb4cb85e265cdbd482aef4978","first_computed_at":"2026-05-18T01:20:53.962695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:53.962695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fAOXsiLUWwID9YYAyLs1LBhIz9E3hYx+LBvJX++EO9gi/uApu3VuTskP02eb4FXeqpyyBLekJ3NF1SV7eT6DAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:53.963302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7260","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e2cc73e00fa8221a03e38bdb39ff1c13e3822cd04ecd77b61d275e8b2ce9406","sha256:b8282b230f7db8537aa5837e40cb412b27880a860495d90d030b6907e1301b9c"],"state_sha256":"63e5177b1b07267f5849422fa6d18e85637c543f20f8282679ff6afc058414d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TElp9CxCg3qcClwe7Htic3NlcPhC+kcrplfmkEzTBA5yRDtVOPOufAls+1tAmKvi+tWcGNKndIJV9oblE4G+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:50:37.152929Z","bundle_sha256":"ad2f6b6da000918b4bacc3b0c21a44c4a1e10e6ba57aa52de5c18e86e0712bc4"}}