{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FDSEYKHFIS3TJIILUBMGU5HIKT","short_pith_number":"pith:FDSEYKHF","schema_version":"1.0","canonical_sha256":"28e44c28e544b734a10ba0586a74e854c0ca3a506e297cf7123a5d184512508c","source":{"kind":"arxiv","id":"1911.03030","version":6},"attestation_state":"computed","paper":{"title":"Certified Data Removal from Machine Learning Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Awni Hannun, Chuan Guo, Laurens van der Maaten, Tom Goldstein","submitted_at":"2019-11-08T03:57:41Z","abstract_excerpt":"Good data stewardship requires removal of data at the request of the data's owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to \"remove\" data from a machine-learning model? We study this problem by defining certified removal: a very strong theoretical guarantee that a model from which data is removed cannot be distinguished from a model that never observed the data to begin with. We develop a certified-removal mechanism for linear classifiers and"},"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":"1911.03030","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T03:57:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"847966ea9d48c5746774211e537a378af838a808ce3469725e7b7e6adeed8d4f","abstract_canon_sha256":"2932bca755373dc52716055d2316f620d3ccd86ce2de24679b00d72a19793ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:18.797145Z","signature_b64":"PPoWw2vKdqNWyoFwKe3GUXbX9W8knVl366kO+3+c/UNAklkCJwEHPRu5njMquTbtHRS1L4mgI1VF9b+6WNneCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e44c28e544b734a10ba0586a74e854c0ca3a506e297cf7123a5d184512508c","last_reissued_at":"2026-07-05T07:10:18.796624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:18.796624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certified Data Removal from Machine Learning Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Awni Hannun, Chuan Guo, Laurens van der Maaten, Tom Goldstein","submitted_at":"2019-11-08T03:57:41Z","abstract_excerpt":"Good data stewardship requires removal of data at the request of the data's owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to \"remove\" data from a machine-learning model? We study this problem by defining certified removal: a very strong theoretical guarantee that a model from which data is removed cannot be distinguished from a model that never observed the data to begin with. We develop a certified-removal mechanism for linear classifiers and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03030","kind":"arxiv","version":6},"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/1911.03030/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":"1911.03030","created_at":"2026-07-05T07:10:18.796681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03030v6","created_at":"2026-07-05T07:10:18.796681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03030","created_at":"2026-07-05T07:10:18.796681+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDSEYKHFIS3T","created_at":"2026-07-05T07:10:18.796681+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDSEYKHFIS3TJIIL","created_at":"2026-07-05T07:10:18.796681+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDSEYKHF","created_at":"2026-07-05T07:10:18.796681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":31,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25410","citing_title":"DFMU: Data-Frugal Machine Unlearning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24113","citing_title":"FedUP: One-Shot Federated Unlearning via Centroid-Guided Plug-in Filters","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17122","citing_title":"TrustErase: Auditable Instant Machine Unlearning with Passport-Embedded Representations","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07688","citing_title":"TRACER: Token ReAssignment for Concept ERasure in Generative Recommendation","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04182","citing_title":"Exact Unlearning in Reinforcement Learning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02453","citing_title":"Initialization is Half the Battle: Generating Diverse Images from a Guidance Potential Posterior","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18879","citing_title":"ZeroUnlearn: Few-Shot Knowledge Unlearning in Large Language Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2411.08443","citing_title":"Machine Unlearning on Pre-trained Models by Residual Feature Alignment Using LoRA","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2411.02622","citing_title":"AdaProb: Efficient Machine Unlearning via Adaptive Probability","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2505.10859","citing_title":"Exploring Nonlinear Pathway in Parameter Space for Machine Unlearning","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2601.06163","citing_title":"Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Masking","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18879","citing_title":"ZeroUnlearn: Few-Shot Knowledge Unlearning in Large Language Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18879","citing_title":"ZeroUnlearn: Few-Shot Knowledge Unlearning in Large Language Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19042","citing_title":"Interference-Aware Multi-Task Unlearning","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2308.05374","citing_title":"Trustworthy LLMs: a Survey and Guideline for Evaluating Large Language Models' Alignment","ref_index":203,"is_internal_anchor":false},{"citing_arxiv_id":"2511.19339","citing_title":"POUR: A Provably Optimal Method for Unlearning Representations via Neural Collapse","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2404.05868","citing_title":"Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2310.12508","citing_title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","ref_index":214,"is_internal_anchor":false},{"citing_arxiv_id":"2401.06121","citing_title":"TOFU: A Task of Fictitious Unlearning for LLMs","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04030","citing_title":"Jellyfish: Zero-Shot Federated Unlearning Scheme with Knowledge Disentanglement","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03547","citing_title":"Erase Persona, Forget Lore: Benchmarking Multimodal Copyright Unlearning in Large Vision Language Models","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23046","citing_title":"Shape of Memory: a Geometric Analysis of Machine Unlearning in Second-Order Optimizers","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12548","citing_title":"DeepSeek Robustness Against Semantic-Character Dual-Space Mutated Prompt Injection","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT","json":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT.json","graph_json":"https://pith.science/api/pith-number/FDSEYKHFIS3TJIILUBMGU5HIKT/graph.json","events_json":"https://pith.science/api/pith-number/FDSEYKHFIS3TJIILUBMGU5HIKT/events.json","paper":"https://pith.science/paper/FDSEYKHF"},"agent_actions":{"view_html":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT","download_json":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT.json","view_paper":"https://pith.science/paper/FDSEYKHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03030&json=true","fetch_graph":"https://pith.science/api/pith-number/FDSEYKHFIS3TJIILUBMGU5HIKT/graph.json","fetch_events":"https://pith.science/api/pith-number/FDSEYKHFIS3TJIILUBMGU5HIKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT/action/storage_attestation","attest_author":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT/action/author_attestation","sign_citation":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT/action/citation_signature","submit_replication":"https://pith.science/pith/FDSEYKHFIS3TJIILUBMGU5HIKT/action/replication_record"}},"created_at":"2026-07-05T07:10:18.796681+00:00","updated_at":"2026-07-05T07:10:18.796681+00:00"}