{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CXKREENAIH2OEIAKRLABIAU726","short_pith_number":"pith:CXKREENA","schema_version":"1.0","canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","source":{"kind":"arxiv","id":"2604.07796","version":2},"attestation_state":"computed","paper":{"title":"Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An adaptive estimator using sequential randomized 1-bit threshold queries achieves order-optimal sample complexity for mean estimation under any fixed moment bound k greater than 1.","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Ivan Lau, Jonathan Scarlett","submitted_at":"2026-04-09T04:49:21Z","abstract_excerpt":"In this paper, we study the problem of mean estimation under 1-bit communication constraints. We propose a novel adaptive mean estimator based solely on randomized threshold queries, where each 1-bit outcome indicates whether a given sample exceeds a sequentially chosen threshold. Our estimator is $(\\epsilon, \\delta)$-PAC for any distribution with a bounded mean $\\mu \\in [-\\lambda, \\lambda]$ and a bounded $k$-th central moment $\\mathbb{E}[|X-\\mu|^k] \\le \\sigma^k$ for any fixed $k > 1$. Moreover, our sample complexity is order-optimal in all such tail regimes, i.e., for every such $k$ value. Fo"},"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":true},"canonical_record":{"source":{"id":"2604.07796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-04-09T04:49:21Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"ea00505a890dd9811f91e547e7e776fdf0f5c2652b4debddfe9964290f894102","abstract_canon_sha256":"4d7347f0dce7669914985a007de7f53002945548d5857138f64fc40f06f0291e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:19.225822Z","signature_b64":"+z3COXutqnnMhsMAxiFQOLzEnETEcvmA4MfbXejZt7SeZtdm2N86JwNJypwEkBw4IaB0bpapBHM2jfFDKKlQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","last_reissued_at":"2026-05-25T02:01:19.224960Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:19.224960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An adaptive estimator using sequential randomized 1-bit threshold queries achieves order-optimal sample complexity for mean estimation under any fixed moment bound k greater than 1.","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Ivan Lau, Jonathan Scarlett","submitted_at":"2026-04-09T04:49:21Z","abstract_excerpt":"In this paper, we study the problem of mean estimation under 1-bit communication constraints. We propose a novel adaptive mean estimator based solely on randomized threshold queries, where each 1-bit outcome indicates whether a given sample exceeds a sequentially chosen threshold. Our estimator is $(\\epsilon, \\delta)$-PAC for any distribution with a bounded mean $\\mu \\in [-\\lambda, \\lambda]$ and a bounded $k$-th central moment $\\mathbb{E}[|X-\\mu|^k] \\le \\sigma^k$ for any fixed $k > 1$. Moreover, our sample complexity is order-optimal in all such tail regimes, i.e., for every such $k$ value. Fo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our estimator is (ε, δ)-PAC for any distribution with a bounded mean μ ∈ [−λ, λ] and a bounded k-th central moment E[|X−μ|^k] ≤ σ^k for any fixed k > 1. Crucially, our sample complexity is order-optimal in all such tail regimes, i.e., for every such k value.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The distribution belongs to the class with bounded mean in [−λ, λ] and bounded k-th central moment for some fixed k>1; the analysis assumes randomized threshold queries can be chosen sequentially and adaptively without additional constraints on query implementation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An adaptive 1-bit mean estimator using sequential threshold queries achieves order-optimal sample complexity for any fixed k-th moment bound, with a necessary logarithmic penalty only when variance is finite.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An adaptive estimator using sequential randomized 1-bit threshold queries achieves order-optimal sample complexity for mean estimation under any fixed moment bound k greater than 1.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"eea7821cf94e7a13a62a803dcd390eb15fd11f9a9f12c6a7f520cbbfb677a3f2"},"source":{"id":"2604.07796","kind":"arxiv","version":2},"verdict":{"id":"c855c06a-a33e-4cf2-9476-6267d70f7ca3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T18:14:26.529999Z","strongest_claim":"Our estimator is (ε, δ)-PAC for any distribution with a bounded mean μ ∈ [−λ, λ] and a bounded k-th central moment E[|X−μ|^k] ≤ σ^k for any fixed k > 1. Crucially, our sample complexity is order-optimal in all such tail regimes, i.e., for every such k value.","one_line_summary":"An adaptive 1-bit mean estimator using sequential threshold queries achieves order-optimal sample complexity for any fixed k-th moment bound, with a necessary logarithmic penalty only when variance is finite.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The distribution belongs to the class with bounded mean in [−λ, λ] and bounded k-th central moment for some fixed k>1; the analysis assumes randomized threshold queries can be chosen sequentially and adaptively without additional constraints on query implementation.","pith_extraction_headline":"An adaptive estimator using sequential randomized 1-bit threshold queries achieves order-optimal sample complexity for mean estimation under any fixed moment bound k greater than 1."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.07796/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":2,"snapshot_sha256":"605df4a1d9a8ce75b573094bec70e9110994df13ff6e75b522448760d1bea886"},"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":"2604.07796","created_at":"2026-05-25T02:01:19.225090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.07796v2","created_at":"2026-05-25T02:01:19.225090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07796","created_at":"2026-05-25T02:01:19.225090+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXKREENAIH2O","created_at":"2026-05-25T02:01:19.225090+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXKREENAIH2OEIAK","created_at":"2026-05-25T02:01:19.225090+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXKREENA","created_at":"2026-05-25T02:01:19.225090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726","json":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726.json","graph_json":"https://pith.science/api/pith-number/CXKREENAIH2OEIAKRLABIAU726/graph.json","events_json":"https://pith.science/api/pith-number/CXKREENAIH2OEIAKRLABIAU726/events.json","paper":"https://pith.science/paper/CXKREENA"},"agent_actions":{"view_html":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726","download_json":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726.json","view_paper":"https://pith.science/paper/CXKREENA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.07796&json=true","fetch_graph":"https://pith.science/api/pith-number/CXKREENAIH2OEIAKRLABIAU726/graph.json","fetch_events":"https://pith.science/api/pith-number/CXKREENAIH2OEIAKRLABIAU726/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/action/storage_attestation","attest_author":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/action/author_attestation","sign_citation":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/action/citation_signature","submit_replication":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/action/replication_record"}},"created_at":"2026-05-25T02:01:19.225090+00:00","updated_at":"2026-05-25T02:01:19.225090+00:00"}