{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:72WVHCECQ7RFHM32SOFIFWHRAW","short_pith_number":"pith:72WVHCEC","schema_version":"1.0","canonical_sha256":"fead53888287e253b37a938a82d8f105912b7571ffbf2cbe071a973cdb09e7b8","source":{"kind":"arxiv","id":"2407.11867","version":3},"attestation_state":"computed","paper":{"title":"Targeted Unlearning with Single Layer Unlearning Gradient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"M. Salman Asif, Yaoteng Tan, Zikui Cai","submitted_at":"2024-07-16T15:52:36Z","abstract_excerpt":"Machine unlearning methods aim to remove sensitive or unwanted content from trained models, but typically demand extensive model updates at significant computational cost while potentially degrading model performance on both related and unrelated tasks. We propose Single Layer Unlearning Gradient (SLUG) as an efficient method to unlearn targeted information by updating a single critical layer using a one-time gradient computation. SLUG uses layer importance and gradient alignment metrics to identify the optimal layer for targeted information removal while preserving the model utility. We demon"},"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":"2407.11867","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-16T15:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"dfc9ab35fc25c97c2f4580e8a200cb59b34652949f24d30ee936f4c9ad945d7d","abstract_canon_sha256":"09ebc472d79d1f4a4da27b5be6e41cfdf82fb00785f21d0ef2d344387df37a29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:18.774648Z","signature_b64":"FpYXS+6lTqQ7aXKXbgXDq9i9HWUEqagS4E+OGTPKboAB+n0COdWp+ZvEDz4I2fMebcfmS+HZFofJSfhkIfRwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fead53888287e253b37a938a82d8f105912b7571ffbf2cbe071a973cdb09e7b8","last_reissued_at":"2026-07-05T11:12:18.774051Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:18.774051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Targeted Unlearning with Single Layer Unlearning Gradient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"M. Salman Asif, Yaoteng Tan, Zikui Cai","submitted_at":"2024-07-16T15:52:36Z","abstract_excerpt":"Machine unlearning methods aim to remove sensitive or unwanted content from trained models, but typically demand extensive model updates at significant computational cost while potentially degrading model performance on both related and unrelated tasks. We propose Single Layer Unlearning Gradient (SLUG) as an efficient method to unlearn targeted information by updating a single critical layer using a one-time gradient computation. SLUG uses layer importance and gradient alignment metrics to identify the optimal layer for targeted information removal while preserving the model utility. We demon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.11867","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/2407.11867/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":"2407.11867","created_at":"2026-07-05T11:12:18.774106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.11867v3","created_at":"2026-07-05T11:12:18.774106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.11867","created_at":"2026-07-05T11:12:18.774106+00:00"},{"alias_kind":"pith_short_12","alias_value":"72WVHCECQ7RF","created_at":"2026-07-05T11:12:18.774106+00:00"},{"alias_kind":"pith_short_16","alias_value":"72WVHCECQ7RFHM32","created_at":"2026-07-05T11:12:18.774106+00:00"},{"alias_kind":"pith_short_8","alias_value":"72WVHCEC","created_at":"2026-07-05T11:12:18.774106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01008","citing_title":"Toward Fine-Grained Forgetting:Attribute Unlearning for Multimodal Large Language Models","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW","json":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW.json","graph_json":"https://pith.science/api/pith-number/72WVHCECQ7RFHM32SOFIFWHRAW/graph.json","events_json":"https://pith.science/api/pith-number/72WVHCECQ7RFHM32SOFIFWHRAW/events.json","paper":"https://pith.science/paper/72WVHCEC"},"agent_actions":{"view_html":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW","download_json":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW.json","view_paper":"https://pith.science/paper/72WVHCEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.11867&json=true","fetch_graph":"https://pith.science/api/pith-number/72WVHCECQ7RFHM32SOFIFWHRAW/graph.json","fetch_events":"https://pith.science/api/pith-number/72WVHCECQ7RFHM32SOFIFWHRAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW/action/storage_attestation","attest_author":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW/action/author_attestation","sign_citation":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW/action/citation_signature","submit_replication":"https://pith.science/pith/72WVHCECQ7RFHM32SOFIFWHRAW/action/replication_record"}},"created_at":"2026-07-05T11:12:18.774106+00:00","updated_at":"2026-07-05T11:12:18.774106+00:00"}