{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3ST6LXQ32SIV74AANHIUAJPEUR","short_pith_number":"pith:3ST6LXQ3","canonical_record":{"source":{"id":"1902.00980","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-03T22:25:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3993e7cf3cd1992d85d22d39b3c1cdec11e0a98e6662787cd961b344cc9d1456","abstract_canon_sha256":"bea812a2f1baefe3411bf1dfda80134800d2282d06f74a7044787080ac28e780"},"schema_version":"1.0"},"canonical_sha256":"dca7e5de1bd4915ff00069d14025e4a446dc473ec97c5e8ec1aaadff1ac008f3","source":{"kind":"arxiv","id":"1902.00980","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00980","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00980v3","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00980","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"3ST6LXQ32SIV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ST6LXQ32SIV74AA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ST6LXQ3","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3ST6LXQ32SIV74AANHIUAJPEUR","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00980","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-03T22:25:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3993e7cf3cd1992d85d22d39b3c1cdec11e0a98e6662787cd961b344cc9d1456","abstract_canon_sha256":"bea812a2f1baefe3411bf1dfda80134800d2282d06f74a7044787080ac28e780"},"schema_version":"1.0"},"canonical_sha256":"dca7e5de1bd4915ff00069d14025e4a446dc473ec97c5e8ec1aaadff1ac008f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:09.094754Z","signature_b64":"x88O2Sx/GSRRt1Olebgcfm4EZz3tdQhNpJoz33YO3cztkmJBxhuoIfFFwOGSWig/YJDqWaC1TLJPrY4P0fJgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca7e5de1bd4915ff00069d14025e4a446dc473ec97c5e8ec1aaadff1ac008f3","last_reissued_at":"2026-05-17T23:43:09.094265Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:09.094265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00980","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-05-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8VJD/QT3X/itF+p6mEm5a4XSiTzQTZxsrImIDn0TwXF7gynuMhALk+X/wfx8dY8EK3SWreAofzZe4qiFc2KDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:48:36.705507Z"},"content_sha256":"531630692b621ffa36a5f9637d5a039d4af82235e2fca44e28909d4185631516","schema_version":"1.0","event_id":"sha256:531630692b621ffa36a5f9637d5a039d4af82235e2fca44e28909d4185631516"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3ST6LXQ32SIV74AANHIUAJPEUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen-Yu Wei, Chung-Wei Lee, Haipeng Luo, Yifang Chen","submitted_at":"2019-02-03T22:25:26Z","abstract_excerpt":"We propose the first contextual bandit algorithm that is parameter-free, efficient, and optimal in terms of dynamic regret. Specifically, our algorithm achieves dynamic regret $\\mathcal{O}(\\min\\{\\sqrt{ST}, \\Delta^{\\frac{1}{3}}T^{\\frac{2}{3}}\\})$ for a contextual bandit problem with $T$ rounds, $S$ switches and $\\Delta$ total variation in data distributions. Importantly, our algorithm is adaptive and does not need to know $S$ or $\\Delta$ ahead of time, and can be implemented efficiently assuming access to an ERM oracle.\n  Our results strictly improve the $\\mathcal{O}(\\min \\{S^{\\frac{1}{4}}T^{\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00980","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":""},"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-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLoY15WvT54uPIuDm27WrNRyb1EDodtAxtIr9bmip/XX/GwAKUsdPZDUpxda+/I8SxENxKUJuGtcXeLSvLN9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:48:36.705880Z"},"content_sha256":"4be23f9100b40c33465942180f454b667301bebf0dfb18b7fc7219aaf6d639a1","schema_version":"1.0","event_id":"sha256:4be23f9100b40c33465942180f454b667301bebf0dfb18b7fc7219aaf6d639a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ST6LXQ32SIV74AANHIUAJPEUR/bundle.json","state_url":"https://pith.science/pith/3ST6LXQ32SIV74AANHIUAJPEUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ST6LXQ32SIV74AANHIUAJPEUR/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-06-11T13:48:36Z","links":{"resolver":"https://pith.science/pith/3ST6LXQ32SIV74AANHIUAJPEUR","bundle":"https://pith.science/pith/3ST6LXQ32SIV74AANHIUAJPEUR/bundle.json","state":"https://pith.science/pith/3ST6LXQ32SIV74AANHIUAJPEUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ST6LXQ32SIV74AANHIUAJPEUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3ST6LXQ32SIV74AANHIUAJPEUR","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":"bea812a2f1baefe3411bf1dfda80134800d2282d06f74a7044787080ac28e780","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-03T22:25:26Z","title_canon_sha256":"3993e7cf3cd1992d85d22d39b3c1cdec11e0a98e6662787cd961b344cc9d1456"},"schema_version":"1.0","source":{"id":"1902.00980","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00980","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00980v3","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00980","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"3ST6LXQ32SIV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ST6LXQ32SIV74AA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ST6LXQ3","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:4be23f9100b40c33465942180f454b667301bebf0dfb18b7fc7219aaf6d639a1","target":"graph","created_at":"2026-05-17T23:43: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 propose the first contextual bandit algorithm that is parameter-free, efficient, and optimal in terms of dynamic regret. Specifically, our algorithm achieves dynamic regret $\\mathcal{O}(\\min\\{\\sqrt{ST}, \\Delta^{\\frac{1}{3}}T^{\\frac{2}{3}}\\})$ for a contextual bandit problem with $T$ rounds, $S$ switches and $\\Delta$ total variation in data distributions. Importantly, our algorithm is adaptive and does not need to know $S$ or $\\Delta$ ahead of time, and can be implemented efficiently assuming access to an ERM oracle.\n  Our results strictly improve the $\\mathcal{O}(\\min \\{S^{\\frac{1}{4}}T^{\\f","authors_text":"Chen-Yu Wei, Chung-Wei Lee, Haipeng Luo, Yifang Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-03T22:25:26Z","title":"A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00980","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:531630692b621ffa36a5f9637d5a039d4af82235e2fca44e28909d4185631516","target":"record","created_at":"2026-05-17T23:43: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":"bea812a2f1baefe3411bf1dfda80134800d2282d06f74a7044787080ac28e780","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-03T22:25:26Z","title_canon_sha256":"3993e7cf3cd1992d85d22d39b3c1cdec11e0a98e6662787cd961b344cc9d1456"},"schema_version":"1.0","source":{"id":"1902.00980","kind":"arxiv","version":3}},"canonical_sha256":"dca7e5de1bd4915ff00069d14025e4a446dc473ec97c5e8ec1aaadff1ac008f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dca7e5de1bd4915ff00069d14025e4a446dc473ec97c5e8ec1aaadff1ac008f3","first_computed_at":"2026-05-17T23:43:09.094265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:09.094265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x88O2Sx/GSRRt1Olebgcfm4EZz3tdQhNpJoz33YO3cztkmJBxhuoIfFFwOGSWig/YJDqWaC1TLJPrY4P0fJgBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:09.094754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00980","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531630692b621ffa36a5f9637d5a039d4af82235e2fca44e28909d4185631516","sha256:4be23f9100b40c33465942180f454b667301bebf0dfb18b7fc7219aaf6d639a1"],"state_sha256":"3b30dcdc005555669ee7391cb3638fa507ffca90593301f299d6e588c7cceff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnQfeq3isfeUwjCH8B7267buFFaOsdrkPFkwl1EtzbrEXlbrp1EtTa1UwmgamATKpNU3/iWsA7vaIe1D8hPxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:48:36.708946Z","bundle_sha256":"1898a096455bc25aed5934ed5fb7943f46fce11bdf4f2fd2e2b3dc2b3f078b89"}}