{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XW3NR3AFARWT5VTZGFYIH5LTDG","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":"063062f10f67b8545bf5c8d3c8647220216e48622891f5746b6600a2d1dda430","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-07T19:31:38Z","title_canon_sha256":"738cf9c1f2bc3ed97fcc34b4a213ee117552a08ec9ffedf65bc82aae87cf5db7"},"schema_version":"1.0","source":{"id":"2607.06750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06750","created_at":"2026-07-09T00:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06750v1","created_at":"2026-07-09T00:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06750","created_at":"2026-07-09T00:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"XW3NR3AFARWT","created_at":"2026-07-09T00:19:25Z"},{"alias_kind":"pith_short_16","alias_value":"XW3NR3AFARWT5VTZ","created_at":"2026-07-09T00:19:25Z"},{"alias_kind":"pith_short_8","alias_value":"XW3NR3AF","created_at":"2026-07-09T00:19:25Z"}],"graph_snapshots":[{"event_id":"sha256:1895eeba3fd747773437a59043a5880e91fff3b9f81012673a4bcf264770a513","target":"graph","created_at":"2026-07-09T00:19:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.06750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper provides the first near-optimal lower bounds for one-bit compressed sensing of approximately sparse signals lying in a scaled $\\ell_1$ ball, which is a commonly adopted relaxation of the exactly $k$-sparse assumption. In prior works, the best known upper bounds on uniform Euclidean error are of order $\\widetilde{O}((k/m)^{1/3})$, where $m$ is the number of measurements. Under sub-Gaussian matrices, we establish nearly matching lower bounds for both the canonical one-bit compressed sensing model and the uniformly dithered model. Our argument is to first embed a small Euclidean ball i","authors_text":"Arya Mazumdar, Junren Chen, Ming Yuan","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06750","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:7ce981e1b7c661e29f5857561cc47f9379540500e3e3a4b3335406a058f7e655","target":"record","created_at":"2026-07-09T00:19:25Z","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":"063062f10f67b8545bf5c8d3c8647220216e48622891f5746b6600a2d1dda430","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-07T19:31:38Z","title_canon_sha256":"738cf9c1f2bc3ed97fcc34b4a213ee117552a08ec9ffedf65bc82aae87cf5db7"},"schema_version":"1.0","source":{"id":"2607.06750","kind":"arxiv","version":1}},"canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","first_computed_at":"2026-07-09T00:19:25.211246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T00:19:25.211246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JUr2pXSySB7kMdO1IG0RCiLa5njm5Fk0z8Bu4uUbivTgT7G5LkMwwxL4H3CBlSYJt0zu6USVrw6iQqszFlWqBw==","signature_status":"signed_v1","signed_at":"2026-07-09T00:19:25.211959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.06750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce981e1b7c661e29f5857561cc47f9379540500e3e3a4b3335406a058f7e655","sha256:1895eeba3fd747773437a59043a5880e91fff3b9f81012673a4bcf264770a513"],"state_sha256":"e68cff8557d64ba3eefa28709cff187bddfb790be1b2bdf6dfaa66a2b8b3c06a"}