{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OQ45OWYG7HKUFDLSKRVEZURUVT","short_pith_number":"pith:OQ45OWYG","canonical_record":{"source":{"id":"1407.4443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-16T19:44:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27c891559b2672ece4416c5e76b06392db1ab21574c0d3fdf53c9330901243c7","abstract_canon_sha256":"dd1ebc9361bd69727f12b05aebc9f52bb39abac30c7c0ed639c81bcf853f479e"},"schema_version":"1.0"},"canonical_sha256":"7439d75b06f9d5428d72546a4cd234accfe0b9e293faa0a473e29474877830c6","source":{"kind":"arxiv","id":"1407.4443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4443","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4443v2","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4443","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"OQ45OWYG7HKU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OQ45OWYG7HKUFDLS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OQ45OWYG","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OQ45OWYG7HKUFDLSKRVEZURUVT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-16T19:44:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27c891559b2672ece4416c5e76b06392db1ab21574c0d3fdf53c9330901243c7","abstract_canon_sha256":"dd1ebc9361bd69727f12b05aebc9f52bb39abac30c7c0ed639c81bcf853f479e"},"schema_version":"1.0"},"canonical_sha256":"7439d75b06f9d5428d72546a4cd234accfe0b9e293faa0a473e29474877830c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:28.042701Z","signature_b64":"0WYqdChFYecfc5xsTYdva3ERTwUQJRsyfEj2cndSwQQJIas4PEB1oh0y5jBa3kkiZOLfNCXOaDjdQmgD4LMKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7439d75b06f9d5428d72546a4cd234accfe0b9e293faa0a473e29474877830c6","last_reissued_at":"2026-05-18T00:59:28.042047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:28.042047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4443","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:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQrpdASgLtdrzBW/TWPCe6SHm13nx0LFmqO098LUojm/g5BdLWKeEDn57lfhx7hRAULHUwuPCyqifYMXN8AgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:49:42.674522Z"},"content_sha256":"c4926e5c2bd72d7e1df737c727e87a912354ed07b979c4a784951d832588c554","schema_version":"1.0","event_id":"sha256:c4926e5c2bd72d7e1df737c727e87a912354ed07b979c4a784951d832588c554"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OQ45OWYG7HKUFDLSKRVEZURUVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Best Arm Identification in Multi-Armed Bandit Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (SEQUEL, LTCI), Olivier Capp\\'e (LTCI)","submitted_at":"2014-07-16T19:44:15Z","abstract_excerpt":"The stochastic multi-armed bandit model is a simple abstraction that has proven useful in many different contexts in statistics and machine learning. Whereas the achievable limit in terms of regret minimization is now well known, our aim is to contribute to a better understanding of the performance in terms of identifying the m best arms. We introduce generic notions of complexity for the two dominant frameworks considered in the literature: fixed-budget and fixed-confidence settings. In the fixed-confidence setting, we provide the first known distribution-dependent lower bound on the complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4443","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:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XP0I69qjPnyCcbG1Isw7FwJSvg43Hp9pbgaIkOuo3O8MldL4DCXo1BvUs9axqCAIcvrYrht9H93l5NrjeN3kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:49:42.674878Z"},"content_sha256":"d5332156177719ac62a2b27c12f79ed158f44c03edc8b9f5843435f176789c90","schema_version":"1.0","event_id":"sha256:d5332156177719ac62a2b27c12f79ed158f44c03edc8b9f5843435f176789c90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/bundle.json","state_url":"https://pith.science/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/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-06-10T14:49:42Z","links":{"resolver":"https://pith.science/pith/OQ45OWYG7HKUFDLSKRVEZURUVT","bundle":"https://pith.science/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/bundle.json","state":"https://pith.science/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ45OWYG7HKUFDLSKRVEZURUVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OQ45OWYG7HKUFDLSKRVEZURUVT","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":"dd1ebc9361bd69727f12b05aebc9f52bb39abac30c7c0ed639c81bcf853f479e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-16T19:44:15Z","title_canon_sha256":"27c891559b2672ece4416c5e76b06392db1ab21574c0d3fdf53c9330901243c7"},"schema_version":"1.0","source":{"id":"1407.4443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4443","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4443v2","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4443","created_at":"2026-05-18T00:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"OQ45OWYG7HKU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OQ45OWYG7HKUFDLS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OQ45OWYG","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d5332156177719ac62a2b27c12f79ed158f44c03edc8b9f5843435f176789c90","target":"graph","created_at":"2026-05-18T00:59:28Z","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":"The stochastic multi-armed bandit model is a simple abstraction that has proven useful in many different contexts in statistics and machine learning. Whereas the achievable limit in terms of regret minimization is now well known, our aim is to contribute to a better understanding of the performance in terms of identifying the m best arms. We introduce generic notions of complexity for the two dominant frameworks considered in the literature: fixed-budget and fixed-confidence settings. In the fixed-confidence setting, we provide the first known distribution-dependent lower bound on the complexi","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (SEQUEL, LTCI), Olivier Capp\\'e (LTCI)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-16T19:44:15Z","title":"On the Complexity of Best Arm Identification in Multi-Armed Bandit Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4443","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:c4926e5c2bd72d7e1df737c727e87a912354ed07b979c4a784951d832588c554","target":"record","created_at":"2026-05-18T00:59:28Z","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":"dd1ebc9361bd69727f12b05aebc9f52bb39abac30c7c0ed639c81bcf853f479e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-16T19:44:15Z","title_canon_sha256":"27c891559b2672ece4416c5e76b06392db1ab21574c0d3fdf53c9330901243c7"},"schema_version":"1.0","source":{"id":"1407.4443","kind":"arxiv","version":2}},"canonical_sha256":"7439d75b06f9d5428d72546a4cd234accfe0b9e293faa0a473e29474877830c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7439d75b06f9d5428d72546a4cd234accfe0b9e293faa0a473e29474877830c6","first_computed_at":"2026-05-18T00:59:28.042047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:28.042047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0WYqdChFYecfc5xsTYdva3ERTwUQJRsyfEj2cndSwQQJIas4PEB1oh0y5jBa3kkiZOLfNCXOaDjdQmgD4LMKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:28.042701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4926e5c2bd72d7e1df737c727e87a912354ed07b979c4a784951d832588c554","sha256:d5332156177719ac62a2b27c12f79ed158f44c03edc8b9f5843435f176789c90"],"state_sha256":"ce791d63f8b0d66120f68b36a75494908b0b8b86e7c6ee571be48557d1df4d24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbAHfCnjmJkEHeoz+xgCVZeTxsUds2XNycon4cOwL68UiobHrOupc950EciLTe6smR1PpfB/+x1kdxPNVWU4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:49:42.676816Z","bundle_sha256":"b6bd00b42a52a6d862a472d42b5b800198b6a548954ad32921e7a9e4b647cab1"}}