{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7V2JM3DGXKIWVGT47TLLLGYGCK","short_pith_number":"pith:7V2JM3DG","schema_version":"1.0","canonical_sha256":"fd74966c66ba916a9a7cfcd6b59b0612b5feb213c41759e57bf4c01a86541101","source":{"kind":"arxiv","id":"2505.07329","version":1},"attestation_state":"computed","paper":{"title":"Private LoRA Fine-tuning of Open-Source LLMs with Homomorphic Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Andrei Stoian, Arthur Meyre, Jakub Klemsa, Jordan Frery, Roman Bredehoft","submitted_at":"2025-05-12T08:14:33Z","abstract_excerpt":"Preserving data confidentiality during the fine-tuning of open-source Large Language Models (LLMs) is crucial for sensitive applications. This work introduces an interactive protocol adapting the Low-Rank Adaptation (LoRA) technique for private fine-tuning. Homomorphic Encryption (HE) protects the confidentiality of training data and gradients handled by remote worker nodes performing the bulk of computations involving the base model weights. The data owner orchestrates training, requiring minimal local computing power and memory, thus alleviating the need for expensive client-side GPUs. We de"},"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":"2505.07329","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-05-12T08:14:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"76454f657ed6b9b670626d91619fac3c8d35bba635cb4a08e8349c195ed1cca7","abstract_canon_sha256":"6baf817384700ee33f4096c1c77cc0dbdabe2000340921b5a14d450c26e6ec4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:46.218336Z","signature_b64":"NxaCjROQX+gr4nRHdbl+HSRzDL+NzDz0Oz3vyd1dbuiNQec0CVOdACvgSPNflo8xGfGbziUqj41rh76JCVN/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd74966c66ba916a9a7cfcd6b59b0612b5feb213c41759e57bf4c01a86541101","last_reissued_at":"2026-07-05T11:01:46.217785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:46.217785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private LoRA Fine-tuning of Open-Source LLMs with Homomorphic Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Andrei Stoian, Arthur Meyre, Jakub Klemsa, Jordan Frery, Roman Bredehoft","submitted_at":"2025-05-12T08:14:33Z","abstract_excerpt":"Preserving data confidentiality during the fine-tuning of open-source Large Language Models (LLMs) is crucial for sensitive applications. This work introduces an interactive protocol adapting the Low-Rank Adaptation (LoRA) technique for private fine-tuning. Homomorphic Encryption (HE) protects the confidentiality of training data and gradients handled by remote worker nodes performing the bulk of computations involving the base model weights. The data owner orchestrates training, requiring minimal local computing power and memory, thus alleviating the need for expensive client-side GPUs. We de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07329","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/2505.07329/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":"2505.07329","created_at":"2026-07-05T11:01:46.217857+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.07329v1","created_at":"2026-07-05T11:01:46.217857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07329","created_at":"2026-07-05T11:01:46.217857+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V2JM3DGXKIW","created_at":"2026-07-05T11:01:46.217857+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V2JM3DGXKIWVGT4","created_at":"2026-07-05T11:01:46.217857+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V2JM3DG","created_at":"2026-07-05T11:01:46.217857+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23245","citing_title":"Training Machine Learning Models on Encrypted Data: A Privacy-Preserving Framework using Homomorphic Encryption","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK","json":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK.json","graph_json":"https://pith.science/api/pith-number/7V2JM3DGXKIWVGT47TLLLGYGCK/graph.json","events_json":"https://pith.science/api/pith-number/7V2JM3DGXKIWVGT47TLLLGYGCK/events.json","paper":"https://pith.science/paper/7V2JM3DG"},"agent_actions":{"view_html":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK","download_json":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK.json","view_paper":"https://pith.science/paper/7V2JM3DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.07329&json=true","fetch_graph":"https://pith.science/api/pith-number/7V2JM3DGXKIWVGT47TLLLGYGCK/graph.json","fetch_events":"https://pith.science/api/pith-number/7V2JM3DGXKIWVGT47TLLLGYGCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK/action/storage_attestation","attest_author":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK/action/author_attestation","sign_citation":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK/action/citation_signature","submit_replication":"https://pith.science/pith/7V2JM3DGXKIWVGT47TLLLGYGCK/action/replication_record"}},"created_at":"2026-07-05T11:01:46.217857+00:00","updated_at":"2026-07-05T11:01:46.217857+00:00"}