{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NY7R3ISFHIJMTP5FGUVK522NSN","short_pith_number":"pith:NY7R3ISF","schema_version":"1.0","canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","source":{"kind":"arxiv","id":"1304.0480","version":1},"attestation_state":"computed","paper":{"title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:35:58Z","abstract_excerpt":"Under-determined systems of linear equations with sparse solutions have been the subject of an extensive research in last several years above all due to results of \\cite{CRT,CanRomTao06,DonohoPol}. In this paper we will consider \\emph{noisy} under-determined linear systems. In a breakthrough \\cite{CanRomTao06} it was established that in \\emph{noisy} systems for any linear level of under-determinedness there is a linear sparsity that can be \\emph{approximately} recovered through an SOCP (second order cone programming) optimization algorithm so that the approximate solution vector is (in an $\\el"},"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.0480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:35:58Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"a359b275f0b1057f1298dd4242489e702853cc980bb95f88e0a9e691523953e5","abstract_canon_sha256":"417985add465dd70c6cc713c29d135003537dcc9d0b133fad06a14662081d1a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.275894Z","signature_b64":"0fn5hTLKcUW4bmhaeedGQARpO0an7eKD1F4STlPKP2wIcwqk+fzFJEcCkPs9ifuayCf8r14D5k6FlW1WoPpJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","last_reissued_at":"2026-05-18T03:29:15.275140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.275140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Mihailo Stojnic","submitted_at":"2013-03-29T04:35:58Z","abstract_excerpt":"Under-determined systems of linear equations with sparse solutions have been the subject of an extensive research in last several years above all due to results of \\cite{CRT,CanRomTao06,DonohoPol}. In this paper we will consider \\emph{noisy} under-determined linear systems. In a breakthrough \\cite{CanRomTao06} it was established that in \\emph{noisy} systems for any linear level of under-determinedness there is a linear sparsity that can be \\emph{approximately} recovered through an SOCP (second order cone programming) optimization algorithm so that the approximate solution vector is (in an $\\el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0480","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.0480","created_at":"2026-05-18T03:29:15.275259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0480v1","created_at":"2026-05-18T03:29:15.275259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0480","created_at":"2026-05-18T03:29:15.275259+00:00"},{"alias_kind":"pith_short_12","alias_value":"NY7R3ISFHIJM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NY7R3ISFHIJMTP5F","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NY7R3ISF","created_at":"2026-05-18T12:27:52.871228+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/NY7R3ISFHIJMTP5FGUVK522NSN","json":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN.json","graph_json":"https://pith.science/api/pith-number/NY7R3ISFHIJMTP5FGUVK522NSN/graph.json","events_json":"https://pith.science/api/pith-number/NY7R3ISFHIJMTP5FGUVK522NSN/events.json","paper":"https://pith.science/paper/NY7R3ISF"},"agent_actions":{"view_html":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN","download_json":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN.json","view_paper":"https://pith.science/paper/NY7R3ISF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0480&json=true","fetch_graph":"https://pith.science/api/pith-number/NY7R3ISFHIJMTP5FGUVK522NSN/graph.json","fetch_events":"https://pith.science/api/pith-number/NY7R3ISFHIJMTP5FGUVK522NSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/action/storage_attestation","attest_author":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/action/author_attestation","sign_citation":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/action/citation_signature","submit_replication":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/action/replication_record"}},"created_at":"2026-05-18T03:29:15.275259+00:00","updated_at":"2026-05-18T03:29:15.275259+00:00"}