{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F242K7D3IUL4OL5REFOGSWA2NG","short_pith_number":"pith:F242K7D3","schema_version":"1.0","canonical_sha256":"2eb9a57c7b4517c72fb1215c69581a698eb15ff02907ae2fc2ce2b7a153552d5","source":{"kind":"arxiv","id":"2502.15097","version":3},"attestation_state":"computed","paper":{"title":"LUME: LLM Unlearning with Multitask Evaluations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Anil Ramakrishna, Bhanukiran Vinzamuri, Kai-Wei Chang, Mingyi Hong, Rahul Gupta, Volkan Cevher, Xiaomeng Jin, Yixin Wan, Zhiqi Bu","submitted_at":"2025-02-20T23:30:45Z","abstract_excerpt":"Unlearning aims to remove copyrighted, sensitive, or private content from large language models (LLMs) without a full retraining. In this work, we develop a multi-task unlearning benchmark (LUME) which features three tasks: (1) unlearn synthetically generated creative short novels, (2) unlearn synthetic biographies with sensitive information, and (3) unlearn a collection of public biographies. We further release two fine-tuned LLMs of 1B and 7B parameter sizes as the target models. We conduct detailed evaluations of several recently proposed unlearning algorithms and present results on careful"},"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":"2502.15097","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-20T23:30:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4c691063ad50143c1b0415dcd224a20214b53d9c2aeadafe672e15e3128a5d2f","abstract_canon_sha256":"e41960fd6bd9be5acea74d69aa7f3aaf1290506cb6cf321d37507a0e8ddcd247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:44.648377Z","signature_b64":"ncZjPIe2G2AOVitylgMCDEJbSRHq4nBso2KPrhIcMX8tOsnCqyXNk6QEk844xDIgpebWrn1xOXLJkHKusLbjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb9a57c7b4517c72fb1215c69581a698eb15ff02907ae2fc2ce2b7a153552d5","last_reissued_at":"2026-07-05T10:20:44.647800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:44.647800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LUME: LLM Unlearning with Multitask Evaluations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Anil Ramakrishna, Bhanukiran Vinzamuri, Kai-Wei Chang, Mingyi Hong, Rahul Gupta, Volkan Cevher, Xiaomeng Jin, Yixin Wan, Zhiqi Bu","submitted_at":"2025-02-20T23:30:45Z","abstract_excerpt":"Unlearning aims to remove copyrighted, sensitive, or private content from large language models (LLMs) without a full retraining. In this work, we develop a multi-task unlearning benchmark (LUME) which features three tasks: (1) unlearn synthetically generated creative short novels, (2) unlearn synthetic biographies with sensitive information, and (3) unlearn a collection of public biographies. We further release two fine-tuned LLMs of 1B and 7B parameter sizes as the target models. We conduct detailed evaluations of several recently proposed unlearning algorithms and present results on careful"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15097","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/2502.15097/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":"2502.15097","created_at":"2026-07-05T10:20:44.647866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15097v3","created_at":"2026-07-05T10:20:44.647866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15097","created_at":"2026-07-05T10:20:44.647866+00:00"},{"alias_kind":"pith_short_12","alias_value":"F242K7D3IUL4","created_at":"2026-07-05T10:20:44.647866+00:00"},{"alias_kind":"pith_short_16","alias_value":"F242K7D3IUL4OL5R","created_at":"2026-07-05T10:20:44.647866+00:00"},{"alias_kind":"pith_short_8","alias_value":"F242K7D3","created_at":"2026-07-05T10:20:44.647866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.04457","citing_title":"RapidUn: Influence-Driven Parameter Reweighting for Efficient Large Language Model Unlearning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG","json":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG.json","graph_json":"https://pith.science/api/pith-number/F242K7D3IUL4OL5REFOGSWA2NG/graph.json","events_json":"https://pith.science/api/pith-number/F242K7D3IUL4OL5REFOGSWA2NG/events.json","paper":"https://pith.science/paper/F242K7D3"},"agent_actions":{"view_html":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG","download_json":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG.json","view_paper":"https://pith.science/paper/F242K7D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15097&json=true","fetch_graph":"https://pith.science/api/pith-number/F242K7D3IUL4OL5REFOGSWA2NG/graph.json","fetch_events":"https://pith.science/api/pith-number/F242K7D3IUL4OL5REFOGSWA2NG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG/action/storage_attestation","attest_author":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG/action/author_attestation","sign_citation":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG/action/citation_signature","submit_replication":"https://pith.science/pith/F242K7D3IUL4OL5REFOGSWA2NG/action/replication_record"}},"created_at":"2026-07-05T10:20:44.647866+00:00","updated_at":"2026-07-05T10:20:44.647866+00:00"}