{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CNEARVIHQ7NSX6BBQ3GJ3EPEJC","short_pith_number":"pith:CNEARVIH","schema_version":"1.0","canonical_sha256":"134808d50787db2bf82186cc9d91e4489bc21ee8c771ea0a88e0ce76db997fab","source":{"kind":"arxiv","id":"2402.00351","version":2},"attestation_state":"computed","paper":{"title":"Machine Unlearning for Image-to-Image Generative Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chun-Fu Chen, Guihong Li, Hsiang Hsu, Radu Marculescu","submitted_at":"2024-02-01T05:35:25Z","abstract_excerpt":"Machine unlearning has emerged as a new paradigm to deliberately forget data samples from a given model in order to adhere to stringent regulations. However, existing machine unlearning methods have been primarily focused on classification models, leaving the landscape of unlearning for generative models relatively unexplored. This paper serves as a bridge, addressing the gap by providing a unifying framework of machine unlearning for image-to-image generative models. Within this framework, we propose a computationally-efficient algorithm, underpinned by rigorous theoretical analysis, that dem"},"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":"2402.00351","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-01T05:35:25Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"69774b07fe2a15c69de509d782b53f9db6c65fd2b26231df3da3f8317e4edd8a","abstract_canon_sha256":"6a58f9644884d4ec20f9286cd23f25d46d926e8c2df414a081e3ba3a3d1b655f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:27.114947Z","signature_b64":"7VkWC9BrvBS9vBx7/EV175F+P6HgHvdoBc4t8+18dounaZX6OoCdJ6z0pGoyUqV/0Q0KBfbhsoA0EguO0jb2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"134808d50787db2bf82186cc9d91e4489bc21ee8c771ea0a88e0ce76db997fab","last_reissued_at":"2026-07-05T07:40:27.114436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:27.114436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Unlearning for Image-to-Image Generative Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chun-Fu Chen, Guihong Li, Hsiang Hsu, Radu Marculescu","submitted_at":"2024-02-01T05:35:25Z","abstract_excerpt":"Machine unlearning has emerged as a new paradigm to deliberately forget data samples from a given model in order to adhere to stringent regulations. However, existing machine unlearning methods have been primarily focused on classification models, leaving the landscape of unlearning for generative models relatively unexplored. This paper serves as a bridge, addressing the gap by providing a unifying framework of machine unlearning for image-to-image generative models. Within this framework, we propose a computationally-efficient algorithm, underpinned by rigorous theoretical analysis, that dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00351","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/2402.00351/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":"2402.00351","created_at":"2026-07-05T07:40:27.114495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00351v2","created_at":"2026-07-05T07:40:27.114495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00351","created_at":"2026-07-05T07:40:27.114495+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNEARVIHQ7NS","created_at":"2026-07-05T07:40:27.114495+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNEARVIHQ7NSX6BB","created_at":"2026-07-05T07:40:27.114495+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNEARVIH","created_at":"2026-07-05T07:40:27.114495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2405.07406","citing_title":"Machine Unlearning: A Comprehensive Survey","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09391","citing_title":"Efficient Unlearning through Maximizing Relearning Convergence Delay","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":171,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC","json":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC.json","graph_json":"https://pith.science/api/pith-number/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/graph.json","events_json":"https://pith.science/api/pith-number/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/events.json","paper":"https://pith.science/paper/CNEARVIH"},"agent_actions":{"view_html":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC","download_json":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC.json","view_paper":"https://pith.science/paper/CNEARVIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00351&json=true","fetch_graph":"https://pith.science/api/pith-number/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/graph.json","fetch_events":"https://pith.science/api/pith-number/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/action/storage_attestation","attest_author":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/action/author_attestation","sign_citation":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/action/citation_signature","submit_replication":"https://pith.science/pith/CNEARVIHQ7NSX6BBQ3GJ3EPEJC/action/replication_record"}},"created_at":"2026-07-05T07:40:27.114495+00:00","updated_at":"2026-07-05T07:40:27.114495+00:00"}