{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C","short_pith_number":"pith:ERJ7U7ZX","canonical_record":{"source":{"id":"1710.10368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T01:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"01609a8fe1a9c992656fb9b8676121e7d99f3240b07381fa2ce009e8a81219c4","abstract_canon_sha256":"0318e3b4cd3671bfc2de6ea233de861a443e0d255f53f8b139d14cd8be4f5309"},"schema_version":"1.0"},"canonical_sha256":"2453fa7f37b469486d9d42e2711559d0a0ebd0982f2f96e84ccc368fe4d932dd","source":{"kind":"arxiv","id":"1710.10368","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10368","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10368v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10368","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"ERJ7U7ZXWRUU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERJ7U7ZXWRUUQ3M5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERJ7U7ZX","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T01:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"01609a8fe1a9c992656fb9b8676121e7d99f3240b07381fa2ce009e8a81219c4","abstract_canon_sha256":"0318e3b4cd3671bfc2de6ea233de861a443e0d255f53f8b139d14cd8be4f5309"},"schema_version":"1.0"},"canonical_sha256":"2453fa7f37b469486d9d42e2711559d0a0ebd0982f2f96e84ccc368fe4d932dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:54.341986Z","signature_b64":"5QPWdHNBPYZNDooYHMXt2pWbCnZO3WBd0GLx4aAnMOaY+enraT8D8SZSKXY1nPnB1C2bYT3Jp3qMguylfkAMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2453fa7f37b469486d9d42e2711559d0a0ebd0982f2f96e84ccc368fe4d932dd","last_reissued_at":"2026-05-18T00:14:54.341165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:54.341165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10368","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:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"606WSf2bi+yeShgL4krjSD3VQIOrPWpilBa8ptAi9QBT2JXdc0YWvVzgf3lecLt7Q8Me5I7cUAlL8j/9xSJWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:40.377679Z"},"content_sha256":"cd0cc8dd8f5d88761adf0839e688f571309baae4d3a7fd08fbd5d4eed0742976","schema_version":"1.0","event_id":"sha256:cd0cc8dd8f5d88761adf0839e688f571309baae4d3a7fd08fbd5d4eed0742976"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Generative Dual Memory Network for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nitin Kamra, Umang Gupta, Yan Liu","submitted_at":"2017-10-28T01:45:43Z","abstract_excerpt":"Despite advances in deep learning, neural networks can only learn multiple tasks when trained on them jointly. When tasks arrive sequentially, they lose performance on previously learnt tasks. This phenomenon called catastrophic forgetting is a fundamental challenge to overcome before neural networks can learn continually from incoming data. In this work, we derive inspiration from human memory to develop an architecture capable of learning continuously from sequentially incoming tasks, while averting catastrophic forgetting. Specifically, our contributions are: (i) a dual memory architecture "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10368","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:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DoWybRaLxy9NGZR9hUNgUNfxzK7nvpq2suahCO70fk4ydJC1NhOrgQ66fikjlWbCcmUH6X2PtkGCh1iDAi9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:40.378079Z"},"content_sha256":"26c6f4055c82e61ca1178618528dd1bbef09906aaaf3866b640bb0117df990e3","schema_version":"1.0","event_id":"sha256:26c6f4055c82e61ca1178618528dd1bbef09906aaaf3866b640bb0117df990e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/bundle.json","state_url":"https://pith.science/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/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-05-25T22:17:40Z","links":{"resolver":"https://pith.science/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C","bundle":"https://pith.science/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/bundle.json","state":"https://pith.science/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ERJ7U7ZXWRUUQ3M5ILRHCFKZ2C","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":"0318e3b4cd3671bfc2de6ea233de861a443e0d255f53f8b139d14cd8be4f5309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T01:45:43Z","title_canon_sha256":"01609a8fe1a9c992656fb9b8676121e7d99f3240b07381fa2ce009e8a81219c4"},"schema_version":"1.0","source":{"id":"1710.10368","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10368","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10368v2","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10368","created_at":"2026-05-18T00:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"ERJ7U7ZXWRUU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ERJ7U7ZXWRUUQ3M5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ERJ7U7ZX","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:26c6f4055c82e61ca1178618528dd1bbef09906aaaf3866b640bb0117df990e3","target":"graph","created_at":"2026-05-18T00:14:54Z","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":"Despite advances in deep learning, neural networks can only learn multiple tasks when trained on them jointly. When tasks arrive sequentially, they lose performance on previously learnt tasks. This phenomenon called catastrophic forgetting is a fundamental challenge to overcome before neural networks can learn continually from incoming data. In this work, we derive inspiration from human memory to develop an architecture capable of learning continuously from sequentially incoming tasks, while averting catastrophic forgetting. Specifically, our contributions are: (i) a dual memory architecture ","authors_text":"Nitin Kamra, Umang Gupta, Yan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T01:45:43Z","title":"Deep Generative Dual Memory Network for Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10368","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:cd0cc8dd8f5d88761adf0839e688f571309baae4d3a7fd08fbd5d4eed0742976","target":"record","created_at":"2026-05-18T00:14:54Z","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":"0318e3b4cd3671bfc2de6ea233de861a443e0d255f53f8b139d14cd8be4f5309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T01:45:43Z","title_canon_sha256":"01609a8fe1a9c992656fb9b8676121e7d99f3240b07381fa2ce009e8a81219c4"},"schema_version":"1.0","source":{"id":"1710.10368","kind":"arxiv","version":2}},"canonical_sha256":"2453fa7f37b469486d9d42e2711559d0a0ebd0982f2f96e84ccc368fe4d932dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2453fa7f37b469486d9d42e2711559d0a0ebd0982f2f96e84ccc368fe4d932dd","first_computed_at":"2026-05-18T00:14:54.341165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:54.341165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5QPWdHNBPYZNDooYHMXt2pWbCnZO3WBd0GLx4aAnMOaY+enraT8D8SZSKXY1nPnB1C2bYT3Jp3qMguylfkAMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:54.341986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10368","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd0cc8dd8f5d88761adf0839e688f571309baae4d3a7fd08fbd5d4eed0742976","sha256:26c6f4055c82e61ca1178618528dd1bbef09906aaaf3866b640bb0117df990e3"],"state_sha256":"2af81b756ce3f2d1c87be6d3db27c85ea12e5fe082fbaf39ae3906a74558a8d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0JSlZx+/BY3nA7q17UFHq4mQ89T9U2NM263vKNxpF8+E4JLhxUPeqPYu48VqnpBhuM26DtgVVtXdlpOnX3BAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:17:40.381690Z","bundle_sha256":"ce5c242487ad2fa6470295a3fbbe0c70e2837e2d038989392ec2d5643e057fda"}}