{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7DKHXXAHHQM7H2D3JHR4JKXSL5","short_pith_number":"pith:7DKHXXAH","schema_version":"1.0","canonical_sha256":"f8d47bdc073c19f3e87b49e3c4aaf25f4f571c60f82170a4c2dc7c22795eb2ab","source":{"kind":"arxiv","id":"2404.16841","version":1},"attestation_state":"computed","paper":{"title":"Machine Unlearning in Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bing Mi, Jiaxing Shen, Kongyang Chen, Shaowei Wang, Waixi Liu, Xiaojun Ren, Zixin Wang","submitted_at":"2024-02-03T05:14:56Z","abstract_excerpt":"Recently, large language models (LLMs) have emerged as a notable field, attracting significant attention for its ability to automatically generate intelligent contents for various application domains. However, LLMs still suffer from significant security and privacy issues. For example, LLMs might expose user privacy from hacking attacks or targeted prompts. To address this problem, this paper introduces a novel machine unlearning framework into LLMs. Our objectives are to make LLMs not produce harmful, hallucinatory, or privacy-compromising responses, while retaining their standard output capa"},"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":"2404.16841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-02-03T05:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"b9210f209577000f06b3eafb7aa34ede4834c36fc588336bc041249a8c7d7ba0","abstract_canon_sha256":"6b62421bd33f7e12971a98ff72d4d32f84864633be4c2d486e728715a4834f79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:15.873780Z","signature_b64":"GGpfVgG05sEXN2XEaIIz9HliLBuEIh7/GlPG4M9REB7fB1hw7imMXR16pbSyDhbzuvRn99k8UbkMxNcJ7IrMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d47bdc073c19f3e87b49e3c4aaf25f4f571c60f82170a4c2dc7c22795eb2ab","last_reissued_at":"2026-07-05T08:12:15.872957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:15.872957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Unlearning in Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bing Mi, Jiaxing Shen, Kongyang Chen, Shaowei Wang, Waixi Liu, Xiaojun Ren, Zixin Wang","submitted_at":"2024-02-03T05:14:56Z","abstract_excerpt":"Recently, large language models (LLMs) have emerged as a notable field, attracting significant attention for its ability to automatically generate intelligent contents for various application domains. However, LLMs still suffer from significant security and privacy issues. For example, LLMs might expose user privacy from hacking attacks or targeted prompts. To address this problem, this paper introduces a novel machine unlearning framework into LLMs. Our objectives are to make LLMs not produce harmful, hallucinatory, or privacy-compromising responses, while retaining their standard output capa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16841","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/2404.16841/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":"2404.16841","created_at":"2026-07-05T08:12:15.873021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16841v1","created_at":"2026-07-05T08:12:15.873021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16841","created_at":"2026-07-05T08:12:15.873021+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DKHXXAHHQM7","created_at":"2026-07-05T08:12:15.873021+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DKHXXAHHQM7H2D3","created_at":"2026-07-05T08:12:15.873021+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DKHXXAH","created_at":"2026-07-05T08:12:15.873021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15847","citing_title":"CiPO: Counterfactual Unlearning for Large Reasoning Models through Iterative Preference Optimization","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":145,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5","json":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5.json","graph_json":"https://pith.science/api/pith-number/7DKHXXAHHQM7H2D3JHR4JKXSL5/graph.json","events_json":"https://pith.science/api/pith-number/7DKHXXAHHQM7H2D3JHR4JKXSL5/events.json","paper":"https://pith.science/paper/7DKHXXAH"},"agent_actions":{"view_html":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5","download_json":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5.json","view_paper":"https://pith.science/paper/7DKHXXAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16841&json=true","fetch_graph":"https://pith.science/api/pith-number/7DKHXXAHHQM7H2D3JHR4JKXSL5/graph.json","fetch_events":"https://pith.science/api/pith-number/7DKHXXAHHQM7H2D3JHR4JKXSL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5/action/storage_attestation","attest_author":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5/action/author_attestation","sign_citation":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5/action/citation_signature","submit_replication":"https://pith.science/pith/7DKHXXAHHQM7H2D3JHR4JKXSL5/action/replication_record"}},"created_at":"2026-07-05T08:12:15.873021+00:00","updated_at":"2026-07-05T08:12:15.873021+00:00"}