{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OLAI3FH2QJFWG47D45Y745GJ6Y","short_pith_number":"pith:OLAI3FH2","canonical_record":{"source":{"id":"1205.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-14T20:10:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"09ac582f892afb9445e26757ac784e7c093172f5bf5f435cfd9513579fb5b998","abstract_canon_sha256":"af74f2f128b2748a9e09c214c37bb7d2959b2c08da8595df248f4f7e901ebad4"},"schema_version":"1.0"},"canonical_sha256":"72c08d94fa824b6373e3e771fe74c9f61bc9480bd5807045a338f5bd79eaef56","source":{"kind":"arxiv","id":"1205.3181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3181","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3181v1","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3181","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"OLAI3FH2QJFW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OLAI3FH2QJFWG47D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OLAI3FH2","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OLAI3FH2QJFWG47D45Y745GJ6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-14T20:10:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"09ac582f892afb9445e26757ac784e7c093172f5bf5f435cfd9513579fb5b998","abstract_canon_sha256":"af74f2f128b2748a9e09c214c37bb7d2959b2c08da8595df248f4f7e901ebad4"},"schema_version":"1.0"},"canonical_sha256":"72c08d94fa824b6373e3e771fe74c9f61bc9480bd5807045a338f5bd79eaef56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:36.724420Z","signature_b64":"9C1bNEnooZgq0duGtLlYYyJr+vwF6zR11FhV+1HHBUwvnO6+BC4WtAyoCI5jMXEQxacXwdIjhqjvOGdv8iBDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72c08d94fa824b6373e3e771fe74c9f61bc9480bd5807045a338f5bd79eaef56","last_reissued_at":"2026-05-18T03:55:36.723826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:36.723826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3181","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-18T03:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Sr68TkDUebL96D2/Cilmls7ilpXnokEs0Gy0yZGW64cllOpZaez5thXWGc3h10ngcwPidlx7kIAIVTD7UHnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:09:09.739212Z"},"content_sha256":"c86f470ae02fdbc916ce3d82ee819475777c0b28bcbaea4c19221ba8ed774e41","schema_version":"1.0","event_id":"sha256:c86f470ae02fdbc916ce3d82ee819475777c0b28bcbaea4c19221ba8ed774e41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OLAI3FH2QJFWG47D45Y745GJ6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Identifications in Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nitin Viswanathan, S\\'ebastien Bubeck, Tengyao Wang","submitted_at":"2012-05-14T20:10:04Z","abstract_excerpt":"We study the problem of identifying the top $m$ arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that were previously out of reach. In particular we show that this idea of successive accepts and rejects applies to the multi-bandit best arm identification problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3181","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-18T03:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPv2w0Vl1tZ0OySAXtru28iTHZ2HryRDPiIpSA5Fn0HcMSKZiJCu5n34XWFwO9hM63gQzwwyoGzhl6SZpvP+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:09:09.739574Z"},"content_sha256":"42d994444fe098bd0a45c57cab4292a58461a29ccefe3bd6fcd36c9fcd8c0819","schema_version":"1.0","event_id":"sha256:42d994444fe098bd0a45c57cab4292a58461a29ccefe3bd6fcd36c9fcd8c0819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/bundle.json","state_url":"https://pith.science/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/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-09T15:09:09Z","links":{"resolver":"https://pith.science/pith/OLAI3FH2QJFWG47D45Y745GJ6Y","bundle":"https://pith.science/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/bundle.json","state":"https://pith.science/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLAI3FH2QJFWG47D45Y745GJ6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OLAI3FH2QJFWG47D45Y745GJ6Y","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":"af74f2f128b2748a9e09c214c37bb7d2959b2c08da8595df248f4f7e901ebad4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-14T20:10:04Z","title_canon_sha256":"09ac582f892afb9445e26757ac784e7c093172f5bf5f435cfd9513579fb5b998"},"schema_version":"1.0","source":{"id":"1205.3181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3181","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3181v1","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3181","created_at":"2026-05-18T03:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"OLAI3FH2QJFW","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OLAI3FH2QJFWG47D","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OLAI3FH2","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:42d994444fe098bd0a45c57cab4292a58461a29ccefe3bd6fcd36c9fcd8c0819","target":"graph","created_at":"2026-05-18T03:55:36Z","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 the problem of identifying the top $m$ arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that were previously out of reach. In particular we show that this idea of successive accepts and rejects applies to the multi-bandit best arm identification problem.","authors_text":"Nitin Viswanathan, S\\'ebastien Bubeck, Tengyao Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-14T20:10:04Z","title":"Multiple Identifications in Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3181","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:c86f470ae02fdbc916ce3d82ee819475777c0b28bcbaea4c19221ba8ed774e41","target":"record","created_at":"2026-05-18T03:55:36Z","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":"af74f2f128b2748a9e09c214c37bb7d2959b2c08da8595df248f4f7e901ebad4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-14T20:10:04Z","title_canon_sha256":"09ac582f892afb9445e26757ac784e7c093172f5bf5f435cfd9513579fb5b998"},"schema_version":"1.0","source":{"id":"1205.3181","kind":"arxiv","version":1}},"canonical_sha256":"72c08d94fa824b6373e3e771fe74c9f61bc9480bd5807045a338f5bd79eaef56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72c08d94fa824b6373e3e771fe74c9f61bc9480bd5807045a338f5bd79eaef56","first_computed_at":"2026-05-18T03:55:36.723826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:36.723826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9C1bNEnooZgq0duGtLlYYyJr+vwF6zR11FhV+1HHBUwvnO6+BC4WtAyoCI5jMXEQxacXwdIjhqjvOGdv8iBDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:36.724420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c86f470ae02fdbc916ce3d82ee819475777c0b28bcbaea4c19221ba8ed774e41","sha256:42d994444fe098bd0a45c57cab4292a58461a29ccefe3bd6fcd36c9fcd8c0819"],"state_sha256":"890f68f2254bde830b85cf19791447c668ce21f9c64ac4a3fcc0d0ca5b243ceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uM2Pe9hRVwaAh8H6O2KmwYcchfFIeSJNRd2WbMMtFBRapiJXXCj2rs5BsRa8riKeXFFcXDFfo9iorsYkhpaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:09:09.741494Z","bundle_sha256":"7f07e5421aad6fdb18f266de9d174713fbb912080c6900205d15b8792e9b559e"}}