{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TSF3GLCIJLQFVWGUXAZ63KCZDW","short_pith_number":"pith:TSF3GLCI","canonical_record":{"source":{"id":"1711.02545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-06T07:02:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"949d5848b00af6be8d94a8f1a36d95680b7d309878f86cc6e5758b61350c0a75","abstract_canon_sha256":"8ae7563559165c94fa39875e783894f5d810f8a6c6bbd635fb7686c9d67651c7"},"schema_version":"1.0"},"canonical_sha256":"9c8bb32c484ae05ad8d4b833eda8591d95fe0034cafc55e06b6e24e23b882d4b","source":{"kind":"arxiv","id":"1711.02545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02545","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02545v1","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02545","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"TSF3GLCIJLQF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TSF3GLCIJLQFVWGU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TSF3GLCI","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TSF3GLCIJLQFVWGUXAZ63KCZDW","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-06T07:02:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"949d5848b00af6be8d94a8f1a36d95680b7d309878f86cc6e5758b61350c0a75","abstract_canon_sha256":"8ae7563559165c94fa39875e783894f5d810f8a6c6bbd635fb7686c9d67651c7"},"schema_version":"1.0"},"canonical_sha256":"9c8bb32c484ae05ad8d4b833eda8591d95fe0034cafc55e06b6e24e23b882d4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:07.634355Z","signature_b64":"hvW81ok5IgyTVXxCUZWwS0VWBwgCt47wHXCerRCCHx3H+BLtf0FO6qDu0LQRxsfBbvdbN7UskCagX0ByI9P1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8bb32c484ae05ad8d4b833eda8591d95fe0034cafc55e06b6e24e23b882d4b","last_reissued_at":"2026-05-18T00:31:07.633674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:07.633674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02545","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-18T00:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8T2GxsKVoYZMvdepdJE8CuqoeKmSQ7CnXuMOB1/zamhlIFLFJOZci1547HXiwHIdEJ+1ixqKmUyRMRe4w5FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:55:30.246804Z"},"content_sha256":"a10cd04af867207caa8388376440de5b4c9ac622b51d98ca33834cd711cb916c","schema_version":"1.0","event_id":"sha256:a10cd04af867207caa8388376440de5b4c9ac622b51d98ca33834cd711cb916c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TSF3GLCIJLQFVWGUXAZ63KCZDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning for Changing Environments using Coin Betting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francesco Orabona, Kwang-Sung Jun, Rebecca Willett, Stephen Wright","submitted_at":"2017-11-06T07:02:53Z","abstract_excerpt":"A key challenge in online learning is that classical algorithms can be slow to adapt to changing environments. Recent studies have proposed \"meta\" algorithms that convert any online learning algorithm to one that is adaptive to changing environments, where the adaptivity is analyzed in a quantity called the strongly-adaptive regret. This paper describes a new meta algorithm that has a strongly-adaptive regret bound that is a factor of $\\sqrt{\\log(T)}$ better than other algorithms with the same time complexity, where $T$ is the time horizon. We also extend our algorithm to achieve a first-order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02545","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-18T00:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ah/A1jQ2DFmjDmWlYZ44u5SbiR5dEAQkMutJLFgCj4VCl064PcTMx05mugoT2/1ruBXn6IWm8wL+GNLdrmZ0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:55:30.247430Z"},"content_sha256":"07e28f0b88ccf036242238666ae6a445298c5e2d6c65d3c182b32108f7bdd4f1","schema_version":"1.0","event_id":"sha256:07e28f0b88ccf036242238666ae6a445298c5e2d6c65d3c182b32108f7bdd4f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/bundle.json","state_url":"https://pith.science/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/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-26T11:55:30Z","links":{"resolver":"https://pith.science/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW","bundle":"https://pith.science/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/bundle.json","state":"https://pith.science/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSF3GLCIJLQFVWGUXAZ63KCZDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TSF3GLCIJLQFVWGUXAZ63KCZDW","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":"8ae7563559165c94fa39875e783894f5d810f8a6c6bbd635fb7686c9d67651c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-06T07:02:53Z","title_canon_sha256":"949d5848b00af6be8d94a8f1a36d95680b7d309878f86cc6e5758b61350c0a75"},"schema_version":"1.0","source":{"id":"1711.02545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02545","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02545v1","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02545","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"TSF3GLCIJLQF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TSF3GLCIJLQFVWGU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TSF3GLCI","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:07e28f0b88ccf036242238666ae6a445298c5e2d6c65d3c182b32108f7bdd4f1","target":"graph","created_at":"2026-05-18T00:31:07Z","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":"A key challenge in online learning is that classical algorithms can be slow to adapt to changing environments. Recent studies have proposed \"meta\" algorithms that convert any online learning algorithm to one that is adaptive to changing environments, where the adaptivity is analyzed in a quantity called the strongly-adaptive regret. This paper describes a new meta algorithm that has a strongly-adaptive regret bound that is a factor of $\\sqrt{\\log(T)}$ better than other algorithms with the same time complexity, where $T$ is the time horizon. We also extend our algorithm to achieve a first-order","authors_text":"Francesco Orabona, Kwang-Sung Jun, Rebecca Willett, Stephen Wright","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-06T07:02:53Z","title":"Online Learning for Changing Environments using Coin Betting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02545","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:a10cd04af867207caa8388376440de5b4c9ac622b51d98ca33834cd711cb916c","target":"record","created_at":"2026-05-18T00:31:07Z","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":"8ae7563559165c94fa39875e783894f5d810f8a6c6bbd635fb7686c9d67651c7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-06T07:02:53Z","title_canon_sha256":"949d5848b00af6be8d94a8f1a36d95680b7d309878f86cc6e5758b61350c0a75"},"schema_version":"1.0","source":{"id":"1711.02545","kind":"arxiv","version":1}},"canonical_sha256":"9c8bb32c484ae05ad8d4b833eda8591d95fe0034cafc55e06b6e24e23b882d4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c8bb32c484ae05ad8d4b833eda8591d95fe0034cafc55e06b6e24e23b882d4b","first_computed_at":"2026-05-18T00:31:07.633674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:07.633674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvW81ok5IgyTVXxCUZWwS0VWBwgCt47wHXCerRCCHx3H+BLtf0FO6qDu0LQRxsfBbvdbN7UskCagX0ByI9P1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:07.634355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10cd04af867207caa8388376440de5b4c9ac622b51d98ca33834cd711cb916c","sha256:07e28f0b88ccf036242238666ae6a445298c5e2d6c65d3c182b32108f7bdd4f1"],"state_sha256":"1182e5a4ab5b8b2d7823b8615636d189bf2ff058062f0d526e8780fbc1908320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZv6RvD/pu9JSkYaFSoEQBO/YVOSWT+SQ/DhI6kRJulNGbOb7wTUajhhUXQOqrJDmM/i00H2Kv5JoPH7CGq+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:55:30.250692Z","bundle_sha256":"a5196bc96d9efa47c994d98da197227ba06c54960f1ab8447828ab52ebb2f75f"}}