{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AM4RB2TKAXOCZMYKT4TA5D7WSC","short_pith_number":"pith:AM4RB2TK","schema_version":"1.0","canonical_sha256":"033910ea6a05dc2cb30a9f260e8ff69090c2417050a6c4445aaefe82944c38ca","source":{"kind":"arxiv","id":"2406.16257","version":3},"attestation_state":"computed","paper":{"title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arijit Sehanobish, Avinava Dubey, Krzysztof Choromanski, Snigdha Chaturvedi, Somnath Basu Roy Chowdhury","submitted_at":"2024-06-24T01:45:13Z","abstract_excerpt":"Machine unlearning is the process of efficiently removing the influence of a training data instance from a trained machine learning model without retraining it from scratch. A popular subclass of unlearning approaches is exact machine unlearning, which focuses on techniques that explicitly guarantee the removal of the influence of a data instance from a model. Exact unlearning approaches use a machine learning model in which individual components are trained on disjoint subsets of the data. During deletion, exact unlearning approaches only retrain the affected components rather than the entire"},"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":"2406.16257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T01:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"a603fe4ccba862ab16bda38fb346d92fa519eeec3a3c6f7aa55fcd49e5b45988","abstract_canon_sha256":"20ddc4cd2da996d40baea13149ae2a11e4b09cbcc41bc08b6d3445c8408d63b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:47.557449Z","signature_b64":"i5oa8RcwjPywz8rjPUsK2XOhn8qln9QKnU6OsintyqerHdcZfkmtOuPZfIGtMBWqAPQDgC8x/xjXzBYXz7zwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033910ea6a05dc2cb30a9f260e8ff69090c2417050a6c4445aaefe82944c38ca","last_reissued_at":"2026-07-05T10:22:47.556633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:47.556633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arijit Sehanobish, Avinava Dubey, Krzysztof Choromanski, Snigdha Chaturvedi, Somnath Basu Roy Chowdhury","submitted_at":"2024-06-24T01:45:13Z","abstract_excerpt":"Machine unlearning is the process of efficiently removing the influence of a training data instance from a trained machine learning model without retraining it from scratch. A popular subclass of unlearning approaches is exact machine unlearning, which focuses on techniques that explicitly guarantee the removal of the influence of a data instance from a model. Exact unlearning approaches use a machine learning model in which individual components are trained on disjoint subsets of the data. During deletion, exact unlearning approaches only retrain the affected components rather than the entire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16257","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/2406.16257/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":"2406.16257","created_at":"2026-07-05T10:22:47.556729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16257v3","created_at":"2026-07-05T10:22:47.556729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16257","created_at":"2026-07-05T10:22:47.556729+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM4RB2TKAXOC","created_at":"2026-07-05T10:22:47.556729+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM4RB2TKAXOCZMYK","created_at":"2026-07-05T10:22:47.556729+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM4RB2TK","created_at":"2026-07-05T10:22:47.556729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19220","citing_title":"Machine Unlearning for the XGBoost Model with Network Intrusion Datasets","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2506.20941","citing_title":"Revisiting the Past: Data Unlearning with Model State History","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2509.05865","citing_title":"The Measure of Deception: An Analysis of Data Forging in Machine Unlearning","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC","json":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC.json","graph_json":"https://pith.science/api/pith-number/AM4RB2TKAXOCZMYKT4TA5D7WSC/graph.json","events_json":"https://pith.science/api/pith-number/AM4RB2TKAXOCZMYKT4TA5D7WSC/events.json","paper":"https://pith.science/paper/AM4RB2TK"},"agent_actions":{"view_html":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC","download_json":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC.json","view_paper":"https://pith.science/paper/AM4RB2TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16257&json=true","fetch_graph":"https://pith.science/api/pith-number/AM4RB2TKAXOCZMYKT4TA5D7WSC/graph.json","fetch_events":"https://pith.science/api/pith-number/AM4RB2TKAXOCZMYKT4TA5D7WSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC/action/storage_attestation","attest_author":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC/action/author_attestation","sign_citation":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC/action/citation_signature","submit_replication":"https://pith.science/pith/AM4RB2TKAXOCZMYKT4TA5D7WSC/action/replication_record"}},"created_at":"2026-07-05T10:22:47.556729+00:00","updated_at":"2026-07-05T10:22:47.556729+00:00"}