{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CHWYVA2MKTV5VHRNCYP7ZOAAYY","short_pith_number":"pith:CHWYVA2M","schema_version":"1.0","canonical_sha256":"11ed8a834c54ebda9e2d161ffcb800c633c590ce955d294394fd017e75dd97a1","source":{"kind":"arxiv","id":"2406.20088","version":1},"attestation_state":"computed","paper":{"title":"Minimax And Adaptive Transfer Learning for Nonparametric Classification under Distributed Differential Privacy Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Abhinav Chakraborty, Arnab Auddy, T. Tony Cai","submitted_at":"2024-06-28T17:55:41Z","abstract_excerpt":"This paper considers minimax and adaptive transfer learning for nonparametric classification under the posterior drift model with distributed differential privacy constraints. Our study is conducted within a heterogeneous framework, encompassing diverse sample sizes, varying privacy parameters, and data heterogeneity across different servers. We first establish the minimax misclassification rate, precisely characterizing the effects of privacy constraints, source samples, and target samples on classification accuracy. The results reveal interesting phase transition phenomena and highlight 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":"2406.20088","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2024-06-28T17:55:41Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"04daaead7302e4743de3803688a35fbf9508f2d553c800aade224323eb1d24c3","abstract_canon_sha256":"5e22736cf3094538c19e9cf93492290b3692e822010ae2363a63de31ffb28aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:58.962596Z","signature_b64":"buOqri3oQvYIU3SkwMsNwKIf1+21wBkUucpqISEcWKzKt6BIfu38fd6W/X8gu+5DJi3pM/1sdIU5+DcK1F6lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11ed8a834c54ebda9e2d161ffcb800c633c590ce955d294394fd017e75dd97a1","last_reissued_at":"2026-07-05T08:37:58.962121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:58.962121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax And Adaptive Transfer Learning for Nonparametric Classification under Distributed Differential Privacy Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Abhinav Chakraborty, Arnab Auddy, T. Tony Cai","submitted_at":"2024-06-28T17:55:41Z","abstract_excerpt":"This paper considers minimax and adaptive transfer learning for nonparametric classification under the posterior drift model with distributed differential privacy constraints. Our study is conducted within a heterogeneous framework, encompassing diverse sample sizes, varying privacy parameters, and data heterogeneity across different servers. We first establish the minimax misclassification rate, precisely characterizing the effects of privacy constraints, source samples, and target samples on classification accuracy. The results reveal interesting phase transition phenomena and highlight the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.20088","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.20088/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.20088","created_at":"2026-07-05T08:37:58.962176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.20088v1","created_at":"2026-07-05T08:37:58.962176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.20088","created_at":"2026-07-05T08:37:58.962176+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHWYVA2MKTV5","created_at":"2026-07-05T08:37:58.962176+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHWYVA2MKTV5VHRN","created_at":"2026-07-05T08:37:58.962176+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHWYVA2M","created_at":"2026-07-05T08:37:58.962176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18656","citing_title":"Statistical Limits and Efficient Algorithms for Differentially Private Federated Learning","ref_index":1,"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":5,"is_internal_anchor":false},{"citing_arxiv_id":"2507.17544","citing_title":"Optimal differentially private kernel learning with random projection","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY","json":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY.json","graph_json":"https://pith.science/api/pith-number/CHWYVA2MKTV5VHRNCYP7ZOAAYY/graph.json","events_json":"https://pith.science/api/pith-number/CHWYVA2MKTV5VHRNCYP7ZOAAYY/events.json","paper":"https://pith.science/paper/CHWYVA2M"},"agent_actions":{"view_html":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY","download_json":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY.json","view_paper":"https://pith.science/paper/CHWYVA2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.20088&json=true","fetch_graph":"https://pith.science/api/pith-number/CHWYVA2MKTV5VHRNCYP7ZOAAYY/graph.json","fetch_events":"https://pith.science/api/pith-number/CHWYVA2MKTV5VHRNCYP7ZOAAYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY/action/storage_attestation","attest_author":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY/action/author_attestation","sign_citation":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY/action/citation_signature","submit_replication":"https://pith.science/pith/CHWYVA2MKTV5VHRNCYP7ZOAAYY/action/replication_record"}},"created_at":"2026-07-05T08:37:58.962176+00:00","updated_at":"2026-07-05T08:37:58.962176+00:00"}