{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZMUTFYO7PUWXPEJ27NQX4KZZGK","short_pith_number":"pith:ZMUTFYO7","schema_version":"1.0","canonical_sha256":"cb2932e1df7d2d77913afb617e2b3932af8e1d74f61fe1db1c2fc95ac531ea6a","source":{"kind":"arxiv","id":"2604.20985","version":2},"attestation_state":"computed","paper":{"title":"Differentially Private Model Merging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Post-processing existing differentially private models with random selection or linear combination produces a model meeting any target privacy level without additional training.","cross_cats":["cs.AI","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Manzil Zaheer, Qichuan Yin, Tian Li","submitted_at":"2026-04-22T18:13:37Z","abstract_excerpt":"In machine learning, privacy requirements at inference or deployment time often evolve due to changing policies, regulations, or user preferences. In this work, we aim to construct a magnitude of models to satisfy any target differential privacy (DP) requirement without additional training, given a set of existing models trained on the same dataset with different privacy/utility tradeoffs. We propose two post-processing techniques, namely random selection and linear combination, to generate final private models satisfying any target privacy parameter. We provide privacy accounting of these app"},"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":"2604.20985","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-22T18:13:37Z","cross_cats_sorted":["cs.AI","cs.CR","stat.ML"],"title_canon_sha256":"74cd4d4751e8f45791432b828fb58bc3d64057097560619189ad21ff1dfc8947","abstract_canon_sha256":"c8d3a2f58553318ba692d7f377561c860b961f49b658fda3d658dcd3ee6ca237"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:25.964152Z","signature_b64":"dnepvgyChzGNLVbeeYohjZrQ1tBvytbGrxlAgh73UblJxk6RkQ3fD8sNLdmnIjk72NHVUzFr+e6CjkWBk98ABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2932e1df7d2d77913afb617e2b3932af8e1d74f61fe1db1c2fc95ac531ea6a","last_reissued_at":"2026-05-21T01:04:25.963335Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:25.963335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Model Merging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Post-processing existing differentially private models with random selection or linear combination produces a model meeting any target privacy level without additional training.","cross_cats":["cs.AI","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Manzil Zaheer, Qichuan Yin, Tian Li","submitted_at":"2026-04-22T18:13:37Z","abstract_excerpt":"In machine learning, privacy requirements at inference or deployment time often evolve due to changing policies, regulations, or user preferences. In this work, we aim to construct a magnitude of models to satisfy any target differential privacy (DP) requirement without additional training, given a set of existing models trained on the same dataset with different privacy/utility tradeoffs. We propose two post-processing techniques, namely random selection and linear combination, to generate final private models satisfying any target privacy parameter. We provide privacy accounting of these app"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose two post processing techniques, namely random selection and linear combination, to output a final private model for any target privacy parameter. We provide privacy accounting of these approaches from the lens of Rényi DP and privacy loss distributions for general problems. In a case study on private mean estimation, we fully characterize the privacy/utility results and theoretically establish the superiority of linear combination over random selection.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The existing models are trained on the same dataset with different privacy/utility tradeoffs, which is required for the post-processing techniques to correctly compose privacy guarantees without additional training.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Post-processing via random selection or linear combination generates differentially private models for arbitrary privacy parameters from pre-trained models on the same dataset.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Post-processing existing differentially private models with random selection or linear combination produces a model meeting any target privacy level without additional training.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f4dd4840f1b51e0df8bb48daed3b13592d99603956ffab65f9375a43a5438bac"},"source":{"id":"2604.20985","kind":"arxiv","version":2},"verdict":{"id":"4ed4ce60-10a2-4ff3-a88e-1782a20a0e27","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T01:10:56.130853Z","strongest_claim":"We propose two post processing techniques, namely random selection and linear combination, to output a final private model for any target privacy parameter. We provide privacy accounting of these approaches from the lens of Rényi DP and privacy loss distributions for general problems. In a case study on private mean estimation, we fully characterize the privacy/utility results and theoretically establish the superiority of linear combination over random selection.","one_line_summary":"Post-processing via random selection or linear combination generates differentially private models for arbitrary privacy parameters from pre-trained models on the same dataset.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The existing models are trained on the same dataset with different privacy/utility tradeoffs, which is required for the post-processing techniques to correctly compose privacy guarantees without additional training.","pith_extraction_headline":"Post-processing existing differentially private models with random selection or linear combination produces a model meeting any target privacy level without additional training."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.20985/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T01:29:53.754074Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"482d38c29369652c0ab2d1fc2260afb03061e5dbcdd5312859ad9fa204dff060"},"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":"2604.20985","created_at":"2026-05-21T01:04:25.963440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.20985v2","created_at":"2026-05-21T01:04:25.963440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20985","created_at":"2026-05-21T01:04:25.963440+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMUTFYO7PUWX","created_at":"2026-05-21T01:04:25.963440+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMUTFYO7PUWXPEJ2","created_at":"2026-05-21T01:04:25.963440+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMUTFYO7","created_at":"2026-05-21T01:04:25.963440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK","json":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK.json","graph_json":"https://pith.science/api/pith-number/ZMUTFYO7PUWXPEJ27NQX4KZZGK/graph.json","events_json":"https://pith.science/api/pith-number/ZMUTFYO7PUWXPEJ27NQX4KZZGK/events.json","paper":"https://pith.science/paper/ZMUTFYO7"},"agent_actions":{"view_html":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK","download_json":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK.json","view_paper":"https://pith.science/paper/ZMUTFYO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.20985&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMUTFYO7PUWXPEJ27NQX4KZZGK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMUTFYO7PUWXPEJ27NQX4KZZGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK/action/storage_attestation","attest_author":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK/action/author_attestation","sign_citation":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK/action/citation_signature","submit_replication":"https://pith.science/pith/ZMUTFYO7PUWXPEJ27NQX4KZZGK/action/replication_record"}},"created_at":"2026-05-21T01:04:25.963440+00:00","updated_at":"2026-05-21T01:04:25.963440+00:00"}