{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DIHX7US6LCN7Y3VFVNUMWXITHJ","short_pith_number":"pith:DIHX7US6","canonical_record":{"source":{"id":"1605.08722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T17:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"cf474215827177e79c896a85bbb83b503ac61feeddf25a09e862403cc55153fc","abstract_canon_sha256":"b2f5044317a741fc831badc93d0d6366335878a3953e4c2a501ac1b29f9a4b80"},"schema_version":"1.0"},"canonical_sha256":"1a0f7fd25e589bfc6ea5ab68cb5d133a4b71115e3cfaf16b0c51db613a6ea859","source":{"kind":"arxiv","id":"1605.08722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08722","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08722v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08722","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"DIHX7US6LCN7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DIHX7US6LCN7Y3VF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DIHX7US6","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DIHX7US6LCN7Y3VFVNUMWXITHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T17:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"cf474215827177e79c896a85bbb83b503ac61feeddf25a09e862403cc55153fc","abstract_canon_sha256":"b2f5044317a741fc831badc93d0d6366335878a3953e4c2a501ac1b29f9a4b80"},"schema_version":"1.0"},"canonical_sha256":"1a0f7fd25e589bfc6ea5ab68cb5d133a4b71115e3cfaf16b0c51db613a6ea859","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.223185Z","signature_b64":"I5iEXYTRt2dHYVatSidwY2LpHk5Su32qYcHT1HLhKrgJ0g+gHyYgN6DAZ7YbLTkhW6cmQdHIWbgBuDvN4AtAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a0f7fd25e589bfc6ea5ab68cb5d133a4b71115e3cfaf16b0c51db613a6ea859","last_reissued_at":"2026-05-18T01:13:29.222614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.222614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08722","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBOKwiGmHPnfK0G8VkVJC4zALgF+G7GmYs+57SA4W7qKz5Ww4ksVNxBlDk4BGl3VDVXHszBOuyiU859iO1/dDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:48:40.571817Z"},"content_sha256":"a9ee3a6a0b3e4cfe5ca67aa5fedfd6829db1cbb338e757ffadccc49e65d4699e","schema_version":"1.0","event_id":"sha256:a9ee3a6a0b3e4cfe5ca67aa5fedfd6829db1cbb338e757ffadccc49e65d4699e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DIHX7US6LCN7Y3VFVNUMWXITHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao-Kai Chiang, Peter Auer","submitted_at":"2016-05-27T17:28:35Z","abstract_excerpt":"We present an algorithm that achieves almost optimal pseudo-regret bounds against adversarial and stochastic bandits. Against adversarial bandits the pseudo-regret is $O(K\\sqrt{n \\log n})$ and against stochastic bandits the pseudo-regret is $O(\\sum_i (\\log n)/\\Delta_i)$. We also show that no algorithm with $O(\\log n)$ pseudo-regret against stochastic bandits can achieve $\\tilde{O}(\\sqrt{n})$ expected regret against adaptive adversarial bandits. This complements previous results of Bubeck and Slivkins (2012) that show $\\tilde{O}(\\sqrt{n})$ expected adversarial regret with $O((\\log n)^2)$ stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08722","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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45qZWFHWIeCZYwA0hLl/J9x5h/Qh3YrlDK1nRzn6DzIJ8CDAPJHv5z3OKdGZv6i15uHNJVlghaN14DOP6RYiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:48:40.572165Z"},"content_sha256":"2eb087fbf0d35035d0e922d4023eccf68703ece7abc643a71183f3f89a4a1f98","schema_version":"1.0","event_id":"sha256:2eb087fbf0d35035d0e922d4023eccf68703ece7abc643a71183f3f89a4a1f98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/bundle.json","state_url":"https://pith.science/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/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-26T09:48:40Z","links":{"resolver":"https://pith.science/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ","bundle":"https://pith.science/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/bundle.json","state":"https://pith.science/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIHX7US6LCN7Y3VFVNUMWXITHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DIHX7US6LCN7Y3VFVNUMWXITHJ","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":"b2f5044317a741fc831badc93d0d6366335878a3953e4c2a501ac1b29f9a4b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T17:28:35Z","title_canon_sha256":"cf474215827177e79c896a85bbb83b503ac61feeddf25a09e862403cc55153fc"},"schema_version":"1.0","source":{"id":"1605.08722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08722","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08722v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08722","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"DIHX7US6LCN7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DIHX7US6LCN7Y3VF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DIHX7US6","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:2eb087fbf0d35035d0e922d4023eccf68703ece7abc643a71183f3f89a4a1f98","target":"graph","created_at":"2026-05-18T01:13:29Z","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 present an algorithm that achieves almost optimal pseudo-regret bounds against adversarial and stochastic bandits. Against adversarial bandits the pseudo-regret is $O(K\\sqrt{n \\log n})$ and against stochastic bandits the pseudo-regret is $O(\\sum_i (\\log n)/\\Delta_i)$. We also show that no algorithm with $O(\\log n)$ pseudo-regret against stochastic bandits can achieve $\\tilde{O}(\\sqrt{n})$ expected regret against adaptive adversarial bandits. This complements previous results of Bubeck and Slivkins (2012) that show $\\tilde{O}(\\sqrt{n})$ expected adversarial regret with $O((\\log n)^2)$ stocha","authors_text":"Chao-Kai Chiang, Peter Auer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T17:28:35Z","title":"An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08722","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:a9ee3a6a0b3e4cfe5ca67aa5fedfd6829db1cbb338e757ffadccc49e65d4699e","target":"record","created_at":"2026-05-18T01:13:29Z","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":"b2f5044317a741fc831badc93d0d6366335878a3953e4c2a501ac1b29f9a4b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-27T17:28:35Z","title_canon_sha256":"cf474215827177e79c896a85bbb83b503ac61feeddf25a09e862403cc55153fc"},"schema_version":"1.0","source":{"id":"1605.08722","kind":"arxiv","version":1}},"canonical_sha256":"1a0f7fd25e589bfc6ea5ab68cb5d133a4b71115e3cfaf16b0c51db613a6ea859","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a0f7fd25e589bfc6ea5ab68cb5d133a4b71115e3cfaf16b0c51db613a6ea859","first_computed_at":"2026-05-18T01:13:29.222614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.222614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5iEXYTRt2dHYVatSidwY2LpHk5Su32qYcHT1HLhKrgJ0g+gHyYgN6DAZ7YbLTkhW6cmQdHIWbgBuDvN4AtAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.223185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9ee3a6a0b3e4cfe5ca67aa5fedfd6829db1cbb338e757ffadccc49e65d4699e","sha256:2eb087fbf0d35035d0e922d4023eccf68703ece7abc643a71183f3f89a4a1f98"],"state_sha256":"5091388c465a887eabc517692abf8526315278c1702c4c0a6e861bcdbf03fcee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FATzq0m49Md2rOd0WWtPTVFPA6znp7u9+ScYIXygSeaDJ+CsozMLGJZUgZYpCEN207XSD8R5JCZ9e7zc3iw4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:48:40.574599Z","bundle_sha256":"eef3eaa03d063c56149a67ffc0df2cc8fc131f39d915d5493524bb8074d2f159"}}