{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BFUOTESD74MWE7VHYF2WEZU24F","short_pith_number":"pith:BFUOTESD","schema_version":"1.0","canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","source":{"kind":"arxiv","id":"1608.06031","version":2},"attestation_state":"computed","paper":{"title":"Towards Instance Optimal Bounds for Best Arm Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","submitted_at":"2016-08-22T02:05:10Z","abstract_excerpt":"In the classical best arm identification (Best-$1$-Arm) problem, we are given $n$ stochastic bandit arms, each associated with a reward distribution with an unknown mean. We would like to identify the arm with the largest mean with probability at least $1-\\delta$, using as few samples as possible. Understanding the sample complexity of Best-$1$-Arm has attracted significant attention since the last decade. However, the exact sample complexity of the problem is still unknown.\n  Recently, Chen and Li made the gap-entropy conjecture concerning the instance sample complexity of Best-$1$-Arm. Given"},"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":"1608.06031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T02:05:10Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"38a171ce3f17d894a31b78de3d131d17d9ecf86746b8841ecd9191437fb63ee3","abstract_canon_sha256":"4aeefe2cf1a23b50f652f52151dc3d27c5d50b7c4275edd928cd16cc4ed80854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.060708Z","signature_b64":"gO14isPcCfazpXmrXepvzBpeE7pnnIf5c9pCZ90jKG7hKGNvGPLMTaQHdG15gb9zmE1XuQCFiPb5ZmTWxe2iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","last_reissued_at":"2026-05-18T00:43:48.060003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.060003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Instance Optimal Bounds for Best Arm Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","submitted_at":"2016-08-22T02:05:10Z","abstract_excerpt":"In the classical best arm identification (Best-$1$-Arm) problem, we are given $n$ stochastic bandit arms, each associated with a reward distribution with an unknown mean. We would like to identify the arm with the largest mean with probability at least $1-\\delta$, using as few samples as possible. Understanding the sample complexity of Best-$1$-Arm has attracted significant attention since the last decade. However, the exact sample complexity of the problem is still unknown.\n  Recently, Chen and Li made the gap-entropy conjecture concerning the instance sample complexity of Best-$1$-Arm. Given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06031","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1608.06031","created_at":"2026-05-18T00:43:48.060099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06031v2","created_at":"2026-05-18T00:43:48.060099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06031","created_at":"2026-05-18T00:43:48.060099+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFUOTESD74MW","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFUOTESD74MWE7VH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFUOTESD","created_at":"2026-05-18T12:30:07.202191+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/BFUOTESD74MWE7VHYF2WEZU24F","json":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F.json","graph_json":"https://pith.science/api/pith-number/BFUOTESD74MWE7VHYF2WEZU24F/graph.json","events_json":"https://pith.science/api/pith-number/BFUOTESD74MWE7VHYF2WEZU24F/events.json","paper":"https://pith.science/paper/BFUOTESD"},"agent_actions":{"view_html":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F","download_json":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F.json","view_paper":"https://pith.science/paper/BFUOTESD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06031&json=true","fetch_graph":"https://pith.science/api/pith-number/BFUOTESD74MWE7VHYF2WEZU24F/graph.json","fetch_events":"https://pith.science/api/pith-number/BFUOTESD74MWE7VHYF2WEZU24F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/action/storage_attestation","attest_author":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/action/author_attestation","sign_citation":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/action/citation_signature","submit_replication":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/action/replication_record"}},"created_at":"2026-05-18T00:43:48.060099+00:00","updated_at":"2026-05-18T00:43:48.060099+00:00"}