{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WYUMOYOESYBAYXLFST4UWJZPPQ","short_pith_number":"pith:WYUMOYOE","schema_version":"1.0","canonical_sha256":"b628c761c496020c5d6594f94b272f7c3ed50ef0ee76d0da6810dd34b6d71029","source":{"kind":"arxiv","id":"2509.02820","version":1},"attestation_state":"computed","paper":{"title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein, Maximilian M\\\"uller, Naman Deep Singh","submitted_at":"2025-09-02T20:38:53Z","abstract_excerpt":"Unlearning in large language models (LLMs) involves precisely removing specific information from a pre-trained model. This is crucial to ensure safety of LLMs by deleting private data or harmful knowledge acquired during pre-training. However, existing unlearning methods often fall short when subjected to thorough evaluation. To overcome this, we introduce JensUn, where we leverage the Jensen-Shannon Divergence as the training objective for both forget and retain sets for more stable and effective unlearning dynamics compared to commonly used loss functions. In extensive experiments, JensUn ac"},"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":"2509.02820","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-02T20:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"c5a2ebf29b58a025d044a760b337624486f723a4a274c5ac96ade8aa1632790c","abstract_canon_sha256":"424c49327b3b9e6b5ef88eead5781a5f68c3e10ece82b665f00afa0d17d51f52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:58.179627Z","signature_b64":"tVHWMiK2M7F2uvRnvnTe5957lhIaRUgZ709xvLvpSZABijznN9+hshYVZdRBFVp/Q1qToRcY3w7qWyTRdZWLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b628c761c496020c5d6594f94b272f7c3ed50ef0ee76d0da6810dd34b6d71029","last_reissued_at":"2026-07-05T12:03:58.179084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:58.179084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein, Maximilian M\\\"uller, Naman Deep Singh","submitted_at":"2025-09-02T20:38:53Z","abstract_excerpt":"Unlearning in large language models (LLMs) involves precisely removing specific information from a pre-trained model. This is crucial to ensure safety of LLMs by deleting private data or harmful knowledge acquired during pre-training. However, existing unlearning methods often fall short when subjected to thorough evaluation. To overcome this, we introduce JensUn, where we leverage the Jensen-Shannon Divergence as the training objective for both forget and retain sets for more stable and effective unlearning dynamics compared to commonly used loss functions. In extensive experiments, JensUn ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02820","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/2509.02820/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":"2509.02820","created_at":"2026-07-05T12:03:58.179143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.02820v1","created_at":"2026-07-05T12:03:58.179143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02820","created_at":"2026-07-05T12:03:58.179143+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYUMOYOESYBA","created_at":"2026-07-05T12:03:58.179143+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYUMOYOESYBAYXLF","created_at":"2026-07-05T12:03:58.179143+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYUMOYOE","created_at":"2026-07-05T12:03:58.179143+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06320","citing_title":"Learning What to Forget: Improving LLM Unlearning via Learned Token-Level Importance","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2510.00761","citing_title":"Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearning","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ","json":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ.json","graph_json":"https://pith.science/api/pith-number/WYUMOYOESYBAYXLFST4UWJZPPQ/graph.json","events_json":"https://pith.science/api/pith-number/WYUMOYOESYBAYXLFST4UWJZPPQ/events.json","paper":"https://pith.science/paper/WYUMOYOE"},"agent_actions":{"view_html":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ","download_json":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ.json","view_paper":"https://pith.science/paper/WYUMOYOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.02820&json=true","fetch_graph":"https://pith.science/api/pith-number/WYUMOYOESYBAYXLFST4UWJZPPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WYUMOYOESYBAYXLFST4UWJZPPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ/action/storage_attestation","attest_author":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ/action/author_attestation","sign_citation":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ/action/citation_signature","submit_replication":"https://pith.science/pith/WYUMOYOESYBAYXLFST4UWJZPPQ/action/replication_record"}},"created_at":"2026-07-05T12:03:58.179143+00:00","updated_at":"2026-07-05T12:03:58.179143+00:00"}