{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TEKJX6GCSDEMKIXTRSSHG5BHLU","short_pith_number":"pith:TEKJX6GC","schema_version":"1.0","canonical_sha256":"99149bf8c290c8c522f38ca47374275d29bc9344bff1c236732d7ebea2f35dba","source":{"kind":"arxiv","id":"1805.11119","version":2},"attestation_state":"computed","paper":{"title":"Adding New Tasks to a Single Network with Weight Transformations using Binary Masks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Barbara Caputo, Elisa Ricci, Massimiliano Mancini, Samuel Rota Bul\\`o","submitted_at":"2018-05-28T18:22:42Z","abstract_excerpt":"Visual recognition algorithms are required today to exhibit adaptive abilities. Given a deep model trained on a specific, given task, it would be highly desirable to be able to adapt incrementally to new tasks, preserving scalability as the number of new tasks increases, while at the same time avoiding catastrophic forgetting issues. Recent work has shown that masking the internal weights of a given original conv-net through learned binary variables is a promising strategy. We build upon this intuition and take into account more elaborated affine transformations of the convolutional weights th"},"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":"1805.11119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-28T18:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"742096b5d8c423b12592a590876f08da9d70a1f7788c7bf376d5ae4a9d65c902","abstract_canon_sha256":"5cfae95ef25204ad6359340e7ba27663da3f1e110b75bf14bd3a36d0c26d035e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:15.249002Z","signature_b64":"2FuIGZvBj+JXz3/HRJdCFNwDcIlY3uzRRez3Xlej7hzNanEroFKp4wb5JwlKEG2BrguWrmjNm0jgFV1VYipKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99149bf8c290c8c522f38ca47374275d29bc9344bff1c236732d7ebea2f35dba","last_reissued_at":"2026-05-18T00:13:15.248373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:15.248373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adding New Tasks to a Single Network with Weight Transformations using Binary Masks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Barbara Caputo, Elisa Ricci, Massimiliano Mancini, Samuel Rota Bul\\`o","submitted_at":"2018-05-28T18:22:42Z","abstract_excerpt":"Visual recognition algorithms are required today to exhibit adaptive abilities. Given a deep model trained on a specific, given task, it would be highly desirable to be able to adapt incrementally to new tasks, preserving scalability as the number of new tasks increases, while at the same time avoiding catastrophic forgetting issues. Recent work has shown that masking the internal weights of a given original conv-net through learned binary variables is a promising strategy. We build upon this intuition and take into account more elaborated affine transformations of the convolutional weights th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11119","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.11119","created_at":"2026-05-18T00:13:15.248461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11119v2","created_at":"2026-05-18T00:13:15.248461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11119","created_at":"2026-05-18T00:13:15.248461+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEKJX6GCSDEM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEKJX6GCSDEMKIXT","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEKJX6GC","created_at":"2026-05-18T12:32:53.628368+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/TEKJX6GCSDEMKIXTRSSHG5BHLU","json":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU.json","graph_json":"https://pith.science/api/pith-number/TEKJX6GCSDEMKIXTRSSHG5BHLU/graph.json","events_json":"https://pith.science/api/pith-number/TEKJX6GCSDEMKIXTRSSHG5BHLU/events.json","paper":"https://pith.science/paper/TEKJX6GC"},"agent_actions":{"view_html":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU","download_json":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU.json","view_paper":"https://pith.science/paper/TEKJX6GC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11119&json=true","fetch_graph":"https://pith.science/api/pith-number/TEKJX6GCSDEMKIXTRSSHG5BHLU/graph.json","fetch_events":"https://pith.science/api/pith-number/TEKJX6GCSDEMKIXTRSSHG5BHLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU/action/storage_attestation","attest_author":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU/action/author_attestation","sign_citation":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU/action/citation_signature","submit_replication":"https://pith.science/pith/TEKJX6GCSDEMKIXTRSSHG5BHLU/action/replication_record"}},"created_at":"2026-05-18T00:13:15.248461+00:00","updated_at":"2026-05-18T00:13:15.248461+00:00"}