{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7ULP5JMXTQNG3Q34FNETNF3AVX","short_pith_number":"pith:7ULP5JMX","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"},"canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","source":{"kind":"arxiv","id":"2106.15093","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.15093","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2106.15093v3","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15093","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"7ULP5JMXTQNG","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"7ULP5JMXTQNG3Q34","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"7ULP5JMX","created_at":"2026-07-05T03:05:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7ULP5JMXTQNG3Q34FNETNF3AVX","target":"record","payload":{"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"},"canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","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"},"source_kind":"arxiv","source_id":"2106.15093","source_version":3,"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-05T03:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NN3m8qGyQ/xgvCl3U/7wdZc+dMXcls/3/yS/9cjbWLc5zBIcJm7ZGkVe5IrLD2x2SJnD7Q2Nj2tiGmc5Km3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:41:44.649073Z"},"content_sha256":"4dd182ec9028a5a23c542b2d3d1f3fd48e19feb90ccbb481f754730c6732059b","schema_version":"1.0","event_id":"sha256:4dd182ec9028a5a23c542b2d3d1f3fd48e19feb90ccbb481f754730c6732059b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7ULP5JMXTQNG3Q34FNETNF3AVX","target":"graph","payload":{"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"},"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-05T03:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Csgvw5v2LMvPSYa9D//XbtAeq8t9k4CXk8oF570+7/pHnvMa7ZaxFZ1eJ6nfKaMTlzEgzNJ9ot+l+BD1yyp6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:41:44.649590Z"},"content_sha256":"7c8b0465d4833b644b6a1d72299ed2cbcd7812f2ce6ea96dc025120e9dd9d73d","schema_version":"1.0","event_id":"sha256:7c8b0465d4833b644b6a1d72299ed2cbcd7812f2ce6ea96dc025120e9dd9d73d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/bundle.json","state_url":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/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-06T07:41:44Z","links":{"resolver":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX","bundle":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/bundle.json","state":"https://pith.science/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ULP5JMXTQNG3Q34FNETNF3AVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7ULP5JMXTQNG3Q34FNETNF3AVX","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":"2d7ac9070af1808f2a5cd9be1c3db099a2b84b8b7ad6ce2d7503bf0e021a88fe","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T05:05:58Z","title_canon_sha256":"8ce851d5c8c8c62c45a06aa62e5f3880e5d4f2125071cf8ba6cb816a4c658b87"},"schema_version":"1.0","source":{"id":"2106.15093","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.15093","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2106.15093v3","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15093","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"7ULP5JMXTQNG","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"7ULP5JMXTQNG3Q34","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"7ULP5JMX","created_at":"2026-07-05T03:05:51Z"}],"graph_snapshots":[{"event_id":"sha256:7c8b0465d4833b644b6a1d72299ed2cbcd7812f2ce6ea96dc025120e9dd9d73d","target":"graph","created_at":"2026-07-05T03:05:51Z","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/2106.15093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ananth Mahadevan, Michael Mathioudakis","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T05:05:58Z","title":"Certifiable Machine Unlearning for Linear Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15093","kind":"arxiv","version":3},"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:4dd182ec9028a5a23c542b2d3d1f3fd48e19feb90ccbb481f754730c6732059b","target":"record","created_at":"2026-07-05T03:05:51Z","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":"2d7ac9070af1808f2a5cd9be1c3db099a2b84b8b7ad6ce2d7503bf0e021a88fe","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T05:05:58Z","title_canon_sha256":"8ce851d5c8c8c62c45a06aa62e5f3880e5d4f2125071cf8ba6cb816a4c658b87"},"schema_version":"1.0","source":{"id":"2106.15093","kind":"arxiv","version":3}},"canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd16fea5979c1a6dc37c2b49369760adea1a879b80092f64f33568a0d88018f3","first_computed_at":"2026-07-05T03:05:51.576258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:51.576258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4ppHUSa2jdMDh9oneuw5GzyI50STWX3dnAI1qQPqsCoAvs3+AQgImOV88JVifeVKmgsIxNX1kJv9UW+2BuZDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:51.576695Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.15093","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dd182ec9028a5a23c542b2d3d1f3fd48e19feb90ccbb481f754730c6732059b","sha256:7c8b0465d4833b644b6a1d72299ed2cbcd7812f2ce6ea96dc025120e9dd9d73d"],"state_sha256":"2229e225bc335c261872aa567a120a10520d704bd6d6878ae3d81c5259aef8bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGwRspZCMa2bJNvc8HUO3+A1NQBy18BiKnQp1LeOLPxdX7Aa2CTBbZrM2BKTlxBxQwpxqO0oBQ2uG9e1hGA8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:41:44.653372Z","bundle_sha256":"42771f4786ee404f45b0a620796e0cdc721180fd1a63b496c3182dc02524f3e1"}}