{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CXKREENAIH2OEIAKRLABIAU726","short_pith_number":"pith:CXKREENA","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"},"canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","source":{"kind":"arxiv","id":"2604.07796","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.07796","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"arxiv_version","alias_value":"2604.07796v2","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07796","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_12","alias_value":"CXKREENAIH2O","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_16","alias_value":"CXKREENAIH2OEIAK","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_8","alias_value":"CXKREENA","created_at":"2026-05-25T02:01:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CXKREENAIH2OEIAKRLABIAU726","target":"record","payload":{"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"},"canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","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"},"source_kind":"arxiv","source_id":"2604.07796","source_version":2,"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-25T02:01:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lA3Yh+PSa/8KoKljodaWvwTsnpIX5imDaxYcWDjMLCTzYCZACxTTxLCyBLSbMCl928lDeeUZRUo2R7X9jejFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:24:00.630073Z"},"content_sha256":"0e34c2c40a17ad0127470be58790e29d36152bca013784851a5b966906433c20","schema_version":"1.0","event_id":"sha256:0e34c2c40a17ad0127470be58790e29d36152bca013784851a5b966906433c20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CXKREENAIH2OEIAKRLABIAU726","target":"graph","payload":{"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"},"verdict_id":"c855c06a-a33e-4cf2-9476-6267d70f7ca3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+OC1xhpeZAfABNbpDFW06A6umueffkbS/jOBi4n6po+OmLS3QhWr0QfiD6QEGL8hYg+rlWFLxrLCjzFc1EqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:24:00.631070Z"},"content_sha256":"51a84c608a5313bb1987fdbba8e8d0bb78af86fae64a63c00e8a246b140cc253","schema_version":"1.0","event_id":"sha256:51a84c608a5313bb1987fdbba8e8d0bb78af86fae64a63c00e8a246b140cc253"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/bundle.json","state_url":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXKREENAIH2OEIAKRLABIAU726/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-27T19:24:00Z","links":{"resolver":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726","bundle":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/bundle.json","state":"https://pith.science/pith/CXKREENAIH2OEIAKRLABIAU726/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXKREENAIH2OEIAKRLABIAU726/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CXKREENAIH2OEIAKRLABIAU726","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":"4d7347f0dce7669914985a007de7f53002945548d5857138f64fc40f06f0291e","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-04-09T04:49:21Z","title_canon_sha256":"ea00505a890dd9811f91e547e7e776fdf0f5c2652b4debddfe9964290f894102"},"schema_version":"1.0","source":{"id":"2604.07796","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.07796","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"arxiv_version","alias_value":"2604.07796v2","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.07796","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_12","alias_value":"CXKREENAIH2O","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_16","alias_value":"CXKREENAIH2OEIAK","created_at":"2026-05-25T02:01:19Z"},{"alias_kind":"pith_short_8","alias_value":"CXKREENA","created_at":"2026-05-25T02:01:19Z"}],"graph_snapshots":[{"event_id":"sha256:51a84c608a5313bb1987fdbba8e8d0bb78af86fae64a63c00e8a246b140cc253","target":"graph","created_at":"2026-05-25T02:01:19Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"eea7821cf94e7a13a62a803dcd390eb15fd11f9a9f12c6a7f520cbbfb677a3f2"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"605df4a1d9a8ce75b573094bec70e9110994df13ff6e75b522448760d1bea886"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.07796/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ivan Lau, Jonathan Scarlett","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-04-09T04:49:21Z","title":"Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.07796","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T18:14:26.529999Z","id":"c855c06a-a33e-4cf2-9476-6267d70f7ca3","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"c855c06a-a33e-4cf2-9476-6267d70f7ca3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e34c2c40a17ad0127470be58790e29d36152bca013784851a5b966906433c20","target":"record","created_at":"2026-05-25T02:01:19Z","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":"4d7347f0dce7669914985a007de7f53002945548d5857138f64fc40f06f0291e","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-04-09T04:49:21Z","title_canon_sha256":"ea00505a890dd9811f91e547e7e776fdf0f5c2652b4debddfe9964290f894102"},"schema_version":"1.0","source":{"id":"2604.07796","kind":"arxiv","version":2}},"canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d51211a041f4e2200a8ac014029fd7819879cb6ff6319fe6b7b792401d16f6","first_computed_at":"2026-05-25T02:01:19.224960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:19.224960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+z3COXutqnnMhsMAxiFQOLzEnETEcvmA4MfbXejZt7SeZtdm2N86JwNJypwEkBw4IaB0bpapBHM2jfFDKKlQBA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:19.225822Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.07796","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e34c2c40a17ad0127470be58790e29d36152bca013784851a5b966906433c20","sha256:51a84c608a5313bb1987fdbba8e8d0bb78af86fae64a63c00e8a246b140cc253"],"state_sha256":"13d9ee107793c8b22d4161b4faa8a3e4869328683bbd8c651dec53a648d78e08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pvo/Dqgu59z0xFsTrNNQa+jiL7sIGk9jNiiIh1Fqx0GFFrUzW2JHXWUG2O5SKq/LK1rbU8ctFvUsUrmrFzBfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:24:00.635312Z","bundle_sha256":"cc9b4210fbbaedd927c0dc255a67da644014ad97db3a6b4b814c8c208325fcea"}}