{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BFJNGJ4KRXG4HYE5AXQXXD74QO","short_pith_number":"pith:BFJNGJ4K","canonical_record":{"source":{"id":"2502.03350","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T16:43:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27ea6c4db61be4bf7386d9aa2639182b6fe3ea3ea55003bfe9bed90938500e61","abstract_canon_sha256":"639f934c0b7d9d3a18db5a93d7832a25a2177b5ec7d4fde0c0d8103758f40b7c"},"schema_version":"1.0"},"canonical_sha256":"0952d3278a8dcdc3e09d05e17b8ffc839a00c4aa57c23bfda84308c094f41c3c","source":{"kind":"arxiv","id":"2502.03350","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03350","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03350v2","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03350","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"BFJNGJ4KRXG4","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_16","alias_value":"BFJNGJ4KRXG4HYE5","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_8","alias_value":"BFJNGJ4K","created_at":"2026-07-05T11:39:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BFJNGJ4KRXG4HYE5AXQXXD74QO","target":"record","payload":{"canonical_record":{"source":{"id":"2502.03350","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T16:43:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27ea6c4db61be4bf7386d9aa2639182b6fe3ea3ea55003bfe9bed90938500e61","abstract_canon_sha256":"639f934c0b7d9d3a18db5a93d7832a25a2177b5ec7d4fde0c0d8103758f40b7c"},"schema_version":"1.0"},"canonical_sha256":"0952d3278a8dcdc3e09d05e17b8ffc839a00c4aa57c23bfda84308c094f41c3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:48.132977Z","signature_b64":"2J/AVS2zPOGKkeyi7sY7T1rUajhihkL05uVNwiinenQNzikKlYBEgMyG8A4nWdQCzVju2XHqdjdVN1vTJ5XNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0952d3278a8dcdc3e09d05e17b8ffc839a00c4aa57c23bfda84308c094f41c3c","last_reissued_at":"2026-07-05T11:39:48.132240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:48.132240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.03350","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-05T11:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCM7Yd2BI88pRcm00GhEVlQ5XrReB0nyvvHw0jZ+t9vXyleY8RHQeUMoZlEtcfbavibwvYQI/nUwwbFMJ93CAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:02:43.447800Z"},"content_sha256":"5d0862c396d8e4c30c383125862ccddc9b6e71338f8bad3d85eb81620d4eef48","schema_version":"1.0","event_id":"sha256:5d0862c396d8e4c30c383125862ccddc9b6e71338f8bad3d85eb81620d4eef48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BFJNGJ4KRXG4HYE5AXQXXD74QO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Task Order for Continual Learning of Multiple Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Naoki Hiratani, Ziyan Li","submitted_at":"2025-02-05T16:43:58Z","abstract_excerpt":"Continual learning of multiple tasks remains a major challenge for neural networks. Here, we investigate how task order influences continual learning and propose a strategy for optimizing it. Leveraging a linear teacher-student model with latent factors, we derive an analytical expression relating task similarity and ordering to learning performance. Our analysis reveals two principles that hold under a wide parameter range: (1) tasks should be arranged from the least representative to the most typical, and (2) adjacent tasks should be dissimilar. We validate these rules on both synthetic data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03350","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/2502.03350/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-05T11:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POvzVa3Fh3kHvTqzOqD3TgIj9uJe03UzD02CnBeEoXvzoHHor93ET+qaScEmQ0jYwHn5+EDDNS8UuXqGSggUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:02:43.448298Z"},"content_sha256":"0a8ba6999d99bad8f4958d17057ec2723beae8779a2a992966b887b2c00e026a","schema_version":"1.0","event_id":"sha256:0a8ba6999d99bad8f4958d17057ec2723beae8779a2a992966b887b2c00e026a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/bundle.json","state_url":"https://pith.science/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/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-20T17:02:43Z","links":{"resolver":"https://pith.science/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO","bundle":"https://pith.science/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/bundle.json","state":"https://pith.science/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFJNGJ4KRXG4HYE5AXQXXD74QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BFJNGJ4KRXG4HYE5AXQXXD74QO","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":"639f934c0b7d9d3a18db5a93d7832a25a2177b5ec7d4fde0c0d8103758f40b7c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T16:43:58Z","title_canon_sha256":"27ea6c4db61be4bf7386d9aa2639182b6fe3ea3ea55003bfe9bed90938500e61"},"schema_version":"1.0","source":{"id":"2502.03350","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03350","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03350v2","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03350","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"BFJNGJ4KRXG4","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_16","alias_value":"BFJNGJ4KRXG4HYE5","created_at":"2026-07-05T11:39:48Z"},{"alias_kind":"pith_short_8","alias_value":"BFJNGJ4K","created_at":"2026-07-05T11:39:48Z"}],"graph_snapshots":[{"event_id":"sha256:0a8ba6999d99bad8f4958d17057ec2723beae8779a2a992966b887b2c00e026a","target":"graph","created_at":"2026-07-05T11:39:48Z","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/2502.03350/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Continual learning of multiple tasks remains a major challenge for neural networks. Here, we investigate how task order influences continual learning and propose a strategy for optimizing it. Leveraging a linear teacher-student model with latent factors, we derive an analytical expression relating task similarity and ordering to learning performance. Our analysis reveals two principles that hold under a wide parameter range: (1) tasks should be arranged from the least representative to the most typical, and (2) adjacent tasks should be dissimilar. We validate these rules on both synthetic data","authors_text":"Naoki Hiratani, Ziyan Li","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T16:43:58Z","title":"Optimal Task Order for Continual Learning of Multiple Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03350","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:5d0862c396d8e4c30c383125862ccddc9b6e71338f8bad3d85eb81620d4eef48","target":"record","created_at":"2026-07-05T11:39:48Z","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":"639f934c0b7d9d3a18db5a93d7832a25a2177b5ec7d4fde0c0d8103758f40b7c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T16:43:58Z","title_canon_sha256":"27ea6c4db61be4bf7386d9aa2639182b6fe3ea3ea55003bfe9bed90938500e61"},"schema_version":"1.0","source":{"id":"2502.03350","kind":"arxiv","version":2}},"canonical_sha256":"0952d3278a8dcdc3e09d05e17b8ffc839a00c4aa57c23bfda84308c094f41c3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0952d3278a8dcdc3e09d05e17b8ffc839a00c4aa57c23bfda84308c094f41c3c","first_computed_at":"2026-07-05T11:39:48.132240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:48.132240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2J/AVS2zPOGKkeyi7sY7T1rUajhihkL05uVNwiinenQNzikKlYBEgMyG8A4nWdQCzVju2XHqdjdVN1vTJ5XNAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:48.132977Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.03350","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d0862c396d8e4c30c383125862ccddc9b6e71338f8bad3d85eb81620d4eef48","sha256:0a8ba6999d99bad8f4958d17057ec2723beae8779a2a992966b887b2c00e026a"],"state_sha256":"9ddf309d9b6042397c3cb414c1fef125430608871277459c4656910135d94bb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emYYcyX3QhB0fWQ37CI6ch+UjiAFO6hD+LpgU9wf6odKmA6r805g8uPnS5hbVJRRGOwIO/DYUJh2lOGJa+UcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T17:02:43.453076Z","bundle_sha256":"ed4aad0085db6dbaf612a6df6e5efda56ef71bec81cc336cff58d5a9e9b29cd2"}}