{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MNAOAHSYEMRBKZ3BQNQGE7JCQ7","short_pith_number":"pith:MNAOAHSY","schema_version":"1.0","canonical_sha256":"6340e01e5823221567618360627d2287cbc1457c70c05808c4d6943e1a18393d","source":{"kind":"arxiv","id":"2508.12220","version":1},"attestation_state":"computed","paper":{"title":"Unlearning at Scale: Implementing the Right to be Forgotten in Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Abdullah X","submitted_at":"2025-08-17T03:29:22Z","abstract_excerpt":"We study the right to be forgotten (GDPR Art. 17) for large language models and frame unlearning as a reproducible systems problem. Our approach treats training as a deterministic program and logs a minimal per-microbatch record (ordered ID hash, RNG seed, learning-rate value, optimizer-step counter, and accumulation boundary). Under a pinned stack and deterministic kernels, replaying the training tail while filtering only the forget closure yields the same parameters as training on the retain set (bit-identical in the training dtype) when preconditions hold. To meet latency and availability c"},"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":"2508.12220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-17T03:29:22Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"0312113b76e9930baa7ede8d69f009b1b3fe56eb6d7c7eb5b308425828334589","abstract_canon_sha256":"23acdb9baa54bcc7b283608e815bf68503ff611930e8556082ba42c0df460ece"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:01.906598Z","signature_b64":"m4lOv/4shSnIFIAIPFX2rmoogIGmtcEhbJ7ops0XNWhHZ6jOCsp2xgokFudJc6DLrbu6F60Bu7W50+XEZ5VMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6340e01e5823221567618360627d2287cbc1457c70c05808c4d6943e1a18393d","last_reissued_at":"2026-07-05T11:55:01.906134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:01.906134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlearning at Scale: Implementing the Right to be Forgotten in Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Abdullah X","submitted_at":"2025-08-17T03:29:22Z","abstract_excerpt":"We study the right to be forgotten (GDPR Art. 17) for large language models and frame unlearning as a reproducible systems problem. Our approach treats training as a deterministic program and logs a minimal per-microbatch record (ordered ID hash, RNG seed, learning-rate value, optimizer-step counter, and accumulation boundary). Under a pinned stack and deterministic kernels, replaying the training tail while filtering only the forget closure yields the same parameters as training on the retain set (bit-identical in the training dtype) when preconditions hold. To meet latency and availability c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12220","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/2508.12220/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":"2508.12220","created_at":"2026-07-05T11:55:01.906190+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12220v1","created_at":"2026-07-05T11:55:01.906190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12220","created_at":"2026-07-05T11:55:01.906190+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNAOAHSYEMRB","created_at":"2026-07-05T11:55:01.906190+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNAOAHSYEMRBKZ3B","created_at":"2026-07-05T11:55:01.906190+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNAOAHSY","created_at":"2026-07-05T11:55:01.906190+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7","json":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7.json","graph_json":"https://pith.science/api/pith-number/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/graph.json","events_json":"https://pith.science/api/pith-number/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/events.json","paper":"https://pith.science/paper/MNAOAHSY"},"agent_actions":{"view_html":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7","download_json":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7.json","view_paper":"https://pith.science/paper/MNAOAHSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12220&json=true","fetch_graph":"https://pith.science/api/pith-number/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/action/storage_attestation","attest_author":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/action/author_attestation","sign_citation":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/action/citation_signature","submit_replication":"https://pith.science/pith/MNAOAHSYEMRBKZ3BQNQGE7JCQ7/action/replication_record"}},"created_at":"2026-07-05T11:55:01.906190+00:00","updated_at":"2026-07-05T11:55:01.906190+00:00"}