{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q5RE6UNG3LIX7KX4NN2TNG5H3A","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":"b0461318662200853d326803f8f9a171f4747a62bd731df5846d8228c33a617e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T14:47:19Z","title_canon_sha256":"dfd75e938f59117fbd44635befef00ea2dc9fce009bb0fad1370b3e4f5ba3473"},"schema_version":"1.0","source":{"id":"1606.00313","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00313","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00313v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00313","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"Q5RE6UNG3LIX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q5RE6UNG3LIX7KX4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q5RE6UNG","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:5c890e1651291bc804377589aea744e2acb23edc25554b1113d87af63950be13","target":"graph","created_at":"2026-05-18T01:13:05Z","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 give an oracle-based algorithm for the adversarial contextual bandit problem, where either contexts are drawn i.i.d. or the sequence of contexts is known a priori, but where the losses are picked adversarially. Our algorithm is computationally efficient, assuming access to an offline optimization oracle, and enjoys a regret of order $O((KT)^{\\frac{2}{3}}(\\log N)^{\\frac{1}{3}})$, where $K$ is the number of actions, $T$ is the number of iterations and $N$ is the number of baseline policies. Our result is the first to break the $O(T^{\\frac{3}{4}})$ barrier that is achieved by recently introduc","authors_text":"Akshay Krishnamurthy, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T14:47:19Z","title":"Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00313","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:42305c6922a89b4e7ce8089fdb78f917d5bafa1d0dbc3bd9ca0a1cdd38745d5d","target":"record","created_at":"2026-05-18T01:13:05Z","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":"b0461318662200853d326803f8f9a171f4747a62bd731df5846d8228c33a617e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T14:47:19Z","title_canon_sha256":"dfd75e938f59117fbd44635befef00ea2dc9fce009bb0fad1370b3e4f5ba3473"},"schema_version":"1.0","source":{"id":"1606.00313","kind":"arxiv","version":1}},"canonical_sha256":"87624f51a6dad17faafc6b75369ba7d80405bbe5e4f4a96359474a65aa20feca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87624f51a6dad17faafc6b75369ba7d80405bbe5e4f4a96359474a65aa20feca","first_computed_at":"2026-05-18T01:13:05.540447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.540447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZgF+acvT+udyrkfJONxBi2oIeNAeoIX4aD5MywchzTO/Tk++2sv2hPH9MauW2e6gDt0rGoVWiqzM4ameyoylDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.540856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00313","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42305c6922a89b4e7ce8089fdb78f917d5bafa1d0dbc3bd9ca0a1cdd38745d5d","sha256:5c890e1651291bc804377589aea744e2acb23edc25554b1113d87af63950be13"],"state_sha256":"47158ca8641eb7b127eedff40ab66d7e2686aa7c637ebb0c800367fbc2665007"}