{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FMXPAAKNRHQGRM5HO2GW37UAWA","short_pith_number":"pith:FMXPAAKN","schema_version":"1.0","canonical_sha256":"2b2ef0014d89e068b3a7768d6dfe80b011bf3bcfc37f989a3725a7bc16b2d51c","source":{"kind":"arxiv","id":"1711.10204","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.10204","created_at":"2026-05-18T00:29:22.949111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10204v1","created_at":"2026-05-18T00:29:22.949111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10204","created_at":"2026-05-18T00:29:22.949111+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMXPAAKNRHQG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMXPAAKNRHQGRM5H","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMXPAAKN","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA","json":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA.json","graph_json":"https://pith.science/api/pith-number/FMXPAAKNRHQGRM5HO2GW37UAWA/graph.json","events_json":"https://pith.science/api/pith-number/FMXPAAKNRHQGRM5HO2GW37UAWA/events.json","paper":"https://pith.science/paper/FMXPAAKN"},"agent_actions":{"view_html":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA","download_json":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA.json","view_paper":"https://pith.science/paper/FMXPAAKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10204&json=true","fetch_graph":"https://pith.science/api/pith-number/FMXPAAKNRHQGRM5HO2GW37UAWA/graph.json","fetch_events":"https://pith.science/api/pith-number/FMXPAAKNRHQGRM5HO2GW37UAWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/action/storage_attestation","attest_author":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/action/author_attestation","sign_citation":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/action/citation_signature","submit_replication":"https://pith.science/pith/FMXPAAKNRHQGRM5HO2GW37UAWA/action/replication_record"}},"created_at":"2026-05-18T00:29:22.949111+00:00","updated_at":"2026-05-18T00:29:22.949111+00:00"}