{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FNR544YA4JYMEBUDTFOUU33L7Q","short_pith_number":"pith:FNR544YA","canonical_record":{"source":{"id":"1508.05608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-23T13:38:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"87c241c2d87f4a7e9a5aa60bfb9c67d7383f18a38b8ab5239696d41fff79bd3d","abstract_canon_sha256":"9d7707defbb759d34f82188184adb81cc648452baf7db1967e6277f9eb04b7fb"},"schema_version":"1.0"},"canonical_sha256":"2b63de7300e270c20683995d4a6f6bfc0a4d013b499805e57f97eb17c6a56cf1","source":{"kind":"arxiv","id":"1508.05608","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FNR544YA4JYMEBUDTFOUU33L7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-23T13:38:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"87c241c2d87f4a7e9a5aa60bfb9c67d7383f18a38b8ab5239696d41fff79bd3d","abstract_canon_sha256":"9d7707defbb759d34f82188184adb81cc648452baf7db1967e6277f9eb04b7fb"},"schema_version":"1.0"},"canonical_sha256":"2b63de7300e270c20683995d4a6f6bfc0a4d013b499805e57f97eb17c6a56cf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:52.105157Z","signature_b64":"fkRwe3PS//Upx9ItQajvfcZYpofAjPbj2crFVP1xNDGxz7WcSYIN3CW03ov1YONHxW/ihc31BBuRxZm7llJYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b63de7300e270c20683995d4a6f6bfc0a4d013b499805e57f97eb17c6a56cf1","last_reissued_at":"2026-05-18T01:34:52.104574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:52.104574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05608","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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvc07/X5uXxtxAdpyzyFnZsxWRb+CIY+3W7KAKWs2EwrYsLV3sVkxrc+7aGU1xl6mEc2EM+Dkt99252pZpoMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:23:39.228135Z"},"content_sha256":"302b9c1de4eda9176475e1b975ec0541d13bbf0d5fd216450a23e6333309ff3f","schema_version":"1.0","event_id":"sha256:302b9c1de4eda9176475e1b975ec0541d13bbf0d5fd216450a23e6333309ff3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FNR544YA4JYMEBUDTFOUU33L7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Max $K$-Armed Bandit: A PAC Lower Bound and tighter Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Nahum Shimkin, Yahel David","submitted_at":"2015-08-23T13:38:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05608","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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWYqbfXVQTATt8HqMFzGK/gNBowVvs4JKRs+kZc2FCNhJTIswtDWYxBZEMR3p7N0lYPGUZPfoLrrDJUAZWr4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:23:39.228506Z"},"content_sha256":"7dd2c14a57ef68dd5242076eff20c64fc71d5cfdb217faf23e3939d46704de21","schema_version":"1.0","event_id":"sha256:7dd2c14a57ef68dd5242076eff20c64fc71d5cfdb217faf23e3939d46704de21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNR544YA4JYMEBUDTFOUU33L7Q/bundle.json","state_url":"https://pith.science/pith/FNR544YA4JYMEBUDTFOUU33L7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNR544YA4JYMEBUDTFOUU33L7Q/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-28T20:23:39Z","links":{"resolver":"https://pith.science/pith/FNR544YA4JYMEBUDTFOUU33L7Q","bundle":"https://pith.science/pith/FNR544YA4JYMEBUDTFOUU33L7Q/bundle.json","state":"https://pith.science/pith/FNR544YA4JYMEBUDTFOUU33L7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNR544YA4JYMEBUDTFOUU33L7Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0wnByeqWSBwHJoH93YO2eQCAtW+csWq92OwnHCpn7kgXVqkeCywwwEzCbJMkHRJ9zzY0LquBO6fAVnYGglfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:23:39.230384Z","bundle_sha256":"47256d9cbdcd668858d05ee1e7c5767b0dfe51a20d6d6e9eec3a7ea04bebc194"}}