{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ALA4TNO2BUOYSALPHU7BLZW7Z","short_pith_number":"pith:6ALA4TNO","schema_version":"1.0","canonical_sha256":"f0160e4daed068ec480b79e9f0af36fe786bebb3cdb5e9f3c1971b8b940c8a4f","source":{"kind":"arxiv","id":"2506.06985","version":2},"attestation_state":"computed","paper":{"title":"Certified Unlearning for Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasia Koloskova, Animesh Jha, Rachid Guerraoui, Sanmi Koyejo, Youssef Allouah","submitted_at":"2025-06-08T03:55:28Z","abstract_excerpt":"We address the problem of machine unlearning, where the goal is to remove the influence of specific training data from a model upon request, motivated by privacy concerns and regulatory requirements such as the \"right to be forgotten.\" Unfortunately, existing methods rely on restrictive assumptions or lack formal guarantees. To this end, we propose a novel method for certified machine unlearning, leveraging the connection between unlearning and privacy amplification by stochastic post-processing. Our method uses noisy fine-tuning on the retain data, i.e., data that does not need to be removed,"},"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":"2506.06985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T03:55:28Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"64fb7d45a716e6b6ab8381c5ecf1620f95e1f30134d3aa0c21fdae916e7fa648","abstract_canon_sha256":"199e7a5b6e7e754ec1455d8a0ae292d286fefaf00e5d18e73e71d01d59bec2b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:28.625298Z","signature_b64":"qPVWt7/S6igP9yV0XuIj1lLs785TecyK7TLSnai+T/xWdi83HzjzhhyBlXvOwJXFewVbXkEu5fAJR7+9SNhdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0160e4daed068ec480b79e9f0af36fe786bebb3cdb5e9f3c1971b8b940c8a4f","last_reissued_at":"2026-07-05T11:19:28.624722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:28.624722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certified Unlearning for Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasia Koloskova, Animesh Jha, Rachid Guerraoui, Sanmi Koyejo, Youssef Allouah","submitted_at":"2025-06-08T03:55:28Z","abstract_excerpt":"We address the problem of machine unlearning, where the goal is to remove the influence of specific training data from a model upon request, motivated by privacy concerns and regulatory requirements such as the \"right to be forgotten.\" Unfortunately, existing methods rely on restrictive assumptions or lack formal guarantees. To this end, we propose a novel method for certified machine unlearning, leveraging the connection between unlearning and privacy amplification by stochastic post-processing. Our method uses noisy fine-tuning on the retain data, i.e., data that does not need to be removed,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06985","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/2506.06985/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":"2506.06985","created_at":"2026-07-05T11:19:28.624787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06985v2","created_at":"2026-07-05T11:19:28.624787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06985","created_at":"2026-07-05T11:19:28.624787+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ALA4TNO2BUO","created_at":"2026-07-05T11:19:28.624787+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ALA4TNO2BUOYSAL","created_at":"2026-07-05T11:19:28.624787+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ALA4TNO","created_at":"2026-07-05T11:19:28.624787+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05898","citing_title":"Auditing of Unlearning Algorithms","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z","json":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z.json","graph_json":"https://pith.science/api/pith-number/6ALA4TNO2BUOYSALPHU7BLZW7Z/graph.json","events_json":"https://pith.science/api/pith-number/6ALA4TNO2BUOYSALPHU7BLZW7Z/events.json","paper":"https://pith.science/paper/6ALA4TNO"},"agent_actions":{"view_html":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z","download_json":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z.json","view_paper":"https://pith.science/paper/6ALA4TNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06985&json=true","fetch_graph":"https://pith.science/api/pith-number/6ALA4TNO2BUOYSALPHU7BLZW7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/6ALA4TNO2BUOYSALPHU7BLZW7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z/action/storage_attestation","attest_author":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z/action/author_attestation","sign_citation":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z/action/citation_signature","submit_replication":"https://pith.science/pith/6ALA4TNO2BUOYSALPHU7BLZW7Z/action/replication_record"}},"created_at":"2026-07-05T11:19:28.624787+00:00","updated_at":"2026-07-05T11:19:28.624787+00:00"}