{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MPEHTRVHN4H5KJ46HCSBQQ7ZV5","short_pith_number":"pith:MPEHTRVH","schema_version":"1.0","canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","source":{"kind":"arxiv","id":"1303.7291","version":1},"attestation_state":"computed","paper":{"title":"A framework to characterize performance of LASSO algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T03:55:09Z","abstract_excerpt":"In this paper we consider solving \\emph{noisy} under-determined systems of linear equations with sparse solutions. A noiseless equivalent attracted enormous attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol} where it was shown in a statistical and large dimensional context that a sparse unknown vector (of sparsity proportional to the length of the vector) can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} further established that even when the equations are \\emph{noisy}, one can, throug"},"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":"1303.7291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T03:55:09Z","cross_cats_sorted":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"title_canon_sha256":"5599b1cb86bdb2d742c88d05cdc8273daa3da8a3e4f9973a4f067e82eb90d58f","abstract_canon_sha256":"74bab4cb3629bc9b2938616789c6960bd1529c105e607c31e34f535dfdf4e02f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:28.981363Z","signature_b64":"WDSjsv+T78Um5+GM5Vj+9mM//6s0OUV+V/qXpj4jih2EjcRfflTYKtDeS98+2txmVOfOcAIhMQocZiA3GzouAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c879c6a76f0fd5279e38a41843f9af6bc6d81555deb75f03dc61e8a2939317","last_reissued_at":"2026-05-18T03:29:28.980713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:28.980713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework to characterize performance of LASSO algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T03:55:09Z","abstract_excerpt":"In this paper we consider solving \\emph{noisy} under-determined systems of linear equations with sparse solutions. A noiseless equivalent attracted enormous attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol} where it was shown in a statistical and large dimensional context that a sparse unknown vector (of sparsity proportional to the length of the vector) can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} further established that even when the equations are \\emph{noisy}, one can, throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7291","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":"1303.7291","created_at":"2026-05-18T03:29:28.980816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7291v1","created_at":"2026-05-18T03:29:28.980816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7291","created_at":"2026-05-18T03:29:28.980816+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPEHTRVHN4H5","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPEHTRVHN4H5KJ46","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPEHTRVH","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1906.10319","citing_title":"Approximate separability of symmetrically penalized least squares in high dimensions: characterization and consequences","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2409.02708","citing_title":"Few-shot Multi-Task Learning of Linear Invariant Features with Meta Subspace Pursuit","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22481","citing_title":"When Stronger Triggers Backfire: A High-Dimensional Theory of Backdoor Attacks","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2505.16329","citing_title":"High-Dimensional Private Linear Regression with Optimal Rates","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03146","citing_title":"Characterization of Gaussian Universality Breakdown in High-Dimensional Empirical Risk Minimization","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":84,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5","json":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5.json","graph_json":"https://pith.science/api/pith-number/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/graph.json","events_json":"https://pith.science/api/pith-number/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/events.json","paper":"https://pith.science/paper/MPEHTRVH"},"agent_actions":{"view_html":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5","download_json":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5.json","view_paper":"https://pith.science/paper/MPEHTRVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7291&json=true","fetch_graph":"https://pith.science/api/pith-number/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/graph.json","fetch_events":"https://pith.science/api/pith-number/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/action/storage_attestation","attest_author":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/action/author_attestation","sign_citation":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/action/citation_signature","submit_replication":"https://pith.science/pith/MPEHTRVHN4H5KJ46HCSBQQ7ZV5/action/replication_record"}},"created_at":"2026-05-18T03:29:28.980816+00:00","updated_at":"2026-05-18T03:29:28.980816+00:00"}