{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WQVZ67JMX75O7JRSQSIOWDMXGO","short_pith_number":"pith:WQVZ67JM","schema_version":"1.0","canonical_sha256":"b42b9f7d2cbffaefa6328490eb0d9733adcb99760907ba9435de7194bcdf3629","source":{"kind":"arxiv","id":"2412.09119","version":3},"attestation_state":"computed","paper":{"title":"The Utility and Complexity of in- and out-of-Distribution Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"cs.LG","authors_text":"Joshua Kazdan, Rachid Guerraoui, Sanmi Koyejo, Youssef Allouah","submitted_at":"2024-12-12T09:54:38Z","abstract_excerpt":"Machine unlearning, the process of selectively removing data from trained models, is increasingly crucial for addressing privacy concerns and knowledge gaps post-deployment. Despite this importance, existing approaches are often heuristic and lack formal guarantees. In this paper, we analyze the fundamental utility, time, and space complexity trade-offs of approximate unlearning, providing rigorous certification analogous to differential privacy. For in-distribution forget data -- data similar to the retain set -- we show that a surprisingly simple and general procedure, empirical risk minimiz"},"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":"2412.09119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T09:54:38Z","cross_cats_sorted":["cs.CR","math.OC"],"title_canon_sha256":"dcfcad82cd046b8fd7b66d70032cd7f7610b93fd726d73ca8eb0a47747c6f846","abstract_canon_sha256":"7d95834a225409e2e26276ab6c02d693666432e44f2a8ffd762fa0c7867ec354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:42.622701Z","signature_b64":"syaWWCNiG1T6sHN1Xsd7zQ89x7e7mJbW5WO9Icc/T4jquFCpVIldabrXSvDuQxkCEsD2jKJZOh7t+BF3yzhUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42b9f7d2cbffaefa6328490eb0d9733adcb99760907ba9435de7194bcdf3629","last_reissued_at":"2026-06-08T01:03:42.620686Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:42.620686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Utility and Complexity of in- and out-of-Distribution Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"cs.LG","authors_text":"Joshua Kazdan, Rachid Guerraoui, Sanmi Koyejo, Youssef Allouah","submitted_at":"2024-12-12T09:54:38Z","abstract_excerpt":"Machine unlearning, the process of selectively removing data from trained models, is increasingly crucial for addressing privacy concerns and knowledge gaps post-deployment. Despite this importance, existing approaches are often heuristic and lack formal guarantees. In this paper, we analyze the fundamental utility, time, and space complexity trade-offs of approximate unlearning, providing rigorous certification analogous to differential privacy. For in-distribution forget data -- data similar to the retain set -- we show that a surprisingly simple and general procedure, empirical risk minimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09119","kind":"arxiv","version":3},"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/2412.09119/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":"2412.09119","created_at":"2026-06-08T01:03:42.621601+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09119v3","created_at":"2026-06-08T01:03:42.621601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09119","created_at":"2026-06-08T01:03:42.621601+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQVZ67JMX75O","created_at":"2026-06-08T01:03:42.621601+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQVZ67JMX75O7JRS","created_at":"2026-06-08T01:03:42.621601+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQVZ67JM","created_at":"2026-06-08T01:03:42.621601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO","json":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO.json","graph_json":"https://pith.science/api/pith-number/WQVZ67JMX75O7JRSQSIOWDMXGO/graph.json","events_json":"https://pith.science/api/pith-number/WQVZ67JMX75O7JRSQSIOWDMXGO/events.json","paper":"https://pith.science/paper/WQVZ67JM"},"agent_actions":{"view_html":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO","download_json":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO.json","view_paper":"https://pith.science/paper/WQVZ67JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09119&json=true","fetch_graph":"https://pith.science/api/pith-number/WQVZ67JMX75O7JRSQSIOWDMXGO/graph.json","fetch_events":"https://pith.science/api/pith-number/WQVZ67JMX75O7JRSQSIOWDMXGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO/action/storage_attestation","attest_author":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO/action/author_attestation","sign_citation":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO/action/citation_signature","submit_replication":"https://pith.science/pith/WQVZ67JMX75O7JRSQSIOWDMXGO/action/replication_record"}},"created_at":"2026-06-08T01:03:42.621601+00:00","updated_at":"2026-06-08T01:03:42.621601+00:00"}