{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CZ3EJYCHYPDTYHVOGRL3TSQTTL","short_pith_number":"pith:CZ3EJYCH","canonical_record":{"source":{"id":"1511.03774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T04:49:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7c217fabd42f35d79cb69754d799a3ee9b691ca5ed66553ea795c5cf72d092a3","abstract_canon_sha256":"3d48f6bbebe2886481564182c6ebd43e03708e124eb3b319903f9162daec34bb"},"schema_version":"1.0"},"canonical_sha256":"167644e047c3c73c1eae3457b9ca139ae193ec8e71520f3772304008ff3232b3","source":{"kind":"arxiv","id":"1511.03774","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03774","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03774v3","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03774","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"CZ3EJYCHYPDT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZ3EJYCHYPDTYHVO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZ3EJYCH","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CZ3EJYCHYPDTYHVOGRL3TSQTTL","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T04:49:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7c217fabd42f35d79cb69754d799a3ee9b691ca5ed66553ea795c5cf72d092a3","abstract_canon_sha256":"3d48f6bbebe2886481564182c6ebd43e03708e124eb3b319903f9162daec34bb"},"schema_version":"1.0"},"canonical_sha256":"167644e047c3c73c1eae3457b9ca139ae193ec8e71520f3772304008ff3232b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:20.663550Z","signature_b64":"Hirlej8TyNEFnertK433j/c2uMwywNCVPlDMYdEe4j1TpVlnvNpqL39lAOyQKDxOng5SNMNyO8jrgH2CNyPMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167644e047c3c73c1eae3457b9ca139ae193ec8e71520f3772304008ff3232b3","last_reissued_at":"2026-05-18T01:08:20.662882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:20.662882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03774","source_version":3,"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-18T01:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xhh1UjGyguGabcBP3cR/vp70RQMvT2KTPFuPufeYMc48Nr73sQ8R0AMUixFNjDm19v3IkfEZtTzRYiY9+VRkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:21:27.866823Z"},"content_sha256":"670260bea999e0342277063b93b645d0e7c16b2718e2151d23d92a6447a1ae34","schema_version":"1.0","event_id":"sha256:670260bea999e0342277063b93b645d0e7c16b2718e2151d23d92a6447a1ae34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CZ3EJYCHYPDTYHVOGRL3TSQTTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimal Sample Complexity for Best Arm Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Jian Li, Lijie Chen","submitted_at":"2015-11-12T04:49:46Z","abstract_excerpt":"We study the best arm identification (BEST-1-ARM) problem, which is defined as follows. We are given $n$ stochastic bandit arms. The $i$th arm has a reward distribution $D_i$ with an unknown mean $\\mu_{i}$. Upon each play of the $i$th arm, we can get a reward, sampled i.i.d. from $D_i$. We would like to identify the arm with the largest mean with probability at least $1-\\delta$, using as few samples as possible. We provide a nontrivial algorithm for BEST-1-ARM, which improves upon several prior upper bounds on the same problem. We also study an important special case where there are only two a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03774","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":""},"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-18T01:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Oiydzi6T+a+4MN/oG8yY3HmjY4asXjpDSbxqsx+bKAotaDPN1rLFPN/C8F8QiIBr2tM2sy9XQyTUCqiN0+hDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:21:27.867165Z"},"content_sha256":"95888cbb4647a1d92eb85f421e84bcae66e60c4c6dd8f41ee908d4877e7c820d","schema_version":"1.0","event_id":"sha256:95888cbb4647a1d92eb85f421e84bcae66e60c4c6dd8f41ee908d4877e7c820d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/bundle.json","state_url":"https://pith.science/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/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-20T12:21:27Z","links":{"resolver":"https://pith.science/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL","bundle":"https://pith.science/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/bundle.json","state":"https://pith.science/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZ3EJYCHYPDTYHVOGRL3TSQTTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CZ3EJYCHYPDTYHVOGRL3TSQTTL","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":"3d48f6bbebe2886481564182c6ebd43e03708e124eb3b319903f9162daec34bb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T04:49:46Z","title_canon_sha256":"7c217fabd42f35d79cb69754d799a3ee9b691ca5ed66553ea795c5cf72d092a3"},"schema_version":"1.0","source":{"id":"1511.03774","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03774","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03774v3","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03774","created_at":"2026-05-18T01:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"CZ3EJYCHYPDT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZ3EJYCHYPDTYHVO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZ3EJYCH","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:95888cbb4647a1d92eb85f421e84bcae66e60c4c6dd8f41ee908d4877e7c820d","target":"graph","created_at":"2026-05-18T01:08:20Z","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":"We study the best arm identification (BEST-1-ARM) problem, which is defined as follows. We are given $n$ stochastic bandit arms. The $i$th arm has a reward distribution $D_i$ with an unknown mean $\\mu_{i}$. Upon each play of the $i$th arm, we can get a reward, sampled i.i.d. from $D_i$. We would like to identify the arm with the largest mean with probability at least $1-\\delta$, using as few samples as possible. We provide a nontrivial algorithm for BEST-1-ARM, which improves upon several prior upper bounds on the same problem. We also study an important special case where there are only two a","authors_text":"Jian Li, Lijie Chen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T04:49:46Z","title":"On the Optimal Sample Complexity for Best Arm Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03774","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:670260bea999e0342277063b93b645d0e7c16b2718e2151d23d92a6447a1ae34","target":"record","created_at":"2026-05-18T01:08:20Z","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":"3d48f6bbebe2886481564182c6ebd43e03708e124eb3b319903f9162daec34bb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T04:49:46Z","title_canon_sha256":"7c217fabd42f35d79cb69754d799a3ee9b691ca5ed66553ea795c5cf72d092a3"},"schema_version":"1.0","source":{"id":"1511.03774","kind":"arxiv","version":3}},"canonical_sha256":"167644e047c3c73c1eae3457b9ca139ae193ec8e71520f3772304008ff3232b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"167644e047c3c73c1eae3457b9ca139ae193ec8e71520f3772304008ff3232b3","first_computed_at":"2026-05-18T01:08:20.662882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:20.662882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hirlej8TyNEFnertK433j/c2uMwywNCVPlDMYdEe4j1TpVlnvNpqL39lAOyQKDxOng5SNMNyO8jrgH2CNyPMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:20.663550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03774","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:670260bea999e0342277063b93b645d0e7c16b2718e2151d23d92a6447a1ae34","sha256:95888cbb4647a1d92eb85f421e84bcae66e60c4c6dd8f41ee908d4877e7c820d"],"state_sha256":"cdda23a2bd82d794ad38b7d32e13ec85df55b76ac3dcbe5daa2e8874027c781d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKqBhTRK94ozGhpSUy6zvKyqZSNQenEgQ6GQjosWQLc2wzUBB+EB5KOkJEKdjfGX3Q7eK9xEDIwK/a2LWwe+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:21:27.869094Z","bundle_sha256":"4bf8567224dacee6010d205e1dcf49a4e96663ef61529eeab95eaf1a9c765cc3"}}