{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SAVTZMBOFHLMUYPTXWZ5YQRYNB","short_pith_number":"pith:SAVTZMBO","canonical_record":{"source":{"id":"2102.13179","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T21:16:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"45a324203bfb3fa3de83b76dc9c7d81b8d72f66bc9c9c95990dad03d6e7ff67e","abstract_canon_sha256":"d10a696dae36edf5462fc9cc35f963ce6f80868f161a9a1ad9bb727725f7096a"},"schema_version":"1.0"},"canonical_sha256":"902b3cb02e29d6ca61f3bdb3dc42386873f8608152a0ec753768f44895d2f6ab","source":{"kind":"arxiv","id":"2102.13179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.13179","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2102.13179v1","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13179","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"SAVTZMBOFHLM","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"SAVTZMBOFHLMUYPT","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"SAVTZMBO","created_at":"2026-07-05T02:18:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SAVTZMBOFHLMUYPTXWZ5YQRYNB","target":"record","payload":{"canonical_record":{"source":{"id":"2102.13179","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T21:16:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"45a324203bfb3fa3de83b76dc9c7d81b8d72f66bc9c9c95990dad03d6e7ff67e","abstract_canon_sha256":"d10a696dae36edf5462fc9cc35f963ce6f80868f161a9a1ad9bb727725f7096a"},"schema_version":"1.0"},"canonical_sha256":"902b3cb02e29d6ca61f3bdb3dc42386873f8608152a0ec753768f44895d2f6ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:34.787479Z","signature_b64":"onWWOFtlvyDDQPsaFds3etSs70Sb64QWiGoPuby4n9RJFgCxyYy3yYg4EQI/xW9QnKMDql1bgI5PfxqAlj+3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902b3cb02e29d6ca61f3bdb3dc42386873f8608152a0ec753768f44895d2f6ab","last_reissued_at":"2026-07-05T02:18:34.786959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:34.786959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.13179","source_version":1,"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-05T02:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aq2bqUkOYO/9QrE3CkL5rToUPL8XK2EnuBl9cnQj+WPx+genKtoPSh86CSIjKhciYhrHojXkdlMBHd/pE1EUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:56:06.280883Z"},"content_sha256":"84a72a5846b650cd592c18f94db398c9cc14c37fd75b5ceb2777d71441bfd0ba","schema_version":"1.0","event_id":"sha256:84a72a5846b650cd592c18f94db398c9cc14c37fd75b5ceb2777d71441bfd0ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SAVTZMBOFHLMUYPTXWZ5YQRYNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Machine Unlearning via Algorithmic Stability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Enayat Ullah, Raman Arora, Ryan Rossi, Tung Mai","submitted_at":"2021-02-25T21:16:56Z","abstract_excerpt":"We study the problem of machine unlearning and identify a notion of algorithmic stability, Total Variation (TV) stability, which we argue, is suitable for the goal of exact unlearning. For convex risk minimization problems, we design TV-stable algorithms based on noisy Stochastic Gradient Descent (SGD). Our key contribution is the design of corresponding efficient unlearning algorithms, which are based on constructing a (maximal) coupling of Markov chains for the noisy SGD procedure. To understand the trade-offs between accuracy and unlearning efficiency, we give upper and lower bounds on exce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.13179","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/2102.13179/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-05T02:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHTJZUM+VDzRZwinjogPANKR0sOz9R9RNQkdbv6Cwh8lTfAa0Acs81lH8dJg6MbnIw0sRAUhVUqfq5PfGPdUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:56:06.281480Z"},"content_sha256":"4be99a2da1d9398c33ab7e4aff9641b11adbf26e7e5083281444c4a6ec20fc5c","schema_version":"1.0","event_id":"sha256:4be99a2da1d9398c33ab7e4aff9641b11adbf26e7e5083281444c4a6ec20fc5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/bundle.json","state_url":"https://pith.science/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/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-08-17T22:56:06Z","links":{"resolver":"https://pith.science/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB","bundle":"https://pith.science/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/bundle.json","state":"https://pith.science/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAVTZMBOFHLMUYPTXWZ5YQRYNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SAVTZMBOFHLMUYPTXWZ5YQRYNB","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":"d10a696dae36edf5462fc9cc35f963ce6f80868f161a9a1ad9bb727725f7096a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T21:16:56Z","title_canon_sha256":"45a324203bfb3fa3de83b76dc9c7d81b8d72f66bc9c9c95990dad03d6e7ff67e"},"schema_version":"1.0","source":{"id":"2102.13179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.13179","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2102.13179v1","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13179","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"SAVTZMBOFHLM","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"SAVTZMBOFHLMUYPT","created_at":"2026-07-05T02:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"SAVTZMBO","created_at":"2026-07-05T02:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:4be99a2da1d9398c33ab7e4aff9641b11adbf26e7e5083281444c4a6ec20fc5c","target":"graph","created_at":"2026-07-05T02:18:34Z","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/2102.13179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of machine unlearning and identify a notion of algorithmic stability, Total Variation (TV) stability, which we argue, is suitable for the goal of exact unlearning. For convex risk minimization problems, we design TV-stable algorithms based on noisy Stochastic Gradient Descent (SGD). Our key contribution is the design of corresponding efficient unlearning algorithms, which are based on constructing a (maximal) coupling of Markov chains for the noisy SGD procedure. To understand the trade-offs between accuracy and unlearning efficiency, we give upper and lower bounds on exce","authors_text":"Anup Rao, Enayat Ullah, Raman Arora, Ryan Rossi, Tung Mai","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T21:16:56Z","title":"Machine Unlearning via Algorithmic Stability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.13179","kind":"arxiv","version":1},"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:84a72a5846b650cd592c18f94db398c9cc14c37fd75b5ceb2777d71441bfd0ba","target":"record","created_at":"2026-07-05T02:18:34Z","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":"d10a696dae36edf5462fc9cc35f963ce6f80868f161a9a1ad9bb727725f7096a","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T21:16:56Z","title_canon_sha256":"45a324203bfb3fa3de83b76dc9c7d81b8d72f66bc9c9c95990dad03d6e7ff67e"},"schema_version":"1.0","source":{"id":"2102.13179","kind":"arxiv","version":1}},"canonical_sha256":"902b3cb02e29d6ca61f3bdb3dc42386873f8608152a0ec753768f44895d2f6ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"902b3cb02e29d6ca61f3bdb3dc42386873f8608152a0ec753768f44895d2f6ab","first_computed_at":"2026-07-05T02:18:34.786959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:34.786959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onWWOFtlvyDDQPsaFds3etSs70Sb64QWiGoPuby4n9RJFgCxyYy3yYg4EQI/xW9QnKMDql1bgI5PfxqAlj+3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:34.787479Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.13179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84a72a5846b650cd592c18f94db398c9cc14c37fd75b5ceb2777d71441bfd0ba","sha256:4be99a2da1d9398c33ab7e4aff9641b11adbf26e7e5083281444c4a6ec20fc5c"],"state_sha256":"57c908f5a1bb063f9d278dbf4b96d73df6bafdc035736ef1a8a7d1715e668dc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcVAQxFVfjBFdYGuyahx/kAd6xzf5gA0+sq3bZ6R/kijjMibU37THGuByDfbIRL1QYZH4sPwdzmWFJRYixzBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T22:56:06.285889Z","bundle_sha256":"3ee9db5c22efa371131fb3d43d6fb27d94cda4ca3aa0ee467625bc4d2cc2d1fc"}}