{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RAWMIIDN6EZ2LLZO4J4D2UKLFG","short_pith_number":"pith:RAWMIIDN","canonical_record":{"source":{"id":"2111.11550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T21:52:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bd65d3f7a46b71150ef455000c07fd6b72e345bec9faa7f65d48924bf5a35c53","abstract_canon_sha256":"5ddc9873d030017a16549cf9b1b893faa591e07505bdf7f5890d931a28311ccb"},"schema_version":"1.0"},"canonical_sha256":"882cc4206df133a5af2ee2783d514b29b867e4d3e30545dcc2d8edf6dd9aa107","source":{"kind":"arxiv","id":"2111.11550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.11550","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2111.11550v1","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.11550","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"RAWMIIDN6EZ2","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"RAWMIIDN6EZ2LLZO","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"RAWMIIDN","created_at":"2026-07-05T03:34:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RAWMIIDN6EZ2LLZO4J4D2UKLFG","target":"record","payload":{"canonical_record":{"source":{"id":"2111.11550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T21:52:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bd65d3f7a46b71150ef455000c07fd6b72e345bec9faa7f65d48924bf5a35c53","abstract_canon_sha256":"5ddc9873d030017a16549cf9b1b893faa591e07505bdf7f5890d931a28311ccb"},"schema_version":"1.0"},"canonical_sha256":"882cc4206df133a5af2ee2783d514b29b867e4d3e30545dcc2d8edf6dd9aa107","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:10.352533Z","signature_b64":"s8WulQKVHFezVcSn2733vLCzCGodZTM9rbjdcB+1mbD562GqAhUiOYmzgp3Ch2y2OLGiYfV4gE0x3yKPkVfuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882cc4206df133a5af2ee2783d514b29b867e4d3e30545dcc2d8edf6dd9aa107","last_reissued_at":"2026-07-05T03:34:10.352048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:10.352048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.11550","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-07-05T03:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0h9H7S6++IV86Sf/1bYaGofZUfcuVc4gkyywg2kzHsy5UDu9cK/kuDLfSKNo1TZRytq2hOOtjmvt8FL5jKFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:41:06.085107Z"},"content_sha256":"0054c44aef2b22fdd2f54fe8f748bf215806fafaf3d2297828c405ff05c7a982","schema_version":"1.0","event_id":"sha256:0054c44aef2b22fdd2f54fe8f748bf215806fafaf3d2297828c405ff05c7a982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RAWMIIDN6EZ2LLZO4J4D2UKLFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dheeraj Baby, Hilaf Hasson, Yuyang Wang","submitted_at":"2021-11-22T21:52:47Z","abstract_excerpt":"We consider the framework of non-stationary Online Convex Optimization where a learner seeks to control its dynamic regret against an arbitrary sequence of comparators. When the loss functions are strongly convex or exp-concave, we demonstrate that Strongly Adaptive (SA) algorithms can be viewed as a principled way of controlling dynamic regret in terms of path variation $V_T$ of the comparator sequence. Specifically, we show that SA algorithms enjoy $\\tilde O(\\sqrt{TV_T} \\vee \\log T)$ and $\\tilde O(\\sqrt{dTV_T} \\vee d\\log T)$ dynamic regret for strongly convex and exp-concave losses respectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.11550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.11550/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-05T03:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4AOOc3zxNGizjM2WIPpyBmRf9P6QLT0rTQB5DRLXP7hyYmKPLp4TMZ8I62S73jTq3uuwRXqcxoRka1HkDNxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:41:06.086058Z"},"content_sha256":"525f725bf8516738328d3618386f2d73db5d9f8293a2c4d4aec86ecd4f79cc7f","schema_version":"1.0","event_id":"sha256:525f725bf8516738328d3618386f2d73db5d9f8293a2c4d4aec86ecd4f79cc7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/bundle.json","state_url":"https://pith.science/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/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-04T13:41:06Z","links":{"resolver":"https://pith.science/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG","bundle":"https://pith.science/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/bundle.json","state":"https://pith.science/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAWMIIDN6EZ2LLZO4J4D2UKLFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RAWMIIDN6EZ2LLZO4J4D2UKLFG","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":"5ddc9873d030017a16549cf9b1b893faa591e07505bdf7f5890d931a28311ccb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T21:52:47Z","title_canon_sha256":"bd65d3f7a46b71150ef455000c07fd6b72e345bec9faa7f65d48924bf5a35c53"},"schema_version":"1.0","source":{"id":"2111.11550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.11550","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2111.11550v1","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.11550","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"RAWMIIDN6EZ2","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"RAWMIIDN6EZ2LLZO","created_at":"2026-07-05T03:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"RAWMIIDN","created_at":"2026-07-05T03:34:10Z"}],"graph_snapshots":[{"event_id":"sha256:525f725bf8516738328d3618386f2d73db5d9f8293a2c4d4aec86ecd4f79cc7f","target":"graph","created_at":"2026-07-05T03:34: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/2111.11550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the framework of non-stationary Online Convex Optimization where a learner seeks to control its dynamic regret against an arbitrary sequence of comparators. When the loss functions are strongly convex or exp-concave, we demonstrate that Strongly Adaptive (SA) algorithms can be viewed as a principled way of controlling dynamic regret in terms of path variation $V_T$ of the comparator sequence. Specifically, we show that SA algorithms enjoy $\\tilde O(\\sqrt{TV_T} \\vee \\log T)$ and $\\tilde O(\\sqrt{dTV_T} \\vee d\\log T)$ dynamic regret for strongly convex and exp-concave losses respectiv","authors_text":"Dheeraj Baby, Hilaf Hasson, Yuyang Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T21:52:47Z","title":"Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.11550","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:0054c44aef2b22fdd2f54fe8f748bf215806fafaf3d2297828c405ff05c7a982","target":"record","created_at":"2026-07-05T03:34: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":"5ddc9873d030017a16549cf9b1b893faa591e07505bdf7f5890d931a28311ccb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T21:52:47Z","title_canon_sha256":"bd65d3f7a46b71150ef455000c07fd6b72e345bec9faa7f65d48924bf5a35c53"},"schema_version":"1.0","source":{"id":"2111.11550","kind":"arxiv","version":1}},"canonical_sha256":"882cc4206df133a5af2ee2783d514b29b867e4d3e30545dcc2d8edf6dd9aa107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882cc4206df133a5af2ee2783d514b29b867e4d3e30545dcc2d8edf6dd9aa107","first_computed_at":"2026-07-05T03:34:10.352048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:34:10.352048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8WulQKVHFezVcSn2733vLCzCGodZTM9rbjdcB+1mbD562GqAhUiOYmzgp3Ch2y2OLGiYfV4gE0x3yKPkVfuAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:34:10.352533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.11550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0054c44aef2b22fdd2f54fe8f748bf215806fafaf3d2297828c405ff05c7a982","sha256:525f725bf8516738328d3618386f2d73db5d9f8293a2c4d4aec86ecd4f79cc7f"],"state_sha256":"df568b0197907eaa690cb18bc2bd220c7d55b9673b3a841573621993c57c2c4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvfiWxBDI9ZIjHoPT5Ka9JTk4yOEQWBDA5wgEPX9bAdlNTwafidm+VHGwXowa6z9W3Ug3h0bo/mdFRG7NcrOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:41:06.092552Z","bundle_sha256":"6894b976d815ef6e00540bdbf5d9561b37269605698415e9d5afbe244ac5bf49"}}