{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UMEVFO3ZQCEGFLVALD5QALMA74","short_pith_number":"pith:UMEVFO3Z","schema_version":"1.0","canonical_sha256":"a30952bb79808862aea058fb002d80ff3d377f73a4c586a4b39042c62bf6e52c","source":{"kind":"arxiv","id":"2201.06640","version":3},"attestation_state":"computed","paper":{"title":"Towards Adversarial Evaluations for Inexact Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Amartya Sanyal, Ameya Prabhu, Philip Torr, Ponnurangam Kumaraguru, Ser-Nam Lim, Shashwat Goel","submitted_at":"2022-01-17T21:49:21Z","abstract_excerpt":"Machine Learning models face increased concerns regarding the storage of personal user data and adverse impacts of corrupted data like backdoors or systematic bias. Machine Unlearning can address these by allowing post-hoc deletion of affected training data from a learned model. Achieving this task exactly is computationally expensive; consequently, recent works have proposed inexact unlearning algorithms to solve this approximately as well as evaluation methods to test the effectiveness of these algorithms.\n  In this work, we first outline some necessary criteria for evaluation methods and sh"},"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":"2201.06640","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T21:49:21Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"bb92a2c4da98f9bdd61c9875c4b674b54cb2c7a3497f8c38338fd7774212288e","abstract_canon_sha256":"9ecf8c40a0688418022baac9130513b7cb10383d88106f2bb23915801da1da97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:37.279238Z","signature_b64":"6aVtJNqXLVx2vtCtADZFhVnWO0/azTptde/eR94O/0cMjjSDktPxiR39sZF1cT9uI+P3eItmoOp3OLlzktaoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a30952bb79808862aea058fb002d80ff3d377f73a4c586a4b39042c62bf6e52c","last_reissued_at":"2026-07-05T05:44:37.278733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:37.278733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Adversarial Evaluations for Inexact Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Amartya Sanyal, Ameya Prabhu, Philip Torr, Ponnurangam Kumaraguru, Ser-Nam Lim, Shashwat Goel","submitted_at":"2022-01-17T21:49:21Z","abstract_excerpt":"Machine Learning models face increased concerns regarding the storage of personal user data and adverse impacts of corrupted data like backdoors or systematic bias. Machine Unlearning can address these by allowing post-hoc deletion of affected training data from a learned model. Achieving this task exactly is computationally expensive; consequently, recent works have proposed inexact unlearning algorithms to solve this approximately as well as evaluation methods to test the effectiveness of these algorithms.\n  In this work, we first outline some necessary criteria for evaluation methods and sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06640","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/2201.06640/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":"2201.06640","created_at":"2026-07-05T05:44:37.278790+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.06640v3","created_at":"2026-07-05T05:44:37.278790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06640","created_at":"2026-07-05T05:44:37.278790+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMEVFO3ZQCEG","created_at":"2026-07-05T05:44:37.278790+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMEVFO3ZQCEGFLVA","created_at":"2026-07-05T05:44:37.278790+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMEVFO3Z","created_at":"2026-07-05T05:44:37.278790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01129","citing_title":"Revisiting Privacy Leakage in Machine Unlearning: Membership Inference Beyond the Forgotten Set","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27569","citing_title":"RULER: Representation-Level Verification of Machine Unlearning","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2411.02622","citing_title":"AdaProb: Efficient Machine Unlearning via Adaptive Probability","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2503.08633","citing_title":"How Does Overparameterization Affect Machine Unlearning of Deep Neural Networks?","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2505.10859","citing_title":"Exploring Nonlinear Pathway in Parameter Space for Machine Unlearning","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2506.15115","citing_title":"Towards Reliable Forgetting: A Survey on Machine Unlearning Verification","ref_index":36,"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":114,"is_internal_anchor":false},{"citing_arxiv_id":"2401.06121","citing_title":"TOFU: A Task of Fictitious Unlearning for LLMs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10680","citing_title":"Exact Unlearning from Proxies Induces Closeness Guarantees on Approximate Unlearning","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01129","citing_title":"Revisiting Privacy Leakage in Machine Unlearning: Membership Inference Beyond the Forgotten Set","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07962","citing_title":"Is your algorithm unlearning or untraining?","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16536","citing_title":"Towards Reliable Testing of Machine Unlearning","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74","json":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74.json","graph_json":"https://pith.science/api/pith-number/UMEVFO3ZQCEGFLVALD5QALMA74/graph.json","events_json":"https://pith.science/api/pith-number/UMEVFO3ZQCEGFLVALD5QALMA74/events.json","paper":"https://pith.science/paper/UMEVFO3Z"},"agent_actions":{"view_html":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74","download_json":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74.json","view_paper":"https://pith.science/paper/UMEVFO3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.06640&json=true","fetch_graph":"https://pith.science/api/pith-number/UMEVFO3ZQCEGFLVALD5QALMA74/graph.json","fetch_events":"https://pith.science/api/pith-number/UMEVFO3ZQCEGFLVALD5QALMA74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74/action/storage_attestation","attest_author":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74/action/author_attestation","sign_citation":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74/action/citation_signature","submit_replication":"https://pith.science/pith/UMEVFO3ZQCEGFLVALD5QALMA74/action/replication_record"}},"created_at":"2026-07-05T05:44:37.278790+00:00","updated_at":"2026-07-05T05:44:37.278790+00:00"}