{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZCMJGL74N4DQIRBRQ2AY2XN3TE","short_pith_number":"pith:ZCMJGL74","schema_version":"1.0","canonical_sha256":"c898932ffc6f0704443186818d5dbb9908e0cd33fd789a225d618d23cbb79535","source":{"kind":"arxiv","id":"2402.11989","version":3},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Low-Rank Adaptation against Membership Inference Attacks for Latent Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Di Wang, Feng Liu, Jingfeng Zhang, Xilie Xu, Yun Sing Koh, Zihao Luo","submitted_at":"2024-02-19T09:32:48Z","abstract_excerpt":"Low-rank adaptation (LoRA) is an efficient strategy for adapting latent diffusion models (LDMs) on a private dataset to generate specific images by minimizing the adaptation loss. However, the LoRA-adapted LDMs are vulnerable to membership inference (MI) attacks that can judge whether a particular data point belongs to the private dataset, thus leading to the privacy leakage. To defend against MI attacks, we first propose a straightforward solution: Membership-Privacy-preserving LoRA (MP-LoRA). MP-LoRA is formulated as a min-max optimization problem where a proxy attack model is trained by max"},"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.11989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-19T09:32:48Z","cross_cats_sorted":["cs.CR","cs.CV"],"title_canon_sha256":"00093486419e0c7b59f19bdb9d14f87247abe1e42abaa36748ac1eff85f6710c","abstract_canon_sha256":"18c576de7fb1d96b2dc250b256e9ae08b13b0739c2363a6bde83855147f61a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:02.519554Z","signature_b64":"QEBvYi8BIIujEOibPjUCaUI3JI41p8BN480fX4rxquGD7/fFehb/AMeZRzRvUFGjfyRYD28gAa7LP/21S3KaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c898932ffc6f0704443186818d5dbb9908e0cd33fd789a225d618d23cbb79535","last_reissued_at":"2026-07-05T09:49:02.519030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:02.519030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Low-Rank Adaptation against Membership Inference Attacks for Latent Diffusion Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Di Wang, Feng Liu, Jingfeng Zhang, Xilie Xu, Yun Sing Koh, Zihao Luo","submitted_at":"2024-02-19T09:32:48Z","abstract_excerpt":"Low-rank adaptation (LoRA) is an efficient strategy for adapting latent diffusion models (LDMs) on a private dataset to generate specific images by minimizing the adaptation loss. However, the LoRA-adapted LDMs are vulnerable to membership inference (MI) attacks that can judge whether a particular data point belongs to the private dataset, thus leading to the privacy leakage. To defend against MI attacks, we first propose a straightforward solution: Membership-Privacy-preserving LoRA (MP-LoRA). MP-LoRA is formulated as a min-max optimization problem where a proxy attack model is trained by max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11989","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/2402.11989/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.11989","created_at":"2026-07-05T09:49:02.519100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11989v3","created_at":"2026-07-05T09:49:02.519100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11989","created_at":"2026-07-05T09:49:02.519100+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCMJGL74N4DQ","created_at":"2026-07-05T09:49:02.519100+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCMJGL74N4DQIRBR","created_at":"2026-07-05T09:49:02.519100+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCMJGL74","created_at":"2026-07-05T09:49:02.519100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22050","citing_title":"Broken Memories: Detecting and Mitigating Memorization in Diffusion Models with Degraded Generations","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22050","citing_title":"Broken Memories: Detecting and Mitigating Memorization in Diffusion Models with Degraded Generations","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22050","citing_title":"Broken Memories: Detecting and Mitigating Memorization in Diffusion Models with Degraded Generations","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE","json":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE.json","graph_json":"https://pith.science/api/pith-number/ZCMJGL74N4DQIRBRQ2AY2XN3TE/graph.json","events_json":"https://pith.science/api/pith-number/ZCMJGL74N4DQIRBRQ2AY2XN3TE/events.json","paper":"https://pith.science/paper/ZCMJGL74"},"agent_actions":{"view_html":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE","download_json":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE.json","view_paper":"https://pith.science/paper/ZCMJGL74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11989&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCMJGL74N4DQIRBRQ2AY2XN3TE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCMJGL74N4DQIRBRQ2AY2XN3TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE/action/storage_attestation","attest_author":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE/action/author_attestation","sign_citation":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE/action/citation_signature","submit_replication":"https://pith.science/pith/ZCMJGL74N4DQIRBRQ2AY2XN3TE/action/replication_record"}},"created_at":"2026-07-05T09:49:02.519100+00:00","updated_at":"2026-07-05T09:49:02.519100+00:00"}