{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5EWXTZPEISCABVX6L2OVAC2UNX","short_pith_number":"pith:5EWXTZPE","canonical_record":{"source":{"id":"1802.03875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T03:51:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f0fe9a0de12073f39306288271e893c995869402df82d6fb7cee2327358ee9ed","abstract_canon_sha256":"058be523b1e57039b75e963187232a975c3127dc78e3db0aa4745c3177eb4e0c"},"schema_version":"1.0"},"canonical_sha256":"e92d79e5e4448400d6fe5e9d500b546de43f84ba72e53e12045b31fe5f10ea38","source":{"kind":"arxiv","id":"1802.03875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03875","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03875v2","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03875","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"5EWXTZPEISCA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5EWXTZPEISCABVX6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5EWXTZPE","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5EWXTZPEISCABVX6L2OVAC2UNX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T03:51:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f0fe9a0de12073f39306288271e893c995869402df82d6fb7cee2327358ee9ed","abstract_canon_sha256":"058be523b1e57039b75e963187232a975c3127dc78e3db0aa4745c3177eb4e0c"},"schema_version":"1.0"},"canonical_sha256":"e92d79e5e4448400d6fe5e9d500b546de43f84ba72e53e12045b31fe5f10ea38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:42.223219Z","signature_b64":"i3qJt41cAWUvf+1KTgA3qBUtUERkpxdBbgZIa+ZN/njCokvlDWgNFSlsX99+AsLZOionillkXiTtWKDbpaitCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92d79e5e4448400d6fe5e9d500b546de43f84ba72e53e12045b31fe5f10ea38","last_reissued_at":"2026-05-18T00:16:42.222682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:42.222682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03875","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-05-18T00:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSz/38oHewUwS/jH7J+206xKKIDHTXL2tpf8LvZuJlgGeFB8XO2/yDkeRqRuQAr/7mhvP0CLy1pxxOv+eq0PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T05:09:30.821264Z"},"content_sha256":"8e5464109290dfb88c54efa88e6dc911ec5af5705a76b9947f12294f1f450570","schema_version":"1.0","event_id":"sha256:8e5464109290dfb88c54efa88e6dc911ec5af5705a76b9947f12294f1f450570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5EWXTZPEISCABVX6L2OVAC2UNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-Recursal: Solving the Catastrophic Forgetting Problem in Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anthony Robins, Brendan McCane, Craig Atkinson, Lech Szymanski","submitted_at":"2018-02-12T03:51:41Z","abstract_excerpt":"In general, neural networks are not currently capable of learning tasks in a sequential fashion. When a novel, unrelated task is learnt by a neural network, it substantially forgets how to solve previously learnt tasks. One of the original solutions to this problem is pseudo-rehearsal, which involves learning the new task while rehearsing generated items representative of the previous task/s. This is very effective for simple tasks. However, pseudo-rehearsal has not yet been successfully applied to very complex tasks because in these tasks it is difficult to generate representative items. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03875","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":""},"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:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pp5m5Errfisy6txgFud0k8Zu/+8HbkYMbpLCZ3spf/WVD6LACpzVCV2woWDqpf0CIbIeY5CQRnoVlBDHHpsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T05:09:30.822132Z"},"content_sha256":"9db1b807c3a1ea367e352ed23d19683388725baef823bfadbbcc314160b664ca","schema_version":"1.0","event_id":"sha256:9db1b807c3a1ea367e352ed23d19683388725baef823bfadbbcc314160b664ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EWXTZPEISCABVX6L2OVAC2UNX/bundle.json","state_url":"https://pith.science/pith/5EWXTZPEISCABVX6L2OVAC2UNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EWXTZPEISCABVX6L2OVAC2UNX/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-14T05:09:30Z","links":{"resolver":"https://pith.science/pith/5EWXTZPEISCABVX6L2OVAC2UNX","bundle":"https://pith.science/pith/5EWXTZPEISCABVX6L2OVAC2UNX/bundle.json","state":"https://pith.science/pith/5EWXTZPEISCABVX6L2OVAC2UNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EWXTZPEISCABVX6L2OVAC2UNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5EWXTZPEISCABVX6L2OVAC2UNX","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":"058be523b1e57039b75e963187232a975c3127dc78e3db0aa4745c3177eb4e0c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T03:51:41Z","title_canon_sha256":"f0fe9a0de12073f39306288271e893c995869402df82d6fb7cee2327358ee9ed"},"schema_version":"1.0","source":{"id":"1802.03875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03875","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03875v2","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03875","created_at":"2026-05-18T00:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"5EWXTZPEISCA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5EWXTZPEISCABVX6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5EWXTZPE","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9db1b807c3a1ea367e352ed23d19683388725baef823bfadbbcc314160b664ca","target":"graph","created_at":"2026-05-18T00:16:42Z","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":"In general, neural networks are not currently capable of learning tasks in a sequential fashion. When a novel, unrelated task is learnt by a neural network, it substantially forgets how to solve previously learnt tasks. One of the original solutions to this problem is pseudo-rehearsal, which involves learning the new task while rehearsing generated items representative of the previous task/s. This is very effective for simple tasks. However, pseudo-rehearsal has not yet been successfully applied to very complex tasks because in these tasks it is difficult to generate representative items. We a","authors_text":"Anthony Robins, Brendan McCane, Craig Atkinson, Lech Szymanski","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T03:51:41Z","title":"Pseudo-Recursal: Solving the Catastrophic Forgetting Problem in Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03875","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:8e5464109290dfb88c54efa88e6dc911ec5af5705a76b9947f12294f1f450570","target":"record","created_at":"2026-05-18T00:16:42Z","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":"058be523b1e57039b75e963187232a975c3127dc78e3db0aa4745c3177eb4e0c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T03:51:41Z","title_canon_sha256":"f0fe9a0de12073f39306288271e893c995869402df82d6fb7cee2327358ee9ed"},"schema_version":"1.0","source":{"id":"1802.03875","kind":"arxiv","version":2}},"canonical_sha256":"e92d79e5e4448400d6fe5e9d500b546de43f84ba72e53e12045b31fe5f10ea38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e92d79e5e4448400d6fe5e9d500b546de43f84ba72e53e12045b31fe5f10ea38","first_computed_at":"2026-05-18T00:16:42.222682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:42.222682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i3qJt41cAWUvf+1KTgA3qBUtUERkpxdBbgZIa+ZN/njCokvlDWgNFSlsX99+AsLZOionillkXiTtWKDbpaitCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:42.223219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e5464109290dfb88c54efa88e6dc911ec5af5705a76b9947f12294f1f450570","sha256:9db1b807c3a1ea367e352ed23d19683388725baef823bfadbbcc314160b664ca"],"state_sha256":"8469653b4d93bca31249b156bd1a0665774a41a8c3a493c391c70b6d11711f05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0IOSbFq4RUynKMXB9HiOfd0RmoUk4P1knLsDjxHKhbTRdJElqFmNlqSRzQZ5LGC1prSHKEVyILaS68FuAUsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T05:09:30.827468Z","bundle_sha256":"c8e63c14fd455b8419b40cc62e2f53665c0cc8f2014829bb2f2334d78e6fbc47"}}