{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FHHTKX2EMR62VEVJPZ5RCT2AO6","short_pith_number":"pith:FHHTKX2E","canonical_record":{"source":{"id":"1106.2369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-13T01:57:52Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"a1103efa859ed1df26652cfe1e7c42ef3b06b8fb7942d91686952f475f2713c1","abstract_canon_sha256":"9a95be48c780e195f942e2d2725746cbf60516f3404867c8a598ce75e35f9f4b"},"schema_version":"1.0"},"canonical_sha256":"29cf355f44647daa92a97e7b114f40778c4b3827fbf9f609f098ca9877bb72c0","source":{"kind":"arxiv","id":"1106.2369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2369","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2369v1","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2369","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"pith_short_12","alias_value":"FHHTKX2EMR62","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FHHTKX2EMR62VEVJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FHHTKX2E","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FHHTKX2EMR62VEVJPZ5RCT2AO6","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-13T01:57:52Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"a1103efa859ed1df26652cfe1e7c42ef3b06b8fb7942d91686952f475f2713c1","abstract_canon_sha256":"9a95be48c780e195f942e2d2725746cbf60516f3404867c8a598ce75e35f9f4b"},"schema_version":"1.0"},"canonical_sha256":"29cf355f44647daa92a97e7b114f40778c4b3827fbf9f609f098ca9877bb72c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:54.351466Z","signature_b64":"MQkSnRJFRUpbsaZ+dncrPc2zTM4zprPA9WwIgvlxZ6srAz3W2LdnC1UBvg4Wcge3hl86wZJsSagbPscnFgwNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29cf355f44647daa92a97e7b114f40778c4b3827fbf9f609f098ca9877bb72c0","last_reissued_at":"2026-05-18T04:19:54.350710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:54.350710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2369","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-18T04:19:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCptp84dd5sKWsvf6OalG0p68bmApNVJpeJqyW27Z4q4rVSxdoMJ47hBhCxxDgK6POQ47o2DdMwxtqMb7U0bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:29:19.670293Z"},"content_sha256":"a5b85de98d15cd70f5b8196a2d412c601b50dc85fbef4d0c83b56c62473ba694","schema_version":"1.0","event_id":"sha256:a5b85de98d15cd70f5b8196a2d412c601b50dc85fbef4d0c83b56c62473ba694"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FHHTKX2EMR62VEVJPZ5RCT2AO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Optimal Learning for Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Hsu, John Langford, Lev Reyzin, Miroslav Dudik, Nikos Karampatziakis, Satyen Kale, Tong Zhang","submitted_at":"2011-06-13T01:57:52Z","abstract_excerpt":"We address the problem of learning in an online setting where the learner repeatedly observes features, selects among a set of actions, and receives reward for the action taken. We provide the first efficient algorithm with an optimal regret. Our algorithm uses a cost sensitive classification learner as an oracle and has a running time $\\mathrm{polylog}(N)$, where $N$ is the number of classification rules among which the oracle might choose. This is exponentially faster than all previous algorithms that achieve optimal regret in this setting. Our formulation also enables us to create an algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2369","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-18T04:19:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfhiYH8plbiBOtJ9QapJT5jciFZNQtuImhQ7Fry6rN6TGk5cefO0vGWhM5TPeFTOvMsSsgIaNSXboLA5ra93Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:29:19.670963Z"},"content_sha256":"00be27ed77ffa87a9dcd76885c2d08a97e234a5219acecf9f7352b6205f68316","schema_version":"1.0","event_id":"sha256:00be27ed77ffa87a9dcd76885c2d08a97e234a5219acecf9f7352b6205f68316"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/bundle.json","state_url":"https://pith.science/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/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-05-26T20:29:19Z","links":{"resolver":"https://pith.science/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6","bundle":"https://pith.science/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/bundle.json","state":"https://pith.science/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHHTKX2EMR62VEVJPZ5RCT2AO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FHHTKX2EMR62VEVJPZ5RCT2AO6","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":"9a95be48c780e195f942e2d2725746cbf60516f3404867c8a598ce75e35f9f4b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-13T01:57:52Z","title_canon_sha256":"a1103efa859ed1df26652cfe1e7c42ef3b06b8fb7942d91686952f475f2713c1"},"schema_version":"1.0","source":{"id":"1106.2369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2369","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2369v1","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2369","created_at":"2026-05-18T04:19:54Z"},{"alias_kind":"pith_short_12","alias_value":"FHHTKX2EMR62","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FHHTKX2EMR62VEVJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FHHTKX2E","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:00be27ed77ffa87a9dcd76885c2d08a97e234a5219acecf9f7352b6205f68316","target":"graph","created_at":"2026-05-18T04:19:54Z","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 setting where the learner repeatedly observes features, selects among a set of actions, and receives reward for the action taken. We provide the first efficient algorithm with an optimal regret. Our algorithm uses a cost sensitive classification learner as an oracle and has a running time $\\mathrm{polylog}(N)$, where $N$ is the number of classification rules among which the oracle might choose. This is exponentially faster than all previous algorithms that achieve optimal regret in this setting. Our formulation also enables us to create an algori","authors_text":"Daniel Hsu, John Langford, Lev Reyzin, Miroslav Dudik, Nikos Karampatziakis, Satyen Kale, Tong Zhang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-13T01:57:52Z","title":"Efficient Optimal Learning for Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2369","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:a5b85de98d15cd70f5b8196a2d412c601b50dc85fbef4d0c83b56c62473ba694","target":"record","created_at":"2026-05-18T04:19:54Z","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":"9a95be48c780e195f942e2d2725746cbf60516f3404867c8a598ce75e35f9f4b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-13T01:57:52Z","title_canon_sha256":"a1103efa859ed1df26652cfe1e7c42ef3b06b8fb7942d91686952f475f2713c1"},"schema_version":"1.0","source":{"id":"1106.2369","kind":"arxiv","version":1}},"canonical_sha256":"29cf355f44647daa92a97e7b114f40778c4b3827fbf9f609f098ca9877bb72c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29cf355f44647daa92a97e7b114f40778c4b3827fbf9f609f098ca9877bb72c0","first_computed_at":"2026-05-18T04:19:54.350710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:54.350710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MQkSnRJFRUpbsaZ+dncrPc2zTM4zprPA9WwIgvlxZ6srAz3W2LdnC1UBvg4Wcge3hl86wZJsSagbPscnFgwNCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:54.351466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5b85de98d15cd70f5b8196a2d412c601b50dc85fbef4d0c83b56c62473ba694","sha256:00be27ed77ffa87a9dcd76885c2d08a97e234a5219acecf9f7352b6205f68316"],"state_sha256":"da7c8ed9c9ee3ab4b86330a367bb9bfc14a1dad7763c85d38468701808ae6dfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLSBSpHpeM3bB1RDniVJ+Tnw7CmRfgYd9sZEoTo25pE30lNvRyXKFSgrBMnDrJfxGLCseiUiKyNg/l1h9hrHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:29:19.674949Z","bundle_sha256":"58152d14403640a1f84969a45ef44f9ce6ac7433f14d6ff5d376561489027e7d"}}