{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UG7NMCWT6ZQL53WD7ZYN422ZWK","short_pith_number":"pith:UG7NMCWT","schema_version":"1.0","canonical_sha256":"a1bed60ad3f660beeec3fe70de6b59b29ab2544448ff97e5314f8e0f288d253c","source":{"kind":"arxiv","id":"2605.19813","version":1},"attestation_state":"computed","paper":{"title":"General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Yicheng Li","submitted_at":"2026-05-19T13:09:58Z","abstract_excerpt":"We prove a general lower bound for differentially private federated learning protocols with arbitrary public-transcript interactions. The protocol may use any number of adaptive rounds, and each client's local samples may be reused across rounds. For parameter estimation under squared \\(\\ell_2\\) loss, we establish a federated van Trees lower bound for every estimator satisfying a total clientwise sample-level zero-concentrated differential privacy (zCDP) constraint. The main technical ingredient is a privacy-information contraction inequality for complete public transcripts. We illustrate 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":"2605.19813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-19T13:09:58Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"52bcdb4a013294af51ad088edb057125b5f2e9a20ab8e991340b73dabd794a9f","abstract_canon_sha256":"791cf7e821accf34b3c38dc3bc4b005df758d22ded07158fb279bfcf6591635b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:15.806183Z","signature_b64":"2EGNxfzHJBRtoCNK/ItWFH6DuYGnqhS4hEP6Ha8WLWFcAIivkVIqd/nbJppS3tWVdqLurtusyTpke90dTMKECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1bed60ad3f660beeec3fe70de6b59b29ab2544448ff97e5314f8e0f288d253c","last_reissued_at":"2026-05-20T01:06:15.805243Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:15.805243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Yicheng Li","submitted_at":"2026-05-19T13:09:58Z","abstract_excerpt":"We prove a general lower bound for differentially private federated learning protocols with arbitrary public-transcript interactions. The protocol may use any number of adaptive rounds, and each client's local samples may be reused across rounds. For parameter estimation under squared \\(\\ell_2\\) loss, we establish a federated van Trees lower bound for every estimator satisfying a total clientwise sample-level zero-concentrated differential privacy (zCDP) constraint. The main technical ingredient is a privacy-information contraction inequality for complete public transcripts. We illustrate the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19813","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/2605.19813/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":"2605.19813","created_at":"2026-05-20T01:06:15.805383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19813v1","created_at":"2026-05-20T01:06:15.805383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19813","created_at":"2026-05-20T01:06:15.805383+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG7NMCWT6ZQL","created_at":"2026-05-20T01:06:15.805383+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG7NMCWT6ZQL53WD","created_at":"2026-05-20T01:06:15.805383+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG7NMCWT","created_at":"2026-05-20T01:06:15.805383+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/UG7NMCWT6ZQL53WD7ZYN422ZWK","json":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK.json","graph_json":"https://pith.science/api/pith-number/UG7NMCWT6ZQL53WD7ZYN422ZWK/graph.json","events_json":"https://pith.science/api/pith-number/UG7NMCWT6ZQL53WD7ZYN422ZWK/events.json","paper":"https://pith.science/paper/UG7NMCWT"},"agent_actions":{"view_html":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK","download_json":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK.json","view_paper":"https://pith.science/paper/UG7NMCWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19813&json=true","fetch_graph":"https://pith.science/api/pith-number/UG7NMCWT6ZQL53WD7ZYN422ZWK/graph.json","fetch_events":"https://pith.science/api/pith-number/UG7NMCWT6ZQL53WD7ZYN422ZWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK/action/storage_attestation","attest_author":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK/action/author_attestation","sign_citation":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK/action/citation_signature","submit_replication":"https://pith.science/pith/UG7NMCWT6ZQL53WD7ZYN422ZWK/action/replication_record"}},"created_at":"2026-05-20T01:06:15.805383+00:00","updated_at":"2026-05-20T01:06:15.805383+00:00"}