{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O3WOWG4CAR2I2F5377DX2FZL4C","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":"31be168c4ae84f87f6fed2599b1f4acfd2a300e95890cde0a40a832998d1c738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-02-22T07:11:39Z","title_canon_sha256":"3ac7cd7797dac8e92c478aaa7d96083420ae798413a55ba37dd50ce9ee15622d"},"schema_version":"1.0","source":{"id":"1002.4058","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4058","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4058v3","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4058","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"O3WOWG4CAR2I","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3WOWG4CAR2I2F53","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3WOWG4C","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:404b001c099232895ac3c583ec0a3fc264bdbfb075bbb5600b7ea9c8efce9e27","target":"graph","created_at":"2026-05-18T04:10:10Z","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 address the problem of learning in an online, bandit setting where the learner must repeatedly select among $K$ actions, but only receives partial feedback based on its choices. We establish two new facts: First, using a new algorithm called Exp4.P, we show that it is possible to compete with the best in a set of $N$ experts with probability $1-\\delta$ while incurring regret at most $O(\\sqrt{KT\\ln(N/\\delta)})$ over $T$ time steps. The new algorithm is tested empirically in a large-scale, real-world dataset. Second, we give a new algorithm called VE that competes with a possibly infinite set","authors_text":"Alina Beygelzimer, John Langford, Lev Reyzin, Lihong Li, Robert E. Schapire","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-02-22T07:11:39Z","title":"Contextual Bandit Algorithms with Supervised Learning Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4058","kind":"arxiv","version":3},"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:795ed8dbb601774df971e83d3af6df3058697fb6fcabdca7ec6e541b571a0ddb","target":"record","created_at":"2026-05-18T04:10:10Z","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":"31be168c4ae84f87f6fed2599b1f4acfd2a300e95890cde0a40a832998d1c738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-02-22T07:11:39Z","title_canon_sha256":"3ac7cd7797dac8e92c478aaa7d96083420ae798413a55ba37dd50ce9ee15622d"},"schema_version":"1.0","source":{"id":"1002.4058","kind":"arxiv","version":3}},"canonical_sha256":"76eceb1b8204748d17bbffc77d172be0b921d920721b2efd0e1e70080e932598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76eceb1b8204748d17bbffc77d172be0b921d920721b2efd0e1e70080e932598","first_computed_at":"2026-05-18T04:10:10.699813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:10.699813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sv1sYHLNqMDBCQzJ1ygxobVu47npcevVL/c/N3YhTRE2pX/hRgIyzxvKIUnNfSBHKBos9UdLu093YMeg/4jnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:10.700751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.4058","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:795ed8dbb601774df971e83d3af6df3058697fb6fcabdca7ec6e541b571a0ddb","sha256:404b001c099232895ac3c583ec0a3fc264bdbfb075bbb5600b7ea9c8efce9e27"],"state_sha256":"a58db66c81361ce184ff33c7e0296025e3b83e4421f0a7c423305251723b3532"}