{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A7JVKW4M6CQRASW7AWD5NITPDD","short_pith_number":"pith:A7JVKW4M","schema_version":"1.0","canonical_sha256":"07d3555b8cf0a1104adf0587d6a26f18edf60e2a9add6b85c45cdbb41311f1e4","source":{"kind":"arxiv","id":"2406.08607","version":1},"attestation_state":"computed","paper":{"title":"Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gaowen Liu, Jiabao Ji, Ramana Rao Kompella, Shiyu Chang, Sijia Liu, Yang Zhang, Yujian Liu","submitted_at":"2024-06-12T19:26:35Z","abstract_excerpt":"As Large Language Models (LLMs) demonstrate extensive capability in learning from documents, LLM unlearning becomes an increasingly important research area to address concerns of LLMs in terms of privacy, copyright, etc. A conventional LLM unlearning task typically involves two goals: (1) The target LLM should forget the knowledge in the specified forget documents, and (2) it should retain the other knowledge that the LLM possesses, for which we assume access to a small number of retain documents. To achieve both goals, a mainstream class of LLM unlearning methods introduces an optimization fr"},"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":"2406.08607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-12T19:26:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4cab41d1878ab8da391aac6d12858f0fdd5c44b997d5f5e62dc22891cb15b9f","abstract_canon_sha256":"32ddc87d287cb64968e9f65e5f1197426f9254e13c04d44c14c428b35e497735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:19.976549Z","signature_b64":"jr1zKHJ5kv9b8B6uSB5ntnsnxdHpJ5+fXvedp02x4DZisKCgZUXQegjXVd9wPrxZXI1gIBMOK2pFSiloa8n7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d3555b8cf0a1104adf0587d6a26f18edf60e2a9add6b85c45cdbb41311f1e4","last_reissued_at":"2026-07-05T08:31:19.976059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:19.976059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Gaowen Liu, Jiabao Ji, Ramana Rao Kompella, Shiyu Chang, Sijia Liu, Yang Zhang, Yujian Liu","submitted_at":"2024-06-12T19:26:35Z","abstract_excerpt":"As Large Language Models (LLMs) demonstrate extensive capability in learning from documents, LLM unlearning becomes an increasingly important research area to address concerns of LLMs in terms of privacy, copyright, etc. A conventional LLM unlearning task typically involves two goals: (1) The target LLM should forget the knowledge in the specified forget documents, and (2) it should retain the other knowledge that the LLM possesses, for which we assume access to a small number of retain documents. To achieve both goals, a mainstream class of LLM unlearning methods introduces an optimization fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08607","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/2406.08607/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":"2406.08607","created_at":"2026-07-05T08:31:19.976116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.08607v1","created_at":"2026-07-05T08:31:19.976116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08607","created_at":"2026-07-05T08:31:19.976116+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7JVKW4M6CQR","created_at":"2026-07-05T08:31:19.976116+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7JVKW4M6CQRASW7","created_at":"2026-07-05T08:31:19.976116+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7JVKW4M","created_at":"2026-07-05T08:31:19.976116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07482","citing_title":"SHRED: Retain-Set-Free Unlearning via Self-Distillation with Logit Demotion","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD","json":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD.json","graph_json":"https://pith.science/api/pith-number/A7JVKW4M6CQRASW7AWD5NITPDD/graph.json","events_json":"https://pith.science/api/pith-number/A7JVKW4M6CQRASW7AWD5NITPDD/events.json","paper":"https://pith.science/paper/A7JVKW4M"},"agent_actions":{"view_html":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD","download_json":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD.json","view_paper":"https://pith.science/paper/A7JVKW4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.08607&json=true","fetch_graph":"https://pith.science/api/pith-number/A7JVKW4M6CQRASW7AWD5NITPDD/graph.json","fetch_events":"https://pith.science/api/pith-number/A7JVKW4M6CQRASW7AWD5NITPDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD/action/storage_attestation","attest_author":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD/action/author_attestation","sign_citation":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD/action/citation_signature","submit_replication":"https://pith.science/pith/A7JVKW4M6CQRASW7AWD5NITPDD/action/replication_record"}},"created_at":"2026-07-05T08:31:19.976116+00:00","updated_at":"2026-07-05T08:31:19.976116+00:00"}