{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5OAF7MUBU76G5JQ24MI4BDQE35","short_pith_number":"pith:5OAF7MUB","schema_version":"1.0","canonical_sha256":"eb805fb281a7fc6ea61ae311c08e04df5a574ac979d21a632ddc90fcc66282ef","source":{"kind":"arxiv","id":"2605.11170","version":2},"attestation_state":"computed","paper":{"title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Asymmetric Langevin Unlearning injects public data to reduce certified unlearning noise by a factor of O(1/n_pub²) while preserving model utility.","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Ahmed Mehdi Inane, Gintare Karolina Dziugaite, Ioannis Mitliagkas, Vincent Quirion","submitted_at":"2026-05-11T19:28:33Z","abstract_excerpt":"Noise-based certified machine unlearning currently faces a hard ceiling: the noise magnitude required to certify unlearning typically destroys model utility, particularly for large-scale deletion requests.\n  While leveraging public data is a standard technique in differential privacy to relax this tension, its role in unlearning remains unexplored. We address this gap by introducing Asymmetric Langevin Unlearning (ALU), a framework that uses public data to mitigate privacy costs. We prove that public data injection suppresses the unlearning cost by a factor of $O(1/n_{\\mathrm{pub}}^2)$, guaran"},"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":true},"canonical_record":{"source":{"id":"2605.11170","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-11T19:28:33Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"417dd600062dd000d608075e6450b915803bd4b36ca57bfd2b0712414b99c7bf","abstract_canon_sha256":"b7cc1be403590cc7cf4ec48b027feabd34da356b9574194cb1b061b65ef6aa67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:51.308119Z","signature_b64":"a/d2J40zlWz2RoytqcKCO2NRF9nSxoz5zLhgnGOXJ1MWBFl6dRv3idacaUrEYNQjhLHZw9Kb+7gsybba6Wt9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb805fb281a7fc6ea61ae311c08e04df5a574ac979d21a632ddc90fcc66282ef","last_reissued_at":"2026-06-03T01:05:51.307619Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:51.307619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Asymmetric Langevin Unlearning injects public data to reduce certified unlearning noise by a factor of O(1/n_pub²) while preserving model utility.","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Ahmed Mehdi Inane, Gintare Karolina Dziugaite, Ioannis Mitliagkas, Vincent Quirion","submitted_at":"2026-05-11T19:28:33Z","abstract_excerpt":"Noise-based certified machine unlearning currently faces a hard ceiling: the noise magnitude required to certify unlearning typically destroys model utility, particularly for large-scale deletion requests.\n  While leveraging public data is a standard technique in differential privacy to relax this tension, its role in unlearning remains unexplored. We address this gap by introducing Asymmetric Langevin Unlearning (ALU), a framework that uses public data to mitigate privacy costs. We prove that public data injection suppresses the unlearning cost by a factor of $O(1/n_{\\mathrm{pub}}^2)$, guaran"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that public data injection suppresses the unlearning cost by a factor of O(1/n_pub²), guaranteeing a strict computational advantage over retraining.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes that the underlying Langevin dynamics and variational Rényi divergence bounds remain valid when public data is injected asymmetrically, and that the distribution mismatch between public and private sources can be explicitly characterized without invalidating the utility guarantees.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Asymmetric Langevin Unlearning uses public data to suppress unlearning noise costs by O(1/n_pub²), enabling practical mass unlearning with preserved utility under distribution mismatch.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Asymmetric Langevin Unlearning injects public data to reduce certified unlearning noise by a factor of O(1/n_pub²) while preserving model utility.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"aa6a3ab45a630ac191ce6eea3555b45d1d2320c1a556c684eb377dced26ed3c1"},"source":{"id":"2605.11170","kind":"arxiv","version":2},"verdict":{"id":"f3991963-4990-40f9-ab81-2cb77f58beb1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T05:53:27.099159Z","strongest_claim":"We prove that public data injection suppresses the unlearning cost by a factor of O(1/n_pub²), guaranteeing a strict computational advantage over retraining.","one_line_summary":"Asymmetric Langevin Unlearning uses public data to suppress unlearning noise costs by O(1/n_pub²), enabling practical mass unlearning with preserved utility under distribution mismatch.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes that the underlying Langevin dynamics and variational Rényi divergence bounds remain valid when public data is injected asymmetrically, and that the distribution mismatch between public and private sources can be explicitly characterized without invalidating the utility guarantees.","pith_extraction_headline":"Asymmetric Langevin Unlearning injects public data to reduce certified unlearning noise by a factor of O(1/n_pub²) while preserving model utility."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11170/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T04:42:00.997250Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:34:08.011819Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:16.516081Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:43:56.866120Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"435ad79cb1b6d6ec49a76721dc79bd548948e215f9f90cf468034bd035d2e966"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fc9b8e2759b9e8f4361f4dc818d33c846eff86014a4be2d30b83487fdc89bdc0"},"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":"2605.11170","created_at":"2026-06-03T01:05:51.307678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.11170v2","created_at":"2026-06-03T01:05:51.307678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11170","created_at":"2026-06-03T01:05:51.307678+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OAF7MUBU76G","created_at":"2026-06-03T01:05:51.307678+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OAF7MUBU76G5JQ2","created_at":"2026-06-03T01:05:51.307678+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OAF7MUB","created_at":"2026-06-03T01:05:51.307678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35","json":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35.json","graph_json":"https://pith.science/api/pith-number/5OAF7MUBU76G5JQ24MI4BDQE35/graph.json","events_json":"https://pith.science/api/pith-number/5OAF7MUBU76G5JQ24MI4BDQE35/events.json","paper":"https://pith.science/paper/5OAF7MUB"},"agent_actions":{"view_html":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35","download_json":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35.json","view_paper":"https://pith.science/paper/5OAF7MUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.11170&json=true","fetch_graph":"https://pith.science/api/pith-number/5OAF7MUBU76G5JQ24MI4BDQE35/graph.json","fetch_events":"https://pith.science/api/pith-number/5OAF7MUBU76G5JQ24MI4BDQE35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35/action/storage_attestation","attest_author":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35/action/author_attestation","sign_citation":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35/action/citation_signature","submit_replication":"https://pith.science/pith/5OAF7MUBU76G5JQ24MI4BDQE35/action/replication_record"}},"created_at":"2026-06-03T01:05:51.307678+00:00","updated_at":"2026-06-03T01:05:51.307678+00:00"}