{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M27SOQ3TIRPS2LSKIFM23KQSS7","short_pith_number":"pith:M27SOQ3T","canonical_record":{"source":{"id":"1505.04627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:16:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e0d1c46660af55f025684bcb48792c9d6937a5d9adc632e20ba8d307f7f9ae7d","abstract_canon_sha256":"1ce798b562bfabf2034d2485dc1a0445f359dce1cffbebfb9e364b718b580b76"},"schema_version":"1.0"},"canonical_sha256":"66bf274373445f2d2e4a4159adaa1297fac17f7bed700ac35559bae8bd495701","source":{"kind":"arxiv","id":"1505.04627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04627","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04627v1","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04627","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"M27SOQ3TIRPS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M27SOQ3TIRPS2LSK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M27SOQ3T","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M27SOQ3TIRPS2LSKIFM23KQSS7","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:16:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e0d1c46660af55f025684bcb48792c9d6937a5d9adc632e20ba8d307f7f9ae7d","abstract_canon_sha256":"1ce798b562bfabf2034d2485dc1a0445f359dce1cffbebfb9e364b718b580b76"},"schema_version":"1.0"},"canonical_sha256":"66bf274373445f2d2e4a4159adaa1297fac17f7bed700ac35559bae8bd495701","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:24.968158Z","signature_b64":"DISc2j9eTrf08zCH49xWPdONmrecPoEPd/4qAwouhZiRUpCkLvT5wC5CqpBfUmj6KEEiEggQmUkep3asMZiuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66bf274373445f2d2e4a4159adaa1297fac17f7bed700ac35559bae8bd495701","last_reissued_at":"2026-05-18T02:07:24.967744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:24.967744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04627","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-18T02:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ERHb+l3sdSZOTsSq4TQJGsctgqu2Iv4Gdhfrn92zFOXtjIfeXRQZtykHOwvyKlekdC6fISnUObW3GC/aUU5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:11:00.388036Z"},"content_sha256":"df36dff0a894b60b1300f3d88c26fdf0a6a87732c96e4ea62f8fb7c2ffce633e","schema_version":"1.0","event_id":"sha256:df36dff0a894b60b1300f3d88c26fdf0a6a87732c96e4ea62f8fb7c2ffce633e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M27SOQ3TIRPS2LSKIFM23KQSS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple regret for infinitely many armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandra Carpentier, Michal Valko","submitted_at":"2015-05-18T13:16:42Z","abstract_excerpt":"We consider a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited number of samples only to a certain number of arms. All previous algorithms for this setting were designed for minimizing the cumulative regret of the learner. In this paper, we propose an algorithm aiming at minimizing the simple regret. As in the cumulative regret setting of infinitely many armed bandits, the rate of the simple regret will depend on a parameter $\\beta$ characterizing the distribution of the near-optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04627","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-18T02:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KElo66Ca4Oa5i9UHGRY0xcAFhSiaRDX5aquKHfUOPCSR0PWtSZP+1YLT7XU3LfjKb+JI+Z9SauuuqfLx7VFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:11:00.388518Z"},"content_sha256":"d9df2ece542e7a7e188454afb3ed4e9792d01381504a3aeb7c63b55ad9bb3b07","schema_version":"1.0","event_id":"sha256:d9df2ece542e7a7e188454afb3ed4e9792d01381504a3aeb7c63b55ad9bb3b07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/bundle.json","state_url":"https://pith.science/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/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-21T17:11:00Z","links":{"resolver":"https://pith.science/pith/M27SOQ3TIRPS2LSKIFM23KQSS7","bundle":"https://pith.science/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/bundle.json","state":"https://pith.science/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M27SOQ3TIRPS2LSKIFM23KQSS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M27SOQ3TIRPS2LSKIFM23KQSS7","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":"1ce798b562bfabf2034d2485dc1a0445f359dce1cffbebfb9e364b718b580b76","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:16:42Z","title_canon_sha256":"e0d1c46660af55f025684bcb48792c9d6937a5d9adc632e20ba8d307f7f9ae7d"},"schema_version":"1.0","source":{"id":"1505.04627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04627","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04627v1","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04627","created_at":"2026-05-18T02:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"M27SOQ3TIRPS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"M27SOQ3TIRPS2LSK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"M27SOQ3T","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:d9df2ece542e7a7e188454afb3ed4e9792d01381504a3aeb7c63b55ad9bb3b07","target":"graph","created_at":"2026-05-18T02:07:24Z","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 a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited number of samples only to a certain number of arms. All previous algorithms for this setting were designed for minimizing the cumulative regret of the learner. In this paper, we propose an algorithm aiming at minimizing the simple regret. As in the cumulative regret setting of infinitely many armed bandits, the rate of the simple regret will depend on a parameter $\\beta$ characterizing the distribution of the near-optimal","authors_text":"Alexandra Carpentier, Michal Valko","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:16:42Z","title":"Simple regret for infinitely many armed bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04627","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:df36dff0a894b60b1300f3d88c26fdf0a6a87732c96e4ea62f8fb7c2ffce633e","target":"record","created_at":"2026-05-18T02:07:24Z","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":"1ce798b562bfabf2034d2485dc1a0445f359dce1cffbebfb9e364b718b580b76","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-05-18T13:16:42Z","title_canon_sha256":"e0d1c46660af55f025684bcb48792c9d6937a5d9adc632e20ba8d307f7f9ae7d"},"schema_version":"1.0","source":{"id":"1505.04627","kind":"arxiv","version":1}},"canonical_sha256":"66bf274373445f2d2e4a4159adaa1297fac17f7bed700ac35559bae8bd495701","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66bf274373445f2d2e4a4159adaa1297fac17f7bed700ac35559bae8bd495701","first_computed_at":"2026-05-18T02:07:24.967744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:24.967744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DISc2j9eTrf08zCH49xWPdONmrecPoEPd/4qAwouhZiRUpCkLvT5wC5CqpBfUmj6KEEiEggQmUkep3asMZiuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:24.968158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df36dff0a894b60b1300f3d88c26fdf0a6a87732c96e4ea62f8fb7c2ffce633e","sha256:d9df2ece542e7a7e188454afb3ed4e9792d01381504a3aeb7c63b55ad9bb3b07"],"state_sha256":"aee7818e511e4a07226d5a5e56c31f88642f626a2e10ed67bb0f9dd61ac71a6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4r/r4zKoWu4u+2eUrq/MJDsM0bMypAeTLFszlhcbXtE4y3bycA/7p4/G7ufr7gSGNg9h4Xurd9l/IMCHIBLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:11:00.391165Z","bundle_sha256":"ecc2daee4f1ee860732f7afcf399a8e40ad987c576a2bc1c6440143868eb0225"}}