{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UW3ZYWWUPFBQLPDIWTKSQHYQUW","short_pith_number":"pith:UW3ZYWWU","schema_version":"1.0","canonical_sha256":"a5b79c5ad4794305bc68b4d5281f10a59dc6640a9336ea54443cc69364863d60","source":{"kind":"arxiv","id":"1908.09094","version":3},"attestation_state":"computed","paper":{"title":"Optimal $\\delta$-Correct Best-Arm Selection for Heavy-Tailed Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter Glynn, Sandeep Juneja, Shubhada Agrawal","submitted_at":"2019-08-24T05:31:49Z","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"},"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":"1908.09094","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-24T05:31:49Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"03bbcd5c7eab53935e10fd39dc177bf951190c240ed638fa4afe3fe40e2d1953","abstract_canon_sha256":"9e22d32fd9f8ba969775fea4e067c117e173efaf87290be073de6e02b41fbe4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:41.399119Z","signature_b64":"7XXmQnSvYAohPTJ+FnX1KiZC0CT4dLE86gcKXIre6KZxa+818VT0onV/OLhNvjYdyfOHMM+2ummZcAgKjGtwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5b79c5ad4794305bc68b4d5281f10a59dc6640a9336ea54443cc69364863d60","last_reissued_at":"2026-07-05T07:15:41.398542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:41.398542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal $\\delta$-Correct Best-Arm Selection for Heavy-Tailed Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter Glynn, Sandeep Juneja, Shubhada Agrawal","submitted_at":"2019-08-24T05:31:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09094","kind":"arxiv","version":3},"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/1908.09094/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":"1908.09094","created_at":"2026-07-05T07:15:41.398588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09094v3","created_at":"2026-07-05T07:15:41.398588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09094","created_at":"2026-07-05T07:15:41.398588+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW3ZYWWUPFBQ","created_at":"2026-07-05T07:15:41.398588+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW3ZYWWUPFBQLPDI","created_at":"2026-07-05T07:15:41.398588+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW3ZYWWU","created_at":"2026-07-05T07:15:41.398588+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW","json":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW.json","graph_json":"https://pith.science/api/pith-number/UW3ZYWWUPFBQLPDIWTKSQHYQUW/graph.json","events_json":"https://pith.science/api/pith-number/UW3ZYWWUPFBQLPDIWTKSQHYQUW/events.json","paper":"https://pith.science/paper/UW3ZYWWU"},"agent_actions":{"view_html":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW","download_json":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW.json","view_paper":"https://pith.science/paper/UW3ZYWWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09094&json=true","fetch_graph":"https://pith.science/api/pith-number/UW3ZYWWUPFBQLPDIWTKSQHYQUW/graph.json","fetch_events":"https://pith.science/api/pith-number/UW3ZYWWUPFBQLPDIWTKSQHYQUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW/action/storage_attestation","attest_author":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW/action/author_attestation","sign_citation":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW/action/citation_signature","submit_replication":"https://pith.science/pith/UW3ZYWWUPFBQLPDIWTKSQHYQUW/action/replication_record"}},"created_at":"2026-07-05T07:15:41.398588+00:00","updated_at":"2026-07-05T07:15:41.398588+00:00"}