{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4A2OP255OI3AXQ6ZWNRGFJUT6Y","short_pith_number":"pith:4A2OP255","schema_version":"1.0","canonical_sha256":"e034e7ebbd72360bc3d9b36262a693f61305a0293485062a63742daec12ed5e3","source":{"kind":"arxiv","id":"1007.2354","version":2},"attestation_state":"computed","paper":{"title":"Nonuniform Sparse Recovery with Subgaussian Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Holger Rauhut, Ula\\c{s} Ayaz","submitted_at":"2010-07-14T15:19:46Z","abstract_excerpt":"Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\\ell_1$-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we focus on nonuniform recovery using Gaussian random matrices and $\\ell_1$-minimization. We provide a condition on the number of samples in terms of the sparsity and the signal length which guarantees"},"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":"1007.2354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-14T15:19:46Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"10b6b171baef62f782cb8076b3e1dbf0d2b02ccab01045a183a70ffeab6a7e99","abstract_canon_sha256":"4839dec3feddd1fce5693d6e40415c2aa81c5cceb1c7dd276df65bbf66581e59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:28.484873Z","signature_b64":"ynDA6hduYdtqxhyqaW7F0R8jXsQH+T5YO3xSwNCpwJFTy9tTO03zALxM+wWBwfJTWloteOUQEARsFW6j24JUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e034e7ebbd72360bc3d9b36262a693f61305a0293485062a63742daec12ed5e3","last_reissued_at":"2026-05-18T04:15:28.484415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:28.484415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonuniform Sparse Recovery with Subgaussian Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Holger Rauhut, Ula\\c{s} Ayaz","submitted_at":"2010-07-14T15:19:46Z","abstract_excerpt":"Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\\ell_1$-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we focus on nonuniform recovery using Gaussian random matrices and $\\ell_1$-minimization. We provide a condition on the number of samples in terms of the sparsity and the signal length which guarantees"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2354","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":"1007.2354","created_at":"2026-05-18T04:15:28.484475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2354v2","created_at":"2026-05-18T04:15:28.484475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2354","created_at":"2026-05-18T04:15:28.484475+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A2OP255OI3A","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A2OP255OI3AXQ6Z","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A2OP255","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2203.02607","citing_title":"An SDP Relaxation for the Sparse Integer Least Squares Problem","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y","json":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y.json","graph_json":"https://pith.science/api/pith-number/4A2OP255OI3AXQ6ZWNRGFJUT6Y/graph.json","events_json":"https://pith.science/api/pith-number/4A2OP255OI3AXQ6ZWNRGFJUT6Y/events.json","paper":"https://pith.science/paper/4A2OP255"},"agent_actions":{"view_html":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y","download_json":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y.json","view_paper":"https://pith.science/paper/4A2OP255","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2354&json=true","fetch_graph":"https://pith.science/api/pith-number/4A2OP255OI3AXQ6ZWNRGFJUT6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/4A2OP255OI3AXQ6ZWNRGFJUT6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y/action/storage_attestation","attest_author":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y/action/author_attestation","sign_citation":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y/action/citation_signature","submit_replication":"https://pith.science/pith/4A2OP255OI3AXQ6ZWNRGFJUT6Y/action/replication_record"}},"created_at":"2026-05-18T04:15:28.484475+00:00","updated_at":"2026-05-18T04:15:28.484475+00:00"}