{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SH4M3EMPMEKDRKYJSESWF7KJPC","short_pith_number":"pith:SH4M3EMP","schema_version":"1.0","canonical_sha256":"91f8cd918f611438ab09912562fd4978aac6da11b11086d7a26063166ec0bea7","source":{"kind":"arxiv","id":"2409.13054","version":1},"attestation_state":"computed","paper":{"title":"LLM Surgery: Efficient Knowledge Unlearning and Editing in Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Akshaj Kumar Veldanda, Anirban Das, Milind Naphade, Sambit Sahu, Shi-Xiong Zhang, Stephen Rawls, Supriyo Chakraborty","submitted_at":"2024-09-19T19:07:01Z","abstract_excerpt":"Large language models (LLMs) have revolutionized various domains, yet their utility comes with significant challenges related to outdated or problematic knowledge embedded during pretraining. This paper addresses the challenge of modifying LLMs to unlearn problematic and outdated information while efficiently integrating new knowledge without retraining from scratch. Here, we propose LLM Surgery, a framework to efficiently modify LLM behaviour by optimizing a three component objective function that: (1) Performs reverse gradient on unlearning dataset (problematic and outdated information), (2)"},"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":"2409.13054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2024-09-19T19:07:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1a04a47bff427fbf735bda58de8d8251c2736bd21517122e5c52a94621cd74ca","abstract_canon_sha256":"bf424950e3c18e249ddf7611b64376f30c9400325aa39f5b75961558ceea6653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:28.476223Z","signature_b64":"LJyfwqyUe3GfLIkC2XHiehepiFZHllBOHgNowifzHmJf8BVYxH8Yk7zy+zzpsisx5raroAGCc7lnoxfhdXYnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f8cd918f611438ab09912562fd4978aac6da11b11086d7a26063166ec0bea7","last_reissued_at":"2026-07-05T09:09:28.475734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:28.475734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM Surgery: Efficient Knowledge Unlearning and Editing in Large Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Akshaj Kumar Veldanda, Anirban Das, Milind Naphade, Sambit Sahu, Shi-Xiong Zhang, Stephen Rawls, Supriyo Chakraborty","submitted_at":"2024-09-19T19:07:01Z","abstract_excerpt":"Large language models (LLMs) have revolutionized various domains, yet their utility comes with significant challenges related to outdated or problematic knowledge embedded during pretraining. This paper addresses the challenge of modifying LLMs to unlearn problematic and outdated information while efficiently integrating new knowledge without retraining from scratch. Here, we propose LLM Surgery, a framework to efficiently modify LLM behaviour by optimizing a three component objective function that: (1) Performs reverse gradient on unlearning dataset (problematic and outdated information), (2)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13054","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/2409.13054/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":"2409.13054","created_at":"2026-07-05T09:09:28.475797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13054v1","created_at":"2026-07-05T09:09:28.475797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13054","created_at":"2026-07-05T09:09:28.475797+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH4M3EMPMEKD","created_at":"2026-07-05T09:09:28.475797+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH4M3EMPMEKDRKYJ","created_at":"2026-07-05T09:09:28.475797+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH4M3EMP","created_at":"2026-07-05T09:09:28.475797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17938","citing_title":"Training data attribution in diffusion models via mirrored unlearning and noise-consistent skew","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC","json":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC.json","graph_json":"https://pith.science/api/pith-number/SH4M3EMPMEKDRKYJSESWF7KJPC/graph.json","events_json":"https://pith.science/api/pith-number/SH4M3EMPMEKDRKYJSESWF7KJPC/events.json","paper":"https://pith.science/paper/SH4M3EMP"},"agent_actions":{"view_html":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC","download_json":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC.json","view_paper":"https://pith.science/paper/SH4M3EMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13054&json=true","fetch_graph":"https://pith.science/api/pith-number/SH4M3EMPMEKDRKYJSESWF7KJPC/graph.json","fetch_events":"https://pith.science/api/pith-number/SH4M3EMPMEKDRKYJSESWF7KJPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC/action/storage_attestation","attest_author":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC/action/author_attestation","sign_citation":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC/action/citation_signature","submit_replication":"https://pith.science/pith/SH4M3EMPMEKDRKYJSESWF7KJPC/action/replication_record"}},"created_at":"2026-07-05T09:09:28.475797+00:00","updated_at":"2026-07-05T09:09:28.475797+00:00"}