{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NY7R3ISFHIJMTP5FGUVK522NSN","short_pith_number":"pith:NY7R3ISF","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"},"canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","source":{"kind":"arxiv","id":"1304.0480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0480","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0480v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0480","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"NY7R3ISFHIJM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NY7R3ISFHIJMTP5F","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NY7R3ISF","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NY7R3ISFHIJMTP5FGUVK522NSN","target":"record","payload":{"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"},"canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","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"},"source_kind":"arxiv","source_id":"1304.0480","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiGlmL7g77JrpoULRtewOCV9PP3JTt2lvXW6cWfPbhNRFpUljDE13bVfAHj5xY1XdT7+sV+Lg7U4H35SYThCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:21:08.237226Z"},"content_sha256":"d85ff03f90e40d97f294ba8659fb367135e6b51c68e7304af5c48084d7727b4b","schema_version":"1.0","event_id":"sha256:d85ff03f90e40d97f294ba8659fb367135e6b51c68e7304af5c48084d7727b4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NY7R3ISFHIJMTP5FGUVK522NSN","target":"graph","payload":{"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"},"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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfVcP4i4iZ36eS4KRwhIdjCwV9WcGfktMzvH6u15pHCAdYERu5D+clvrUE2yaQkm1X2IyHXhv74TSpR0k/MsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:21:08.237882Z"},"content_sha256":"2a1758a8c25edd34d35b83c0814188fb254ba774b0422c89c85351c6b5d9e4df","schema_version":"1.0","event_id":"sha256:2a1758a8c25edd34d35b83c0814188fb254ba774b0422c89c85351c6b5d9e4df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/bundle.json","state_url":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NY7R3ISFHIJMTP5FGUVK522NSN/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-24T06:21:08Z","links":{"resolver":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN","bundle":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/bundle.json","state":"https://pith.science/pith/NY7R3ISFHIJMTP5FGUVK522NSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NY7R3ISFHIJMTP5FGUVK522NSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NY7R3ISFHIJMTP5FGUVK522NSN","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":"417985add465dd70c6cc713c29d135003537dcc9d0b133fad06a14662081d1a3","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:35:58Z","title_canon_sha256":"a359b275f0b1057f1298dd4242489e702853cc980bb95f88e0a9e691523953e5"},"schema_version":"1.0","source":{"id":"1304.0480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0480","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0480v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0480","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"NY7R3ISFHIJM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NY7R3ISFHIJMTP5F","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NY7R3ISF","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2a1758a8c25edd34d35b83c0814188fb254ba774b0422c89c85351c6b5d9e4df","target":"graph","created_at":"2026-05-18T03:29:15Z","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":"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","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0480","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:d85ff03f90e40d97f294ba8659fb367135e6b51c68e7304af5c48084d7727b4b","target":"record","created_at":"2026-05-18T03:29:15Z","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":"417985add465dd70c6cc713c29d135003537dcc9d0b133fad06a14662081d1a3","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-29T04:35:58Z","title_canon_sha256":"a359b275f0b1057f1298dd4242489e702853cc980bb95f88e0a9e691523953e5"},"schema_version":"1.0","source":{"id":"1304.0480","kind":"arxiv","version":1}},"canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e3f1da2453a12c9bfa5352aaeeb4d93511b90dbaeeaf82cac88d04ecf9a986b","first_computed_at":"2026-05-18T03:29:15.275140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.275140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0fn5hTLKcUW4bmhaeedGQARpO0an7eKD1F4STlPKP2wIcwqk+fzFJEcCkPs9ifuayCf8r14D5k6FlW1WoPpJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.275894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d85ff03f90e40d97f294ba8659fb367135e6b51c68e7304af5c48084d7727b4b","sha256:2a1758a8c25edd34d35b83c0814188fb254ba774b0422c89c85351c6b5d9e4df"],"state_sha256":"7cf691290fc93e3c3255e212460bca684ddb9aa017dfd5a4566acb0c2271d5c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvQn6B8FwdITB7y9Tlox1I/MXNQsvvVS4eFC0ywNS4n0ZAJqwuycO9joUinKBy5FR7OxIsps0FAUZSchV/FTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:21:08.241474Z","bundle_sha256":"09921d7656f7f75a9894654a0da0eb398907564600444caf57f96889eef34641"}}