{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SVEXQHXONJBX552EZ27FO3EZYX","short_pith_number":"pith:SVEXQHXO","schema_version":"1.0","canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","source":{"kind":"arxiv","id":"2007.02923","version":1},"attestation_state":"computed","paper":{"title":"Descent-to-Delete: Gradient-Based Methods for Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aaron Roth, Saeed Sharifi-Malvajerdi, Seth Neel","submitted_at":"2020-07-06T17:54:35Z","abstract_excerpt":"We study the data deletion problem for convex models. By leveraging techniques from convex optimization and reservoir sampling, we give the first data deletion algorithms that are able to handle an arbitrarily long sequence of adversarial updates while promising both per-deletion run-time and steady-state error that do not grow with the length of the update sequence. We also introduce several new conceptual distinctions: for example, we can ask that after a deletion, the entire state maintained by the optimization algorithm is statistically indistinguishable from the state that would have resu"},"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":"2007.02923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-06T17:54:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"743cdf4484e12fc3e2768c23a75854e8a3a56f8d3d1ea48b9d28432fbe2498d5","abstract_canon_sha256":"febaba212773491fa81cb91df6ec493e245f6f64744730d96fda486d2f65e696"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:35.863307Z","signature_b64":"R3CNRMtYJpPyrRT/atjbD+23pZUvzVSKasJAWdhE43PcIxqSiGxPoikvz8pGrtQjCP77NkLEQ/hGQ5XEnTb7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","last_reissued_at":"2026-07-05T01:16:35.862821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:35.862821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Descent-to-Delete: Gradient-Based Methods for Machine Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aaron Roth, Saeed Sharifi-Malvajerdi, Seth Neel","submitted_at":"2020-07-06T17:54:35Z","abstract_excerpt":"We study the data deletion problem for convex models. By leveraging techniques from convex optimization and reservoir sampling, we give the first data deletion algorithms that are able to handle an arbitrarily long sequence of adversarial updates while promising both per-deletion run-time and steady-state error that do not grow with the length of the update sequence. We also introduce several new conceptual distinctions: for example, we can ask that after a deletion, the entire state maintained by the optimization algorithm is statistically indistinguishable from the state that would have resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02923","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/2007.02923/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":"2007.02923","created_at":"2026-07-05T01:16:35.862883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02923v1","created_at":"2026-07-05T01:16:35.862883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02923","created_at":"2026-07-05T01:16:35.862883+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVEXQHXONJBX","created_at":"2026-07-05T01:16:35.862883+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVEXQHXONJBX552E","created_at":"2026-07-05T01:16:35.862883+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVEXQHXO","created_at":"2026-07-05T01:16:35.862883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27804","citing_title":"Machine Unlearning for Class Removal through SISA-based Deep Neural Network Architectures","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX","json":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX.json","graph_json":"https://pith.science/api/pith-number/SVEXQHXONJBX552EZ27FO3EZYX/graph.json","events_json":"https://pith.science/api/pith-number/SVEXQHXONJBX552EZ27FO3EZYX/events.json","paper":"https://pith.science/paper/SVEXQHXO"},"agent_actions":{"view_html":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX","download_json":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX.json","view_paper":"https://pith.science/paper/SVEXQHXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02923&json=true","fetch_graph":"https://pith.science/api/pith-number/SVEXQHXONJBX552EZ27FO3EZYX/graph.json","fetch_events":"https://pith.science/api/pith-number/SVEXQHXONJBX552EZ27FO3EZYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/action/storage_attestation","attest_author":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/action/author_attestation","sign_citation":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/action/citation_signature","submit_replication":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/action/replication_record"}},"created_at":"2026-07-05T01:16:35.862883+00:00","updated_at":"2026-07-05T01:16:35.862883+00:00"}