{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RMIPIQXA7SZMDQF23KVC6DABZO","short_pith_number":"pith:RMIPIQXA","canonical_record":{"source":{"id":"2411.12600","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T16:04:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"45c2cd79e750cbe115ee3b59b3eaecefb897029d6ede4c6511e3ead1262fa0d2","abstract_canon_sha256":"c8a099a6c16c2be3e1590857a24f366923596517ddf84577dab01309c1cd8e97"},"schema_version":"1.0"},"canonical_sha256":"8b10f442e0fcb2c1c0badaaa2f0c01cba8e21ffab9699b9417fa326cd4b565fa","source":{"kind":"arxiv","id":"2411.12600","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12600","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12600v3","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12600","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"RMIPIQXA7SZM","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"RMIPIQXA7SZMDQF2","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"RMIPIQXA","created_at":"2026-07-05T10:51:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RMIPIQXA7SZMDQF23KVC6DABZO","target":"record","payload":{"canonical_record":{"source":{"id":"2411.12600","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T16:04:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"45c2cd79e750cbe115ee3b59b3eaecefb897029d6ede4c6511e3ead1262fa0d2","abstract_canon_sha256":"c8a099a6c16c2be3e1590857a24f366923596517ddf84577dab01309c1cd8e97"},"schema_version":"1.0"},"canonical_sha256":"8b10f442e0fcb2c1c0badaaa2f0c01cba8e21ffab9699b9417fa326cd4b565fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:28.403255Z","signature_b64":"BbBAWuJAcHrcWo7yRHgPGr7NgvnZ3rMfrPsvWdzJbq9/cUCmpLfW9+7mUAC0Iejwz6J6Gu1OsZ59Z8pC8Kd5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b10f442e0fcb2c1c0badaaa2f0c01cba8e21ffab9699b9417fa326cd4b565fa","last_reissued_at":"2026-07-05T10:51:28.402774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:28.402774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.12600","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOy0N0WbjjAFBCCiQTGr4gtPPffp5ml34HUhoH2+KRrDYnH72j6uzUd3ICtH5snl4fSq3H8P5rLnmh5snOYDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T13:39:41.493780Z"},"content_sha256":"1dcd36eb1455d3e1b05a79f85cae56504eb081445ff6cc22ff21ad15c056fb5e","schema_version":"1.0","event_id":"sha256:1dcd36eb1455d3e1b05a79f85cae56504eb081445ff6cc22ff21ad15c056fb5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RMIPIQXA7SZMDQF23KVC6DABZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable unlearning in topic modeling and downstream tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amartya Sanyal, Sadhika Malladi, Sanjeev Arora, Stanley Wei","submitted_at":"2024-11-19T16:04:31Z","abstract_excerpt":"Machine unlearning algorithms are increasingly important as legal concerns arise around the provenance of training data, but verifying the success of unlearning is often difficult. Provable guarantees for unlearning are often limited to supervised learning settings. In this paper, we provide the first theoretical guarantees for unlearning in the pre-training and fine-tuning paradigm by studying topic models, simple bag-of-words language models that can be adapted to solve downstream tasks like retrieval and classification. First, we design a provably effective unlearning algorithm for topic mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12600","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/2411.12600/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Laybk4xBk1urSE9tzyxq4E7HlFtexREN88vz1oqGcDD0c32TeuiZDJmuvk0iDjVA1O9HDK1oFryomHw6XWZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T13:39:41.494155Z"},"content_sha256":"6d0ac9f32ccae5a6e2cba18fb877d230bc4330a370109148fe3c72142615ce55","schema_version":"1.0","event_id":"sha256:6d0ac9f32ccae5a6e2cba18fb877d230bc4330a370109148fe3c72142615ce55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMIPIQXA7SZMDQF23KVC6DABZO/bundle.json","state_url":"https://pith.science/pith/RMIPIQXA7SZMDQF23KVC6DABZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMIPIQXA7SZMDQF23KVC6DABZO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-13T13:39:41Z","links":{"resolver":"https://pith.science/pith/RMIPIQXA7SZMDQF23KVC6DABZO","bundle":"https://pith.science/pith/RMIPIQXA7SZMDQF23KVC6DABZO/bundle.json","state":"https://pith.science/pith/RMIPIQXA7SZMDQF23KVC6DABZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMIPIQXA7SZMDQF23KVC6DABZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RMIPIQXA7SZMDQF23KVC6DABZO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c8a099a6c16c2be3e1590857a24f366923596517ddf84577dab01309c1cd8e97","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T16:04:31Z","title_canon_sha256":"45c2cd79e750cbe115ee3b59b3eaecefb897029d6ede4c6511e3ead1262fa0d2"},"schema_version":"1.0","source":{"id":"2411.12600","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12600","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12600v3","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12600","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"RMIPIQXA7SZM","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"RMIPIQXA7SZMDQF2","created_at":"2026-07-05T10:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"RMIPIQXA","created_at":"2026-07-05T10:51:28Z"}],"graph_snapshots":[{"event_id":"sha256:6d0ac9f32ccae5a6e2cba18fb877d230bc4330a370109148fe3c72142615ce55","target":"graph","created_at":"2026-07-05T10:51:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.12600/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine unlearning algorithms are increasingly important as legal concerns arise around the provenance of training data, but verifying the success of unlearning is often difficult. Provable guarantees for unlearning are often limited to supervised learning settings. In this paper, we provide the first theoretical guarantees for unlearning in the pre-training and fine-tuning paradigm by studying topic models, simple bag-of-words language models that can be adapted to solve downstream tasks like retrieval and classification. First, we design a provably effective unlearning algorithm for topic mo","authors_text":"Amartya Sanyal, Sadhika Malladi, Sanjeev Arora, Stanley Wei","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T16:04:31Z","title":"Provable unlearning in topic modeling and downstream tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12600","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1dcd36eb1455d3e1b05a79f85cae56504eb081445ff6cc22ff21ad15c056fb5e","target":"record","created_at":"2026-07-05T10:51:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c8a099a6c16c2be3e1590857a24f366923596517ddf84577dab01309c1cd8e97","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T16:04:31Z","title_canon_sha256":"45c2cd79e750cbe115ee3b59b3eaecefb897029d6ede4c6511e3ead1262fa0d2"},"schema_version":"1.0","source":{"id":"2411.12600","kind":"arxiv","version":3}},"canonical_sha256":"8b10f442e0fcb2c1c0badaaa2f0c01cba8e21ffab9699b9417fa326cd4b565fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b10f442e0fcb2c1c0badaaa2f0c01cba8e21ffab9699b9417fa326cd4b565fa","first_computed_at":"2026-07-05T10:51:28.402774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:28.402774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbBAWuJAcHrcWo7yRHgPGr7NgvnZ3rMfrPsvWdzJbq9/cUCmpLfW9+7mUAC0Iejwz6J6Gu1OsZ59Z8pC8Kd5DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:28.403255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12600","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dcd36eb1455d3e1b05a79f85cae56504eb081445ff6cc22ff21ad15c056fb5e","sha256:6d0ac9f32ccae5a6e2cba18fb877d230bc4330a370109148fe3c72142615ce55"],"state_sha256":"e507c59baf4c605b7569159637c35d8b4328dade9d9852893542d7c33df9ee8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhzTP4p4+pYMjYZqZ9PAla7+WdveLjAqlN6EPIw1947hWMKPR7KZpb1ZKlbWwmoTuETnPMCyx3BDkeM+rs9qBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T13:39:41.496311Z","bundle_sha256":"29efb0835589470af657304338cc3dc32fd4021ef9164838d325203efcf2674a"}}