{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IUQO5OLOI427H2IK2J54M5A35Q","short_pith_number":"pith:IUQO5OLO","canonical_record":{"source":{"id":"1805.07441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T21:01:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1a99daeffe3ad77050fed71cb9205652f98425e0ee3436179d587bce9c99565a","abstract_canon_sha256":"9a2103df70493d3e1946741e7ec0152c9605c5d93c0fa2d3b5b9f1228ad5dac8"},"schema_version":"1.0"},"canonical_sha256":"4520eeb96e4735f3e90ad27bc6741bec210cf45f627ac483c28a1a076c922d6f","source":{"kind":"arxiv","id":"1805.07441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07441","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07441v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07441","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"IUQO5OLOI427","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUQO5OLOI427H2IK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUQO5OLO","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IUQO5OLOI427H2IK2J54M5A35Q","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T21:01:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1a99daeffe3ad77050fed71cb9205652f98425e0ee3436179d587bce9c99565a","abstract_canon_sha256":"9a2103df70493d3e1946741e7ec0152c9605c5d93c0fa2d3b5b9f1228ad5dac8"},"schema_version":"1.0"},"canonical_sha256":"4520eeb96e4735f3e90ad27bc6741bec210cf45f627ac483c28a1a076c922d6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.576648Z","signature_b64":"QRL+O/bl8l2VUJEEDYc7qfdWTfaRNPKVqRWHJKDuJasdKT61amErOnULC+P6ildzgRZ2kiIqjU/nzmySPtYLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4520eeb96e4735f3e90ad27bc6741bec210cf45f627ac483c28a1a076c922d6f","last_reissued_at":"2026-05-18T00:15:33.575894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.575894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07441","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-05-18T00:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vubuuXBzQ+U7EOFORfeA7MNGhbu88Kys/51Q852WGVXEns/9qhD7bpauL+KSoo6WHakwbYiOXl+DzUcL+SIODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:13:16.454943Z"},"content_sha256":"89d274de45bd4b53d69ab488a25e6af40b1df0ec16d14f5b32a73b85e0c17da9","schema_version":"1.0","event_id":"sha256:89d274de45bd4b53d69ab488a25e6af40b1df0ec16d14f5b32a73b85e0c17da9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IUQO5OLOI427H2IK2J54M5A35Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overcoming catastrophic forgetting problem by weight consolidation and long-term memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Itti, Shixian Wen","submitted_at":"2018-05-18T21:01:12Z","abstract_excerpt":"Sequential learning of multiple tasks in artificial neural networks using gradient descent leads to catastrophic forgetting, whereby previously learned knowledge is erased during learning of new, disjoint knowledge. Here, we propose a new approach to sequential learning which leverages the recent discovery of adversarial examples. We use adversarial subspaces from previous tasks to enable learning of new tasks with less interference. We apply our method to sequentially learning to classify digits 0, 1, 2 (task 1), 4, 5, 6, (task 2), and 7, 8, 9 (task 3) in MNIST (disjoint MNIST task). We compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07441","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":""},"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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nO3BCtE/RkpBTmmoMnIDevHclYvKEei1DMMAT4EYFGKBAkhfL0tr/gwFTlWYa629yRCht4/c8vmBYLlTdXehAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:13:16.455282Z"},"content_sha256":"e54da454ed0ab081884d4be50d9509dbaeea6e7534ee3a4ce170f1b08958866d","schema_version":"1.0","event_id":"sha256:e54da454ed0ab081884d4be50d9509dbaeea6e7534ee3a4ce170f1b08958866d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUQO5OLOI427H2IK2J54M5A35Q/bundle.json","state_url":"https://pith.science/pith/IUQO5OLOI427H2IK2J54M5A35Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUQO5OLOI427H2IK2J54M5A35Q/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-06-27T04:13:16Z","links":{"resolver":"https://pith.science/pith/IUQO5OLOI427H2IK2J54M5A35Q","bundle":"https://pith.science/pith/IUQO5OLOI427H2IK2J54M5A35Q/bundle.json","state":"https://pith.science/pith/IUQO5OLOI427H2IK2J54M5A35Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUQO5OLOI427H2IK2J54M5A35Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IUQO5OLOI427H2IK2J54M5A35Q","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":"9a2103df70493d3e1946741e7ec0152c9605c5d93c0fa2d3b5b9f1228ad5dac8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T21:01:12Z","title_canon_sha256":"1a99daeffe3ad77050fed71cb9205652f98425e0ee3436179d587bce9c99565a"},"schema_version":"1.0","source":{"id":"1805.07441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07441","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07441v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07441","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"IUQO5OLOI427","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IUQO5OLOI427H2IK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IUQO5OLO","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e54da454ed0ab081884d4be50d9509dbaeea6e7534ee3a4ce170f1b08958866d","target":"graph","created_at":"2026-05-18T00:15:33Z","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":"Sequential learning of multiple tasks in artificial neural networks using gradient descent leads to catastrophic forgetting, whereby previously learned knowledge is erased during learning of new, disjoint knowledge. Here, we propose a new approach to sequential learning which leverages the recent discovery of adversarial examples. We use adversarial subspaces from previous tasks to enable learning of new tasks with less interference. We apply our method to sequentially learning to classify digits 0, 1, 2 (task 1), 4, 5, 6, (task 2), and 7, 8, 9 (task 3) in MNIST (disjoint MNIST task). We compa","authors_text":"Laurent Itti, Shixian Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T21:01:12Z","title":"Overcoming catastrophic forgetting problem by weight consolidation and long-term memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07441","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:89d274de45bd4b53d69ab488a25e6af40b1df0ec16d14f5b32a73b85e0c17da9","target":"record","created_at":"2026-05-18T00:15:33Z","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":"9a2103df70493d3e1946741e7ec0152c9605c5d93c0fa2d3b5b9f1228ad5dac8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T21:01:12Z","title_canon_sha256":"1a99daeffe3ad77050fed71cb9205652f98425e0ee3436179d587bce9c99565a"},"schema_version":"1.0","source":{"id":"1805.07441","kind":"arxiv","version":1}},"canonical_sha256":"4520eeb96e4735f3e90ad27bc6741bec210cf45f627ac483c28a1a076c922d6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4520eeb96e4735f3e90ad27bc6741bec210cf45f627ac483c28a1a076c922d6f","first_computed_at":"2026-05-18T00:15:33.575894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:33.575894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRL+O/bl8l2VUJEEDYc7qfdWTfaRNPKVqRWHJKDuJasdKT61amErOnULC+P6ildzgRZ2kiIqjU/nzmySPtYLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:33.576648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d274de45bd4b53d69ab488a25e6af40b1df0ec16d14f5b32a73b85e0c17da9","sha256:e54da454ed0ab081884d4be50d9509dbaeea6e7534ee3a4ce170f1b08958866d"],"state_sha256":"734ebfee38e32b0ff34fc141a9d6074999db0f1528c26b258b11e67c0929d39a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZZp+3MsA7ogbAC2CwxxQOxBIkBCkQU1MeafE2tiBJPJRJkUU/WrNpg/25TKdndA1H6DOJd26RRcXmk+B9bSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:13:16.457152Z","bundle_sha256":"81bb5422822abef2af0a220bc56eae776815f3987ff71769a7080c9a3e77317d"}}