{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NBQYVN7IKFEJ7OPXNUIUIPP7HZ","short_pith_number":"pith:NBQYVN7I","canonical_record":{"source":{"id":"1910.04959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T03:53:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e4a66bf8717fb0179f87ee65f1b18c27c3f8825215dd767e08ad609089b57b9","abstract_canon_sha256":"176d2516f35bcf8c7cb96a2476d1b0b2eb9b99bd56a5868df4e000c11b850cab"},"schema_version":"1.0"},"canonical_sha256":"68618ab7e851489fb9f76d11443dff3e4fb07c6e60f272c08ea01c5ec8152e27","source":{"kind":"arxiv","id":"1910.04959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.04959","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1910.04959v2","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04959","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"NBQYVN7IKFEJ","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_16","alias_value":"NBQYVN7IKFEJ7OPX","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_8","alias_value":"NBQYVN7I","created_at":"2026-07-05T00:41:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NBQYVN7IKFEJ7OPXNUIUIPP7HZ","target":"record","payload":{"canonical_record":{"source":{"id":"1910.04959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T03:53:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e4a66bf8717fb0179f87ee65f1b18c27c3f8825215dd767e08ad609089b57b9","abstract_canon_sha256":"176d2516f35bcf8c7cb96a2476d1b0b2eb9b99bd56a5868df4e000c11b850cab"},"schema_version":"1.0"},"canonical_sha256":"68618ab7e851489fb9f76d11443dff3e4fb07c6e60f272c08ea01c5ec8152e27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:42.565978Z","signature_b64":"SET15CyKCb+FE7DokOOanx1BDeXz114uAJymBjm+263y0/n5p4GnOS2hYxBlR6B+R3xA9XebKsy/A6w6UWLNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68618ab7e851489fb9f76d11443dff3e4fb07c6e60f272c08ea01c5ec8152e27","last_reissued_at":"2026-07-05T00:41:42.565505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:42.565505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.04959","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-07-05T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2PhHGza6l6kajdH62E8b83p3YiVc0Bi29pYpiRKp9N+zwUH75WfR/iVSnBsz9+0IAZvZgnMrvd++vPxDXM/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:16:51.838019Z"},"content_sha256":"08c60cf2611acd4311b223a2c3ebe8474b758aa45be91e0980560c8833b16dd5","schema_version":"1.0","event_id":"sha256:08c60cf2611acd4311b223a2c3ebe8474b758aa45be91e0980560c8833b16dd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NBQYVN7IKFEJ7OPXNUIUIPP7HZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret Bounds for Batched Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Abbas Mehrabian, Amin Karbasi, Hossein Esfandiari, Vahab Mirrokni","submitted_at":"2019-10-11T03:53:28Z","abstract_excerpt":"We present simple and efficient algorithms for the batched stochastic multi-armed bandit and batched stochastic linear bandit problems. We prove bounds for their expected regrets that improve over the best-known regret bounds for any number of batches. In particular, our algorithms in both settings achieve the optimal expected regrets by using only a logarithmic number of batches. We also study the batched adversarial multi-armed bandit problem for the first time and find the optimal regret, up to logarithmic factors, of any algorithm with predetermined batch sizes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04959","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.04959/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sr7da5BKBeQaebJb/ZW9VFEsYw/YGiC2NiKhvshJV9IDFo8D1Qkfr8/sulxO2pXkrDTbF4wMDB77sEHisHcBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:16:51.838418Z"},"content_sha256":"f52babb09a9acea5e1c10483ffcc67eb5444540a5e8055cbde8cea6b216cbd3f","schema_version":"1.0","event_id":"sha256:f52babb09a9acea5e1c10483ffcc67eb5444540a5e8055cbde8cea6b216cbd3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/bundle.json","state_url":"https://pith.science/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/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-07-07T04:16:51Z","links":{"resolver":"https://pith.science/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ","bundle":"https://pith.science/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/bundle.json","state":"https://pith.science/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBQYVN7IKFEJ7OPXNUIUIPP7HZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NBQYVN7IKFEJ7OPXNUIUIPP7HZ","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":"176d2516f35bcf8c7cb96a2476d1b0b2eb9b99bd56a5868df4e000c11b850cab","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T03:53:28Z","title_canon_sha256":"3e4a66bf8717fb0179f87ee65f1b18c27c3f8825215dd767e08ad609089b57b9"},"schema_version":"1.0","source":{"id":"1910.04959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.04959","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1910.04959v2","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04959","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"NBQYVN7IKFEJ","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_16","alias_value":"NBQYVN7IKFEJ7OPX","created_at":"2026-07-05T00:41:42Z"},{"alias_kind":"pith_short_8","alias_value":"NBQYVN7I","created_at":"2026-07-05T00:41:42Z"}],"graph_snapshots":[{"event_id":"sha256:f52babb09a9acea5e1c10483ffcc67eb5444540a5e8055cbde8cea6b216cbd3f","target":"graph","created_at":"2026-07-05T00:41:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.04959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present simple and efficient algorithms for the batched stochastic multi-armed bandit and batched stochastic linear bandit problems. We prove bounds for their expected regrets that improve over the best-known regret bounds for any number of batches. In particular, our algorithms in both settings achieve the optimal expected regrets by using only a logarithmic number of batches. We also study the batched adversarial multi-armed bandit problem for the first time and find the optimal regret, up to logarithmic factors, of any algorithm with predetermined batch sizes.","authors_text":"Abbas Mehrabian, Amin Karbasi, Hossein Esfandiari, Vahab Mirrokni","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T03:53:28Z","title":"Regret Bounds for Batched Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04959","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:08c60cf2611acd4311b223a2c3ebe8474b758aa45be91e0980560c8833b16dd5","target":"record","created_at":"2026-07-05T00:41:42Z","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":"176d2516f35bcf8c7cb96a2476d1b0b2eb9b99bd56a5868df4e000c11b850cab","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T03:53:28Z","title_canon_sha256":"3e4a66bf8717fb0179f87ee65f1b18c27c3f8825215dd767e08ad609089b57b9"},"schema_version":"1.0","source":{"id":"1910.04959","kind":"arxiv","version":2}},"canonical_sha256":"68618ab7e851489fb9f76d11443dff3e4fb07c6e60f272c08ea01c5ec8152e27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68618ab7e851489fb9f76d11443dff3e4fb07c6e60f272c08ea01c5ec8152e27","first_computed_at":"2026-07-05T00:41:42.565505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:41:42.565505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SET15CyKCb+FE7DokOOanx1BDeXz114uAJymBjm+263y0/n5p4GnOS2hYxBlR6B+R3xA9XebKsy/A6w6UWLNAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:41:42.565978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.04959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c60cf2611acd4311b223a2c3ebe8474b758aa45be91e0980560c8833b16dd5","sha256:f52babb09a9acea5e1c10483ffcc67eb5444540a5e8055cbde8cea6b216cbd3f"],"state_sha256":"743ac105de284f569dcb91f0a573127bd94c0f86ec6b53913eea6dc74542e232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOgVM862qNbkAJznNw/vaHwOyUFRAnPmGysOnP6o74Zl/a9+s+gKYKNAxncReygXSlmpGv/vE9GE4jUnPtN4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:16:51.840376Z","bundle_sha256":"273155e2f95a884fa6b1506cae23db80e2dff3d93f2958100732fae07969de88"}}