{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QGDZNN3KCVDYJUJDQMJNLNLSJA","short_pith_number":"pith:QGDZNN3K","schema_version":"1.0","canonical_sha256":"818796b76a154784d1238312d5b572483822f0d7041e94502e4bffae0ef9dc6e","source":{"kind":"arxiv","id":"2106.04378","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Christopher Jung, Chris Waites, Saeed Sharifi-Malvajerdi, Seth Neel, Varun Gupta","submitted_at":"2021-06-08T14:11:53Z","abstract_excerpt":"Data deletion algorithms aim to remove the influence of deleted data points from trained models at a cheaper computational cost than fully retraining those models. However, for sequences of deletions, most prior work in the non-convex setting gives valid guarantees only for sequences that are chosen independently of the models that are published. If people choose to delete their data as a function of the published models (because they don't like what the models reveal about them, for example), then the update sequence is adaptive. In this paper, we give a general reduction from deletion guaran"},"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":"2106.04378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T14:11:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9e9d8e7132d0b0617ad3e9b061f2be11e92099d295426b6adef84a1cbaf7ce4d","abstract_canon_sha256":"9d3c883566ae0419d2dab652771e77dfce8c9a592ae22a7c817a999c4710b634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:14.968012Z","signature_b64":"a/zVVF0He6wpjSX6cJ810CqXi1eQAJsrKUwg8ttfSKSdvrcaeESpRoX7e8qS9nyJJpV5lYpvmTzSBSwRpNubCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"818796b76a154784d1238312d5b572483822f0d7041e94502e4bffae0ef9dc6e","last_reissued_at":"2026-07-05T02:47:14.967574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:14.967574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Christopher Jung, Chris Waites, Saeed Sharifi-Malvajerdi, Seth Neel, Varun Gupta","submitted_at":"2021-06-08T14:11:53Z","abstract_excerpt":"Data deletion algorithms aim to remove the influence of deleted data points from trained models at a cheaper computational cost than fully retraining those models. However, for sequences of deletions, most prior work in the non-convex setting gives valid guarantees only for sequences that are chosen independently of the models that are published. If people choose to delete their data as a function of the published models (because they don't like what the models reveal about them, for example), then the update sequence is adaptive. In this paper, we give a general reduction from deletion guaran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04378","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/2106.04378/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":"2106.04378","created_at":"2026-07-05T02:47:14.967639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04378v1","created_at":"2026-07-05T02:47:14.967639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04378","created_at":"2026-07-05T02:47:14.967639+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGDZNN3KCVDY","created_at":"2026-07-05T02:47:14.967639+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGDZNN3KCVDYJUJD","created_at":"2026-07-05T02:47:14.967639+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGDZNN3K","created_at":"2026-07-05T02:47:14.967639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06112","citing_title":"Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level Unlearning Completeness","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA","json":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA.json","graph_json":"https://pith.science/api/pith-number/QGDZNN3KCVDYJUJDQMJNLNLSJA/graph.json","events_json":"https://pith.science/api/pith-number/QGDZNN3KCVDYJUJDQMJNLNLSJA/events.json","paper":"https://pith.science/paper/QGDZNN3K"},"agent_actions":{"view_html":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA","download_json":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA.json","view_paper":"https://pith.science/paper/QGDZNN3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04378&json=true","fetch_graph":"https://pith.science/api/pith-number/QGDZNN3KCVDYJUJDQMJNLNLSJA/graph.json","fetch_events":"https://pith.science/api/pith-number/QGDZNN3KCVDYJUJDQMJNLNLSJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA/action/storage_attestation","attest_author":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA/action/author_attestation","sign_citation":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA/action/citation_signature","submit_replication":"https://pith.science/pith/QGDZNN3KCVDYJUJDQMJNLNLSJA/action/replication_record"}},"created_at":"2026-07-05T02:47:14.967639+00:00","updated_at":"2026-07-05T02:47:14.967639+00:00"}