{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VYBGI5A6V2E5FJSDA4CHADXMPK","short_pith_number":"pith:VYBGI5A6","canonical_record":{"source":{"id":"1602.04589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T08:25:02Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"852b7d4d5f2e45886ce65e5384a4a84fc7cd1cbeb27067d6640bf8aebbe94e4c","abstract_canon_sha256":"4b515a057aeb489753b936d8b4f915c7a29c4b98c7ebc2ba8a3e44d400de7b2b"},"schema_version":"1.0"},"canonical_sha256":"ae0264741eae89d2a6430704700eec7a9ad7f52383623383974197267af26330","source":{"kind":"arxiv","id":"1602.04589","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04589","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04589v2","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04589","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"VYBGI5A6V2E5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYBGI5A6V2E5FJSD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYBGI5A6","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VYBGI5A6V2E5FJSDA4CHADXMPK","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T08:25:02Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"852b7d4d5f2e45886ce65e5384a4a84fc7cd1cbeb27067d6640bf8aebbe94e4c","abstract_canon_sha256":"4b515a057aeb489753b936d8b4f915c7a29c4b98c7ebc2ba8a3e44d400de7b2b"},"schema_version":"1.0"},"canonical_sha256":"ae0264741eae89d2a6430704700eec7a9ad7f52383623383974197267af26330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:09.418246Z","signature_b64":"GVusTlrUg/hIhpVeDut2cnNg5X0kMRI/60dYVfYD0VxVJmp3YhUZjGw4xX8pJFCDTAtmbnmq3wOrUDNwiC5jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0264741eae89d2a6430704700eec7a9ad7f52383623383974197267af26330","last_reissued_at":"2026-05-18T01:13:09.417902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:09.417902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04589","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-18T01:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bqjp/lPLEejOiikhwSaFWUOs1qxcre4ncBCQGvudzny8P3zTlGIePGalbD5S6K/b+LqMcZKqGnGX5BFEoH4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:00.278221Z"},"content_sha256":"8e043adc47981810ffcc2c1f09b2f9aba30101c270960a13658c412d082b9672","schema_version":"1.0","event_id":"sha256:8e043adc47981810ffcc2c1f09b2f9aba30101c270960a13658c412d082b9672"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VYBGI5A6V2E5FJSDA4CHADXMPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Best Arm Identification with Fixed Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (CRIStAL, SEQUEL)","submitted_at":"2016-02-15T08:25:02Z","abstract_excerpt":"We give a complete characterization of the complexity of best-arm identification in one-parameter bandit problems. We prove a new, tight lower bound on the sample complexity. We propose the `Track-and-Stop' strategy, which we prove to be asymptotically optimal. It consists in a new sampling rule (which tracks the optimal proportions of arm draws highlighted by the lower bound) and in a stopping rule named after Chernoff, for which we give a new analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04589","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-18T01:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pMkMuLvLUWYt9oCKqIEKEXXxxfjAJ3beiV1dxvqgboU5uxJRcXDGJgbw8eo+c5CyDDd6KyI8NvZYFcVDjNQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:53:00.278586Z"},"content_sha256":"14486656155e53b8516583ea241074117ae3694f157eda4658c92af3377830f4","schema_version":"1.0","event_id":"sha256:14486656155e53b8516583ea241074117ae3694f157eda4658c92af3377830f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/bundle.json","state_url":"https://pith.science/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/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-03T21:53:00Z","links":{"resolver":"https://pith.science/pith/VYBGI5A6V2E5FJSDA4CHADXMPK","bundle":"https://pith.science/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/bundle.json","state":"https://pith.science/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYBGI5A6V2E5FJSDA4CHADXMPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VYBGI5A6V2E5FJSDA4CHADXMPK","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":"4b515a057aeb489753b936d8b4f915c7a29c4b98c7ebc2ba8a3e44d400de7b2b","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T08:25:02Z","title_canon_sha256":"852b7d4d5f2e45886ce65e5384a4a84fc7cd1cbeb27067d6640bf8aebbe94e4c"},"schema_version":"1.0","source":{"id":"1602.04589","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04589","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04589v2","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04589","created_at":"2026-05-18T01:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"VYBGI5A6V2E5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYBGI5A6V2E5FJSD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYBGI5A6","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:14486656155e53b8516583ea241074117ae3694f157eda4658c92af3377830f4","target":"graph","created_at":"2026-05-18T01:13:09Z","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 give a complete characterization of the complexity of best-arm identification in one-parameter bandit problems. We prove a new, tight lower bound on the sample complexity. We propose the `Track-and-Stop' strategy, which we prove to be asymptotically optimal. It consists in a new sampling rule (which tracks the optimal proportions of arm draws highlighted by the lower bound) and in a stopping rule named after Chernoff, for which we give a new analysis.","authors_text":"Aur\\'elien Garivier (IMT), Emilie Kaufmann (CRIStAL, SEQUEL)","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T08:25:02Z","title":"Optimal Best Arm Identification with Fixed Confidence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04589","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:8e043adc47981810ffcc2c1f09b2f9aba30101c270960a13658c412d082b9672","target":"record","created_at":"2026-05-18T01:13:09Z","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":"4b515a057aeb489753b936d8b4f915c7a29c4b98c7ebc2ba8a3e44d400de7b2b","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-15T08:25:02Z","title_canon_sha256":"852b7d4d5f2e45886ce65e5384a4a84fc7cd1cbeb27067d6640bf8aebbe94e4c"},"schema_version":"1.0","source":{"id":"1602.04589","kind":"arxiv","version":2}},"canonical_sha256":"ae0264741eae89d2a6430704700eec7a9ad7f52383623383974197267af26330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0264741eae89d2a6430704700eec7a9ad7f52383623383974197267af26330","first_computed_at":"2026-05-18T01:13:09.417902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:09.417902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GVusTlrUg/hIhpVeDut2cnNg5X0kMRI/60dYVfYD0VxVJmp3YhUZjGw4xX8pJFCDTAtmbnmq3wOrUDNwiC5jAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:09.418246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04589","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e043adc47981810ffcc2c1f09b2f9aba30101c270960a13658c412d082b9672","sha256:14486656155e53b8516583ea241074117ae3694f157eda4658c92af3377830f4"],"state_sha256":"6e6e3728b5769050c864242b88abd3f6cba7e1614047385951de573c4ad360a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQ98x51c7XxixGwPp6sd0lJOqIS4Qo+dPw/VxhHOJjlbg+jNgKX5DLCYXU3Z36+jlpaoAMEQzp6mYBwzdoN+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:53:00.280539Z","bundle_sha256":"77831f80a63744c27e87a3becfdbf7019461c0cda9867aa00d1c6cc7c5fdcce7"}}