{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VFRA44KA4FNLVHKCXEKAVRLXV6","short_pith_number":"pith:VFRA44KA","schema_version":"1.0","canonical_sha256":"a9620e7140e15aba9d42b9140ac577afba2adddc5d46a7bc40213c9c5b2a1ae8","source":{"kind":"arxiv","id":"2406.07687","version":1},"attestation_state":"computed","paper":{"title":"Adversarial Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Sixie Yu, Yang Liu, Yevgeniy Vorobeychik, Zonglin Di","submitted_at":"2024-06-11T20:07:22Z","abstract_excerpt":"This paper focuses on the challenge of machine unlearning, aiming to remove the influence of specific training data on machine learning models. Traditionally, the development of unlearning algorithms runs parallel with that of membership inference attacks (MIA), a type of privacy threat to determine whether a data instance was used for training. However, the two strands are intimately connected: one can view machine unlearning through the lens of MIA success with respect to removed data. Recognizing this connection, we propose a game-theoretic framework that integrates MIAs into the design of "},"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.07687","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-11T20:07:22Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"17798558a1bd3d1ba6488c7812b11ddce2e7826962c706db4f97f15ef391f572","abstract_canon_sha256":"b4c8b170eab4df14446214c30e52297011dc1c88b87f6e8d7a483c505544049d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:36.795382Z","signature_b64":"2nevQPJt7wEztPQ8ortEiWWACjeuLFui59zMy0wCxoo1E3gH4+nXvN9JzjO7GvfM9funtZbbhyO6uzajjCOPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9620e7140e15aba9d42b9140ac577afba2adddc5d46a7bc40213c9c5b2a1ae8","last_reissued_at":"2026-07-05T08:30:36.794889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:36.794889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Sixie Yu, Yang Liu, Yevgeniy Vorobeychik, Zonglin Di","submitted_at":"2024-06-11T20:07:22Z","abstract_excerpt":"This paper focuses on the challenge of machine unlearning, aiming to remove the influence of specific training data on machine learning models. Traditionally, the development of unlearning algorithms runs parallel with that of membership inference attacks (MIA), a type of privacy threat to determine whether a data instance was used for training. However, the two strands are intimately connected: one can view machine unlearning through the lens of MIA success with respect to removed data. Recognizing this connection, we propose a game-theoretic framework that integrates MIAs into the design of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07687","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/2406.07687/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.07687","created_at":"2026-07-05T08:30:36.794950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07687v1","created_at":"2026-07-05T08:30:36.794950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07687","created_at":"2026-07-05T08:30:36.794950+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFRA44KA4FNL","created_at":"2026-07-05T08:30:36.794950+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFRA44KA4FNLVHKC","created_at":"2026-07-05T08:30:36.794950+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFRA44KA","created_at":"2026-07-05T08:30:36.794950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.13312","citing_title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6","json":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6.json","graph_json":"https://pith.science/api/pith-number/VFRA44KA4FNLVHKCXEKAVRLXV6/graph.json","events_json":"https://pith.science/api/pith-number/VFRA44KA4FNLVHKCXEKAVRLXV6/events.json","paper":"https://pith.science/paper/VFRA44KA"},"agent_actions":{"view_html":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6","download_json":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6.json","view_paper":"https://pith.science/paper/VFRA44KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07687&json=true","fetch_graph":"https://pith.science/api/pith-number/VFRA44KA4FNLVHKCXEKAVRLXV6/graph.json","fetch_events":"https://pith.science/api/pith-number/VFRA44KA4FNLVHKCXEKAVRLXV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6/action/storage_attestation","attest_author":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6/action/author_attestation","sign_citation":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6/action/citation_signature","submit_replication":"https://pith.science/pith/VFRA44KA4FNLVHKCXEKAVRLXV6/action/replication_record"}},"created_at":"2026-07-05T08:30:36.794950+00:00","updated_at":"2026-07-05T08:30:36.794950+00:00"}