{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QS5FT3PM4F6LV4FTY2SUBVN6CT","short_pith_number":"pith:QS5FT3PM","canonical_record":{"source":{"id":"2002.00287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-01T22:49:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2b0437e3433d76d0b7c1f95e56cd4726045b196ba381c6bd4897286723868f79","abstract_canon_sha256":"4f416cae42000c82c78d9debf4f64d0077b2da54f8fcbf1ac0897885350f2b77"},"schema_version":"1.0"},"canonical_sha256":"84ba59edece17cbaf0b3c6a540d5be14cf98f19cfcf3721ec54ec54245146ddf","source":{"kind":"arxiv","id":"2002.00287","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00287","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00287v3","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00287","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"QS5FT3PM4F6L","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_16","alias_value":"QS5FT3PM4F6LV4FT","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_8","alias_value":"QS5FT3PM","created_at":"2026-07-05T04:25:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QS5FT3PM4F6LV4FTY2SUBVN6CT","target":"record","payload":{"canonical_record":{"source":{"id":"2002.00287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-01T22:49:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2b0437e3433d76d0b7c1f95e56cd4726045b196ba381c6bd4897286723868f79","abstract_canon_sha256":"4f416cae42000c82c78d9debf4f64d0077b2da54f8fcbf1ac0897885350f2b77"},"schema_version":"1.0"},"canonical_sha256":"84ba59edece17cbaf0b3c6a540d5be14cf98f19cfcf3721ec54ec54245146ddf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:39.054565Z","signature_b64":"XQb6NnOKLHyKDC4E0+aTAd4PD4/PP9j2lD5fd1ICxgBzKZaevKjXCnViMhayEceS48xlYnYjFcjX/PsbEvHIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ba59edece17cbaf0b3c6a540d5be14cf98f19cfcf3721ec54ec54245146ddf","last_reissued_at":"2026-07-05T04:25:39.054058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:39.054058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.00287","source_version":3,"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-07-05T04:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uddRzDEi33a9uvU25lKemMQrleziMP/CQ2c1OWvrlamRsw41uD84RgyR4wxn9j7UWYS2p6G09pLvZvlM7rLjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:36:21.671381Z"},"content_sha256":"13d88607d69826e41d5ee3da92d446c02440d4b24c7c8f41dd64483ae0d8ad81","schema_version":"1.0","event_id":"sha256:13d88607d69826e41d5ee3da92d446c02440d4b24c7c8f41dd64483ae0d8ad81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QS5FT3PM4F6LV4FTY2SUBVN6CT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gergely Neu, Julia Olkhovskaya","submitted_at":"2020-02-01T22:49:46Z","abstract_excerpt":"We consider an adversarial variant of the classic $K$-armed linear contextual bandit problem where the sequence of loss functions associated with each arm are allowed to change without restriction over time. Under the assumption that the $d$-dimensional contexts are generated i.i.d.~at random from a known distributions, we develop computationally efficient algorithms based on the classic Exp3 algorithm. Our first algorithm, RealLinExp3, is shown to achieve a regret guarantee of $\\widetilde{O}(\\sqrt{KdT})$ over $T$ rounds, which matches the best available bound for this problem. Our second algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00287","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.00287/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChylUSvg572jDWSNg3hT9SjnNncv2nHGgWdeI8CxsxjcvoVtEiCMBRMc8VVmP7vpmhMkrAVPi0bXyaDF0kfoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:36:21.671680Z"},"content_sha256":"4bb7ff07d73a10e12fd48b19850051d81518e8bffcbcd1ca5c6d6d07712b180c","schema_version":"1.0","event_id":"sha256:4bb7ff07d73a10e12fd48b19850051d81518e8bffcbcd1ca5c6d6d07712b180c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/bundle.json","state_url":"https://pith.science/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/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-08-01T07:36:21Z","links":{"resolver":"https://pith.science/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT","bundle":"https://pith.science/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/bundle.json","state":"https://pith.science/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QS5FT3PM4F6LV4FTY2SUBVN6CT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QS5FT3PM4F6LV4FTY2SUBVN6CT","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":"4f416cae42000c82c78d9debf4f64d0077b2da54f8fcbf1ac0897885350f2b77","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-01T22:49:46Z","title_canon_sha256":"2b0437e3433d76d0b7c1f95e56cd4726045b196ba381c6bd4897286723868f79"},"schema_version":"1.0","source":{"id":"2002.00287","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00287","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00287v3","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00287","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"QS5FT3PM4F6L","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_16","alias_value":"QS5FT3PM4F6LV4FT","created_at":"2026-07-05T04:25:39Z"},{"alias_kind":"pith_short_8","alias_value":"QS5FT3PM","created_at":"2026-07-05T04:25:39Z"}],"graph_snapshots":[{"event_id":"sha256:4bb7ff07d73a10e12fd48b19850051d81518e8bffcbcd1ca5c6d6d07712b180c","target":"graph","created_at":"2026-07-05T04:25:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.00287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider an adversarial variant of the classic $K$-armed linear contextual bandit problem where the sequence of loss functions associated with each arm are allowed to change without restriction over time. Under the assumption that the $d$-dimensional contexts are generated i.i.d.~at random from a known distributions, we develop computationally efficient algorithms based on the classic Exp3 algorithm. Our first algorithm, RealLinExp3, is shown to achieve a regret guarantee of $\\widetilde{O}(\\sqrt{KdT})$ over $T$ rounds, which matches the best available bound for this problem. Our second algo","authors_text":"Gergely Neu, Julia Olkhovskaya","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-01T22:49:46Z","title":"Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00287","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:13d88607d69826e41d5ee3da92d446c02440d4b24c7c8f41dd64483ae0d8ad81","target":"record","created_at":"2026-07-05T04:25:39Z","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":"4f416cae42000c82c78d9debf4f64d0077b2da54f8fcbf1ac0897885350f2b77","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-01T22:49:46Z","title_canon_sha256":"2b0437e3433d76d0b7c1f95e56cd4726045b196ba381c6bd4897286723868f79"},"schema_version":"1.0","source":{"id":"2002.00287","kind":"arxiv","version":3}},"canonical_sha256":"84ba59edece17cbaf0b3c6a540d5be14cf98f19cfcf3721ec54ec54245146ddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84ba59edece17cbaf0b3c6a540d5be14cf98f19cfcf3721ec54ec54245146ddf","first_computed_at":"2026-07-05T04:25:39.054058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:39.054058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQb6NnOKLHyKDC4E0+aTAd4PD4/PP9j2lD5fd1ICxgBzKZaevKjXCnViMhayEceS48xlYnYjFcjX/PsbEvHIAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:39.054565Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.00287","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13d88607d69826e41d5ee3da92d446c02440d4b24c7c8f41dd64483ae0d8ad81","sha256:4bb7ff07d73a10e12fd48b19850051d81518e8bffcbcd1ca5c6d6d07712b180c"],"state_sha256":"b78846a456fc1ea003764950d957295748227b0ae3e77d23664f6fc4a62a94c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekNFTzXMXyWlfTFANNcIZiTuCmi9D0KPAyGMFuaLCwy49wsOEutMbV2qu4S2E8Xa2eZb2RYOLAiAhIcz1tDlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:36:21.676149Z","bundle_sha256":"b72fc18485df9d4e3f21d2bfd6f2137790fe3f9fe4bf2736f080146a0d633f3f"}}