{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:V3L4XTLBSGJQ3TJYJJSPUOLF6M","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":"23d6513a920e4ff768c9095017c716a6459706ea5a692f2607c26ce6a0ea3621","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-12T13:06:11Z","title_canon_sha256":"393dc6533692abc99eaa8133ccfab7995a91ee772fdcf37f1ae6f867df0b1dbe"},"schema_version":"1.0","source":{"id":"2205.06069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.06069","created_at":"2026-07-05T04:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"2205.06069v1","created_at":"2026-07-05T04:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06069","created_at":"2026-07-05T04:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"V3L4XTLBSGJQ","created_at":"2026-07-05T04:22:45Z"},{"alias_kind":"pith_short_16","alias_value":"V3L4XTLBSGJQ3TJY","created_at":"2026-07-05T04:22:45Z"},{"alias_kind":"pith_short_8","alias_value":"V3L4XTLB","created_at":"2026-07-05T04:22:45Z"}],"graph_snapshots":[{"event_id":"sha256:1b2b32b734aa045deee653945ecaf73effd3f13aa61b3986cb54a3cbbde7c734","target":"graph","created_at":"2026-07-05T04:22:45Z","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/2205.06069/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"What advantage do \\emph{sequential} procedures provide over batch algorithms for testing properties of unknown distributions? Focusing on the problem of testing whether two distributions $\\mathcal{D}_1$ and $\\mathcal{D}_2$ on $\\{1,\\dots, n\\}$ are equal or $\\epsilon$-far, we give several answers to this question. We show that for a small alphabet size $n$, there is a sequential algorithm that outperforms any batch algorithm by a factor of at least $4$ in terms sample complexity. For a general alphabet size $n$, we give a sequential algorithm that uses no more samples than its batch counterpart,","authors_text":"Aadil Oufkir, Aur\\'elien Garivier, Nicolas Flammarion, Omar Fawzi","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-12T13:06:11Z","title":"Sequential algorithms for testing identity and closeness of distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06069","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:487f4b087b947ebea8aafea608703b1cfb35ca68ac98c36a83f7c3b014fcc378","target":"record","created_at":"2026-07-05T04:22:45Z","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":"23d6513a920e4ff768c9095017c716a6459706ea5a692f2607c26ce6a0ea3621","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-12T13:06:11Z","title_canon_sha256":"393dc6533692abc99eaa8133ccfab7995a91ee772fdcf37f1ae6f867df0b1dbe"},"schema_version":"1.0","source":{"id":"2205.06069","kind":"arxiv","version":1}},"canonical_sha256":"aed7cbcd6191930dcd384a64fa3965f313a9ce68ac309f443631687637330939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aed7cbcd6191930dcd384a64fa3965f313a9ce68ac309f443631687637330939","first_computed_at":"2026-07-05T04:22:45.194943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:22:45.194943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UyL+KgZeqf4HPuvM6ms4gXhwXnho5Qn88Z9YuB8n5vhRqtCHg+iEZeUJbC2Gn9hFd0s9td5BlW9Y+Pkzi1ZyBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:22:45.195417Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.06069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:487f4b087b947ebea8aafea608703b1cfb35ca68ac98c36a83f7c3b014fcc378","sha256:1b2b32b734aa045deee653945ecaf73effd3f13aa61b3986cb54a3cbbde7c734"],"state_sha256":"933f48a9069cf548cc31e4c9689de6f5ae28aea19dde33a966e58ba1f9ed2f85"}