{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6W2SHPDFJ4IFIVTJLCK5OPQBT3","short_pith_number":"pith:6W2SHPDF","schema_version":"1.0","canonical_sha256":"f5b523bc654f105456695895d73e019efd180bf42687e2ca5e64d5d94febddc7","source":{"kind":"arxiv","id":"0903.4579","version":2},"attestation_state":"computed","paper":{"title":"Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Michael Elad, Yonina C. Eldar, Zvika Ben-Haim","submitted_at":"2009-03-26T13:37:09Z","abstract_excerpt":"We consider the problem of estimating a deterministic sparse vector x from underdetermined measurements Ax+w, where w represents white Gaussian noise and A is a given deterministic dictionary. We analyze the performance of three sparse estimation algorithms: basis pursuit denoising (BPDN), orthogonal matching pursuit (OMP), and thresholding. These algorithms are shown to achieve near-oracle performance with high probability, assuming that x is sufficiently sparse. Our results are non-asymptotic and are based only on the coherence of A, so that they are applicable to arbitrary dictionaries. Dif"},"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":"0903.4579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2009-03-26T13:37:09Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"7e1f90498b2dae256dbe120355679727893f34470647e47c1797c12ab90793d1","abstract_canon_sha256":"ad80a1b6c7bfcdb8a88d911855cbf6100483f0a8ca973c8f8069b5071233d842"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:25.825119Z","signature_b64":"+9nYZEwy9wGT6iXi0IjRc1k/A7rDOD5Vvh8helNE0gOVs/HOrcbQEnJMyiSCO8RHJtyz/A8Z3jhc968zkZTRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b523bc654f105456695895d73e019efd180bf42687e2ca5e64d5d94febddc7","last_reissued_at":"2026-05-18T02:14:25.824673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:25.824673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Michael Elad, Yonina C. Eldar, Zvika Ben-Haim","submitted_at":"2009-03-26T13:37:09Z","abstract_excerpt":"We consider the problem of estimating a deterministic sparse vector x from underdetermined measurements Ax+w, where w represents white Gaussian noise and A is a given deterministic dictionary. We analyze the performance of three sparse estimation algorithms: basis pursuit denoising (BPDN), orthogonal matching pursuit (OMP), and thresholding. These algorithms are shown to achieve near-oracle performance with high probability, assuming that x is sufficiently sparse. Our results are non-asymptotic and are based only on the coherence of A, so that they are applicable to arbitrary dictionaries. Dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4579","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":"0903.4579","created_at":"2026-05-18T02:14:25.824751+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.4579v2","created_at":"2026-05-18T02:14:25.824751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4579","created_at":"2026-05-18T02:14:25.824751+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W2SHPDFJ4IF","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W2SHPDFJ4IFIVTJ","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W2SHPDF","created_at":"2026-05-18T12:25:58.837520+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/6W2SHPDFJ4IFIVTJLCK5OPQBT3","json":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3.json","graph_json":"https://pith.science/api/pith-number/6W2SHPDFJ4IFIVTJLCK5OPQBT3/graph.json","events_json":"https://pith.science/api/pith-number/6W2SHPDFJ4IFIVTJLCK5OPQBT3/events.json","paper":"https://pith.science/paper/6W2SHPDF"},"agent_actions":{"view_html":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3","download_json":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3.json","view_paper":"https://pith.science/paper/6W2SHPDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.4579&json=true","fetch_graph":"https://pith.science/api/pith-number/6W2SHPDFJ4IFIVTJLCK5OPQBT3/graph.json","fetch_events":"https://pith.science/api/pith-number/6W2SHPDFJ4IFIVTJLCK5OPQBT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3/action/storage_attestation","attest_author":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3/action/author_attestation","sign_citation":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3/action/citation_signature","submit_replication":"https://pith.science/pith/6W2SHPDFJ4IFIVTJLCK5OPQBT3/action/replication_record"}},"created_at":"2026-05-18T02:14:25.824751+00:00","updated_at":"2026-05-18T02:14:25.824751+00:00"}