{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IBRVO42IXE5W4AAIG3UDXTCSZQ","short_pith_number":"pith:IBRVO42I","schema_version":"1.0","canonical_sha256":"4063577348b93b6e000836e83bcc52cc21c05595e7e5c9e7e36d4ae14f6df8d1","source":{"kind":"arxiv","id":"2405.02437","version":3},"attestation_state":"computed","paper":{"title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Abdulrahman Diaa, Florian Kerschbaum, Thomas Humphries","submitted_at":"2024-05-03T19:04:37Z","abstract_excerpt":"We study the problem of privacy-preserving $k$-means clustering in the horizontally federated setting. Existing federated approaches using secure computation suffer from substantial overheads and do not offer output privacy. At the same time, differentially private (DP) $k$-means algorithms either assume a trusted central curator or significantly degrade utility by adding noise in the local DP model. Naively combining the secure and central DP solutions results in a protocol with impractical overhead. Instead, our work provides enhancements to both the DP and secure computation components, res"},"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":"2405.02437","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-05-03T19:04:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1a8e6a5f075ab903becde72ff759b765244b0ff1ac2f6581e353be1c235b52e7","abstract_canon_sha256":"f8db71d7c5d024923ac2254174def3db2a00be24a54ba4e5834a166cc2ae76f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:19.248426Z","signature_b64":"eRv7Dpp8KfzhafqXfUeoOGYB+zZJPDfir3gSv2V6U6Bbdd2SvouKFQgQCLQK870kmHl+GLmVWkhBWpaOpFskAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4063577348b93b6e000836e83bcc52cc21c05595e7e5c9e7e36d4ae14f6df8d1","last_reissued_at":"2026-07-05T11:19:19.247936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:19.247936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Abdulrahman Diaa, Florian Kerschbaum, Thomas Humphries","submitted_at":"2024-05-03T19:04:37Z","abstract_excerpt":"We study the problem of privacy-preserving $k$-means clustering in the horizontally federated setting. Existing federated approaches using secure computation suffer from substantial overheads and do not offer output privacy. At the same time, differentially private (DP) $k$-means algorithms either assume a trusted central curator or significantly degrade utility by adding noise in the local DP model. Naively combining the secure and central DP solutions results in a protocol with impractical overhead. Instead, our work provides enhancements to both the DP and secure computation components, res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.02437","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/2405.02437/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":"2405.02437","created_at":"2026-07-05T11:19:19.247993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.02437v3","created_at":"2026-07-05T11:19:19.247993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.02437","created_at":"2026-07-05T11:19:19.247993+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBRVO42IXE5W","created_at":"2026-07-05T11:19:19.247993+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBRVO42IXE5W4AAI","created_at":"2026-07-05T11:19:19.247993+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBRVO42I","created_at":"2026-07-05T11:19:19.247993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05408","citing_title":"Differentially Private Federated $k$-Means Clustering with Server-Side Data","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ","json":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ.json","graph_json":"https://pith.science/api/pith-number/IBRVO42IXE5W4AAIG3UDXTCSZQ/graph.json","events_json":"https://pith.science/api/pith-number/IBRVO42IXE5W4AAIG3UDXTCSZQ/events.json","paper":"https://pith.science/paper/IBRVO42I"},"agent_actions":{"view_html":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ","download_json":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ.json","view_paper":"https://pith.science/paper/IBRVO42I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.02437&json=true","fetch_graph":"https://pith.science/api/pith-number/IBRVO42IXE5W4AAIG3UDXTCSZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IBRVO42IXE5W4AAIG3UDXTCSZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ/action/storage_attestation","attest_author":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ/action/author_attestation","sign_citation":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ/action/citation_signature","submit_replication":"https://pith.science/pith/IBRVO42IXE5W4AAIG3UDXTCSZQ/action/replication_record"}},"created_at":"2026-07-05T11:19:19.247993+00:00","updated_at":"2026-07-05T11:19:19.247993+00:00"}