{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DTN5EYCXJX3MVWMFTO45K5HAC6","short_pith_number":"pith:DTN5EYCX","schema_version":"1.0","canonical_sha256":"1cdbd260574df6cad9859bb9d574e01780e2ae0c944283a6340b92d837d68629","source":{"kind":"arxiv","id":"1108.0477","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arian Maleki, Laura Anitori, Richard Baraniuk, Zai Yang","submitted_at":"2011-08-02T03:23:28Z","abstract_excerpt":"Recovering a sparse signal from an undersampled set of random linear measurements is the main problem of interest in compressed sensing. In this paper, we consider the case where both the signal and the measurements are complex. We study the popular reconstruction method of $\\ell_1$-regularized least squares or LASSO. While several studies have shown that the LASSO algorithm offers desirable solutions under certain conditions, the precise asymptotic performance of this algorithm in the complex setting is not yet known. In this paper, we extend the approximate message passing (AMP) algorithm to"},"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":"1108.0477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-02T03:23:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bee84d762a9c8aa00992bc81f7d18c1da8ea7825a6f9e2bc59abea6aa0937288","abstract_canon_sha256":"17de494385641013e3278e8746e0cf1fbd6371e837f6fe212df1390d6992e272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.504704Z","signature_b64":"U7BS4zAo3sMqH7HtSMXId5ixz4g7fpsNdUGng2fcpuHcgdK0bIyAkHd5+wCscqQKScBj91tQOS0bKJf/k4pjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cdbd260574df6cad9859bb9d574e01780e2ae0c944283a6340b92d837d68629","last_reissued_at":"2026-05-18T02:21:42.504190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.504190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arian Maleki, Laura Anitori, Richard Baraniuk, Zai Yang","submitted_at":"2011-08-02T03:23:28Z","abstract_excerpt":"Recovering a sparse signal from an undersampled set of random linear measurements is the main problem of interest in compressed sensing. In this paper, we consider the case where both the signal and the measurements are complex. We study the popular reconstruction method of $\\ell_1$-regularized least squares or LASSO. While several studies have shown that the LASSO algorithm offers desirable solutions under certain conditions, the precise asymptotic performance of this algorithm in the complex setting is not yet known. In this paper, we extend the approximate message passing (AMP) algorithm to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0477","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":"1108.0477","created_at":"2026-05-18T02:21:42.504265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0477v2","created_at":"2026-05-18T02:21:42.504265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0477","created_at":"2026-05-18T02:21:42.504265+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTN5EYCXJX3M","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTN5EYCXJX3MVWMF","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTN5EYCX","created_at":"2026-05-18T12:26:26.731475+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/DTN5EYCXJX3MVWMFTO45K5HAC6","json":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6.json","graph_json":"https://pith.science/api/pith-number/DTN5EYCXJX3MVWMFTO45K5HAC6/graph.json","events_json":"https://pith.science/api/pith-number/DTN5EYCXJX3MVWMFTO45K5HAC6/events.json","paper":"https://pith.science/paper/DTN5EYCX"},"agent_actions":{"view_html":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6","download_json":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6.json","view_paper":"https://pith.science/paper/DTN5EYCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0477&json=true","fetch_graph":"https://pith.science/api/pith-number/DTN5EYCXJX3MVWMFTO45K5HAC6/graph.json","fetch_events":"https://pith.science/api/pith-number/DTN5EYCXJX3MVWMFTO45K5HAC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6/action/storage_attestation","attest_author":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6/action/author_attestation","sign_citation":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6/action/citation_signature","submit_replication":"https://pith.science/pith/DTN5EYCXJX3MVWMFTO45K5HAC6/action/replication_record"}},"created_at":"2026-05-18T02:21:42.504265+00:00","updated_at":"2026-05-18T02:21:42.504265+00:00"}