{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BFUOTESD74MWE7VHYF2WEZU24F","short_pith_number":"pith:BFUOTESD","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"},"canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","source":{"kind":"arxiv","id":"1608.06031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06031","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06031v2","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06031","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"BFUOTESD74MW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFUOTESD74MWE7VH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFUOTESD","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BFUOTESD74MWE7VHYF2WEZU24F","target":"record","payload":{"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"},"canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","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"},"source_kind":"arxiv","source_id":"1608.06031","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4354XnWlVXFlZTzA73SNvJBKKLu6cvPSrKj/wpKWijqrvF14JIGPVgnWkpkGGkDBKxoWACy9VQs5sgQ9afgmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:53:12.638724Z"},"content_sha256":"7bb90419a1ed651eea1578bd302b196cba815c0988cc353327df1c8f77650639","schema_version":"1.0","event_id":"sha256:7bb90419a1ed651eea1578bd302b196cba815c0988cc353327df1c8f77650639"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BFUOTESD74MWE7VHYF2WEZU24F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTfHvb36nqETEmpbPA3/WK6tNzGJbHdfX8pl1riTtShjzP0Yq5JIjKO4PDFBxZa7quINudrL7YumVBR6sCQ0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T03:53:12.639090Z"},"content_sha256":"74610d18dd190276957df4735f0619fb164e4740df33dd409740196637bdb1b8","schema_version":"1.0","event_id":"sha256:74610d18dd190276957df4735f0619fb164e4740df33dd409740196637bdb1b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/bundle.json","state_url":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFUOTESD74MWE7VHYF2WEZU24F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T03:53:12Z","links":{"resolver":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F","bundle":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/bundle.json","state":"https://pith.science/pith/BFUOTESD74MWE7VHYF2WEZU24F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFUOTESD74MWE7VHYF2WEZU24F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BFUOTESD74MWE7VHYF2WEZU24F","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":"4aeefe2cf1a23b50f652f52151dc3d27c5d50b7c4275edd928cd16cc4ed80854","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T02:05:10Z","title_canon_sha256":"38a171ce3f17d894a31b78de3d131d17d9ecf86746b8841ecd9191437fb63ee3"},"schema_version":"1.0","source":{"id":"1608.06031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06031","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06031v2","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06031","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"BFUOTESD74MW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BFUOTESD74MWE7VH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BFUOTESD","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:74610d18dd190276957df4735f0619fb164e4740df33dd409740196637bdb1b8","target":"graph","created_at":"2026-05-18T00:43:48Z","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"},"paper":{"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","authors_text":"Jian Li, Lijie Chen, Mingda Qiao","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T02:05:10Z","title":"Towards Instance Optimal Bounds for Best Arm Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06031","kind":"arxiv","version":2},"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:7bb90419a1ed651eea1578bd302b196cba815c0988cc353327df1c8f77650639","target":"record","created_at":"2026-05-18T00:43:48Z","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":"4aeefe2cf1a23b50f652f52151dc3d27c5d50b7c4275edd928cd16cc4ed80854","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T02:05:10Z","title_canon_sha256":"38a171ce3f17d894a31b78de3d131d17d9ecf86746b8841ecd9191437fb63ee3"},"schema_version":"1.0","source":{"id":"1608.06031","kind":"arxiv","version":2}},"canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0968e99243ff19627ea7c17562669ae170bbc8235243e207018fe2a3e5f09377","first_computed_at":"2026-05-18T00:43:48.060003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.060003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gO14isPcCfazpXmrXepvzBpeE7pnnIf5c9pCZ90jKG7hKGNvGPLMTaQHdG15gb9zmE1XuQCFiPb5ZmTWxe2iDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.060708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bb90419a1ed651eea1578bd302b196cba815c0988cc353327df1c8f77650639","sha256:74610d18dd190276957df4735f0619fb164e4740df33dd409740196637bdb1b8"],"state_sha256":"9de1af587f3ea92f224bbd2e53474a2700c4c5f0c2c894db48d40d69b5a375ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xAtFMA5wMiYXy3kQE0Q2B1vYHz2vxygI3Lpl28a+kva92UjafuMQEIM2b5pBtvIcdfyTou0PdCMQAg6/gxyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T03:53:12.642667Z","bundle_sha256":"27425f7626d4a2db19d163411d1c10a2822db172796d1ba490357f53044261c4"}}