{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CRTFZIREC72NH5OUM5Y36GHM6A","short_pith_number":"pith:CRTFZIRE","schema_version":"1.0","canonical_sha256":"14665ca22417f4d3f5d46771bf18ecf01f746d7cdd6e3746e8570433ac1e1552","source":{"kind":"arxiv","id":"2407.00106","version":1},"attestation_state":"computed","paper":{"title":"UnUnlearning: Unlearning is not sufficient for content regulation in advanced generative AI","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Eleni Triantafillou, Eugene Bagdasaryan, Guillermo Ortiz-Jimenez, Heidi Howard, Ilia Shumailov, Itay Yona, Jamie Hayes, Matthew Jagielski, Nicolas Papernot","submitted_at":"2024-06-27T10:24:35Z","abstract_excerpt":"Exact unlearning was first introduced as a privacy mechanism that allowed a user to retract their data from machine learning models on request. Shortly after, inexact schemes were proposed to mitigate the impractical costs associated with exact unlearning. More recently unlearning is often discussed as an approach for removal of impermissible knowledge i.e. knowledge that the model should not possess such as unlicensed copyrighted, inaccurate, or malicious information. The promise is that if the model does not have a certain malicious capability, then it cannot be used for the associated malic"},"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":"2407.00106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-27T10:24:35Z","cross_cats_sorted":["cs.AI","cs.CL","cs.CR"],"title_canon_sha256":"8a716b33a5fadafd1787445a16389e9597a56482d1659e575eeb6006a9cf5608","abstract_canon_sha256":"34cda5a08b7684ef11813f4a8e44ab2d6f46718966f579fcb36e67e15d9483e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:14.525906Z","signature_b64":"bjVhePUmyXNexHSIMZtE4s0B468jwYWYdtbONBwdw6xc8XCXmH4sOG4FCe8XGBwq5tNteSn/kanpQSUzg48GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14665ca22417f4d3f5d46771bf18ecf01f746d7cdd6e3746e8570433ac1e1552","last_reissued_at":"2026-07-05T08:38:14.525442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:14.525442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UnUnlearning: Unlearning is not sufficient for content regulation in advanced generative AI","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Eleni Triantafillou, Eugene Bagdasaryan, Guillermo Ortiz-Jimenez, Heidi Howard, Ilia Shumailov, Itay Yona, Jamie Hayes, Matthew Jagielski, Nicolas Papernot","submitted_at":"2024-06-27T10:24:35Z","abstract_excerpt":"Exact unlearning was first introduced as a privacy mechanism that allowed a user to retract their data from machine learning models on request. Shortly after, inexact schemes were proposed to mitigate the impractical costs associated with exact unlearning. More recently unlearning is often discussed as an approach for removal of impermissible knowledge i.e. knowledge that the model should not possess such as unlicensed copyrighted, inaccurate, or malicious information. The promise is that if the model does not have a certain malicious capability, then it cannot be used for the associated malic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00106","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/2407.00106/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":"2407.00106","created_at":"2026-07-05T08:38:14.525498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.00106v1","created_at":"2026-07-05T08:38:14.525498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00106","created_at":"2026-07-05T08:38:14.525498+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRTFZIREC72N","created_at":"2026-07-05T08:38:14.525498+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRTFZIREC72NH5OU","created_at":"2026-07-05T08:38:14.525498+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRTFZIRE","created_at":"2026-07-05T08:38:14.525498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17168","citing_title":"RepSelect: Robust LLM Unlearning via Representation Selectivity","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00570","citing_title":"Revisiting Parameter-Based Knowledge Editing in Large Language Models: Theoretical Limits and Empirical Evidence","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2501.19202","citing_title":"Improving LLM Unlearning Robustness via Random Perturbations","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11592","citing_title":"SoK: Unlearnability and Unlearning for Model Dememorization","ref_index":170,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22076","citing_title":"PrivUn: Unveiling Latent Ripple Effects and Shallow Forgetting in Privacy Unlearning","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07962","citing_title":"Is your algorithm unlearning or untraining?","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A","json":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A.json","graph_json":"https://pith.science/api/pith-number/CRTFZIREC72NH5OUM5Y36GHM6A/graph.json","events_json":"https://pith.science/api/pith-number/CRTFZIREC72NH5OUM5Y36GHM6A/events.json","paper":"https://pith.science/paper/CRTFZIRE"},"agent_actions":{"view_html":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A","download_json":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A.json","view_paper":"https://pith.science/paper/CRTFZIRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.00106&json=true","fetch_graph":"https://pith.science/api/pith-number/CRTFZIREC72NH5OUM5Y36GHM6A/graph.json","fetch_events":"https://pith.science/api/pith-number/CRTFZIREC72NH5OUM5Y36GHM6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A/action/storage_attestation","attest_author":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A/action/author_attestation","sign_citation":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A/action/citation_signature","submit_replication":"https://pith.science/pith/CRTFZIREC72NH5OUM5Y36GHM6A/action/replication_record"}},"created_at":"2026-07-05T08:38:14.525498+00:00","updated_at":"2026-07-05T08:38:14.525498+00:00"}