{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XZ4A3NBTHESGDQQMOOW2XYHWIQ","short_pith_number":"pith:XZ4A3NBT","schema_version":"1.0","canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","source":{"kind":"arxiv","id":"1605.08481","version":1},"attestation_state":"computed","paper":{"title":"Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen","submitted_at":"2016-05-27T00:23:39Z","abstract_excerpt":"The best arm identification problem (BEST-1-ARM) is the most basic pure exploration problem in stochastic multi-armed bandits. The problem has a long history and attracted significant attention for the last decade. However, we do not yet have a complete understanding of the optimal sample complexity of the problem: The state-of-the-art algorithms achieve a sample complexity of $O(\\sum_{i=2}^{n} \\Delta_{i}^{-2}(\\ln\\delta^{-1} + \\ln\\ln\\Delta_i^{-1}))$ ($\\Delta_{i}$ is the difference between the largest mean and the $i^{th}$ mean), while the best known lower bound is $\\Omega(\\sum_{i=2}^{n} \\Delta"},"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":"1605.08481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T00:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"8066884b6e48ffce8af16784c6a656bfe474c55d36b9b746cdc65f53349aee19","abstract_canon_sha256":"232e982d9bb0adacb8ad673f752e6d7e5399763a20df4af130c025586d73e109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.831572Z","signature_b64":"l1vht3BYhYty9Sp25TikaVTvYoHKz39ZT0elNmgCq5cwJDL2/R8ZUfdE+2bdFU7nKLlz5sAWOY5zFk/Uzo4wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be780db433392461c20c73adabe0f64422da60c3546bd6b7d44749918fd1e87c","last_reissued_at":"2026-05-18T01:13:29.830914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.830914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen","submitted_at":"2016-05-27T00:23:39Z","abstract_excerpt":"The best arm identification problem (BEST-1-ARM) is the most basic pure exploration problem in stochastic multi-armed bandits. The problem has a long history and attracted significant attention for the last decade. However, we do not yet have a complete understanding of the optimal sample complexity of the problem: The state-of-the-art algorithms achieve a sample complexity of $O(\\sum_{i=2}^{n} \\Delta_{i}^{-2}(\\ln\\delta^{-1} + \\ln\\ln\\Delta_i^{-1}))$ ($\\Delta_{i}$ is the difference between the largest mean and the $i^{th}$ mean), while the best known lower bound is $\\Omega(\\sum_{i=2}^{n} \\Delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08481","kind":"arxiv","version":1},"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":"1605.08481","created_at":"2026-05-18T01:13:29.831002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08481v1","created_at":"2026-05-18T01:13:29.831002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08481","created_at":"2026-05-18T01:13:29.831002+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ4A3NBTHESG","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ4A3NBTHESGDQQM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ4A3NBT","created_at":"2026-05-18T12:30:51.357362+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/XZ4A3NBTHESGDQQMOOW2XYHWIQ","json":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ.json","graph_json":"https://pith.science/api/pith-number/XZ4A3NBTHESGDQQMOOW2XYHWIQ/graph.json","events_json":"https://pith.science/api/pith-number/XZ4A3NBTHESGDQQMOOW2XYHWIQ/events.json","paper":"https://pith.science/paper/XZ4A3NBT"},"agent_actions":{"view_html":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ","download_json":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ.json","view_paper":"https://pith.science/paper/XZ4A3NBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08481&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ4A3NBTHESGDQQMOOW2XYHWIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ4A3NBTHESGDQQMOOW2XYHWIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/action/storage_attestation","attest_author":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/action/author_attestation","sign_citation":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/action/citation_signature","submit_replication":"https://pith.science/pith/XZ4A3NBTHESGDQQMOOW2XYHWIQ/action/replication_record"}},"created_at":"2026-05-18T01:13:29.831002+00:00","updated_at":"2026-05-18T01:13:29.831002+00:00"}