{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JN2OOPPL3EPSYNAIADDGIXAQFI","short_pith_number":"pith:JN2OOPPL","canonical_record":{"source":{"id":"2102.07666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-15T16:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"4158eefdbc6e9ed3488425674d840ce92ee0455f181d3fdc44a2b3aa9faa551d","abstract_canon_sha256":"1126d2a9ec785582f43b778ce51e8b452bc8542e7d54dd746f67efc028af6e59"},"schema_version":"1.0"},"canonical_sha256":"4b74e73debd91f2c340800c6645c102a11553983e20431387297f2aa71e1ff66","source":{"kind":"arxiv","id":"2102.07666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.07666","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"2102.07666v1","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07666","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"JN2OOPPL3EPS","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_16","alias_value":"JN2OOPPL3EPSYNAI","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_8","alias_value":"JN2OOPPL","created_at":"2026-07-05T02:15:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JN2OOPPL3EPSYNAIADDGIXAQFI","target":"record","payload":{"canonical_record":{"source":{"id":"2102.07666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-15T16:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"4158eefdbc6e9ed3488425674d840ce92ee0455f181d3fdc44a2b3aa9faa551d","abstract_canon_sha256":"1126d2a9ec785582f43b778ce51e8b452bc8542e7d54dd746f67efc028af6e59"},"schema_version":"1.0"},"canonical_sha256":"4b74e73debd91f2c340800c6645c102a11553983e20431387297f2aa71e1ff66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:18.812155Z","signature_b64":"+6JQhryguT7TSwaQM13W7u9vdeOtusT24/tn/Oll54qB3TaTIKMRlg+qKAGYijarMbBduUHN93DURLmWiKDaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b74e73debd91f2c340800c6645c102a11553983e20431387297f2aa71e1ff66","last_reissued_at":"2026-07-05T02:15:18.811765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:18.811765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.07666","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-05T02:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USbn8ejZaicVv4S5hSyUxR5lHTVtqYhODLTfh3od5bAXpNGenXRqCXVAXW0y8/Ro/4rs9oEkuDmXFPH/Fd3iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:05:51.506597Z"},"content_sha256":"f5533a218d5d8dbe068a00b9632a03faedce98d20aef60069e0d7e5afa919690","schema_version":"1.0","event_id":"sha256:f5533a218d5d8dbe068a00b9632a03faedce98d20aef60069e0d7e5afa919690"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JN2OOPPL3EPSYNAIADDGIXAQFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A closer look at temporal variability in dynamic online learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Orabona, Nicol\\`o Campolongo","submitted_at":"2021-02-15T16:50:16Z","abstract_excerpt":"This work focuses on the setting of dynamic regret in the context of online learning with full information. In particular, we analyze regret bounds with respect to the temporal variability of the loss functions. By assuming that the sequence of loss functions does not vary much with time, we show that it is possible to incur improved regret bounds compared to existing results. The key to our approach is to use the loss function (and not its gradient) during the optimization process. Building on recent advances in the analysis of Implicit algorithms, we propose an adaptation of the Implicit ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07666","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/2102.07666/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-05T02:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYIZf/7M8OpYNNdl6YtQSZqJjA/sg2KXVthvsTFPvsw+O7xttoBcAudJ27wufy2yog7WG00i8m8KHzy5ybZ9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:05:51.507301Z"},"content_sha256":"fd1226371599464fdd3f4f36d85b9c21534b5eac6e4bfd4600ffd5c77757577a","schema_version":"1.0","event_id":"sha256:fd1226371599464fdd3f4f36d85b9c21534b5eac6e4bfd4600ffd5c77757577a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/bundle.json","state_url":"https://pith.science/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/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-18T22:05:51Z","links":{"resolver":"https://pith.science/pith/JN2OOPPL3EPSYNAIADDGIXAQFI","bundle":"https://pith.science/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/bundle.json","state":"https://pith.science/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JN2OOPPL3EPSYNAIADDGIXAQFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JN2OOPPL3EPSYNAIADDGIXAQFI","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":"1126d2a9ec785582f43b778ce51e8b452bc8542e7d54dd746f67efc028af6e59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-15T16:50:16Z","title_canon_sha256":"4158eefdbc6e9ed3488425674d840ce92ee0455f181d3fdc44a2b3aa9faa551d"},"schema_version":"1.0","source":{"id":"2102.07666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.07666","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"2102.07666v1","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07666","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"JN2OOPPL3EPS","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_16","alias_value":"JN2OOPPL3EPSYNAI","created_at":"2026-07-05T02:15:18Z"},{"alias_kind":"pith_short_8","alias_value":"JN2OOPPL","created_at":"2026-07-05T02:15:18Z"}],"graph_snapshots":[{"event_id":"sha256:fd1226371599464fdd3f4f36d85b9c21534b5eac6e4bfd4600ffd5c77757577a","target":"graph","created_at":"2026-07-05T02:15:18Z","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/2102.07666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work focuses on the setting of dynamic regret in the context of online learning with full information. In particular, we analyze regret bounds with respect to the temporal variability of the loss functions. By assuming that the sequence of loss functions does not vary much with time, we show that it is possible to incur improved regret bounds compared to existing results. The key to our approach is to use the loss function (and not its gradient) during the optimization process. Building on recent advances in the analysis of Implicit algorithms, we propose an adaptation of the Implicit ver","authors_text":"Francesco Orabona, Nicol\\`o Campolongo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-15T16:50:16Z","title":"A closer look at temporal variability in dynamic online learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07666","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:f5533a218d5d8dbe068a00b9632a03faedce98d20aef60069e0d7e5afa919690","target":"record","created_at":"2026-07-05T02:15:18Z","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":"1126d2a9ec785582f43b778ce51e8b452bc8542e7d54dd746f67efc028af6e59","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-15T16:50:16Z","title_canon_sha256":"4158eefdbc6e9ed3488425674d840ce92ee0455f181d3fdc44a2b3aa9faa551d"},"schema_version":"1.0","source":{"id":"2102.07666","kind":"arxiv","version":1}},"canonical_sha256":"4b74e73debd91f2c340800c6645c102a11553983e20431387297f2aa71e1ff66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b74e73debd91f2c340800c6645c102a11553983e20431387297f2aa71e1ff66","first_computed_at":"2026-07-05T02:15:18.811765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:15:18.811765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+6JQhryguT7TSwaQM13W7u9vdeOtusT24/tn/Oll54qB3TaTIKMRlg+qKAGYijarMbBduUHN93DURLmWiKDaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:15:18.812155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.07666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5533a218d5d8dbe068a00b9632a03faedce98d20aef60069e0d7e5afa919690","sha256:fd1226371599464fdd3f4f36d85b9c21534b5eac6e4bfd4600ffd5c77757577a"],"state_sha256":"29af4bf0475965f80e3a48068e6614340d5d1328dd9694cf0cafc1f67cacca4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K+kg2/8i2dqOgUPSmatWLkpzPOYUyJDE2/ocCiVmYre2UuHC9WigXSsAL9q/SbdMS5L2GqtaOWZ4MYSmVKAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T22:05:51.514339Z","bundle_sha256":"9a2a81cf5774e36ddcf94786e70c09b706383be606a344f8a92f0a3ca8efccd1"}}