{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3OLFIGI2DGCO47LY3TAPPAMCAM","short_pith_number":"pith:3OLFIGI2","canonical_record":{"source":{"id":"2010.12247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T09:12:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c5589f66bb956cf23e3a22630da93730625040515469ae6c2c4b06ed46da0db8","abstract_canon_sha256":"92d35207fbd24197daaa806e84dc4c6ca58d3e8cd02ee3b5375ff325e0f43e4e"},"schema_version":"1.0"},"canonical_sha256":"db9654191a1984ee7d78dcc0f7818203125cbef477d695366d8b9b4aeb4660f6","source":{"kind":"arxiv","id":"2010.12247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12247","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12247v2","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12247","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"3OLFIGI2DGCO","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_16","alias_value":"3OLFIGI2DGCO47LY","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_8","alias_value":"3OLFIGI2","created_at":"2026-07-05T01:53:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3OLFIGI2DGCO47LY3TAPPAMCAM","target":"record","payload":{"canonical_record":{"source":{"id":"2010.12247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T09:12:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c5589f66bb956cf23e3a22630da93730625040515469ae6c2c4b06ed46da0db8","abstract_canon_sha256":"92d35207fbd24197daaa806e84dc4c6ca58d3e8cd02ee3b5375ff325e0f43e4e"},"schema_version":"1.0"},"canonical_sha256":"db9654191a1984ee7d78dcc0f7818203125cbef477d695366d8b9b4aeb4660f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:10.306162Z","signature_b64":"9FgaFGdhd9/vYYawHdBBmg7Q7lskov5GgEfgcdN/i4oiPfOzT9R/wCfJf9tBvGCQSn7DIwGfzj1Of9E5sQ44Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db9654191a1984ee7d78dcc0f7818203125cbef477d695366d8b9b4aeb4660f6","last_reissued_at":"2026-07-05T01:53:10.305657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:10.305657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.12247","source_version":2,"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-05T01:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxBDPcEPVPCf8BZcG4ANSfOgrgQwIh1DLNCvRz61/z0zZfKmT1B1FuahHqEVC+AaNKt5r+GGi5YezH8ic9E/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:32.710845Z"},"content_sha256":"dc8f7de8c1e956c5783c756ac462b9eca234474fdc499289b1a122c81a3f4ef9","schema_version":"1.0","event_id":"sha256:dc8f7de8c1e956c5783c756ac462b9eca234474fdc499289b1a122c81a3f4ef9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3OLFIGI2DGCO47LY3TAPPAMCAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Lazaric, Andrea Tirinzoni, Marcello Restelli, Matteo Pirotta","submitted_at":"2020-10-23T09:12:47Z","abstract_excerpt":"In the contextual linear bandit setting, algorithms built on the optimism principle fail to exploit the structure of the problem and have been shown to be asymptotically suboptimal. In this paper, we follow recent approaches of deriving asymptotically optimal algorithms from problem-dependent regret lower bounds and we introduce a novel algorithm improving over the state-of-the-art along multiple dimensions. We build on a reformulation of the lower bound, where context distribution and exploration policy are decoupled, and we obtain an algorithm robust to unbalanced context distributions. Then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12247","kind":"arxiv","version":2},"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/2010.12247/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-05T01:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKbpunUko9fXIG5UQMZXx3MPqiXrTATJmd/PwjwEEh/Hi8CePbQGmKIj2oYCQyS+AH/hex00KH/xTHWkLeo6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:32.711219Z"},"content_sha256":"5b75930af82ddfdfd88f95b97528cc322f4e76197e649557630e42db8b3645cd","schema_version":"1.0","event_id":"sha256:5b75930af82ddfdfd88f95b97528cc322f4e76197e649557630e42db8b3645cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/bundle.json","state_url":"https://pith.science/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/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-07-06T18:34:32Z","links":{"resolver":"https://pith.science/pith/3OLFIGI2DGCO47LY3TAPPAMCAM","bundle":"https://pith.science/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/bundle.json","state":"https://pith.science/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OLFIGI2DGCO47LY3TAPPAMCAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3OLFIGI2DGCO47LY3TAPPAMCAM","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":"92d35207fbd24197daaa806e84dc4c6ca58d3e8cd02ee3b5375ff325e0f43e4e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T09:12:47Z","title_canon_sha256":"c5589f66bb956cf23e3a22630da93730625040515469ae6c2c4b06ed46da0db8"},"schema_version":"1.0","source":{"id":"2010.12247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12247","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12247v2","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12247","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"3OLFIGI2DGCO","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_16","alias_value":"3OLFIGI2DGCO47LY","created_at":"2026-07-05T01:53:10Z"},{"alias_kind":"pith_short_8","alias_value":"3OLFIGI2","created_at":"2026-07-05T01:53:10Z"}],"graph_snapshots":[{"event_id":"sha256:5b75930af82ddfdfd88f95b97528cc322f4e76197e649557630e42db8b3645cd","target":"graph","created_at":"2026-07-05T01:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.12247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the contextual linear bandit setting, algorithms built on the optimism principle fail to exploit the structure of the problem and have been shown to be asymptotically suboptimal. In this paper, we follow recent approaches of deriving asymptotically optimal algorithms from problem-dependent regret lower bounds and we introduce a novel algorithm improving over the state-of-the-art along multiple dimensions. We build on a reformulation of the lower bound, where context distribution and exploration policy are decoupled, and we obtain an algorithm robust to unbalanced context distributions. Then","authors_text":"Alessandro Lazaric, Andrea Tirinzoni, Marcello Restelli, Matteo Pirotta","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T09:12:47Z","title":"An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12247","kind":"arxiv","version":2},"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:dc8f7de8c1e956c5783c756ac462b9eca234474fdc499289b1a122c81a3f4ef9","target":"record","created_at":"2026-07-05T01:53: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":"92d35207fbd24197daaa806e84dc4c6ca58d3e8cd02ee3b5375ff325e0f43e4e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T09:12:47Z","title_canon_sha256":"c5589f66bb956cf23e3a22630da93730625040515469ae6c2c4b06ed46da0db8"},"schema_version":"1.0","source":{"id":"2010.12247","kind":"arxiv","version":2}},"canonical_sha256":"db9654191a1984ee7d78dcc0f7818203125cbef477d695366d8b9b4aeb4660f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db9654191a1984ee7d78dcc0f7818203125cbef477d695366d8b9b4aeb4660f6","first_computed_at":"2026-07-05T01:53:10.305657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:10.305657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9FgaFGdhd9/vYYawHdBBmg7Q7lskov5GgEfgcdN/i4oiPfOzT9R/wCfJf9tBvGCQSn7DIwGfzj1Of9E5sQ44Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:10.306162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc8f7de8c1e956c5783c756ac462b9eca234474fdc499289b1a122c81a3f4ef9","sha256:5b75930af82ddfdfd88f95b97528cc322f4e76197e649557630e42db8b3645cd"],"state_sha256":"4919e16e6fecea0135b38f8ee3b124892b00bde191ba9724d675411861a57807"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2WG68gxvtaVHEnBxRT62NWryHN+LQR7X7ZpBPEnb7VrtKgamOsXytiDTKVhPZuO6KJJOTKWY4DpdAkRoaaBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:34:32.713327Z","bundle_sha256":"eeb6f853001f8ec1cb8be6d51b54fe5efc30327596853a87b22f569a3d6c6360"}}