{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3Z7WOPWWQGVHAS3GVLFNG7J2HC","short_pith_number":"pith:3Z7WOPWW","schema_version":"1.0","canonical_sha256":"de7f673ed681aa704b66aacad37d3a389c34102fe44250321130787859057882","source":{"kind":"arxiv","id":"2506.13048","version":1},"attestation_state":"computed","paper":{"title":"The Space Complexity of Learning-Unlearning Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhishek Shetty, Ayush Sekhari, Nived Rajaraman, Sumegha Garg, Yeshwanth Cherapanamjeri","submitted_at":"2025-06-16T02:31:41Z","abstract_excerpt":"We study the memory complexity of machine unlearning algorithms that provide strong data deletion guarantees to the users. Formally, consider an algorithm for a particular learning task that initially receives a training dataset. Then, after learning, it receives data deletion requests from a subset of users (of arbitrary size), and the goal of unlearning is to perform the task as if the learner never received the data of deleted users. In this paper, we ask how many bits of storage are needed to be able to delete certain training samples at a later time. We focus on the task of realizability "},"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":"2506.13048","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-16T02:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"26eab0216711d65e2f38cb3a79f3635f2ed9f3d00144d4acd5a98447cdb2f429","abstract_canon_sha256":"0871b788122a4d5db13883623829e07e6cf9dc68e72221e6ce053e8629c3e7a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:04.345032Z","signature_b64":"Y41EhhEjKvCl4NhIuGBa79P+KZeVekzDgqpPcQMpStLsyB5EsV+Z5XzMBB7VdzN2A0Zlx3kn/s4nuWgv+cWYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7f673ed681aa704b66aacad37d3a389c34102fe44250321130787859057882","last_reissued_at":"2026-07-05T11:22:04.344588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:04.344588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Space Complexity of Learning-Unlearning Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhishek Shetty, Ayush Sekhari, Nived Rajaraman, Sumegha Garg, Yeshwanth Cherapanamjeri","submitted_at":"2025-06-16T02:31:41Z","abstract_excerpt":"We study the memory complexity of machine unlearning algorithms that provide strong data deletion guarantees to the users. Formally, consider an algorithm for a particular learning task that initially receives a training dataset. Then, after learning, it receives data deletion requests from a subset of users (of arbitrary size), and the goal of unlearning is to perform the task as if the learner never received the data of deleted users. In this paper, we ask how many bits of storage are needed to be able to delete certain training samples at a later time. We focus on the task of realizability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13048","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/2506.13048/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":"2506.13048","created_at":"2026-07-05T11:22:04.344645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13048v1","created_at":"2026-07-05T11:22:04.344645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13048","created_at":"2026-07-05T11:22:04.344645+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z7WOPWWQGVH","created_at":"2026-07-05T11:22:04.344645+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z7WOPWWQGVHAS3G","created_at":"2026-07-05T11:22:04.344645+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z7WOPWW","created_at":"2026-07-05T11:22:04.344645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC","json":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC.json","graph_json":"https://pith.science/api/pith-number/3Z7WOPWWQGVHAS3GVLFNG7J2HC/graph.json","events_json":"https://pith.science/api/pith-number/3Z7WOPWWQGVHAS3GVLFNG7J2HC/events.json","paper":"https://pith.science/paper/3Z7WOPWW"},"agent_actions":{"view_html":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC","download_json":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC.json","view_paper":"https://pith.science/paper/3Z7WOPWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13048&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z7WOPWWQGVHAS3GVLFNG7J2HC/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z7WOPWWQGVHAS3GVLFNG7J2HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC/action/storage_attestation","attest_author":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC/action/author_attestation","sign_citation":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC/action/citation_signature","submit_replication":"https://pith.science/pith/3Z7WOPWWQGVHAS3GVLFNG7J2HC/action/replication_record"}},"created_at":"2026-07-05T11:22:04.344645+00:00","updated_at":"2026-07-05T11:22:04.344645+00:00"}