{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XW3NR3AFARWT5VTZGFYIH5LTDG","short_pith_number":"pith:XW3NR3AF","schema_version":"1.0","canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","source":{"kind":"arxiv","id":"2607.06750","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Junren Chen, Ming Yuan","submitted_at":"2026-07-07T19:31:38Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.06750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-07T19:31:38Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"738cf9c1f2bc3ed97fcc34b4a213ee117552a08ec9ffedf65bc82aae87cf5db7","abstract_canon_sha256":"063062f10f67b8545bf5c8d3c8647220216e48622891f5746b6600a2d1dda430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:25.211959Z","signature_b64":"JUr2pXSySB7kMdO1IG0RCiLa5njm5Fk0z8Bu4uUbivTgT7G5LkMwwxL4H3CBlSYJt0zu6USVrw6iQqszFlWqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","last_reissued_at":"2026-07-09T00:19:25.211246Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:25.211246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Arya Mazumdar, Junren Chen, Ming Yuan","submitted_at":"2026-07-07T19:31:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06750","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.06750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.06750","created_at":"2026-07-09T00:19:25.211366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06750v1","created_at":"2026-07-09T00:19:25.211366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06750","created_at":"2026-07-09T00:19:25.211366+00:00"},{"alias_kind":"pith_short_12","alias_value":"XW3NR3AFARWT","created_at":"2026-07-09T00:19:25.211366+00:00"},{"alias_kind":"pith_short_16","alias_value":"XW3NR3AFARWT5VTZ","created_at":"2026-07-09T00:19:25.211366+00:00"},{"alias_kind":"pith_short_8","alias_value":"XW3NR3AF","created_at":"2026-07-09T00:19:25.211366+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG","json":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG.json","graph_json":"https://pith.science/api/pith-number/XW3NR3AFARWT5VTZGFYIH5LTDG/graph.json","events_json":"https://pith.science/api/pith-number/XW3NR3AFARWT5VTZGFYIH5LTDG/events.json","paper":"https://pith.science/paper/XW3NR3AF"},"agent_actions":{"view_html":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG","download_json":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG.json","view_paper":"https://pith.science/paper/XW3NR3AF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06750&json=true","fetch_graph":"https://pith.science/api/pith-number/XW3NR3AFARWT5VTZGFYIH5LTDG/graph.json","fetch_events":"https://pith.science/api/pith-number/XW3NR3AFARWT5VTZGFYIH5LTDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/action/storage_attestation","attest_author":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/action/author_attestation","sign_citation":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/action/citation_signature","submit_replication":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/action/replication_record"}},"created_at":"2026-07-09T00:19:25.211366+00:00","updated_at":"2026-07-09T00:19:25.211366+00:00"}