{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FMXPAAKNRHQGRM5HO2GW37UAWA","short_pith_number":"pith:FMXPAAKN","canonical_record":{"source":{"id":"1711.10204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-28T09:47:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"800039629bb5fe85d0318d4c8769065668aeb6f86112c735503bea13e4fc84e9","abstract_canon_sha256":"a6e5e404a0e6f12f51326cc9b9176305bd79e33ffe64e085d4852405f3f8f854"},"schema_version":"1.0"},"canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","source":{"kind":"arxiv","id":"1711.10204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10204","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10204v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10204","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"FMXPAAKNRHQG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FMXPAAKNRHQGRM5H","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FMXPAAKN","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FMXPAAKNRHQGRM5HO2GW37UAWA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-28T09:47:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"800039629bb5fe85d0318d4c8769065668aeb6f86112c735503bea13e4fc84e9","abstract_canon_sha256":"a6e5e404a0e6f12f51326cc9b9176305bd79e33ffe64e085d4852405f3f8f854"},"schema_version":"1.0"},"canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:22.949724Z","signature_b64":"WkDs4MNv4e9KzWc5TBEdMaOk3ox+APQv/0rsA7NmwwZdwN7SE47+FKKgrdYX2rRjo9BRce6UopL0ioo3LlSPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","last_reissued_at":"2026-05-18T00:29:22.948998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:22.948998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10204","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:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmSPRsXj6fYM08PCfFV9t2yB4NYJHTdPg8hHAaiA6oe4GBOrVUNnZ5KMFyoGkWezSwqJec4WMAJ9aDaJQx4wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:54:05.525032Z"},"content_sha256":"f4e54f0a8792fd20ab9a922e9024a67bc4d3242be011ae0d8c18c09eba0dc503","schema_version":"1.0","event_id":"sha256:f4e54f0a8792fd20ab9a922e9024a67bc4d3242be011ae0d8c18c09eba0dc503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FMXPAAKNRHQGRM5HO2GW37UAWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block Neural Network Avoids Catastrophic Forgetting When Learning Multiple Task","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Alexander V. Terekhov, Guglielmo Montone, J. Kevin O'Regan","submitted_at":"2017-11-28T09:47:51Z","abstract_excerpt":"In the present work we propose a Deep Feed Forward network architecture which can be trained according to a sequential learning paradigm, where tasks of increasing difficulty are learned sequentially, yet avoiding catastrophic forgetting. The proposed architecture can re-use the features learned on previous tasks in a new task when the old tasks and the new one are related. The architecture needs fewer computational resources (neurons and connections) and less data for learning the new task than a network trained from scratch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10204","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:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9My6vka1lEgq40uuobo+w8lpT/tFnRYfHZPY457HpIxOyJ9kZjhV5iJI1WNxmZ/RUf2x+CteY7lp4FO1BG4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:54:05.525408Z"},"content_sha256":"497807899396ec81e5519267e8f8b3f39c48e547ff821220a48e3f9d06d29060","schema_version":"1.0","event_id":"sha256:497807899396ec81e5519267e8f8b3f39c48e547ff821220a48e3f9d06d29060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/bundle.json","state_url":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/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-07-01T16:54:05Z","links":{"resolver":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA","bundle":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/bundle.json","state":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FMXPAAKNRHQGRM5HO2GW37UAWA","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":"a6e5e404a0e6f12f51326cc9b9176305bd79e33ffe64e085d4852405f3f8f854","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-28T09:47:51Z","title_canon_sha256":"800039629bb5fe85d0318d4c8769065668aeb6f86112c735503bea13e4fc84e9"},"schema_version":"1.0","source":{"id":"1711.10204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10204","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10204v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10204","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"FMXPAAKNRHQG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FMXPAAKNRHQGRM5H","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FMXPAAKN","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:497807899396ec81e5519267e8f8b3f39c48e547ff821220a48e3f9d06d29060","target":"graph","created_at":"2026-05-18T00:29:22Z","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 the present work we propose a Deep Feed Forward network architecture which can be trained according to a sequential learning paradigm, where tasks of increasing difficulty are learned sequentially, yet avoiding catastrophic forgetting. The proposed architecture can re-use the features learned on previous tasks in a new task when the old tasks and the new one are related. The architecture needs fewer computational resources (neurons and connections) and less data for learning the new task than a network trained from scratch","authors_text":"Alexander V. Terekhov, Guglielmo Montone, J. Kevin O'Regan","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-28T09:47:51Z","title":"Block Neural Network Avoids Catastrophic Forgetting When Learning Multiple Task"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10204","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:f4e54f0a8792fd20ab9a922e9024a67bc4d3242be011ae0d8c18c09eba0dc503","target":"record","created_at":"2026-05-18T00:29:22Z","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":"a6e5e404a0e6f12f51326cc9b9176305bd79e33ffe64e085d4852405f3f8f854","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-28T09:47:51Z","title_canon_sha256":"800039629bb5fe85d0318d4c8769065668aeb6f86112c735503bea13e4fc84e9"},"schema_version":"1.0","source":{"id":"1711.10204","kind":"arxiv","version":1}},"canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","first_computed_at":"2026-05-18T00:29:22.948998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:22.948998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WkDs4MNv4e9KzWc5TBEdMaOk3ox+APQv/0rsA7NmwwZdwN7SE47+FKKgrdYX2rRjo9BRce6UopL0ioo3LlSPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:22.949724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e54f0a8792fd20ab9a922e9024a67bc4d3242be011ae0d8c18c09eba0dc503","sha256:497807899396ec81e5519267e8f8b3f39c48e547ff821220a48e3f9d06d29060"],"state_sha256":"5a754485b095cc051bb81889db9aaf3612d7743c72e85167dae9431203016fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrbRzyE9EwKRBVwwZ7tuihs4a9/CUsIdurfW7nTcbk5la+rRXB2NLFLmhwglQhbYAbkvt3uBxpYScEU3kClsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T16:54:05.527508Z","bundle_sha256":"76caccd6343d24d41f14176e52897f7c69646f4a4f81e66a7ac3cb737936c602"}}