{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UVDGP4QQ6SYRLQUVK7LCVE74XB","short_pith_number":"pith:UVDGP4QQ","canonical_record":{"source":{"id":"1605.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-29T13:59:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b744fd724aeb6fedb2fe9b2358f5a40a2ccdc7af3cdc9dddb8312e841be2af3c","abstract_canon_sha256":"397f6ca3a65ec5625aef965addddea80ef555f592c036b6d8a5da425e803e409"},"schema_version":"1.0"},"canonical_sha256":"a54667f210f4b115c29557d62a93fcb84bd0f01fb0d6123e8622a9415d11efea","source":{"kind":"arxiv","id":"1605.09004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09004","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09004v1","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09004","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"UVDGP4QQ6SYR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVDGP4QQ6SYRLQUV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVDGP4QQ","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UVDGP4QQ6SYRLQUVK7LCVE74XB","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-29T13:59:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b744fd724aeb6fedb2fe9b2358f5a40a2ccdc7af3cdc9dddb8312e841be2af3c","abstract_canon_sha256":"397f6ca3a65ec5625aef965addddea80ef555f592c036b6d8a5da425e803e409"},"schema_version":"1.0"},"canonical_sha256":"a54667f210f4b115c29557d62a93fcb84bd0f01fb0d6123e8622a9415d11efea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:22.343934Z","signature_b64":"iKNCGAjaX53edyQQ2ncqOmYUptpm2LQLexg7mJivLiMahVvxdA04zSGoP23YevISTygLYQUcepN+Yvd0fyVpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54667f210f4b115c29557d62a93fcb84bd0f01fb0d6123e8622a9415d11efea","last_reissued_at":"2026-05-18T01:13:22.343119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:22.343119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09004","source_version":1,"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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2Ag/MSJJZgWCcv/UPB/I5m8i9fNXDiryCwtwE93piqaMTZZPXLSj+yiORc/FUQOOCT2qymmuXZZ6uqK0UsTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:11:52.096474Z"},"content_sha256":"2529ef00e6abb8b9f0765b94c1da22ee68df4ab02c571fdbee76cf98b96357af","schema_version":"1.0","event_id":"sha256:2529ef00e6abb8b9f0765b94c1da22ee68df4ab02c571fdbee76cf98b96357af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UVDGP4QQ6SYRLQUVK7LCVE74XB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandra Carpentier, Andrea Locatelli","submitted_at":"2016-05-29T13:59:48Z","abstract_excerpt":"We consider the problem of \\textit{best arm identification} with a \\textit{fixed budget $T$}, in the $K$-armed stochastic bandit setting, with arms distribution defined on $[0,1]$. We prove that any bandit strategy, for at least one bandit problem characterized by a complexity $H$, will misidentify the best arm with probability lower bounded by $$\\exp\\Big(-\\frac{T}{\\log(K)H}\\Big),$$ where $H$ is the sum for all sub-optimal arms of the inverse of the squared gaps. Our result disproves formally the general belief - coming from results in the fixed confidence setting - that there must exist an al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09004","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"},"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:13:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OQfKv5h1a7NLNPJNy9+j+72ZguzuPmOO0UCarBsnmsVcJdoEFkKCXtKOFOrI4l6PtRA8mqtGSTbKnNj+znVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:11:52.097191Z"},"content_sha256":"3cb9b4a144c9127a3017bc40ff2e2e3cd2296829a2b5cbe6472ef0c781dd93ae","schema_version":"1.0","event_id":"sha256:3cb9b4a144c9127a3017bc40ff2e2e3cd2296829a2b5cbe6472ef0c781dd93ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/bundle.json","state_url":"https://pith.science/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/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-31T21:11:52Z","links":{"resolver":"https://pith.science/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB","bundle":"https://pith.science/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/bundle.json","state":"https://pith.science/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVDGP4QQ6SYRLQUVK7LCVE74XB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UVDGP4QQ6SYRLQUVK7LCVE74XB","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":"397f6ca3a65ec5625aef965addddea80ef555f592c036b6d8a5da425e803e409","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-29T13:59:48Z","title_canon_sha256":"b744fd724aeb6fedb2fe9b2358f5a40a2ccdc7af3cdc9dddb8312e841be2af3c"},"schema_version":"1.0","source":{"id":"1605.09004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09004","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09004v1","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09004","created_at":"2026-05-18T01:13:22Z"},{"alias_kind":"pith_short_12","alias_value":"UVDGP4QQ6SYR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVDGP4QQ6SYRLQUV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVDGP4QQ","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:3cb9b4a144c9127a3017bc40ff2e2e3cd2296829a2b5cbe6472ef0c781dd93ae","target":"graph","created_at":"2026-05-18T01:13:22Z","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 consider the problem of \\textit{best arm identification} with a \\textit{fixed budget $T$}, in the $K$-armed stochastic bandit setting, with arms distribution defined on $[0,1]$. We prove that any bandit strategy, for at least one bandit problem characterized by a complexity $H$, will misidentify the best arm with probability lower bounded by $$\\exp\\Big(-\\frac{T}{\\log(K)H}\\Big),$$ where $H$ is the sum for all sub-optimal arms of the inverse of the squared gaps. Our result disproves formally the general belief - coming from results in the fixed confidence setting - that there must exist an al","authors_text":"Alexandra Carpentier, Andrea Locatelli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-29T13:59:48Z","title":"Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09004","kind":"arxiv","version":1},"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:2529ef00e6abb8b9f0765b94c1da22ee68df4ab02c571fdbee76cf98b96357af","target":"record","created_at":"2026-05-18T01:13:22Z","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":"397f6ca3a65ec5625aef965addddea80ef555f592c036b6d8a5da425e803e409","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-29T13:59:48Z","title_canon_sha256":"b744fd724aeb6fedb2fe9b2358f5a40a2ccdc7af3cdc9dddb8312e841be2af3c"},"schema_version":"1.0","source":{"id":"1605.09004","kind":"arxiv","version":1}},"canonical_sha256":"a54667f210f4b115c29557d62a93fcb84bd0f01fb0d6123e8622a9415d11efea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a54667f210f4b115c29557d62a93fcb84bd0f01fb0d6123e8622a9415d11efea","first_computed_at":"2026-05-18T01:13:22.343119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:22.343119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKNCGAjaX53edyQQ2ncqOmYUptpm2LQLexg7mJivLiMahVvxdA04zSGoP23YevISTygLYQUcepN+Yvd0fyVpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:22.343934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2529ef00e6abb8b9f0765b94c1da22ee68df4ab02c571fdbee76cf98b96357af","sha256:3cb9b4a144c9127a3017bc40ff2e2e3cd2296829a2b5cbe6472ef0c781dd93ae"],"state_sha256":"0fcf0ccf7934cb1e9b8d7350dbf155a90d052e3829e4a1a18c332774e83f2bdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRJhnDpQ7LrGjhaM/AQAMdPStI/OACxcsgv43xKhoCcGd9T8uvWG3LB9f1Fk25GM92Zd4tDyTTrVxnqvoc/cDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:11:52.101149Z","bundle_sha256":"8e99b164e09ca00f45fb539efe3924737e952d0d5ccff8657fbbd59a8e72a439"}}