{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CCNWFIQSGESDPIIXZO3GZWBA4M","short_pith_number":"pith:CCNWFIQS","schema_version":"1.0","canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","source":{"kind":"arxiv","id":"1304.0002","version":1},"attestation_state":"computed","paper":{"title":"A performance analysis framework for SOCP algorithms in noisy compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:00:23Z","abstract_excerpt":"Solving under-determined systems of linear equations with sparse solutions attracted enormous amount of attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol}. In \\cite{CRT,CanRomTao06,DonohoPol} it was rigorously shown for the first time that in a statistical and large dimensional context a linear sparsity can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} went even further and established that in \\emph{noisy} systems for any linear level of under-determinedness there is again a linear spa"},"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.0002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:00:23Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"7252f186f3efd2d1ae1d0394cfe42ef781e5750a836c82537bb14493eee8d910","abstract_canon_sha256":"48b139c570fa5207f926bb9095be7b20348212d74e0f11607449793adb70d602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.333960Z","signature_b64":"3aBoKulcB8D1DQ/KjJOdImKkntMYia3H6JdzRMC+H5wgKF5gFdMUm2A+bBOc9AxcaEM6qtFzoyD1oflYDZK2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","last_reissued_at":"2026-05-18T03:29:26.333038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.333038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A performance analysis framework for SOCP algorithms in noisy compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:00:23Z","abstract_excerpt":"Solving under-determined systems of linear equations with sparse solutions attracted enormous amount of attention in recent years, above all, due to work of \\cite{CRT,CanRomTao06,DonohoPol}. In \\cite{CRT,CanRomTao06,DonohoPol} it was rigorously shown for the first time that in a statistical and large dimensional context a linear sparsity can be recovered from an under-determined system via a simple polynomial $\\ell_1$-optimization algorithm. \\cite{CanRomTao06} went even further and established that in \\emph{noisy} systems for any linear level of under-determinedness there is again a linear spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0002","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.0002","created_at":"2026-05-18T03:29:26.333189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0002v1","created_at":"2026-05-18T03:29:26.333189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0002","created_at":"2026-05-18T03:29:26.333189+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCNWFIQSGESD","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCNWFIQSGESDPIIX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCNWFIQS","created_at":"2026-05-18T12:27:40.988391+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/CCNWFIQSGESDPIIXZO3GZWBA4M","json":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M.json","graph_json":"https://pith.science/api/pith-number/CCNWFIQSGESDPIIXZO3GZWBA4M/graph.json","events_json":"https://pith.science/api/pith-number/CCNWFIQSGESDPIIXZO3GZWBA4M/events.json","paper":"https://pith.science/paper/CCNWFIQS"},"agent_actions":{"view_html":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M","download_json":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M.json","view_paper":"https://pith.science/paper/CCNWFIQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0002&json=true","fetch_graph":"https://pith.science/api/pith-number/CCNWFIQSGESDPIIXZO3GZWBA4M/graph.json","fetch_events":"https://pith.science/api/pith-number/CCNWFIQSGESDPIIXZO3GZWBA4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/action/storage_attestation","attest_author":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/action/author_attestation","sign_citation":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/action/citation_signature","submit_replication":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/action/replication_record"}},"created_at":"2026-05-18T03:29:26.333189+00:00","updated_at":"2026-05-18T03:29:26.333189+00:00"}