{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CCNWFIQSGESDPIIXZO3GZWBA4M","short_pith_number":"pith:CCNWFIQS","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"},"canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","source":{"kind":"arxiv","id":"1304.0002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0002","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0002v1","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0002","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"pith_short_12","alias_value":"CCNWFIQSGESD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CCNWFIQSGESDPIIX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CCNWFIQS","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CCNWFIQSGESDPIIXZO3GZWBA4M","target":"record","payload":{"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"},"canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","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"},"source_kind":"arxiv","source_id":"1304.0002","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"boq6kJy8uGjLLAXpjPMOm6TU6iB+1KpawPIWvX4HvilcRZt0VCb3lBGPDdGv4xfta0I9k32V+6ue3ld0iBx0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:52:35.034619Z"},"content_sha256":"66c77876d0a666038734c56edfa1f7436b53ea1d1758933184bfce11bd05addc","schema_version":"1.0","event_id":"sha256:66c77876d0a666038734c56edfa1f7436b53ea1d1758933184bfce11bd05addc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CCNWFIQSGESDPIIXZO3GZWBA4M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AyFhVM3n+jML9HptFk/ax3MdYQWTrfgFqY7T+koMVYMly9XaJrj2/f4Yc5XPqvmkN6QmVCoK5Voh3PwvkVpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:52:35.035258Z"},"content_sha256":"96b65776773cd9184da504a7fe874bedd0b1af53d3f8119a98240bfc2cf23a59","schema_version":"1.0","event_id":"sha256:96b65776773cd9184da504a7fe874bedd0b1af53d3f8119a98240bfc2cf23a59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/bundle.json","state_url":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T23:52:35Z","links":{"resolver":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M","bundle":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/bundle.json","state":"https://pith.science/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCNWFIQSGESDPIIXZO3GZWBA4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CCNWFIQSGESDPIIXZO3GZWBA4M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48b139c570fa5207f926bb9095be7b20348212d74e0f11607449793adb70d602","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:00:23Z","title_canon_sha256":"7252f186f3efd2d1ae1d0394cfe42ef781e5750a836c82537bb14493eee8d910"},"schema_version":"1.0","source":{"id":"1304.0002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0002","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0002v1","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0002","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"pith_short_12","alias_value":"CCNWFIQSGESD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CCNWFIQSGESDPIIX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CCNWFIQS","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:96b65776773cd9184da504a7fe874bedd0b1af53d3f8119a98240bfc2cf23a59","target":"graph","created_at":"2026-05-18T03:29:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:00:23Z","title":"A performance analysis framework for SOCP algorithms in noisy compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0002","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:66c77876d0a666038734c56edfa1f7436b53ea1d1758933184bfce11bd05addc","target":"record","created_at":"2026-05-18T03:29:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48b139c570fa5207f926bb9095be7b20348212d74e0f11607449793adb70d602","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:00:23Z","title_canon_sha256":"7252f186f3efd2d1ae1d0394cfe42ef781e5750a836c82537bb14493eee8d910"},"schema_version":"1.0","source":{"id":"1304.0002","kind":"arxiv","version":1}},"canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"109b62a212312437a117cbb66cd820e3312c49a6d3eb3d6f0ca930ad56d2ec23","first_computed_at":"2026-05-18T03:29:26.333038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:26.333038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3aBoKulcB8D1DQ/KjJOdImKkntMYia3H6JdzRMC+H5wgKF5gFdMUm2A+bBOc9AxcaEM6qtFzoyD1oflYDZK2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:26.333960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66c77876d0a666038734c56edfa1f7436b53ea1d1758933184bfce11bd05addc","sha256:96b65776773cd9184da504a7fe874bedd0b1af53d3f8119a98240bfc2cf23a59"],"state_sha256":"0c37c4fab9bf2b474f698c60a2fe63a90b0ca8b282c8fb810d9c548096c68dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKH53Ve4PMRX7pTgAqRFsssLzTbF98jaKcCmUPzxvVylpDWEf/xoD6hncIe30uKJ3gKJWnj3C/oYnWIiSR2hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:52:35.038938Z","bundle_sha256":"17507f8e2e34dac817ea9259170be8db4e4e9b6ebac433f39b7eacc7cb0739f7"}}