{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NVOWAF7TXMTFPGVNB2FWLVF5LF","short_pith_number":"pith:NVOWAF7T","schema_version":"1.0","canonical_sha256":"6d5d6017f3bb26579aad0e8b65d4bd594dfb351ded47669b460ad60c7f65402a","source":{"kind":"arxiv","id":"2312.01235","version":2},"attestation_state":"computed","paper":{"title":"Strategic Data Revocation in Federated Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ermin Wei, Ningning Ding, Randall Berry","submitted_at":"2023-12-02T21:57:44Z","abstract_excerpt":"By allowing users to erase their data's impact on federated learning models, federated unlearning protects users' right to be forgotten and data privacy. Despite a burgeoning body of research on federated unlearning's technical feasibility, there is a paucity of literature investigating the considerations behind users' requests for data revocation. This paper proposes a non-cooperative game framework to study users' data revocation strategies in federated unlearning. We prove the existence of a Nash equilibrium. However, users' best response strategies are coupled via model performance and unl"},"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":"2312.01235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-12-02T21:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"5ceff5943fcf1ea40c862165e413e36dbf69e2b96910d3a22e182614969d5061","abstract_canon_sha256":"b571f55ef47bf41ccc44b72a6680e74177dab09f03f7b9397a4abf166b960790"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:13.029107Z","signature_b64":"R5vMXKeR+Bz09M61jnSgmcEKxUeTf1FuZfSj5cpJHPE21JCIBwVkiddsq30711j5mtlEKOzL2ksG539z17mUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d5d6017f3bb26579aad0e8b65d4bd594dfb351ded47669b460ad60c7f65402a","last_reissued_at":"2026-07-05T07:21:13.028620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:13.028620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategic Data Revocation in Federated Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ermin Wei, Ningning Ding, Randall Berry","submitted_at":"2023-12-02T21:57:44Z","abstract_excerpt":"By allowing users to erase their data's impact on federated learning models, federated unlearning protects users' right to be forgotten and data privacy. Despite a burgeoning body of research on federated unlearning's technical feasibility, there is a paucity of literature investigating the considerations behind users' requests for data revocation. This paper proposes a non-cooperative game framework to study users' data revocation strategies in federated unlearning. We prove the existence of a Nash equilibrium. However, users' best response strategies are coupled via model performance and unl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01235","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/2312.01235/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":"2312.01235","created_at":"2026-07-05T07:21:13.028682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.01235v2","created_at":"2026-07-05T07:21:13.028682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01235","created_at":"2026-07-05T07:21:13.028682+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVOWAF7TXMTF","created_at":"2026-07-05T07:21:13.028682+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVOWAF7TXMTFPGVN","created_at":"2026-07-05T07:21:13.028682+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVOWAF7T","created_at":"2026-07-05T07:21:13.028682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05529","citing_title":"Upcycling Noise for Federated Unlearning","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF","json":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF.json","graph_json":"https://pith.science/api/pith-number/NVOWAF7TXMTFPGVNB2FWLVF5LF/graph.json","events_json":"https://pith.science/api/pith-number/NVOWAF7TXMTFPGVNB2FWLVF5LF/events.json","paper":"https://pith.science/paper/NVOWAF7T"},"agent_actions":{"view_html":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF","download_json":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF.json","view_paper":"https://pith.science/paper/NVOWAF7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.01235&json=true","fetch_graph":"https://pith.science/api/pith-number/NVOWAF7TXMTFPGVNB2FWLVF5LF/graph.json","fetch_events":"https://pith.science/api/pith-number/NVOWAF7TXMTFPGVNB2FWLVF5LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF/action/storage_attestation","attest_author":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF/action/author_attestation","sign_citation":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF/action/citation_signature","submit_replication":"https://pith.science/pith/NVOWAF7TXMTFPGVNB2FWLVF5LF/action/replication_record"}},"created_at":"2026-07-05T07:21:13.028682+00:00","updated_at":"2026-07-05T07:21:13.028682+00:00"}