{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4QHTALJGBDSLQ7FHZ3N2DR7D7M","short_pith_number":"pith:4QHTALJG","schema_version":"1.0","canonical_sha256":"e40f302d2608e4b87ca7cedba1c7e3fb0f0f67d9abd15c11d3fb1509063200b8","source":{"kind":"arxiv","id":"2410.23232","version":2},"attestation_state":"computed","paper":{"title":"Attribute-to-Delete: Machine Unlearning via Datamodel Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksander Madry, Andrew Ilyas, Kristian Georgiev, Roy Rinberg, Seth Neel, Shivam Garg, Sung Min Park","submitted_at":"2024-10-30T17:20:10Z","abstract_excerpt":"Machine unlearning -- efficiently removing the effect of a small \"forget set\" of training data on a pre-trained machine learning model -- has recently attracted significant research interest. Despite this interest, however, recent work shows that existing machine unlearning techniques do not hold up to thorough evaluation in non-convex settings. In this work, we introduce a new machine unlearning technique that exhibits strong empirical performance even in such challenging settings. Our starting point is the perspective that the goal of unlearning is to produce a model whose outputs are statis"},"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":"2410.23232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-30T17:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"b81015ea54fd016db3adba3e25561df9879b9f94109af64164e09dd70a020eb9","abstract_canon_sha256":"208553e93d8353603eac11e0a4dcd83fedc2a83e3d9898b515fa4cee57914491"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:00.444447Z","signature_b64":"CNFPc2gqJQ2t/GnafUXh/8l+GuZMydRIlSl2NbZ9JKmaX8gvbTemQ/m4yVtaC+gAVEowjXuANZ7reCAl3EPWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40f302d2608e4b87ca7cedba1c7e3fb0f0f67d9abd15c11d3fb1509063200b8","last_reissued_at":"2026-07-05T09:34:00.444002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:00.444002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attribute-to-Delete: Machine Unlearning via Datamodel Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksander Madry, Andrew Ilyas, Kristian Georgiev, Roy Rinberg, Seth Neel, Shivam Garg, Sung Min Park","submitted_at":"2024-10-30T17:20:10Z","abstract_excerpt":"Machine unlearning -- efficiently removing the effect of a small \"forget set\" of training data on a pre-trained machine learning model -- has recently attracted significant research interest. Despite this interest, however, recent work shows that existing machine unlearning techniques do not hold up to thorough evaluation in non-convex settings. In this work, we introduce a new machine unlearning technique that exhibits strong empirical performance even in such challenging settings. Our starting point is the perspective that the goal of unlearning is to produce a model whose outputs are statis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23232","kind":"arxiv","version":2},"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/2410.23232/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":"2410.23232","created_at":"2026-07-05T09:34:00.444056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23232v2","created_at":"2026-07-05T09:34:00.444056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23232","created_at":"2026-07-05T09:34:00.444056+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QHTALJGBDSL","created_at":"2026-07-05T09:34:00.444056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QHTALJGBDSLQ7FH","created_at":"2026-07-05T09:34:00.444056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QHTALJG","created_at":"2026-07-05T09:34:00.444056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30919","citing_title":"De-attribute to Forget for LLM Unlearning","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M","json":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M.json","graph_json":"https://pith.science/api/pith-number/4QHTALJGBDSLQ7FHZ3N2DR7D7M/graph.json","events_json":"https://pith.science/api/pith-number/4QHTALJGBDSLQ7FHZ3N2DR7D7M/events.json","paper":"https://pith.science/paper/4QHTALJG"},"agent_actions":{"view_html":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M","download_json":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M.json","view_paper":"https://pith.science/paper/4QHTALJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23232&json=true","fetch_graph":"https://pith.science/api/pith-number/4QHTALJGBDSLQ7FHZ3N2DR7D7M/graph.json","fetch_events":"https://pith.science/api/pith-number/4QHTALJGBDSLQ7FHZ3N2DR7D7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M/action/storage_attestation","attest_author":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M/action/author_attestation","sign_citation":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M/action/citation_signature","submit_replication":"https://pith.science/pith/4QHTALJGBDSLQ7FHZ3N2DR7D7M/action/replication_record"}},"created_at":"2026-07-05T09:34:00.444056+00:00","updated_at":"2026-07-05T09:34:00.444056+00:00"}