{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XW3NR3AFARWT5VTZGFYIH5LTDG","short_pith_number":"pith:XW3NR3AF","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"},"canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","source":{"kind":"arxiv","id":"2607.06750","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XW3NR3AFARWT5VTZGFYIH5LTDG","target":"record","payload":{"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"},"canonical_sha256":"bdb6d8ec05046d3ed679317083f57319be5ce485552495c2ee9693b3f63e2dd7","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"},"source_kind":"arxiv","source_id":"2607.06750","source_version":1,"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-07-09T00:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMIXRXq+Y5mNhk5JgB3abRuGfPWr95731vsO9u+G1S+Cky9GWK/q75q6UEG7iaXOFYoKdZltis3APGFq3C8UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:14:44.048637Z"},"content_sha256":"7ce981e1b7c661e29f5857561cc47f9379540500e3e3a4b3335406a058f7e655","schema_version":"1.0","event_id":"sha256:7ce981e1b7c661e29f5857561cc47f9379540500e3e3a4b3335406a058f7e655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XW3NR3AFARWT5VTZGFYIH5LTDG","target":"graph","payload":{"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"},"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-07-09T00:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lX7n7Bc8sMWpT3MwNen3mQJpBBTfv3rYIH1CroRtsehXaHn/8b4CLB2Gtw3dKukI8KpkPpjWxonwB8oPlKXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:14:44.049176Z"},"content_sha256":"1895eeba3fd747773437a59043a5880e91fff3b9f81012673a4bcf264770a513","schema_version":"1.0","event_id":"sha256:1895eeba3fd747773437a59043a5880e91fff3b9f81012673a4bcf264770a513"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/bundle.json","state_url":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/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-08-08T19:14:44Z","links":{"resolver":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG","bundle":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/bundle.json","state":"https://pith.science/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XW3NR3AFARWT5VTZGFYIH5LTDG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWkG/HP8N9qGsuyFifaIYTeaJwfQQLQ4DLG1vI7Ojc0vIHiDR5iHiM1fJ6u6r8cLeuPPnO/q/aU1wHH6m8X/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:14:44.054994Z","bundle_sha256":"96018082ed2a57ce85f782372e341bece2180552c5876d19b10278923d616c8b"}}