{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VHV2XPIOPXAJKH76P3MPH3IF46","short_pith_number":"pith:VHV2XPIO","schema_version":"1.0","canonical_sha256":"a9ebabbd0e7dc0951ffe7ed8f3ed05e7b84814aaee0b62fe669337dcc440c950","source":{"kind":"arxiv","id":"2208.10836","version":2},"attestation_state":"computed","paper":{"title":"Evaluating Machine Unlearning via Epistemic Uncertainty","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Becker, Thomas Liebig","submitted_at":"2022-08-23T09:37:31Z","abstract_excerpt":"There has been a growing interest in Machine Unlearning recently, primarily due to legal requirements such as the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act. Thus, multiple approaches were presented to remove the influence of specific target data points from a trained model. However, when evaluating the success of unlearning, current approaches either use adversarial attacks or compare their results to the optimal solution, which usually incorporates retraining from scratch. We argue that both ways are insufficient in practice. In this work, we present an"},"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":"2208.10836","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-23T09:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"e56a13152c512cd8757e0414e99cfff18a558e433a671ff38f528bd8b6af7eb6","abstract_canon_sha256":"341febc49988e78bb563941cdb22d84e1888600a04a22efa69cf9b67a9498ed4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:38.866649Z","signature_b64":"qirolrywN4Vts2D2P/rqzRzBcICyHD8Tsem9evhAo8wvGiMi63cG8SgD26LLB0SfJd1rQf1OnFbK/NC/w68PAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ebabbd0e7dc0951ffe7ed8f3ed05e7b84814aaee0b62fe669337dcc440c950","last_reissued_at":"2026-07-05T04:58:38.866192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:38.866192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Machine Unlearning via Epistemic Uncertainty","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Becker, Thomas Liebig","submitted_at":"2022-08-23T09:37:31Z","abstract_excerpt":"There has been a growing interest in Machine Unlearning recently, primarily due to legal requirements such as the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act. Thus, multiple approaches were presented to remove the influence of specific target data points from a trained model. However, when evaluating the success of unlearning, current approaches either use adversarial attacks or compare their results to the optimal solution, which usually incorporates retraining from scratch. We argue that both ways are insufficient in practice. In this work, we present an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10836","kind":"arxiv","version":2},"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/2208.10836/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":"2208.10836","created_at":"2026-07-05T04:58:38.866246+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.10836v2","created_at":"2026-07-05T04:58:38.866246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10836","created_at":"2026-07-05T04:58:38.866246+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHV2XPIOPXAJ","created_at":"2026-07-05T04:58:38.866246+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHV2XPIOPXAJKH76","created_at":"2026-07-05T04:58:38.866246+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHV2XPIO","created_at":"2026-07-05T04:58:38.866246+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2405.07406","citing_title":"Machine Unlearning: A Comprehensive Survey","ref_index":137,"is_internal_anchor":false},{"citing_arxiv_id":"2506.15115","citing_title":"Towards Reliable Forgetting: A Survey on Machine Unlearning Verification","ref_index":6,"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":209,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":120,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46","json":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46.json","graph_json":"https://pith.science/api/pith-number/VHV2XPIOPXAJKH76P3MPH3IF46/graph.json","events_json":"https://pith.science/api/pith-number/VHV2XPIOPXAJKH76P3MPH3IF46/events.json","paper":"https://pith.science/paper/VHV2XPIO"},"agent_actions":{"view_html":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46","download_json":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46.json","view_paper":"https://pith.science/paper/VHV2XPIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.10836&json=true","fetch_graph":"https://pith.science/api/pith-number/VHV2XPIOPXAJKH76P3MPH3IF46/graph.json","fetch_events":"https://pith.science/api/pith-number/VHV2XPIOPXAJKH76P3MPH3IF46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46/action/storage_attestation","attest_author":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46/action/author_attestation","sign_citation":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46/action/citation_signature","submit_replication":"https://pith.science/pith/VHV2XPIOPXAJKH76P3MPH3IF46/action/replication_record"}},"created_at":"2026-07-05T04:58:38.866246+00:00","updated_at":"2026-07-05T04:58:38.866246+00:00"}