{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BVFANRK5NUYP6WK7WLJUDJTRMQ","short_pith_number":"pith:BVFANRK5","canonical_record":{"source":{"id":"1605.08671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-27T14:35:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06947edde2fc49e478fb593b01e7b6d33c53c5a3332be3b3ac3cdff55ab59a7b","abstract_canon_sha256":"a2939213efa23fbebbe511ae836580ae1fec60f17bb802523d85e39c6ad139e8"},"schema_version":"1.0"},"canonical_sha256":"0d4a06c55d6d30ff595fb2d341a671641855a4587e0676dc21f0e7d5532b84cb","source":{"kind":"arxiv","id":"1605.08671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08671","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08671v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08671","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"BVFANRK5NUYP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVFANRK5NUYP6WK7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVFANRK5","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BVFANRK5NUYP6WK7WLJUDJTRMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-27T14:35:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06947edde2fc49e478fb593b01e7b6d33c53c5a3332be3b3ac3cdff55ab59a7b","abstract_canon_sha256":"a2939213efa23fbebbe511ae836580ae1fec60f17bb802523d85e39c6ad139e8"},"schema_version":"1.0"},"canonical_sha256":"0d4a06c55d6d30ff595fb2d341a671641855a4587e0676dc21f0e7d5532b84cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.365349Z","signature_b64":"C7aFLDjvxtBnkwVp0D04mLij427AbDZzfthpEMeccS+0vzbJhGleUId1hUrbPyh2oTzbOaEGPdiEjinctZ48AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d4a06c55d6d30ff595fb2d341a671641855a4587e0676dc21f0e7d5532b84cb","last_reissued_at":"2026-05-18T01:13:29.364899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.364899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08671","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPdRzS5MUcd0zzl0pUhV7+w03ZJEcvK/klNk07zI9S8DO0yGxAuVCLznShw016x8Np7VgaNF4GuUeYZnrqvlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:53.624180Z"},"content_sha256":"5c46bba4e8701f3f67343f4097458c7002c13b3100634450445341362234033a","schema_version":"1.0","event_id":"sha256:5c46bba4e8701f3f67343f4097458c7002c13b3100634450445341362234033a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BVFANRK5NUYP6WK7WLJUDJTRMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimal algorithm for the Thresholding 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, Maurilio Gutzeit","submitted_at":"2016-05-27T14:35:29Z","abstract_excerpt":"We study a specific \\textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \\textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove that it is optimal for this problem by deriving matching upper and lower bounds. To the best of our knowledge, this is the first non-trivial pure exploration setting with \\textit{fixed budget} for which optimal strategies are constructed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08671","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xx93djtcfX54PbSwQRTTTrrN1Aq2mspNRgh86GwRIE5LZhcac4QZlpYrJdUIIiN8hpnihXzFrXQE9Pj4Dh/lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:53.624961Z"},"content_sha256":"40168412580048f3d06b5b79c15704a1ecca3b7a79079b5290a7813ac2eb2b48","schema_version":"1.0","event_id":"sha256:40168412580048f3d06b5b79c15704a1ecca3b7a79079b5290a7813ac2eb2b48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/bundle.json","state_url":"https://pith.science/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/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-31T19:26:53Z","links":{"resolver":"https://pith.science/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ","bundle":"https://pith.science/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/bundle.json","state":"https://pith.science/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVFANRK5NUYP6WK7WLJUDJTRMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BVFANRK5NUYP6WK7WLJUDJTRMQ","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":"a2939213efa23fbebbe511ae836580ae1fec60f17bb802523d85e39c6ad139e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-27T14:35:29Z","title_canon_sha256":"06947edde2fc49e478fb593b01e7b6d33c53c5a3332be3b3ac3cdff55ab59a7b"},"schema_version":"1.0","source":{"id":"1605.08671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08671","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08671v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08671","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"BVFANRK5NUYP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVFANRK5NUYP6WK7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVFANRK5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:40168412580048f3d06b5b79c15704a1ecca3b7a79079b5290a7813ac2eb2b48","target":"graph","created_at":"2026-05-18T01:13:29Z","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 a specific \\textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \\textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove that it is optimal for this problem by deriving matching upper and lower bounds. To the best of our knowledge, this is the first non-trivial pure exploration setting with \\textit{fixed budget} for which optimal strategies are constructed.","authors_text":"Alexandra Carpentier, Andrea Locatelli, Maurilio Gutzeit","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-27T14:35:29Z","title":"An optimal algorithm for the Thresholding Bandit Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08671","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:5c46bba4e8701f3f67343f4097458c7002c13b3100634450445341362234033a","target":"record","created_at":"2026-05-18T01:13:29Z","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":"a2939213efa23fbebbe511ae836580ae1fec60f17bb802523d85e39c6ad139e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-27T14:35:29Z","title_canon_sha256":"06947edde2fc49e478fb593b01e7b6d33c53c5a3332be3b3ac3cdff55ab59a7b"},"schema_version":"1.0","source":{"id":"1605.08671","kind":"arxiv","version":1}},"canonical_sha256":"0d4a06c55d6d30ff595fb2d341a671641855a4587e0676dc21f0e7d5532b84cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d4a06c55d6d30ff595fb2d341a671641855a4587e0676dc21f0e7d5532b84cb","first_computed_at":"2026-05-18T01:13:29.364899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.364899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7aFLDjvxtBnkwVp0D04mLij427AbDZzfthpEMeccS+0vzbJhGleUId1hUrbPyh2oTzbOaEGPdiEjinctZ48AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.365349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c46bba4e8701f3f67343f4097458c7002c13b3100634450445341362234033a","sha256:40168412580048f3d06b5b79c15704a1ecca3b7a79079b5290a7813ac2eb2b48"],"state_sha256":"5bf1cdcd788b1a6de07d0fd80207da3628d877b521870049642e14d1d4ced784"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57u/+n8z3C2Kb9y/c6uB4O0An2sOVWZpMNj/+YAS4K9Q9SFmfWS7JrFSHd9SZnN2vIoVrsns948a0Cu0Q69MAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:26:53.629027Z","bundle_sha256":"60ff2ef7c91fae85f44f10590a73e76b52255a9310c666369e5baef155207fb7"}}