{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AC4IWOM3IESTKLXMOZ2HB373TT","short_pith_number":"pith:AC4IWOM3","schema_version":"1.0","canonical_sha256":"00b88b399b4125352eec767470effb9cd1a2fd7749b024701d4c22d64d724afd","source":{"kind":"arxiv","id":"2210.00036","version":3},"attestation_state":"computed","paper":{"title":"Differentially Private Bias-Term Fine-tuning of Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"George Karypis, Sheng Zha, Yu-Xiang Wang, Zhiqi Bu","submitted_at":"2022-09-30T18:30:48Z","abstract_excerpt":"We study the problem of differentially private (DP) fine-tuning of large pre-trained models -- a recent privacy-preserving approach suitable for solving downstream tasks with sensitive data. Existing work has demonstrated that high accuracy is possible under strong privacy constraint, yet requires significant computational overhead or modifications to the network architecture. We propose differentially private bias-term fine-tuning (DP-BiTFiT), which matches the state-of-the-art accuracy for DP algorithms and the efficiency of the standard BiTFiT. DP-BiTFiT is model agnostic (not modifying the"},"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":"2210.00036","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T18:30:48Z","cross_cats_sorted":["cs.CL","cs.CR","cs.CV"],"title_canon_sha256":"1bd3bdb692ff460e9a7a62b0a9d223de93615e1c66394e09267a3290d37fb024","abstract_canon_sha256":"17a719bcce901629ab38ba6960f4ff749e1d2e1721150201309035a4a00ca7ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:01.101008Z","signature_b64":"nSzocQlxDxUCJ8T4mVKb+wmVC/e8mEIlsn94iD5f/meMkZi4Se4ZuqVrC2n5PJG7BeaGYPmKiP+JUxE4nV2MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00b88b399b4125352eec767470effb9cd1a2fd7749b024701d4c22d64d724afd","last_reissued_at":"2026-07-05T08:34:01.100533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:01.100533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Bias-Term Fine-tuning of Foundation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"George Karypis, Sheng Zha, Yu-Xiang Wang, Zhiqi Bu","submitted_at":"2022-09-30T18:30:48Z","abstract_excerpt":"We study the problem of differentially private (DP) fine-tuning of large pre-trained models -- a recent privacy-preserving approach suitable for solving downstream tasks with sensitive data. Existing work has demonstrated that high accuracy is possible under strong privacy constraint, yet requires significant computational overhead or modifications to the network architecture. We propose differentially private bias-term fine-tuning (DP-BiTFiT), which matches the state-of-the-art accuracy for DP algorithms and the efficiency of the standard BiTFiT. DP-BiTFiT is model agnostic (not modifying the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00036","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/2210.00036/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":"2210.00036","created_at":"2026-07-05T08:34:01.100597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.00036v3","created_at":"2026-07-05T08:34:01.100597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00036","created_at":"2026-07-05T08:34:01.100597+00:00"},{"alias_kind":"pith_short_12","alias_value":"AC4IWOM3IEST","created_at":"2026-07-05T08:34:01.100597+00:00"},{"alias_kind":"pith_short_16","alias_value":"AC4IWOM3IESTKLXM","created_at":"2026-07-05T08:34:01.100597+00:00"},{"alias_kind":"pith_short_8","alias_value":"AC4IWOM3","created_at":"2026-07-05T08:34:01.100597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09125","citing_title":"Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT","json":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT.json","graph_json":"https://pith.science/api/pith-number/AC4IWOM3IESTKLXMOZ2HB373TT/graph.json","events_json":"https://pith.science/api/pith-number/AC4IWOM3IESTKLXMOZ2HB373TT/events.json","paper":"https://pith.science/paper/AC4IWOM3"},"agent_actions":{"view_html":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT","download_json":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT.json","view_paper":"https://pith.science/paper/AC4IWOM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.00036&json=true","fetch_graph":"https://pith.science/api/pith-number/AC4IWOM3IESTKLXMOZ2HB373TT/graph.json","fetch_events":"https://pith.science/api/pith-number/AC4IWOM3IESTKLXMOZ2HB373TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT/action/storage_attestation","attest_author":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT/action/author_attestation","sign_citation":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT/action/citation_signature","submit_replication":"https://pith.science/pith/AC4IWOM3IESTKLXMOZ2HB373TT/action/replication_record"}},"created_at":"2026-07-05T08:34:01.100597+00:00","updated_at":"2026-07-05T08:34:01.100597+00:00"}