{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BHQT7KRXDYZE6FRNTSTMF22DL5","short_pith_number":"pith:BHQT7KRX","schema_version":"1.0","canonical_sha256":"09e13faa371e324f162d9ca6c2eb435f60cdcdce6fbd9e9f047ed02871c66126","source":{"kind":"arxiv","id":"2404.03233","version":1},"attestation_state":"computed","paper":{"title":"Learn What You Want to Unlearn: Unlearning Inversion Attacks against Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hongsheng Hu, Minhui Xue, Shuo Wang, Tian Dong","submitted_at":"2024-04-04T06:37:46Z","abstract_excerpt":"Machine unlearning has become a promising solution for fulfilling the \"right to be forgotten\", under which individuals can request the deletion of their data from machine learning models. However, existing studies of machine unlearning mainly focus on the efficacy and efficiency of unlearning methods, while neglecting the investigation of the privacy vulnerability during the unlearning process. With two versions of a model available to an adversary, that is, the original model and the unlearned model, machine unlearning opens up a new attack surface. In this paper, we conduct the first investi"},"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":"2404.03233","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-04-04T06:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"f00fc15d4e558f333bbebf53f126e9c6c4b99aaf338e74fad488fcb1b1bd1257","abstract_canon_sha256":"9d7cbfc93cb73a7b50f839e329fa8a28a0d66945519b398140cbb5e97e1e6b59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:22.986866Z","signature_b64":"/bMRV6a8jqwC5VqMtUbBt/229MwCqd2v5xjKbc+b40FSJmhnU5s+Bax7cl9pra6ksz4RK/7leReNnoCS3s4oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09e13faa371e324f162d9ca6c2eb435f60cdcdce6fbd9e9f047ed02871c66126","last_reissued_at":"2026-07-05T08:04:22.986432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:22.986432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learn What You Want to Unlearn: Unlearning Inversion Attacks against Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hongsheng Hu, Minhui Xue, Shuo Wang, Tian Dong","submitted_at":"2024-04-04T06:37:46Z","abstract_excerpt":"Machine unlearning has become a promising solution for fulfilling the \"right to be forgotten\", under which individuals can request the deletion of their data from machine learning models. However, existing studies of machine unlearning mainly focus on the efficacy and efficiency of unlearning methods, while neglecting the investigation of the privacy vulnerability during the unlearning process. With two versions of a model available to an adversary, that is, the original model and the unlearned model, machine unlearning opens up a new attack surface. In this paper, we conduct the first investi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03233","kind":"arxiv","version":1},"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/2404.03233/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":"2404.03233","created_at":"2026-07-05T08:04:22.986487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03233v1","created_at":"2026-07-05T08:04:22.986487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03233","created_at":"2026-07-05T08:04:22.986487+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHQT7KRXDYZE","created_at":"2026-07-05T08:04:22.986487+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHQT7KRXDYZE6FRN","created_at":"2026-07-05T08:04:22.986487+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHQT7KRX","created_at":"2026-07-05T08:04:22.986487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.02622","citing_title":"AdaProb: Efficient Machine Unlearning via Adaptive Probability","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12827","citing_title":"GraphIP-Bench: How Hard Is It to Steal a Graph Neural Network, and Can We Stop It?","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5","json":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5.json","graph_json":"https://pith.science/api/pith-number/BHQT7KRXDYZE6FRNTSTMF22DL5/graph.json","events_json":"https://pith.science/api/pith-number/BHQT7KRXDYZE6FRNTSTMF22DL5/events.json","paper":"https://pith.science/paper/BHQT7KRX"},"agent_actions":{"view_html":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5","download_json":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5.json","view_paper":"https://pith.science/paper/BHQT7KRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03233&json=true","fetch_graph":"https://pith.science/api/pith-number/BHQT7KRXDYZE6FRNTSTMF22DL5/graph.json","fetch_events":"https://pith.science/api/pith-number/BHQT7KRXDYZE6FRNTSTMF22DL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5/action/storage_attestation","attest_author":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5/action/author_attestation","sign_citation":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5/action/citation_signature","submit_replication":"https://pith.science/pith/BHQT7KRXDYZE6FRNTSTMF22DL5/action/replication_record"}},"created_at":"2026-07-05T08:04:22.986487+00:00","updated_at":"2026-07-05T08:04:22.986487+00:00"}