{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UW3ZYWWUPFBQLPDIWTKSQHYQUW","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":"9e22d32fd9f8ba969775fea4e067c117e173efaf87290be073de6e02b41fbe4d","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-24T05:31:49Z","title_canon_sha256":"03bbcd5c7eab53935e10fd39dc177bf951190c240ed638fa4afe3fe40e2d1953"},"schema_version":"1.0","source":{"id":"1908.09094","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09094","created_at":"2026-07-05T07:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09094v3","created_at":"2026-07-05T07:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09094","created_at":"2026-07-05T07:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"UW3ZYWWUPFBQ","created_at":"2026-07-05T07:15:41Z"},{"alias_kind":"pith_short_16","alias_value":"UW3ZYWWUPFBQLPDI","created_at":"2026-07-05T07:15:41Z"},{"alias_kind":"pith_short_8","alias_value":"UW3ZYWWU","created_at":"2026-07-05T07:15:41Z"}],"graph_snapshots":[{"event_id":"sha256:24c83ecf181017c576b586201d5e9ae2fd281ef7b4b5a353731dafd776384ec7","target":"graph","created_at":"2026-07-05T07:15:41Z","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/1908.09094/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a finite set of unknown distributions or arms that can be sampled, we consider the problem of identifying the one with the maximum mean using a $\\delta$-correct algorithm (an adaptive, sequential algorithm that restricts the probability of error to a specified $\\delta$) that has minimum sample complexity. Lower bounds for $\\delta$-correct algorithms are well known. $\\delta$-correct algorithms that match the lower bound asymptotically as $\\delta$ reduces to zero have been previously developed when arm distributions are restricted to a single parameter exponential family. In this paper, we","authors_text":"Peter Glynn, Sandeep Juneja, Shubhada Agrawal","cross_cats":["math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-24T05:31:49Z","title":"Optimal $\\delta$-Correct Best-Arm Selection for Heavy-Tailed Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09094","kind":"arxiv","version":3},"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:b396df7384ca992c07c41744f1107ab396e3b3fdebd73fed90651cf90efd7331","target":"record","created_at":"2026-07-05T07:15:41Z","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":"9e22d32fd9f8ba969775fea4e067c117e173efaf87290be073de6e02b41fbe4d","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-24T05:31:49Z","title_canon_sha256":"03bbcd5c7eab53935e10fd39dc177bf951190c240ed638fa4afe3fe40e2d1953"},"schema_version":"1.0","source":{"id":"1908.09094","kind":"arxiv","version":3}},"canonical_sha256":"a5b79c5ad4794305bc68b4d5281f10a59dc6640a9336ea54443cc69364863d60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5b79c5ad4794305bc68b4d5281f10a59dc6640a9336ea54443cc69364863d60","first_computed_at":"2026-07-05T07:15:41.398542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:41.398542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XXmQnSvYAohPTJ+FnX1KiZC0CT4dLE86gcKXIre6KZxa+818VT0onV/OLhNvjYdyfOHMM+2ummZcAgKjGtwDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:41.399119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09094","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b396df7384ca992c07c41744f1107ab396e3b3fdebd73fed90651cf90efd7331","sha256:24c83ecf181017c576b586201d5e9ae2fd281ef7b4b5a353731dafd776384ec7"],"state_sha256":"75cd75831328b9b28b1d60f8f66338536a66fb69014921dd8133aa8e91977b2e"}