{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AF6Y7DOH7YNFCUSN5ABMYR5DGJ","short_pith_number":"pith:AF6Y7DOH","schema_version":"1.0","canonical_sha256":"017d8f8dc7fe1a51524de802cc47a3324be34421207e215550d5fdd2f07f472a","source":{"kind":"arxiv","id":"1009.3525","version":1},"attestation_state":"computed","paper":{"title":"Analyzing Weighted $\\ell_1$ Minimization for Sparse Recovery with Nonuniform Sparse Models\\footnote{The results of this paper were presented in part at the International Symposium on Information Theory, ISIT 2009}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Babak Hassibi, M. Amin Khajehnejad, Weiyu Xu","submitted_at":"2010-09-18T00:57:12Z","abstract_excerpt":"In this paper we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted $\\ell_1$ minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted $\\ell_1$ minimization recovery algorithm and analyze its performance using a Grassmann angle approach. We compute explicitly the relationship between the system parameters-the weights, the number of measurements, the size of the two sets, the probabiliti"},"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":"1009.3525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-18T00:57:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"696f4d9fb3dcd09a5973c52c501f2b883bd0da73297bfa0fe3f701ede0e487d6","abstract_canon_sha256":"67e2bad81bfaa26b6027449af848a3b5c0d647c500ba872f8bbf3714b4fe6a64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:44.708779Z","signature_b64":"mLa89It3Cw6RzjROH2R2sOpPtLYDRBtCXAj/tR+N10YGOpENeYK/zikgL7SFwMIFW0B6Ud2/X0hJBJmCwlXuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017d8f8dc7fe1a51524de802cc47a3324be34421207e215550d5fdd2f07f472a","last_reissued_at":"2026-05-18T04:40:44.708112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:44.708112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing Weighted $\\ell_1$ Minimization for Sparse Recovery with Nonuniform Sparse Models\\footnote{The results of this paper were presented in part at the International Symposium on Information Theory, ISIT 2009}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Babak Hassibi, M. Amin Khajehnejad, Weiyu Xu","submitted_at":"2010-09-18T00:57:12Z","abstract_excerpt":"In this paper we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted $\\ell_1$ minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted $\\ell_1$ minimization recovery algorithm and analyze its performance using a Grassmann angle approach. We compute explicitly the relationship between the system parameters-the weights, the number of measurements, the size of the two sets, the probabiliti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3525","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":"1009.3525","created_at":"2026-05-18T04:40:44.708236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3525v1","created_at":"2026-05-18T04:40:44.708236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3525","created_at":"2026-05-18T04:40:44.708236+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF6Y7DOH7YNF","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF6Y7DOH7YNFCUSN","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF6Y7DOH","created_at":"2026-05-18T12:26:05.355336+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/AF6Y7DOH7YNFCUSN5ABMYR5DGJ","json":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ.json","graph_json":"https://pith.science/api/pith-number/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/graph.json","events_json":"https://pith.science/api/pith-number/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/events.json","paper":"https://pith.science/paper/AF6Y7DOH"},"agent_actions":{"view_html":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ","download_json":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ.json","view_paper":"https://pith.science/paper/AF6Y7DOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3525&json=true","fetch_graph":"https://pith.science/api/pith-number/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/action/storage_attestation","attest_author":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/action/author_attestation","sign_citation":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/action/citation_signature","submit_replication":"https://pith.science/pith/AF6Y7DOH7YNFCUSN5ABMYR5DGJ/action/replication_record"}},"created_at":"2026-05-18T04:40:44.708236+00:00","updated_at":"2026-05-18T04:40:44.708236+00:00"}