{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OYKG2O7C6D2SGPP4LHMCD5ZTHO","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":"dc1daf10d1de4b3358d2ce844903fb7a5961767ab53dc55db30cd958751cab26","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-11T21:57:47Z","title_canon_sha256":"e1623fe939cc20aa7bb69aed60c3c866cbd8e229e6d16fd0c027440f360cb679"},"schema_version":"1.0","source":{"id":"1306.2665","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2665","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2665v3","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2665","created_at":"2026-05-18T03:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"OYKG2O7C6D2S","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OYKG2O7C6D2SGPP4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OYKG2O7C","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:bf084c6317887bbd45d6aac8121452525402a08e89f455bb3763e5bf3c357c40","target":"graph","created_at":"2026-05-18T03:16:16Z","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":"In this paper, we propose new efficient algorithms to verify the null space condition in compressed sensing (CS). Given an $(n-m) \\times n$ ($m>0$) CS matrix $A$ and a positive $k$, we are interested in computing $\\displaystyle \\alpha_k = \\max_{\\{z: Az=0,z\\neq 0\\}}\\max_{\\{K: |K|\\leq k\\}}$ ${\\|z_K \\|_{1}}{\\|z\\|_{1}}$, where $K$ represents subsets of $\\{1,2,...,n\\}$, and $|K|$ is the cardinality of $K$. In particular, we are interested in finding the maximum $k$ such that $\\alpha_k < {1}{2}$. However, computing $\\alpha_k$ is known to be extremely challenging. In this paper, we first propose a se","authors_text":"Myung Cho, Weiyu Xu","cross_cats":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-11T21:57:47Z","title":"Precisely Verifying the Null Space Conditions in Compressed Sensing: A Sandwiching Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2665","kind":"arxiv","version":3},"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:9f9f7eff13e33997c0ba508baead59b41880f2f53114eefb8cad20e9ab4de16c","target":"record","created_at":"2026-05-18T03:16:16Z","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":"dc1daf10d1de4b3358d2ce844903fb7a5961767ab53dc55db30cd958751cab26","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-11T21:57:47Z","title_canon_sha256":"e1623fe939cc20aa7bb69aed60c3c866cbd8e229e6d16fd0c027440f360cb679"},"schema_version":"1.0","source":{"id":"1306.2665","kind":"arxiv","version":3}},"canonical_sha256":"76146d3be2f0f5233dfc59d821f7333b8bdc1d04f22c8f8967ac7ce6a01171dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76146d3be2f0f5233dfc59d821f7333b8bdc1d04f22c8f8967ac7ce6a01171dc","first_computed_at":"2026-05-18T03:16:16.296080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:16.296080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gfGQrOwmQMWEw4TIsSJEHJ8ebt9nTgYTcrg+t1MbA7Nt8CSHf3zl8n50mkRTZFmcUH0mOm8wTXKH/23QIwhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:16.296829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2665","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f9f7eff13e33997c0ba508baead59b41880f2f53114eefb8cad20e9ab4de16c","sha256:bf084c6317887bbd45d6aac8121452525402a08e89f455bb3763e5bf3c357c40"],"state_sha256":"c00925b2ad20ae110e31dc5fc20522ae54359c99d98b41428b63d7395d12dc90"}