{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P7SNESKLLD6UDI4MGULYNKWOSY","short_pith_number":"pith:P7SNESKL","canonical_record":{"source":{"id":"1603.02752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T00:55:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9df19c7cf5927a828aa1404b1ed0548fb1767f687dfbe46bd5f92e954b26870f","abstract_canon_sha256":"c8b22cca0e3fc57642947250f0b144f697df1762e384e9a68c978dea28e45b51"},"schema_version":"1.0"},"canonical_sha256":"7fe4d2494b58fd41a38c351786aace962966d8805e456a11cfd3a16349a8190e","source":{"kind":"arxiv","id":"1603.02752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02752","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02752v2","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02752","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"P7SNESKLLD6U","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7SNESKLLD6UDI4M","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7SNESKL","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P7SNESKLLD6UDI4MGULYNKWOSY","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T00:55:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9df19c7cf5927a828aa1404b1ed0548fb1767f687dfbe46bd5f92e954b26870f","abstract_canon_sha256":"c8b22cca0e3fc57642947250f0b144f697df1762e384e9a68c978dea28e45b51"},"schema_version":"1.0"},"canonical_sha256":"7fe4d2494b58fd41a38c351786aace962966d8805e456a11cfd3a16349a8190e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.147959Z","signature_b64":"Q3IdIgpQCOl1GsUOhEnqgKHNOQwbdNJXzeuPGDrnn3DPjpowtTfRrX16RX9ct6IOwcBdDGC7elKiTaQC8ABNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fe4d2494b58fd41a38c351786aace962966d8805e456a11cfd3a16349a8190e","last_reissued_at":"2026-05-18T01:18:52.147481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.147481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02752","source_version":2,"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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09LpoMFcN9I4+/iaZEUUyHXOdljRX80RndGn8/jpUP+yIN6dwF3YwgZ6y6HAbeGWmRXubBcPSzj1mSKbUbmJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:59:28.215094Z"},"content_sha256":"35ac5d40b643a4b26c95f128dd8061fef2ff5411ad2a3c7fd6cf6e3a4c0a6c9c","schema_version":"1.0","event_id":"sha256:35ac5d40b643a4b26c95f128dd8061fef2ff5411ad2a3c7fd6cf6e3a4c0a6c9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P7SNESKLLD6UDI4MGULYNKWOSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best-of-K Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Recht, Kevin Jamieson, Max Simchowitz","submitted_at":"2016-03-09T00:55:58Z","abstract_excerpt":"This paper studies the Best-of-K Bandit game: At each time the player chooses a subset S among all N-choose-K possible options and observes reward max(X(i) : i in S) where X is a random vector drawn from a joint distribution. The objective is to identify the subset that achieves the highest expected reward with high probability using as few queries as possible. We present distribution-dependent lower bounds based on a particular construction which force a learner to consider all N-choose-K subsets, and match naive extensions of known upper bounds in the bandit setting obtained by treating each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02752","kind":"arxiv","version":2},"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:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moJbJbr+DUlE7itcRVnAn+MX9B1+GbO8AcMRWY+GfIClkkiP4mxwfSX7Ia/YLqPdoNoD9Lpq1taEKMUhYQJVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:59:28.215807Z"},"content_sha256":"81aad75791af7cd6fe87ff9107c73c351e9334f6acdd32cbfb556430c586f1d1","schema_version":"1.0","event_id":"sha256:81aad75791af7cd6fe87ff9107c73c351e9334f6acdd32cbfb556430c586f1d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7SNESKLLD6UDI4MGULYNKWOSY/bundle.json","state_url":"https://pith.science/pith/P7SNESKLLD6UDI4MGULYNKWOSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7SNESKLLD6UDI4MGULYNKWOSY/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-01T00:59:28Z","links":{"resolver":"https://pith.science/pith/P7SNESKLLD6UDI4MGULYNKWOSY","bundle":"https://pith.science/pith/P7SNESKLLD6UDI4MGULYNKWOSY/bundle.json","state":"https://pith.science/pith/P7SNESKLLD6UDI4MGULYNKWOSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7SNESKLLD6UDI4MGULYNKWOSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P7SNESKLLD6UDI4MGULYNKWOSY","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":"c8b22cca0e3fc57642947250f0b144f697df1762e384e9a68c978dea28e45b51","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T00:55:58Z","title_canon_sha256":"9df19c7cf5927a828aa1404b1ed0548fb1767f687dfbe46bd5f92e954b26870f"},"schema_version":"1.0","source":{"id":"1603.02752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02752","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02752v2","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02752","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"P7SNESKLLD6U","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7SNESKLLD6UDI4M","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7SNESKL","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:81aad75791af7cd6fe87ff9107c73c351e9334f6acdd32cbfb556430c586f1d1","target":"graph","created_at":"2026-05-18T01:18: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":"This paper studies the Best-of-K Bandit game: At each time the player chooses a subset S among all N-choose-K possible options and observes reward max(X(i) : i in S) where X is a random vector drawn from a joint distribution. The objective is to identify the subset that achieves the highest expected reward with high probability using as few queries as possible. We present distribution-dependent lower bounds based on a particular construction which force a learner to consider all N-choose-K subsets, and match naive extensions of known upper bounds in the bandit setting obtained by treating each","authors_text":"Benjamin Recht, Kevin Jamieson, Max Simchowitz","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T00:55:58Z","title":"Best-of-K Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02752","kind":"arxiv","version":2},"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:35ac5d40b643a4b26c95f128dd8061fef2ff5411ad2a3c7fd6cf6e3a4c0a6c9c","target":"record","created_at":"2026-05-18T01:18: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":"c8b22cca0e3fc57642947250f0b144f697df1762e384e9a68c978dea28e45b51","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T00:55:58Z","title_canon_sha256":"9df19c7cf5927a828aa1404b1ed0548fb1767f687dfbe46bd5f92e954b26870f"},"schema_version":"1.0","source":{"id":"1603.02752","kind":"arxiv","version":2}},"canonical_sha256":"7fe4d2494b58fd41a38c351786aace962966d8805e456a11cfd3a16349a8190e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fe4d2494b58fd41a38c351786aace962966d8805e456a11cfd3a16349a8190e","first_computed_at":"2026-05-18T01:18:52.147481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:52.147481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3IdIgpQCOl1GsUOhEnqgKHNOQwbdNJXzeuPGDrnn3DPjpowtTfRrX16RX9ct6IOwcBdDGC7elKiTaQC8ABNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:52.147959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35ac5d40b643a4b26c95f128dd8061fef2ff5411ad2a3c7fd6cf6e3a4c0a6c9c","sha256:81aad75791af7cd6fe87ff9107c73c351e9334f6acdd32cbfb556430c586f1d1"],"state_sha256":"9a1e70f5eeb177c7dfb7d1c25a92dfc18470ab174c7609dff6a983a8f34faaac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqVO7RIAQDxM8QUfgoCmhft7orrg5l32XWh7QKcA7JKQNcWY8XNLbpu9mQnqauikVwX8r84ei+LRqtYpc2B1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:59:28.219983Z","bundle_sha256":"619821a6ab28efca4429ddadedb62c56bb120b0bfd11c8065492f44c1b68b8b4"}}