{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QBR4B5TSLICB2LQH6XMLTR3NPH","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":"4974133a32dc6fa88b86e1f1ed40ce71aa96b5363437173c72074c74c40486de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-28T07:08:33Z","title_canon_sha256":"0a06deca7b762497aadba12741a76fda6e2a676806aa7ea1f2855d8df9ddf086"},"schema_version":"1.0","source":{"id":"1001.5113","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5113","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5113v2","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5113","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"QBR4B5TSLICB","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QBR4B5TSLICB2LQH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QBR4B5TS","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:a15e8e0a45ebf57e592f81d35c0ce5f2f191db9aecde7329c4693aa6d4c39be8","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"We consider the Linear Programming (LP) solution of the Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation as a channel-coding problem, and it guarantees error-free reconstruction with a properly chosen measurement matrix and sufficiently sparse error vectors. In this manuscript, we examine how the BasP performs on a given measurement matrix and develop an algorithm to discover the sparsest vectors for which the BasP fails. The resulting algorithm is a generalization of our previous results on finding the most probable e","authors_text":"Bane Vasic, Michael Chertkov, Shashi Kiran Chilappagari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-28T07:08:33Z","title":"Worst Configurations (Instantons) for Compressed Sensing over Reals: a Channel Coding Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5113","kind":"arxiv","version":2},"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:38f6a6df77f404b2414114d80816c330518914c0f827ab9e13b6f97a63173393","target":"record","created_at":"2026-05-18T00:57:57Z","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":"4974133a32dc6fa88b86e1f1ed40ce71aa96b5363437173c72074c74c40486de","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-28T07:08:33Z","title_canon_sha256":"0a06deca7b762497aadba12741a76fda6e2a676806aa7ea1f2855d8df9ddf086"},"schema_version":"1.0","source":{"id":"1001.5113","kind":"arxiv","version":2}},"canonical_sha256":"8063c0f6725a041d2e07f5d8b9c76d79eeb1f06aa3514882d13e3df2e9cf864c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8063c0f6725a041d2e07f5d8b9c76d79eeb1f06aa3514882d13e3df2e9cf864c","first_computed_at":"2026-05-18T00:57:57.913268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.913268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzFePYZ/AZw5liUUCgz4SvbdUPlCFpd/wE9eFXtvcrwsuYb//KHVm+3MkORCjl39PLz2rstjCjnIFpjX5vPIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.913870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.5113","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38f6a6df77f404b2414114d80816c330518914c0f827ab9e13b6f97a63173393","sha256:a15e8e0a45ebf57e592f81d35c0ce5f2f191db9aecde7329c4693aa6d4c39be8"],"state_sha256":"566a145f284212cd6f147f2375ca8caea26879c50c626fb4283e6782fc7d67d8"}