{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2U3ZABGJDR7RHMSCJSRFHTHXFM","short_pith_number":"pith:2U3ZABGJ","schema_version":"1.0","canonical_sha256":"d5379004c91c7f13b2424ca253ccf72b28032b5c94f8a83e5bec7aa467a1bc73","source":{"kind":"arxiv","id":"2302.09880","version":3},"attestation_state":"computed","paper":{"title":"Towards Unbounded Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Eleni Triantafillou, Jamie Hayes, Meghdad Kurmanji, Peter Triantafillou","submitted_at":"2023-02-20T10:15:36Z","abstract_excerpt":"Deep machine unlearning is the problem of `removing' from a trained neural network a subset of its training set. This problem is very timely and has many applications, including the key tasks of removing biases (RB), resolving confusion (RC) (caused by mislabelled data in trained models), as well as allowing users to exercise their `right to be forgotten' to protect User Privacy (UP). This paper is the first, to our knowledge, to study unlearning for different applications (RB, RC, UP), with the view that each has its own desiderata, definitions for `forgetting' and associated metrics for forg"},"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":"2302.09880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-20T10:15:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9dd14f83cca03623a72ca10c6eaec2334b01a24468867fb5db64ba729d0552c2","abstract_canon_sha256":"90b0ac4743ef260b2ab8d19ba615e31f6c117c64570dc512b301aa910585a884"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:23.521783Z","signature_b64":"ib+8kHVmrHyKSqcSUQR+/perduwI2MD3EiO9h0jGr9kBlMG6RFlKdFGW0qAaJzjvKAMzWDHeXfm3b/adjqRVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5379004c91c7f13b2424ca253ccf72b28032b5c94f8a83e5bec7aa467a1bc73","last_reissued_at":"2026-07-05T07:06:23.521277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:23.521277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Unbounded Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Eleni Triantafillou, Jamie Hayes, Meghdad Kurmanji, Peter Triantafillou","submitted_at":"2023-02-20T10:15:36Z","abstract_excerpt":"Deep machine unlearning is the problem of `removing' from a trained neural network a subset of its training set. This problem is very timely and has many applications, including the key tasks of removing biases (RB), resolving confusion (RC) (caused by mislabelled data in trained models), as well as allowing users to exercise their `right to be forgotten' to protect User Privacy (UP). This paper is the first, to our knowledge, to study unlearning for different applications (RB, RC, UP), with the view that each has its own desiderata, definitions for `forgetting' and associated metrics for forg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09880","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/2302.09880/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":"2302.09880","created_at":"2026-07-05T07:06:23.521341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.09880v3","created_at":"2026-07-05T07:06:23.521341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09880","created_at":"2026-07-05T07:06:23.521341+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U3ZABGJDR7R","created_at":"2026-07-05T07:06:23.521341+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U3ZABGJDR7RHMSC","created_at":"2026-07-05T07:06:23.521341+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U3ZABGJ","created_at":"2026-07-05T07:06:23.521341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2401.06121","citing_title":"TOFU: A Task of Fictitious Unlearning for LLMs","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09391","citing_title":"Efficient Unlearning through Maximizing Relearning Convergence Delay","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM","json":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM.json","graph_json":"https://pith.science/api/pith-number/2U3ZABGJDR7RHMSCJSRFHTHXFM/graph.json","events_json":"https://pith.science/api/pith-number/2U3ZABGJDR7RHMSCJSRFHTHXFM/events.json","paper":"https://pith.science/paper/2U3ZABGJ"},"agent_actions":{"view_html":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM","download_json":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM.json","view_paper":"https://pith.science/paper/2U3ZABGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.09880&json=true","fetch_graph":"https://pith.science/api/pith-number/2U3ZABGJDR7RHMSCJSRFHTHXFM/graph.json","fetch_events":"https://pith.science/api/pith-number/2U3ZABGJDR7RHMSCJSRFHTHXFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM/action/storage_attestation","attest_author":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM/action/author_attestation","sign_citation":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM/action/citation_signature","submit_replication":"https://pith.science/pith/2U3ZABGJDR7RHMSCJSRFHTHXFM/action/replication_record"}},"created_at":"2026-07-05T07:06:23.521341+00:00","updated_at":"2026-07-05T07:06:23.521341+00:00"}