{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DGGTQXG6BJKPR74AKZEOWBPH4H","short_pith_number":"pith:DGGTQXG6","schema_version":"1.0","canonical_sha256":"198d385cde0a54f8ff805648eb05e7e1f000a10be7fcf9815766d6617149609c","source":{"kind":"arxiv","id":"2009.01220","version":1},"attestation_state":"computed","paper":{"title":"Differentially private $k$-means clustering via exponential mechanism and max cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Anamay Chaturvedi, Eric Xu, Huy Nguyen","submitted_at":"2020-09-02T17:52:54Z","abstract_excerpt":"We introduce a new $(\\epsilon_p, \\delta_p)$-differentially private algorithm for the $k$-means clustering problem. Given a dataset in Euclidean space, the $k$-means clustering problem requires one to find $k$ points in that space such that the sum of squares of Euclidean distances between each data point and its closest respective point among the $k$ returned is minimised. Although there exist privacy-preserving methods with good theoretical guarantees to solve this problem [Balcan et al., 2017; Kaplan and Stemmer, 2018], in practice it is seen that it is the additive error which dictates 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":"2009.01220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-02T17:52:54Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"488c4b19adb56c8e75ce858481d6dceff62195be5a8a0d8f5f37795afdc1d285","abstract_canon_sha256":"da8ff440563939b95b7a166ef8833a9122b83dbc22e120d6c207395700f20edd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:39.083393Z","signature_b64":"+PxjFhcH/XwvCAoq9Nlp6US9FCSFR5T9b1JH2tW28zeEcQmPXh9gYVuQ2nIqg5Xmgi7Cka++/iiCOJakFymsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"198d385cde0a54f8ff805648eb05e7e1f000a10be7fcf9815766d6617149609c","last_reissued_at":"2026-07-05T01:32:39.082971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:39.082971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially private $k$-means clustering via exponential mechanism and max cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Anamay Chaturvedi, Eric Xu, Huy Nguyen","submitted_at":"2020-09-02T17:52:54Z","abstract_excerpt":"We introduce a new $(\\epsilon_p, \\delta_p)$-differentially private algorithm for the $k$-means clustering problem. Given a dataset in Euclidean space, the $k$-means clustering problem requires one to find $k$ points in that space such that the sum of squares of Euclidean distances between each data point and its closest respective point among the $k$ returned is minimised. Although there exist privacy-preserving methods with good theoretical guarantees to solve this problem [Balcan et al., 2017; Kaplan and Stemmer, 2018], in practice it is seen that it is the additive error which dictates the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.01220","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/2009.01220/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":"2009.01220","created_at":"2026-07-05T01:32:39.083029+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.01220v1","created_at":"2026-07-05T01:32:39.083029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.01220","created_at":"2026-07-05T01:32:39.083029+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGGTQXG6BJKP","created_at":"2026-07-05T01:32:39.083029+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGGTQXG6BJKPR74A","created_at":"2026-07-05T01:32:39.083029+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGGTQXG6","created_at":"2026-07-05T01:32:39.083029+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04566","citing_title":"Clustering and Median Aggregation Improve Differentially Private Inference","ref_index":2017,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H","json":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H.json","graph_json":"https://pith.science/api/pith-number/DGGTQXG6BJKPR74AKZEOWBPH4H/graph.json","events_json":"https://pith.science/api/pith-number/DGGTQXG6BJKPR74AKZEOWBPH4H/events.json","paper":"https://pith.science/paper/DGGTQXG6"},"agent_actions":{"view_html":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H","download_json":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H.json","view_paper":"https://pith.science/paper/DGGTQXG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.01220&json=true","fetch_graph":"https://pith.science/api/pith-number/DGGTQXG6BJKPR74AKZEOWBPH4H/graph.json","fetch_events":"https://pith.science/api/pith-number/DGGTQXG6BJKPR74AKZEOWBPH4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H/action/storage_attestation","attest_author":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H/action/author_attestation","sign_citation":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H/action/citation_signature","submit_replication":"https://pith.science/pith/DGGTQXG6BJKPR74AKZEOWBPH4H/action/replication_record"}},"created_at":"2026-07-05T01:32:39.083029+00:00","updated_at":"2026-07-05T01:32:39.083029+00:00"}