{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FNR544YA4JYMEBUDTFOUU33L7Q","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":"9d7707defbb759d34f82188184adb81cc648452baf7db1967e6277f9eb04b7fb","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-23T13:38:15Z","title_canon_sha256":"87c241c2d87f4a7e9a5aa60bfb9c67d7383f18a38b8ab5239696d41fff79bd3d"},"schema_version":"1.0","source":{"id":"1508.05608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05608","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05608v1","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05608","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"FNR544YA4JYM","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FNR544YA4JYMEBUD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FNR544YA","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7dd2c14a57ef68dd5242076eff20c64fc71d5cfdb217faf23e3939d46704de21","target":"graph","created_at":"2026-05-18T01:34:52Z","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 the Max $K$-Armed Bandit problem, where a learning agent is faced with several sources (arms) of items (rewards), and interested in finding the best item overall. At each time step the agent chooses an arm, and obtains a random real valued reward. The rewards of each arm are assumed to be i.i.d., with an unknown probability distribution that generally differs among the arms. Under the PAC framework, we provide lower bounds on the sample complexity of any $(\\epsilon,\\delta)$-correct algorithm, and propose algorithms that attain this bound up to logarithmic factors. We compare the pe","authors_text":"Nahum Shimkin, Yahel David","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-23T13:38:15Z","title":"The Max $K$-Armed Bandit: A PAC Lower Bound and tighter Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05608","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:302b9c1de4eda9176475e1b975ec0541d13bbf0d5fd216450a23e6333309ff3f","target":"record","created_at":"2026-05-18T01:34:52Z","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":"9d7707defbb759d34f82188184adb81cc648452baf7db1967e6277f9eb04b7fb","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-23T13:38:15Z","title_canon_sha256":"87c241c2d87f4a7e9a5aa60bfb9c67d7383f18a38b8ab5239696d41fff79bd3d"},"schema_version":"1.0","source":{"id":"1508.05608","kind":"arxiv","version":1}},"canonical_sha256":"2b63de7300e270c20683995d4a6f6bfc0a4d013b499805e57f97eb17c6a56cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b63de7300e270c20683995d4a6f6bfc0a4d013b499805e57f97eb17c6a56cf1","first_computed_at":"2026-05-18T01:34:52.104574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:52.104574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkRwe3PS//Upx9ItQajvfcZYpofAjPbj2crFVP1xNDGxz7WcSYIN3CW03ov1YONHxW/ihc31BBuRxZm7llJYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:52.105157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:302b9c1de4eda9176475e1b975ec0541d13bbf0d5fd216450a23e6333309ff3f","sha256:7dd2c14a57ef68dd5242076eff20c64fc71d5cfdb217faf23e3939d46704de21"],"state_sha256":"18deb15bc9a64daa1a9743ff22d72fd58f610ea6d42fbf752891cbd2234cfb88"}