{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6Q3P7JKKI7OC6SUSCYGOHEVARC","short_pith_number":"pith:6Q3P7JKK","schema_version":"1.0","canonical_sha256":"f436ffa54a47dc2f4a92160ce392a0888decfd8f91dae184dd9c43c24310a32b","source":{"kind":"arxiv","id":"2406.06755","version":1},"attestation_state":"computed","paper":{"title":"Optimal Federated Learning for Nonparametric Regression with Heterogeneous Distributed Differential Privacy Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Abhinav Chakraborty, Lasse Vuursteen, T. Tony Cai","submitted_at":"2024-06-10T19:34:07Z","abstract_excerpt":"This paper studies federated learning for nonparametric regression in the context of distributed samples across different servers, each adhering to distinct differential privacy constraints. The setting we consider is heterogeneous, encompassing both varying sample sizes and differential privacy constraints across servers. Within this framework, both global and pointwise estimation are considered, and optimal rates of convergence over the Besov spaces are established.\n  Distributed privacy-preserving estimators are proposed and their risk properties are investigated. Matching minimax lower bou"},"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":"2406.06755","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2024-06-10T19:34:07Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"ff8b28af19ef823a464d85939ac5e2da8ea57d7b6889657cb9ec8e2a115d0583","abstract_canon_sha256":"696b52014ea71ebcb071890d6444acd5955c217108b0b3afbdcb5946f4b88432"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:49.629724Z","signature_b64":"urqQdQcsnrP9JItwwZrLpaGmpaJ1EJDi3ijonPYoKsuZN9QHhc45UTgMzvYTqkQaFNP594MqpDVfkf2Fnre8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f436ffa54a47dc2f4a92160ce392a0888decfd8f91dae184dd9c43c24310a32b","last_reissued_at":"2026-07-05T08:29:49.629328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:49.629328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Federated Learning for Nonparametric Regression with Heterogeneous Distributed Differential Privacy Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Abhinav Chakraborty, Lasse Vuursteen, T. Tony Cai","submitted_at":"2024-06-10T19:34:07Z","abstract_excerpt":"This paper studies federated learning for nonparametric regression in the context of distributed samples across different servers, each adhering to distinct differential privacy constraints. The setting we consider is heterogeneous, encompassing both varying sample sizes and differential privacy constraints across servers. Within this framework, both global and pointwise estimation are considered, and optimal rates of convergence over the Besov spaces are established.\n  Distributed privacy-preserving estimators are proposed and their risk properties are investigated. Matching minimax lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06755","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/2406.06755/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":"2406.06755","created_at":"2026-07-05T08:29:49.629386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06755v1","created_at":"2026-07-05T08:29:49.629386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06755","created_at":"2026-07-05T08:29:49.629386+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Q3P7JKKI7OC","created_at":"2026-07-05T08:29:49.629386+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Q3P7JKKI7OC6SUS","created_at":"2026-07-05T08:29:49.629386+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Q3P7JKK","created_at":"2026-07-05T08:29:49.629386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26145","citing_title":"NetPTR: Optimal Differentially Private Spectral Community Detection on Sparse Networks","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03264","citing_title":"Efficient Propose-Test-Release for Optimal Differentially Private Estimation","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18656","citing_title":"Statistical Limits and Efficient Algorithms for Differentially Private Federated Learning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19813","citing_title":"A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16906","citing_title":"Differentially private hypothesis testing in survival analysis","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2507.17544","citing_title":"Optimal differentially private kernel learning with random projection","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03264","citing_title":"Efficient Propose-Test-Release for Optimal Differentially Private Estimation","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC","json":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC.json","graph_json":"https://pith.science/api/pith-number/6Q3P7JKKI7OC6SUSCYGOHEVARC/graph.json","events_json":"https://pith.science/api/pith-number/6Q3P7JKKI7OC6SUSCYGOHEVARC/events.json","paper":"https://pith.science/paper/6Q3P7JKK"},"agent_actions":{"view_html":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC","download_json":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC.json","view_paper":"https://pith.science/paper/6Q3P7JKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06755&json=true","fetch_graph":"https://pith.science/api/pith-number/6Q3P7JKKI7OC6SUSCYGOHEVARC/graph.json","fetch_events":"https://pith.science/api/pith-number/6Q3P7JKKI7OC6SUSCYGOHEVARC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC/action/storage_attestation","attest_author":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC/action/author_attestation","sign_citation":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC/action/citation_signature","submit_replication":"https://pith.science/pith/6Q3P7JKKI7OC6SUSCYGOHEVARC/action/replication_record"}},"created_at":"2026-07-05T08:29:49.629386+00:00","updated_at":"2026-07-05T08:29:49.629386+00:00"}