{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YOTL5ACJG6IPOIOXCGD4QYIQ6V","short_pith_number":"pith:YOTL5ACJ","schema_version":"1.0","canonical_sha256":"c3a6be80493790f721d71187c86110f54b434197f255f826e8c7144126692af6","source":{"kind":"arxiv","id":"2408.06621","version":5},"attestation_state":"computed","paper":{"title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Dasol Hwang, Moontae Lee, Sungjun Cho, Sungmin Cha","submitted_at":"2024-08-13T04:18:32Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated strong reasoning and memorization capabilities via pretraining on massive textual corpora. However, this poses risk of privacy and copyright violations, highlighting the need for efficient machine unlearning methods that remove sensitive data without retraining from scratch. While Gradient Ascent (GA) is commonly used to unlearn by reducing the likelihood of generating unwanted content, it leads to unstable optimization and catastrophic forgetting of retrained knowledge. We find that combining GA with low-rank adaptation results in poor trade-offs"},"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":"2408.06621","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-13T04:18:32Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"b9d7946be3e3076c8125e115edd6f1f740966227db1c264d86c4703304db85e5","abstract_canon_sha256":"2d68232cec73101182c6b48140b4cf500067d5db0c06f3d2be34f19481326e01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:46.801250Z","signature_b64":"C3L/QvgLUlCrPgXe8awVpfIM+t5rxLB3hmQuqrRZdEalp4AStIgROHQNHTlTMh5/CnN0V2IKucFOtI5BJV6jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a6be80493790f721d71187c86110f54b434197f255f826e8c7144126692af6","last_reissued_at":"2026-07-05T10:53:46.800718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:46.800718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Dasol Hwang, Moontae Lee, Sungjun Cho, Sungmin Cha","submitted_at":"2024-08-13T04:18:32Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated strong reasoning and memorization capabilities via pretraining on massive textual corpora. However, this poses risk of privacy and copyright violations, highlighting the need for efficient machine unlearning methods that remove sensitive data without retraining from scratch. While Gradient Ascent (GA) is commonly used to unlearn by reducing the likelihood of generating unwanted content, it leads to unstable optimization and catastrophic forgetting of retrained knowledge. We find that combining GA with low-rank adaptation results in poor trade-offs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06621","kind":"arxiv","version":5},"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/2408.06621/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":"2408.06621","created_at":"2026-07-05T10:53:46.800775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06621v5","created_at":"2026-07-05T10:53:46.800775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06621","created_at":"2026-07-05T10:53:46.800775+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOTL5ACJG6IP","created_at":"2026-07-05T10:53:46.800775+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOTL5ACJG6IPOIOX","created_at":"2026-07-05T10:53:46.800775+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOTL5ACJ","created_at":"2026-07-05T10:53:46.800775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19042","citing_title":"Interference-Aware Multi-Task Unlearning","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V","json":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V.json","graph_json":"https://pith.science/api/pith-number/YOTL5ACJG6IPOIOXCGD4QYIQ6V/graph.json","events_json":"https://pith.science/api/pith-number/YOTL5ACJG6IPOIOXCGD4QYIQ6V/events.json","paper":"https://pith.science/paper/YOTL5ACJ"},"agent_actions":{"view_html":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V","download_json":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V.json","view_paper":"https://pith.science/paper/YOTL5ACJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06621&json=true","fetch_graph":"https://pith.science/api/pith-number/YOTL5ACJG6IPOIOXCGD4QYIQ6V/graph.json","fetch_events":"https://pith.science/api/pith-number/YOTL5ACJG6IPOIOXCGD4QYIQ6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V/action/storage_attestation","attest_author":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V/action/author_attestation","sign_citation":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V/action/citation_signature","submit_replication":"https://pith.science/pith/YOTL5ACJG6IPOIOXCGD4QYIQ6V/action/replication_record"}},"created_at":"2026-07-05T10:53:46.800775+00:00","updated_at":"2026-07-05T10:53:46.800775+00:00"}