{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7ULP5JMXTQNG3Q34FNETNF3AVX","short_pith_number":"pith:7ULP5JMX","schema_version":"1.0","canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","source":{"kind":"arxiv","id":"2106.15093","version":3},"attestation_state":"computed","paper":{"title":"Certifiable Machine Unlearning for Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Ananth Mahadevan, Michael Mathioudakis","submitted_at":"2021-06-29T05:05:58Z","abstract_excerpt":"Machine unlearning is the task of updating machine learning (ML) models after a subset of the training data they were trained on is deleted. Methods for the task are desired to combine effectiveness and efficiency, i.e., they should effectively \"unlearn\" deleted data, but in a way that does not require excessive computation effort (e.g., a full retraining) for a small amount of deletions. Such a combination is typically achieved by tolerating some amount of approximation in the unlearning. In addition, laws and regulations in the spirit of \"the right to be forgotten\" have given rise to require"},"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.15093","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T05:05:58Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"8ce851d5c8c8c62c45a06aa62e5f3880e5d4f2125071cf8ba6cb816a4c658b87","abstract_canon_sha256":"2d7ac9070af1808f2a5cd9be1c3db099a2b84b8b7ad6ce2d7503bf0e021a88fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:51.576695Z","signature_b64":"Z4ppHUSa2jdMDh9oneuw5GzyI50STWX3dnAI1qQPqsCoAvs3+AQgImOV88JVifeVKmgsIxNX1kJv9UW+2BuZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","last_reissued_at":"2026-07-05T03:05:51.576258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:51.576258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certifiable Machine Unlearning for Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Ananth Mahadevan, Michael Mathioudakis","submitted_at":"2021-06-29T05:05:58Z","abstract_excerpt":"Machine unlearning is the task of updating machine learning (ML) models after a subset of the training data they were trained on is deleted. Methods for the task are desired to combine effectiveness and efficiency, i.e., they should effectively \"unlearn\" deleted data, but in a way that does not require excessive computation effort (e.g., a full retraining) for a small amount of deletions. Such a combination is typically achieved by tolerating some amount of approximation in the unlearning. In addition, laws and regulations in the spirit of \"the right to be forgotten\" have given rise to require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15093","kind":"arxiv","version":3},"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.15093/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.15093","created_at":"2026-07-05T03:05:51.576322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.15093v3","created_at":"2026-07-05T03:05:51.576322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15093","created_at":"2026-07-05T03:05:51.576322+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ULP5JMXTQNG","created_at":"2026-07-05T03:05:51.576322+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ULP5JMXTQNG3Q34","created_at":"2026-07-05T03:05:51.576322+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ULP5JMX","created_at":"2026-07-05T03:05:51.576322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17122","citing_title":"TrustErase: Auditable Instant Machine Unlearning with Passport-Embedded Representations","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2405.07406","citing_title":"Machine Unlearning: A Comprehensive Survey","ref_index":111,"is_internal_anchor":false},{"citing_arxiv_id":"2408.00920","citing_title":"Towards Certified Unlearning for Deep Neural Networks","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX","json":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX.json","graph_json":"https://pith.science/api/pith-number/7ULP5JMXTQNG3Q34FNETNF3AVX/graph.json","events_json":"https://pith.science/api/pith-number/7ULP5JMXTQNG3Q34FNETNF3AVX/events.json","paper":"https://pith.science/paper/7ULP5JMX"},"agent_actions":{"view_html":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX","download_json":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX.json","view_paper":"https://pith.science/paper/7ULP5JMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.15093&json=true","fetch_graph":"https://pith.science/api/pith-number/7ULP5JMXTQNG3Q34FNETNF3AVX/graph.json","fetch_events":"https://pith.science/api/pith-number/7ULP5JMXTQNG3Q34FNETNF3AVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/action/storage_attestation","attest_author":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/action/author_attestation","sign_citation":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/action/citation_signature","submit_replication":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/action/replication_record"}},"created_at":"2026-07-05T03:05:51.576322+00:00","updated_at":"2026-07-05T03:05:51.576322+00:00"}