{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QVCAZ3RPDD2YBNVN3VQOKNYMOR","short_pith_number":"pith:QVCAZ3RP","schema_version":"1.0","canonical_sha256":"85440cee2f18f580b6addd60e5370c744802c704fa14b450f6843c9a68c9659b","source":{"kind":"arxiv","id":"2504.02818","version":1},"attestation_state":"computed","paper":{"title":"Universal Log-Optimality for General Classes of e-processes and Sequential Hypothesis Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Ian Waudby-Smith, Michael I. Jordan, Ricardo Sandoval","submitted_at":"2025-04-03T17:58:10Z","abstract_excerpt":"We consider the problem of sequential hypothesis testing by betting. For a general class of composite testing problems -- which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases -- we show that any $e$-process satisfying a certain sublinear regret bound is adaptively, asymptotically, and almost surely log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems and we provide explicit test supermart"},"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":"2504.02818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-04-03T17:58:10Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"df79a2748619cd89aa92269812f6c97fe5bd9bf14145207d4d886d8edba85cf8","abstract_canon_sha256":"0db00a4d4a97a01382aee9d777dc1b42982e248e2f5485994c8ac65b1a69a616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:02.759531Z","signature_b64":"J7rx67AqV1YohEa7p/nSTdftKWR5aHOk0vCjkGOP1J11iscjyRY9VR7SD+A8LxpNh0MTCG5ZUuqzCHHeIkNKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85440cee2f18f580b6addd60e5370c744802c704fa14b450f6843c9a68c9659b","last_reissued_at":"2026-07-05T10:44:02.759059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:02.759059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Log-Optimality for General Classes of e-processes and Sequential Hypothesis Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Ian Waudby-Smith, Michael I. Jordan, Ricardo Sandoval","submitted_at":"2025-04-03T17:58:10Z","abstract_excerpt":"We consider the problem of sequential hypothesis testing by betting. For a general class of composite testing problems -- which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases -- we show that any $e$-process satisfying a certain sublinear regret bound is adaptively, asymptotically, and almost surely log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems and we provide explicit test supermart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02818","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/2504.02818/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":"2504.02818","created_at":"2026-07-05T10:44:02.759116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.02818v1","created_at":"2026-07-05T10:44:02.759116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02818","created_at":"2026-07-05T10:44:02.759116+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVCAZ3RPDD2Y","created_at":"2026-07-05T10:44:02.759116+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVCAZ3RPDD2YBNVN","created_at":"2026-07-05T10:44:02.759116+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVCAZ3RP","created_at":"2026-07-05T10:44:02.759116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02101","citing_title":"Sequential Structure-Sensitive Residual Diagnostics for PDE Inverse Problems","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05072","citing_title":"Adaptive Sequential Change Detection using Mixtures of Predictive Distributions","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28533","citing_title":"Semi-Supervised Hypothesis Testing by Betting on Predictions","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21851","citing_title":"Betting on Bets: Anytime-Valid Tests for Stochastic Dominance","ref_index":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR","json":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR.json","graph_json":"https://pith.science/api/pith-number/QVCAZ3RPDD2YBNVN3VQOKNYMOR/graph.json","events_json":"https://pith.science/api/pith-number/QVCAZ3RPDD2YBNVN3VQOKNYMOR/events.json","paper":"https://pith.science/paper/QVCAZ3RP"},"agent_actions":{"view_html":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR","download_json":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR.json","view_paper":"https://pith.science/paper/QVCAZ3RP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.02818&json=true","fetch_graph":"https://pith.science/api/pith-number/QVCAZ3RPDD2YBNVN3VQOKNYMOR/graph.json","fetch_events":"https://pith.science/api/pith-number/QVCAZ3RPDD2YBNVN3VQOKNYMOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR/action/storage_attestation","attest_author":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR/action/author_attestation","sign_citation":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR/action/citation_signature","submit_replication":"https://pith.science/pith/QVCAZ3RPDD2YBNVN3VQOKNYMOR/action/replication_record"}},"created_at":"2026-07-05T10:44:02.759116+00:00","updated_at":"2026-07-05T10:44:02.759116+00:00"}