{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OYKG2O7C6D2SGPP4LHMCD5ZTHO","short_pith_number":"pith:OYKG2O7C","canonical_record":{"source":{"id":"1306.2665","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-11T21:57:47Z","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"e1623fe939cc20aa7bb69aed60c3c866cbd8e229e6d16fd0c027440f360cb679","abstract_canon_sha256":"dc1daf10d1de4b3358d2ce844903fb7a5961767ab53dc55db30cd958751cab26"},"schema_version":"1.0"},"canonical_sha256":"76146d3be2f0f5233dfc59d821f7333b8bdc1d04f22c8f8967ac7ce6a01171dc","source":{"kind":"arxiv","id":"1306.2665","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OYKG2O7C6D2SGPP4LHMCD5ZTHO","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2665","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-11T21:57:47Z","cross_cats_sorted":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"title_canon_sha256":"e1623fe939cc20aa7bb69aed60c3c866cbd8e229e6d16fd0c027440f360cb679","abstract_canon_sha256":"dc1daf10d1de4b3358d2ce844903fb7a5961767ab53dc55db30cd958751cab26"},"schema_version":"1.0"},"canonical_sha256":"76146d3be2f0f5233dfc59d821f7333b8bdc1d04f22c8f8967ac7ce6a01171dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:16.296829Z","signature_b64":"3gfGQrOwmQMWEw4TIsSJEHJ8ebt9nTgYTcrg+t1MbA7Nt8CSHf3zl8n50mkRTZFmcUH0mOm8wTXKH/23QIwhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76146d3be2f0f5233dfc59d821f7333b8bdc1d04f22c8f8967ac7ce6a01171dc","last_reissued_at":"2026-05-18T03:16:16.296080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:16.296080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2665","source_version":3,"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:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOEq8hPsU/65SKluYcFbaJIZgCk7mDmVql0/KiP1cV4RpaYX4vKq2tf1SEx7pIE5xnTuqYvvfs9F43+IIwVsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:24.007443Z"},"content_sha256":"9f9f7eff13e33997c0ba508baead59b41880f2f53114eefb8cad20e9ab4de16c","schema_version":"1.0","event_id":"sha256:9f9f7eff13e33997c0ba508baead59b41880f2f53114eefb8cad20e9ab4de16c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OYKG2O7C6D2SGPP4LHMCD5ZTHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precisely Verifying the Null Space Conditions in Compressed Sensing: A Sandwiching Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Myung Cho, Weiyu Xu","submitted_at":"2013-06-11T21:57:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2665","kind":"arxiv","version":3},"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:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBWGLKEVxo8fxn/w1Pw1CMIbvqnZw03yqTc4136WpX6/FvhPWUPicix3zSdjfeVQf7DIm2tyVXCNmpuNQ0Z6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:24.008104Z"},"content_sha256":"bf084c6317887bbd45d6aac8121452525402a08e89f455bb3763e5bf3c357c40","schema_version":"1.0","event_id":"sha256:bf084c6317887bbd45d6aac8121452525402a08e89f455bb3763e5bf3c357c40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/bundle.json","state_url":"https://pith.science/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/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-30T21:35:24Z","links":{"resolver":"https://pith.science/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO","bundle":"https://pith.science/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/bundle.json","state":"https://pith.science/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYKG2O7C6D2SGPP4LHMCD5ZTHO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zN7N59MJbvdk7VjyO+uyMoMAf4FNs3XIRtO8x1GYql9+czrF5pzN0N1BM1ZNCSfAv5Lhw5P3Z1cjnAruMi18DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:35:24.012416Z","bundle_sha256":"f3d39047951c54fc29e15a8145db36bdf6e06a458f47be0700fafd92ec1a4c2f"}}