{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YE5QC3RWEEVXLPIEG3LQVUKTWJ","short_pith_number":"pith:YE5QC3RW","schema_version":"1.0","canonical_sha256":"c13b016e36212b75bd0436d70ad153b2747f9c341fd2a2c3eecd601f01e05d19","source":{"kind":"arxiv","id":"1304.6232","version":1},"attestation_state":"computed","paper":{"title":"L2/L2-foreach sparse recovery with low risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Atri Rudra, Ely Porat, Hung Q. Ngo, Martin J. Strauss","submitted_at":"2013-04-23T11:00:45Z","abstract_excerpt":"In this paper, we consider the \"foreach\" sparse recovery problem with failure probability $p$. The goal of which is to design a distribution over $m \\times N$ matrices $\\Phi$ and a decoding algorithm $\\algo$ such that for every $\\vx\\in\\R^N$, we have the following error guarantee with probability at least $1-p$ \\[\\|\\vx-\\algo(\\Phi\\vx)\\|_2\\le C\\|\\vx-\\vx_k\\|_2,\\] where $C$ is a constant (ideally arbitrarily close to 1) and $\\vx_k$ is the best $k$-sparse approximation of $\\vx$.\n  Much of the sparse recovery or compressive sensing literature has focused on the case of either $p = 0$ or $p = \\Omega(1"},"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":"1304.6232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T11:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"8e76a63b45cd4d1a0d74313b1fa292e0f4fcae8fcd25770ecc3792d40533e52f","abstract_canon_sha256":"4c4cee42773fa102e98838fc7f7a54ea9d3df1778d464bb21cad84692a4854ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:22.028136Z","signature_b64":"6/dn8dWcVA8aAt/N8iSXY+gmIDEWSi6Xk2zjR4D/jMhbidJXOZCuME5wNfz/oj9/CeFfqqxp57Q5kPr6F8U4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13b016e36212b75bd0436d70ad153b2747f9c341fd2a2c3eecd601f01e05d19","last_reissued_at":"2026-05-18T03:27:22.027444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:22.027444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L2/L2-foreach sparse recovery with low risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna C. Gilbert, Atri Rudra, Ely Porat, Hung Q. Ngo, Martin J. Strauss","submitted_at":"2013-04-23T11:00:45Z","abstract_excerpt":"In this paper, we consider the \"foreach\" sparse recovery problem with failure probability $p$. The goal of which is to design a distribution over $m \\times N$ matrices $\\Phi$ and a decoding algorithm $\\algo$ such that for every $\\vx\\in\\R^N$, we have the following error guarantee with probability at least $1-p$ \\[\\|\\vx-\\algo(\\Phi\\vx)\\|_2\\le C\\|\\vx-\\vx_k\\|_2,\\] where $C$ is a constant (ideally arbitrarily close to 1) and $\\vx_k$ is the best $k$-sparse approximation of $\\vx$.\n  Much of the sparse recovery or compressive sensing literature has focused on the case of either $p = 0$ or $p = \\Omega(1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6232","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":"1304.6232","created_at":"2026-05-18T03:27:22.027546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6232v1","created_at":"2026-05-18T03:27:22.027546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6232","created_at":"2026-05-18T03:27:22.027546+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE5QC3RWEEVX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE5QC3RWEEVXLPIE","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE5QC3RW","created_at":"2026-05-18T12:28:06.772260+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/YE5QC3RWEEVXLPIEG3LQVUKTWJ","json":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ.json","graph_json":"https://pith.science/api/pith-number/YE5QC3RWEEVXLPIEG3LQVUKTWJ/graph.json","events_json":"https://pith.science/api/pith-number/YE5QC3RWEEVXLPIEG3LQVUKTWJ/events.json","paper":"https://pith.science/paper/YE5QC3RW"},"agent_actions":{"view_html":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ","download_json":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ.json","view_paper":"https://pith.science/paper/YE5QC3RW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6232&json=true","fetch_graph":"https://pith.science/api/pith-number/YE5QC3RWEEVXLPIEG3LQVUKTWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YE5QC3RWEEVXLPIEG3LQVUKTWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ/action/storage_attestation","attest_author":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ/action/author_attestation","sign_citation":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ/action/citation_signature","submit_replication":"https://pith.science/pith/YE5QC3RWEEVXLPIEG3LQVUKTWJ/action/replication_record"}},"created_at":"2026-05-18T03:27:22.027546+00:00","updated_at":"2026-05-18T03:27:22.027546+00:00"}