{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SVEXQHXONJBX552EZ27FO3EZYX","short_pith_number":"pith:SVEXQHXO","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"},"canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","source":{"kind":"arxiv","id":"2007.02923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02923","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02923v1","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02923","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"SVEXQHXONJBX","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_16","alias_value":"SVEXQHXONJBX552E","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_8","alias_value":"SVEXQHXO","created_at":"2026-07-05T01:16:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SVEXQHXONJBX552EZ27FO3EZYX","target":"record","payload":{"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"},"canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","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"},"source_kind":"arxiv","source_id":"2007.02923","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-05T01:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlCMLKbO7WO/H0m2mW3MNLZy+8aM06aoeIaDMD9IfKOYC3Pr4IhQ8ezyicbjv8b7TIkbVpmIjiWMDwmJkieEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:49:59.426374Z"},"content_sha256":"8015097f28d6e280dc1a7cf9f98e58264babb12917e4e5692a95299c465df71b","schema_version":"1.0","event_id":"sha256:8015097f28d6e280dc1a7cf9f98e58264babb12917e4e5692a95299c465df71b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SVEXQHXONJBX552EZ27FO3EZYX","target":"graph","payload":{"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"},"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-05T01:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kG4bfVwGSmMytbSZ7qYzp+l0oXNOgJnru8arcjIvZXs8Td6Ai7BVzEMquEXyJ4N8RY6fF8+D6Is/pMzyyPkCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:49:59.426904Z"},"content_sha256":"4fe3ea660bedcade22407d397143af7b182ba7648ddd6068566269ce3af7555c","schema_version":"1.0","event_id":"sha256:4fe3ea660bedcade22407d397143af7b182ba7648ddd6068566269ce3af7555c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/bundle.json","state_url":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVEXQHXONJBX552EZ27FO3EZYX/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-11T13:49:59Z","links":{"resolver":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX","bundle":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/bundle.json","state":"https://pith.science/pith/SVEXQHXONJBX552EZ27FO3EZYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVEXQHXONJBX552EZ27FO3EZYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SVEXQHXONJBX552EZ27FO3EZYX","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":"febaba212773491fa81cb91df6ec493e245f6f64744730d96fda486d2f65e696","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-06T17:54:35Z","title_canon_sha256":"743cdf4484e12fc3e2768c23a75854e8a3a56f8d3d1ea48b9d28432fbe2498d5"},"schema_version":"1.0","source":{"id":"2007.02923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02923","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02923v1","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02923","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"SVEXQHXONJBX","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_16","alias_value":"SVEXQHXONJBX552E","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_8","alias_value":"SVEXQHXO","created_at":"2026-07-05T01:16:35Z"}],"graph_snapshots":[{"event_id":"sha256:4fe3ea660bedcade22407d397143af7b182ba7648ddd6068566269ce3af7555c","target":"graph","created_at":"2026-07-05T01:16:35Z","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/2007.02923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aaron Roth, Saeed Sharifi-Malvajerdi, Seth Neel","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-06T17:54:35Z","title":"Descent-to-Delete: Gradient-Based Methods for Machine Unlearning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02923","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:8015097f28d6e280dc1a7cf9f98e58264babb12917e4e5692a95299c465df71b","target":"record","created_at":"2026-07-05T01:16:35Z","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":"febaba212773491fa81cb91df6ec493e245f6f64744730d96fda486d2f65e696","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-06T17:54:35Z","title_canon_sha256":"743cdf4484e12fc3e2768c23a75854e8a3a56f8d3d1ea48b9d28432fbe2498d5"},"schema_version":"1.0","source":{"id":"2007.02923","kind":"arxiv","version":1}},"canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9549781eee6a437ef744cebe576c99c5ef63c2691dd64dc3485ef7f39a89dfad","first_computed_at":"2026-07-05T01:16:35.862821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:35.862821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R3CNRMtYJpPyrRT/atjbD+23pZUvzVSKasJAWdhE43PcIxqSiGxPoikvz8pGrtQjCP77NkLEQ/hGQ5XEnTb7Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:35.863307Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.02923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8015097f28d6e280dc1a7cf9f98e58264babb12917e4e5692a95299c465df71b","sha256:4fe3ea660bedcade22407d397143af7b182ba7648ddd6068566269ce3af7555c"],"state_sha256":"cba20867cb6094cb68eee40caaa699f5d9a40b0dca27125ae0e9a061bb0071eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1cV/YQwtMrOSYOUp0Vyfh43O1jvw2E55Y5J/lUuNg9J0VBg/Kmb7MW4ygPmrDMDouV+4a4+9XaWvrJqXp2zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:49:59.431443Z","bundle_sha256":"f2f6f2e08612208b99199b85568482f40c34d0850d4991c2ddcbbd8cd9c3a4b4"}}