{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IDVM6JAF7MVOEOEOOOSDPF2ERJ","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":"67ba814ebbb2c91cf70648e69cda16737de19d0140c9d50d5f0ef3dd0d8843c1","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-12T20:27:17Z","title_canon_sha256":"c083df169433f501550e190a2270c3608734e939e9c3c41dc719c08ae9e050ba"},"schema_version":"1.0","source":{"id":"2605.12720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12720","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12720v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12720","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"IDVM6JAF7MVO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IDVM6JAF7MVOEOEO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IDVM6JAF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:657749128e05247788bfd47dfca4caa857efea031103809170ae00df02271e6d","target":"graph","created_at":"2026-05-18T03:09:49Z","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":"it is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes. This is accomplished by using a new class of WAIT e-processes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The definitions of asymptotic optimality for tests and log-optimality for e-processes are compatible in the sense that the optimal rate for stopping times directly translates to the optimal growth rate for the e-process under the alternative."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes via Weighted Aggregates of Indicators of stopping Times (WAIT e-processes)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes using WAIT e-processes."}],"snapshot_sha256":"afdb7f3cb5c2f37fa83a19f2ab5830b7608ff54dbf333cfea1051b0bb34d8b1d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"It has been recently shown that e-processes are sufficient for sequential testing in the following sense: every level-$\\alpha$ sequential test can be obtained by thresholding an e-process at $1/\\alpha$. However, in the above result, neither does the test have to be asymptotically optimal (in terms of stopping times) nor does the e-process have to be asymptotically log-optimal. It has separately been shown that asymptotically log-optimal e-processes yield asymptotically optimal sequential tests. In this paper, we prove the converse, arguably completing the story: it is possible to aggregate asy","authors_text":"Aaditya Ramdas, Ashwin Ram","cross_cats":["math.PR","stat.ML","stat.TH"],"headline":"Asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes using WAIT e-processes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-12T20:27:17Z","title":"Optimal sequential tests yield log-optimal e-processes"},"references":{"count":36,"internal_anchors":0,"resolved_work":36,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"and Ramdas, Aaditya , journal=","work_id":"988d863e-43ad-4df8-9ed4-321b25a5901d","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"New England Journal of Statistics in Data Science , volume=","work_id":"d1f9dc28-22e0-4a66-a33e-cb23db666eb3","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Howard and Aaditya Ramdas and Jon McAuliffe and Jasjeet S","work_id":"de0ef42a-4762-4e68-b422-0709c6e2d99d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology) , year =","work_id":"ecd0c391-a028-4e6f-ba9a-22e777da3b26","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Ramdas, Aaditya and Wang, Ruodu , title =. Foundations and Trends. 2025 , volume =","work_id":"a2d5745a-e104-4436-807c-4c44e4e06e22","year":2025}],"snapshot_sha256":"6f2df869e7dee4ea86c1606396fda075274a4f2dd4a9de1a7b7d4bc17a6162a1"},"source":{"id":"2605.12720","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:46:39.543688Z","id":"2e53a574-cbc5-4302-875e-684543d5d3bb","model_set":{"reader":"grok-4.3"},"one_line_summary":"Asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes via Weighted Aggregates of Indicators of stopping Times (WAIT e-processes).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Asymptotically optimal sequential tests can be aggregated into asymptotically log-optimal e-processes using WAIT e-processes.","strongest_claim":"it is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes. This is accomplished by using a new class of WAIT e-processes.","weakest_assumption":"The definitions of asymptotic optimality for tests and log-optimality for e-processes are compatible in the sense that the optimal rate for stopping times directly translates to the optimal growth rate for the e-process under the alternative."}},"verdict_id":"2e53a574-cbc5-4302-875e-684543d5d3bb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10db3a7da2dd4d7860c1a8e73ffa3bb91938e772bcb6d05991b4bb3fad2f3dce","target":"record","created_at":"2026-05-18T03:09:49Z","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":"67ba814ebbb2c91cf70648e69cda16737de19d0140c9d50d5f0ef3dd0d8843c1","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-12T20:27:17Z","title_canon_sha256":"c083df169433f501550e190a2270c3608734e939e9c3c41dc719c08ae9e050ba"},"schema_version":"1.0","source":{"id":"2605.12720","kind":"arxiv","version":1}},"canonical_sha256":"40eacf2405fb2ae2388e73a43797448a513c406649dbc2ae7525159f8872adad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40eacf2405fb2ae2388e73a43797448a513c406649dbc2ae7525159f8872adad","first_computed_at":"2026-05-18T03:09:49.407702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:49.407702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EFioSd+YRhbSCzu4cnsNCTYJK3Wd+KcX0iTpNL8LcgOtpPa/yvo5ZzzPDL5W+4QNKublEer1bEe1hVExEnTwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:49.408520Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10db3a7da2dd4d7860c1a8e73ffa3bb91938e772bcb6d05991b4bb3fad2f3dce","sha256:657749128e05247788bfd47dfca4caa857efea031103809170ae00df02271e6d"],"state_sha256":"778e82b84d8b3cfb117d3fb2d0072ea33fe11a587c29f08e1166d972435ba61e"}