{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LXNMCDVNU7A6K5A4GCTG4H3MBQ","short_pith_number":"pith:LXNMCDVN","canonical_record":{"source":{"id":"1512.07650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-23T22:11:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"19e34f4104b9e39fa488054ec3c77b3d02fa32e44804fa1069ac021351263cd9","abstract_canon_sha256":"2a5277071bd8e49166dc6b44550ce47a0d34540cc86e62c77894b185282884ac"},"schema_version":"1.0"},"canonical_sha256":"5ddac10eada7c1e5741c30a66e1f6c0c123c58669aea5f131d43ef746d7e999a","source":{"kind":"arxiv","id":"1512.07650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07650","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07650v1","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07650","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"LXNMCDVNU7A6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXNMCDVNU7A6K5A4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXNMCDVN","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LXNMCDVNU7A6K5A4GCTG4H3MBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-23T22:11:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"19e34f4104b9e39fa488054ec3c77b3d02fa32e44804fa1069ac021351263cd9","abstract_canon_sha256":"2a5277071bd8e49166dc6b44550ce47a0d34540cc86e62c77894b185282884ac"},"schema_version":"1.0"},"canonical_sha256":"5ddac10eada7c1e5741c30a66e1f6c0c123c58669aea5f131d43ef746d7e999a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:48.894843Z","signature_b64":"COMRCOKvAkgb7VyERNBNm5+fCjvZI8asZeJEKoYroXR55gqAG5/m7JBlsOIGTDb9dMtjSroULoJTsQVKq74kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ddac10eada7c1e5741c30a66e1f6c0c123c58669aea5f131d43ef746d7e999a","last_reissued_at":"2026-05-18T01:23:48.894247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:48.894247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07650","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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyPby97t40wlBOJWuJvBrmdy8jU+T6QD03pWd1nfYRL3ZvCpziNSrHrOz71VhZTMeu0x5n6GnS/pHrLsEuK+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:35:40.259254Z"},"content_sha256":"68b55b5901681737497b29ee67be9594425781107cf3e48b753955be8ab15f4e","schema_version":"1.0","event_id":"sha256:68b55b5901681737497b29ee67be9594425781107cf3e48b753955be8ab15f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LXNMCDVNU7A6K5A4GCTG4H3MBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Max $K$-Armed Bandit: PAC Lower Bounds and Efficient 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-12-23T22:11:02Z","abstract_excerpt":"We consider the Max $K$-Armed Bandit problem, where a learning agent is faced with several stochastic arms, each a source of i.i.d. rewards of unknown distribution. At each time step the agent chooses an arm, and observes the reward of the obtained sample. Each sample is considered here as a separate item with the reward designating its value, and the goal is to find an item with the highest possible value. Our basic assumption is a known lower bound on the {\\em tail function} of the reward distributions. Under the PAC framework, we provide a lower bound on the sample complexity of any $(\\epsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07650","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:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zal15E2DbMAVagrxGptEF9oeRl9YxJExagUYaH0fYyea+GAuQoaikAoma7eRiiu+Cb8z33aPSPdPYIhgoCibBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:35:40.259611Z"},"content_sha256":"a78ce614252a2a8154e9c7bf8bb27cdef96a4edd3415e17acb238e3ae5b601b9","schema_version":"1.0","event_id":"sha256:a78ce614252a2a8154e9c7bf8bb27cdef96a4edd3415e17acb238e3ae5b601b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/bundle.json","state_url":"https://pith.science/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/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-28T19:35:40Z","links":{"resolver":"https://pith.science/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ","bundle":"https://pith.science/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/bundle.json","state":"https://pith.science/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXNMCDVNU7A6K5A4GCTG4H3MBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LXNMCDVNU7A6K5A4GCTG4H3MBQ","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":"2a5277071bd8e49166dc6b44550ce47a0d34540cc86e62c77894b185282884ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-23T22:11:02Z","title_canon_sha256":"19e34f4104b9e39fa488054ec3c77b3d02fa32e44804fa1069ac021351263cd9"},"schema_version":"1.0","source":{"id":"1512.07650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07650","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07650v1","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07650","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"LXNMCDVNU7A6","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LXNMCDVNU7A6K5A4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LXNMCDVN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:a78ce614252a2a8154e9c7bf8bb27cdef96a4edd3415e17acb238e3ae5b601b9","target":"graph","created_at":"2026-05-18T01:23:48Z","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 stochastic arms, each a source of i.i.d. rewards of unknown distribution. At each time step the agent chooses an arm, and observes the reward of the obtained sample. Each sample is considered here as a separate item with the reward designating its value, and the goal is to find an item with the highest possible value. Our basic assumption is a known lower bound on the {\\em tail function} of the reward distributions. Under the PAC framework, we provide a lower bound on the sample complexity of any $(\\epsi","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-12-23T22:11:02Z","title":"The Max $K$-Armed Bandit: PAC Lower Bounds and Efficient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07650","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:68b55b5901681737497b29ee67be9594425781107cf3e48b753955be8ab15f4e","target":"record","created_at":"2026-05-18T01:23:48Z","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":"2a5277071bd8e49166dc6b44550ce47a0d34540cc86e62c77894b185282884ac","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-23T22:11:02Z","title_canon_sha256":"19e34f4104b9e39fa488054ec3c77b3d02fa32e44804fa1069ac021351263cd9"},"schema_version":"1.0","source":{"id":"1512.07650","kind":"arxiv","version":1}},"canonical_sha256":"5ddac10eada7c1e5741c30a66e1f6c0c123c58669aea5f131d43ef746d7e999a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ddac10eada7c1e5741c30a66e1f6c0c123c58669aea5f131d43ef746d7e999a","first_computed_at":"2026-05-18T01:23:48.894247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:48.894247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"COMRCOKvAkgb7VyERNBNm5+fCjvZI8asZeJEKoYroXR55gqAG5/m7JBlsOIGTDb9dMtjSroULoJTsQVKq74kCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:48.894843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68b55b5901681737497b29ee67be9594425781107cf3e48b753955be8ab15f4e","sha256:a78ce614252a2a8154e9c7bf8bb27cdef96a4edd3415e17acb238e3ae5b601b9"],"state_sha256":"3e73fd3c0e7089f37e44a760b8995fb6407614838655c63830a5d8d031db04d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWfLvZdUwQZTf+gCwgBbMzk8ku/gXcWJjijitriiRZ/TQ9As+e9+DF0ADJXk1IPmTHRslik1zXBvnobpwvc8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:35:40.261478Z","bundle_sha256":"8048813573d4c5a14ef77338f7c8a2afcd9c7d523c67a292b11a65ef010e9f2f"}}