{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U6IPCW5ZZB4THMCX3IWINBLRP6","short_pith_number":"pith:U6IPCW5Z","canonical_record":{"source":{"id":"1602.02454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"63ad7f18f8b48d436f39defd7c1c4411b4753da67956d80973c106541d2a079c","abstract_canon_sha256":"8aa27a436a334b84a7c36311f913e740ddb077ee56dc68f09cde0285436f1fd2"},"schema_version":"1.0"},"canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","source":{"kind":"arxiv","id":"1602.02454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02454","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02454v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02454","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"U6IPCW5ZZB4T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6IPCW5ZZB4THMCX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6IPCW5Z","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U6IPCW5ZZB4THMCX3IWINBLRP6","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"63ad7f18f8b48d436f39defd7c1c4411b4753da67956d80973c106541d2a079c","abstract_canon_sha256":"8aa27a436a334b84a7c36311f913e740ddb077ee56dc68f09cde0285436f1fd2"},"schema_version":"1.0"},"canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:09.908753Z","signature_b64":"P4vj7n5wha6+r8OZvHQ57SFcM2N/prveWLvvcWUzd+INoiZtbvD1wyb26K6iYF/1Gs9VLUTbJq9RIVyA26KmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","last_reissued_at":"2026-05-18T01:21:09.908142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:09.908142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02454","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:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QyOUgWWworLwqElHzs/QA4/3wKwA9afPk0qQ90k/hJSw/8ah76sRkxugKQFyA9j/4XdX7hHXS2po7a8G3puAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:36.237406Z"},"content_sha256":"76ffb08640c4f1d8149f863a33d0a3919ec8d789f00a294193d3c83b4a58fbf4","schema_version":"1.0","event_id":"sha256:76ffb08640c4f1d8149f863a33d0a3919ec8d789f00a294193d3c83b4a58fbf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U6IPCW5ZZB4THMCX3IWINBLRP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Adversarial Contextual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2016-02-08T03:11:39Z","abstract_excerpt":"We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of a context and receives reward for the chosen action, with the goal of achieving reward competitive with a large class of policies. We analyze two settings: i) in the transductive setting the learner knows the set of contexts a priori, ii) in the small separator setting, there exists a small set of contexts such that any two policies behave differently in one of the contexts in the set. Our algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02454","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:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMG+rEqGxzhC0y8Sx7dBDLqDXHL4oWzl/TujzsSXRUy9quJdf+3Xgfmtc1q5hJewfAo5n56DxXCdWcW7tsarBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:36.237797Z"},"content_sha256":"ebc155cf80bab9854c3c01619a882bd4c6e3bcf38ed9a6a4147a96e374e66177","schema_version":"1.0","event_id":"sha256:ebc155cf80bab9854c3c01619a882bd4c6e3bcf38ed9a6a4147a96e374e66177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/bundle.json","state_url":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/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-27T11:52:36Z","links":{"resolver":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6","bundle":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/bundle.json","state":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U6IPCW5ZZB4THMCX3IWINBLRP6","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":"8aa27a436a334b84a7c36311f913e740ddb077ee56dc68f09cde0285436f1fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","title_canon_sha256":"63ad7f18f8b48d436f39defd7c1c4411b4753da67956d80973c106541d2a079c"},"schema_version":"1.0","source":{"id":"1602.02454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02454","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02454v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02454","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"U6IPCW5ZZB4T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6IPCW5ZZB4THMCX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6IPCW5Z","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ebc155cf80bab9854c3c01619a882bd4c6e3bcf38ed9a6a4147a96e374e66177","target":"graph","created_at":"2026-05-18T01:21:09Z","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 provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of a context and receives reward for the chosen action, with the goal of achieving reward competitive with a large class of policies. We analyze two settings: i) in the transductive setting the learner knows the set of contexts a priori, ii) in the small separator setting, there exists a small set of contexts such that any two policies behave differently in one of the contexts in the set. Our algorithms","authors_text":"Akshay Krishnamurthy, Robert E. Schapire, Vasilis Syrgkanis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","title":"Efficient Algorithms for Adversarial Contextual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02454","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:76ffb08640c4f1d8149f863a33d0a3919ec8d789f00a294193d3c83b4a58fbf4","target":"record","created_at":"2026-05-18T01:21:09Z","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":"8aa27a436a334b84a7c36311f913e740ddb077ee56dc68f09cde0285436f1fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","title_canon_sha256":"63ad7f18f8b48d436f39defd7c1c4411b4753da67956d80973c106541d2a079c"},"schema_version":"1.0","source":{"id":"1602.02454","kind":"arxiv","version":1}},"canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","first_computed_at":"2026-05-18T01:21:09.908142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:09.908142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4vj7n5wha6+r8OZvHQ57SFcM2N/prveWLvvcWUzd+INoiZtbvD1wyb26K6iYF/1Gs9VLUTbJq9RIVyA26KmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:09.908753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ffb08640c4f1d8149f863a33d0a3919ec8d789f00a294193d3c83b4a58fbf4","sha256:ebc155cf80bab9854c3c01619a882bd4c6e3bcf38ed9a6a4147a96e374e66177"],"state_sha256":"f018ff5569b1465b3cfabb6a34d3edbe5147c71c6f2930f034f67987c3bffb6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqspOaqwEuEGsqOWCF/90uG54ZS6MNfkVnuh5mAhtGct/PSEftBsAMJpV16BfmBzmAaDr+htbhfwL4WM3obfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:52:36.240378Z","bundle_sha256":"63556183c4bd181455e56099aa1a87a2572dab4a2465b7db591de12dcc00b5b5"}}