{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KKQDDC7U6UVTFCB67WPAGPJJUX","short_pith_number":"pith:KKQDDC7U","canonical_record":{"source":{"id":"1801.01423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T16:22:22Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"e37bdbde07c384dd7d0d16f8649b64c3bd9e66f65a7a743eea6a2637d6bdb36b","abstract_canon_sha256":"fda437f942818fa625307c10eaa0d95d59daf2e7d1d5879afb5c84b2943b7f45"},"schema_version":"1.0"},"canonical_sha256":"52a0318bf4f52b32883efd9e033d29a5f079b00abd3e7317c7fc539377aed868","source":{"kind":"arxiv","id":"1801.01423","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01423","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01423v3","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01423","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"KKQDDC7U6UVT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KKQDDC7U6UVTFCB6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KKQDDC7U","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KKQDDC7U6UVTFCB67WPAGPJJUX","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T16:22:22Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"e37bdbde07c384dd7d0d16f8649b64c3bd9e66f65a7a743eea6a2637d6bdb36b","abstract_canon_sha256":"fda437f942818fa625307c10eaa0d95d59daf2e7d1d5879afb5c84b2943b7f45"},"schema_version":"1.0"},"canonical_sha256":"52a0318bf4f52b32883efd9e033d29a5f079b00abd3e7317c7fc539377aed868","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:46.609378Z","signature_b64":"Fu2lulItoFpkKW1VjGLY08PL59Q/6AKHFeexIIBUp83HronZCfDymW482M8CQfkVuHUYBkVWQgWdMzadgKfKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a0318bf4f52b32883efd9e033d29a5f079b00abd3e7317c7fc539377aed868","last_reissued_at":"2026-05-18T00:14:46.608908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:46.608908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01423","source_version":3,"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:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mtp+e40ILC9KraRamgmV4vBKw5UEEU5Z8G03wuBYLGDSwp1fH4yNIGoPB9ZeOLGzQcQy/BgM7i0W85ze7F48Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:13:54.834436Z"},"content_sha256":"12a643d321552e965660b7badc2751348a505f0198d117055037751536fa4367","schema_version":"1.0","event_id":"sha256:12a643d321552e965660b7badc2751348a505f0198d117055037751536fa4367"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KKQDDC7U6UVTFCB67WPAGPJJUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overcoming catastrophic forgetting with hard attention to the task","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Karatzoglou, D\\'idac Sur\\'is, Joan Serr\\`a, Marius Miron","submitted_at":"2018-01-04T16:22:22Z","abstract_excerpt":"Catastrophic forgetting occurs when a neural network loses the information learned in a previous task after training on subsequent tasks. This problem remains a hurdle for artificial intelligence systems with sequential learning capabilities. In this paper, we propose a task-based hard attention mechanism that preserves previous tasks' information without affecting the current task's learning. A hard attention mask is learned concurrently to every task, through stochastic gradient descent, and previous masks are exploited to condition such learning. We show that the proposed mechanism is effec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01423","kind":"arxiv","version":3},"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:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMloj+FxcYB6G0N+f+1E1KCajEAQqxBpT0r23O/TmUnVJ/n+am7CMp2tSWsEjtA34bQbYcZxvjqOvCeRugnmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:13:54.835100Z"},"content_sha256":"0ccd4f007ecef19e6a94853b87b6750919ac6ea2adee51cd8c2edccbd945b8bc","schema_version":"1.0","event_id":"sha256:0ccd4f007ecef19e6a94853b87b6750919ac6ea2adee51cd8c2edccbd945b8bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/bundle.json","state_url":"https://pith.science/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/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-04T05:13:54Z","links":{"resolver":"https://pith.science/pith/KKQDDC7U6UVTFCB67WPAGPJJUX","bundle":"https://pith.science/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/bundle.json","state":"https://pith.science/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKQDDC7U6UVTFCB67WPAGPJJUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KKQDDC7U6UVTFCB67WPAGPJJUX","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":"fda437f942818fa625307c10eaa0d95d59daf2e7d1d5879afb5c84b2943b7f45","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T16:22:22Z","title_canon_sha256":"e37bdbde07c384dd7d0d16f8649b64c3bd9e66f65a7a743eea6a2637d6bdb36b"},"schema_version":"1.0","source":{"id":"1801.01423","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01423","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01423v3","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01423","created_at":"2026-05-18T00:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"KKQDDC7U6UVT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KKQDDC7U6UVTFCB6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KKQDDC7U","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:0ccd4f007ecef19e6a94853b87b6750919ac6ea2adee51cd8c2edccbd945b8bc","target":"graph","created_at":"2026-05-18T00:14:46Z","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":"Catastrophic forgetting occurs when a neural network loses the information learned in a previous task after training on subsequent tasks. This problem remains a hurdle for artificial intelligence systems with sequential learning capabilities. In this paper, we propose a task-based hard attention mechanism that preserves previous tasks' information without affecting the current task's learning. A hard attention mask is learned concurrently to every task, through stochastic gradient descent, and previous masks are exploited to condition such learning. We show that the proposed mechanism is effec","authors_text":"Alexandros Karatzoglou, D\\'idac Sur\\'is, Joan Serr\\`a, Marius Miron","cross_cats":["cs.AI","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T16:22:22Z","title":"Overcoming catastrophic forgetting with hard attention to the task"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01423","kind":"arxiv","version":3},"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:12a643d321552e965660b7badc2751348a505f0198d117055037751536fa4367","target":"record","created_at":"2026-05-18T00:14:46Z","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":"fda437f942818fa625307c10eaa0d95d59daf2e7d1d5879afb5c84b2943b7f45","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T16:22:22Z","title_canon_sha256":"e37bdbde07c384dd7d0d16f8649b64c3bd9e66f65a7a743eea6a2637d6bdb36b"},"schema_version":"1.0","source":{"id":"1801.01423","kind":"arxiv","version":3}},"canonical_sha256":"52a0318bf4f52b32883efd9e033d29a5f079b00abd3e7317c7fc539377aed868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52a0318bf4f52b32883efd9e033d29a5f079b00abd3e7317c7fc539377aed868","first_computed_at":"2026-05-18T00:14:46.608908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:46.608908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fu2lulItoFpkKW1VjGLY08PL59Q/6AKHFeexIIBUp83HronZCfDymW482M8CQfkVuHUYBkVWQgWdMzadgKfKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:46.609378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01423","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12a643d321552e965660b7badc2751348a505f0198d117055037751536fa4367","sha256:0ccd4f007ecef19e6a94853b87b6750919ac6ea2adee51cd8c2edccbd945b8bc"],"state_sha256":"f553652cb5947f4f42fb458d36195ceafadac8a74403e5fec8e4c248799b72e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDobhfhj1uDapQ6D4zCJRuE6Buw/7F4UaQmJMAx/paJSRpwCRTrZsTSp2AfHrgz3VQ5OBYRa2fs2C4kvZBtfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:13:54.838604Z","bundle_sha256":"d6026c0d2c81c730d5a65eebdbff5bf74da7516cdda80cc854be8d5dd11d49ff"}}