{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2T32PRORRK2LRPCTKONTBFEP5P","short_pith_number":"pith:2T32PROR","schema_version":"1.0","canonical_sha256":"d4f7a7c5d18ab4b8bc53539b30948febfca84890e8d38626b65db6cafc63989f","source":{"kind":"arxiv","id":"2304.02049","version":2},"attestation_state":"computed","paper":{"title":"Multi-Class Unlearning for Image Classification via Weight Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Lorenzo Baraldi, Marcella Cornia, Rita Cucchiara, Samuele Poppi, Sara Sarto","submitted_at":"2023-04-04T18:01:59Z","abstract_excerpt":"Machine Unlearning is an emerging paradigm for selectively removing the impact of training datapoints from a network. Unlike existing methods that target a limited subset or a single class, our framework unlearns all classes in a single round. We achieve this by modulating the network's components using memory matrices, enabling the network to demonstrate selective unlearning behavior for any class after training. By discovering weights that are specific to each class, our approach also recovers a representation of the classes which is explainable by design. We test the proposed framework on s"},"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":"2304.02049","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-04-04T18:01:59Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"2aca7b845ebcfc35d10e735b7c17513d5929c1fa937954782a520c419459dcc5","abstract_canon_sha256":"ebf9e693e8efa23d68393e172b8df9cde928d457a74dc662afcd947dc06a47fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:56.396484Z","signature_b64":"vT2c8xkElqyi2ZXZUHsEKu1QsPddXWPH/znwAC6sM+Rc0ExISujbOSYQdx2l6Zbwy5vF8DGRH6IiMOuYK8RqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f7a7c5d18ab4b8bc53539b30948febfca84890e8d38626b65db6cafc63989f","last_reissued_at":"2026-07-05T08:28:56.396022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:56.396022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Class Unlearning for Image Classification via Weight Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Lorenzo Baraldi, Marcella Cornia, Rita Cucchiara, Samuele Poppi, Sara Sarto","submitted_at":"2023-04-04T18:01:59Z","abstract_excerpt":"Machine Unlearning is an emerging paradigm for selectively removing the impact of training datapoints from a network. Unlike existing methods that target a limited subset or a single class, our framework unlearns all classes in a single round. We achieve this by modulating the network's components using memory matrices, enabling the network to demonstrate selective unlearning behavior for any class after training. By discovering weights that are specific to each class, our approach also recovers a representation of the classes which is explainable by design. We test the proposed framework on s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02049","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.02049/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.02049","created_at":"2026-07-05T08:28:56.396083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.02049v2","created_at":"2026-07-05T08:28:56.396083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02049","created_at":"2026-07-05T08:28:56.396083+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T32PRORRK2L","created_at":"2026-07-05T08:28:56.396083+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T32PRORRK2LRPCT","created_at":"2026-07-05T08:28:56.396083+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T32PROR","created_at":"2026-07-05T08:28:56.396083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01634","citing_title":"Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data","ref_index":2001,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P","json":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P.json","graph_json":"https://pith.science/api/pith-number/2T32PRORRK2LRPCTKONTBFEP5P/graph.json","events_json":"https://pith.science/api/pith-number/2T32PRORRK2LRPCTKONTBFEP5P/events.json","paper":"https://pith.science/paper/2T32PROR"},"agent_actions":{"view_html":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P","download_json":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P.json","view_paper":"https://pith.science/paper/2T32PROR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.02049&json=true","fetch_graph":"https://pith.science/api/pith-number/2T32PRORRK2LRPCTKONTBFEP5P/graph.json","fetch_events":"https://pith.science/api/pith-number/2T32PRORRK2LRPCTKONTBFEP5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P/action/storage_attestation","attest_author":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P/action/author_attestation","sign_citation":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P/action/citation_signature","submit_replication":"https://pith.science/pith/2T32PRORRK2LRPCTKONTBFEP5P/action/replication_record"}},"created_at":"2026-07-05T08:28:56.396083+00:00","updated_at":"2026-07-05T08:28:56.396083+00:00"}