{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OHE6Q5IERZ4D5YOWJYEZSP24RG","short_pith_number":"pith:OHE6Q5IE","canonical_record":{"source":{"id":"2210.05561","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T15:55:06Z","cross_cats_sorted":[],"title_canon_sha256":"f4d15610f9ac1460ade9b01c59a8b6d28db96d823b59321bc00a42406cc291a5","abstract_canon_sha256":"42a921ee92c105c2bf5b7d240fe857d7b17d60815e88e6282d0a0168b51f826f"},"schema_version":"1.0"},"canonical_sha256":"71c9e875048e783ee1d64e09993f5c89853763e4802532fbe0d6de91ef4e1076","source":{"kind":"arxiv","id":"2210.05561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05561","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05561v2","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05561","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"OHE6Q5IERZ4D","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHE6Q5IERZ4D5YOW","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHE6Q5IE","created_at":"2026-07-05T05:06:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OHE6Q5IERZ4D5YOWJYEZSP24RG","target":"record","payload":{"canonical_record":{"source":{"id":"2210.05561","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T15:55:06Z","cross_cats_sorted":[],"title_canon_sha256":"f4d15610f9ac1460ade9b01c59a8b6d28db96d823b59321bc00a42406cc291a5","abstract_canon_sha256":"42a921ee92c105c2bf5b7d240fe857d7b17d60815e88e6282d0a0168b51f826f"},"schema_version":"1.0"},"canonical_sha256":"71c9e875048e783ee1d64e09993f5c89853763e4802532fbe0d6de91ef4e1076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:34.815540Z","signature_b64":"ibpK2VyG2mW3+kHxZntLRdSSY/mVU6OyCmGefID5dIYmrBTrDcD7+EeSSoRIH6eXDkoP7Y1qJNojz+7M9eZkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71c9e875048e783ee1d64e09993f5c89853763e4802532fbe0d6de91ef4e1076","last_reissued_at":"2026-07-05T05:06:34.815138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:34.815138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.05561","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-05T05:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4dnZ5jti/fEHTKTFzUPfsHi9lN3Az9QUUMSjxvfhAnV7y5/zl6Ywqbu4DuyOxEBhLMeONwXWVQdFxBEGeHSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:59:53.969721Z"},"content_sha256":"d77b4aa84828cb31afbcdbdbfb7b86c912482c614ab06b44ed8c7999ecb35e26","schema_version":"1.0","event_id":"sha256:d77b4aa84828cb31afbcdbdbfb7b86c912482c614ab06b44ed8c7999ecb35e26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OHE6Q5IERZ4D5YOWJYEZSP24RG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Schedule-Robust Online Continual Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrew Yapp, Carlo Ciliberto, Giulia Luise, Marco Ciccone, Massimiliano Pontil, Ruohan Wang","submitted_at":"2022-10-11T15:55:06Z","abstract_excerpt":"A continual learning (CL) algorithm learns from a non-stationary data stream. The non-stationarity is modeled by some schedule that determines how data is presented over time. Most current methods make strong assumptions on the schedule and have unpredictable performance when such requirements are not met. A key challenge in CL is thus to design methods robust against arbitrary schedules over the same underlying data, since in real-world scenarios schedules are often unknown and dynamic. In this work, we introduce the notion of schedule-robustness for CL and a novel approach satisfying this de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05561","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/2210.05561/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-05T05:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqCqFDulbuH0mDK5cAHvh61DW2hdAERIgVRONKKxnCQqLs3Pw43wHOYy02GWG0YjrnZSVZyl0q/yuliEpEjGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:59:53.970107Z"},"content_sha256":"df7b44f0d5e8fab043c767e2d60b7d63ad6444b9779e10998606e35ea9cdfc6c","schema_version":"1.0","event_id":"sha256:df7b44f0d5e8fab043c767e2d60b7d63ad6444b9779e10998606e35ea9cdfc6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/bundle.json","state_url":"https://pith.science/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/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-21T18:59:53Z","links":{"resolver":"https://pith.science/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG","bundle":"https://pith.science/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/bundle.json","state":"https://pith.science/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHE6Q5IERZ4D5YOWJYEZSP24RG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OHE6Q5IERZ4D5YOWJYEZSP24RG","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":"42a921ee92c105c2bf5b7d240fe857d7b17d60815e88e6282d0a0168b51f826f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T15:55:06Z","title_canon_sha256":"f4d15610f9ac1460ade9b01c59a8b6d28db96d823b59321bc00a42406cc291a5"},"schema_version":"1.0","source":{"id":"2210.05561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05561","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05561v2","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05561","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"OHE6Q5IERZ4D","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_16","alias_value":"OHE6Q5IERZ4D5YOW","created_at":"2026-07-05T05:06:34Z"},{"alias_kind":"pith_short_8","alias_value":"OHE6Q5IE","created_at":"2026-07-05T05:06:34Z"}],"graph_snapshots":[{"event_id":"sha256:df7b44f0d5e8fab043c767e2d60b7d63ad6444b9779e10998606e35ea9cdfc6c","target":"graph","created_at":"2026-07-05T05:06:34Z","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/2210.05561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A continual learning (CL) algorithm learns from a non-stationary data stream. The non-stationarity is modeled by some schedule that determines how data is presented over time. Most current methods make strong assumptions on the schedule and have unpredictable performance when such requirements are not met. A key challenge in CL is thus to design methods robust against arbitrary schedules over the same underlying data, since in real-world scenarios schedules are often unknown and dynamic. In this work, we introduce the notion of schedule-robustness for CL and a novel approach satisfying this de","authors_text":"Andrew Yapp, Carlo Ciliberto, Giulia Luise, Marco Ciccone, Massimiliano Pontil, Ruohan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T15:55:06Z","title":"Schedule-Robust Online Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05561","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:d77b4aa84828cb31afbcdbdbfb7b86c912482c614ab06b44ed8c7999ecb35e26","target":"record","created_at":"2026-07-05T05:06:34Z","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":"42a921ee92c105c2bf5b7d240fe857d7b17d60815e88e6282d0a0168b51f826f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T15:55:06Z","title_canon_sha256":"f4d15610f9ac1460ade9b01c59a8b6d28db96d823b59321bc00a42406cc291a5"},"schema_version":"1.0","source":{"id":"2210.05561","kind":"arxiv","version":2}},"canonical_sha256":"71c9e875048e783ee1d64e09993f5c89853763e4802532fbe0d6de91ef4e1076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71c9e875048e783ee1d64e09993f5c89853763e4802532fbe0d6de91ef4e1076","first_computed_at":"2026-07-05T05:06:34.815138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:34.815138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ibpK2VyG2mW3+kHxZntLRdSSY/mVU6OyCmGefID5dIYmrBTrDcD7+EeSSoRIH6eXDkoP7Y1qJNojz+7M9eZkBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:34.815540Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.05561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d77b4aa84828cb31afbcdbdbfb7b86c912482c614ab06b44ed8c7999ecb35e26","sha256:df7b44f0d5e8fab043c767e2d60b7d63ad6444b9779e10998606e35ea9cdfc6c"],"state_sha256":"7fc128ca1d0c955ad7c4afd1a7be1b2fe07ab4f7c755ec1062736fd8b5bb3a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b115GoG4ifSWoMzhWgXQHO+kVlZyPDrHzqJlL+4av4pQxhGRU7iu3elXaCm1hWnj79oynQU7cmZcGdnp7BOkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:59:53.972730Z","bundle_sha256":"01ae0dbc03b8f140b39b73d61921b9106b761e7eec944c562964c08bfac14786"}}