{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PI4CFXJUZNVI2ZIDZ5XDTAZFEC","short_pith_number":"pith:PI4CFXJU","canonical_record":{"source":{"id":"1804.08001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T17:41:04Z","cross_cats_sorted":[],"title_canon_sha256":"bddb7ccb03dd7b47423196361241b0f18e5d027bcfbdec0e9efde28ec829a4e8","abstract_canon_sha256":"3989912af9998a70b4ab2925d16303ee9083078b9846ccef54bb4e0f073165e1"},"schema_version":"1.0"},"canonical_sha256":"7a3822dd34cb6a8d6503cf6e3983252080a1c031dc7c0627c0035baf23e1270d","source":{"kind":"arxiv","id":"1804.08001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08001","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08001v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08001","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"PI4CFXJUZNVI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PI4CFXJUZNVI2ZID","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PI4CFXJU","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PI4CFXJUZNVI2ZIDZ5XDTAZFEC","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T17:41:04Z","cross_cats_sorted":[],"title_canon_sha256":"bddb7ccb03dd7b47423196361241b0f18e5d027bcfbdec0e9efde28ec829a4e8","abstract_canon_sha256":"3989912af9998a70b4ab2925d16303ee9083078b9846ccef54bb4e0f073165e1"},"schema_version":"1.0"},"canonical_sha256":"7a3822dd34cb6a8d6503cf6e3983252080a1c031dc7c0627c0035baf23e1270d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.629243Z","signature_b64":"Tk0IT7FKzLxr15k3gyEZ2fm4jtmm2Tf3Mx46Vs1f49pwNjhuLYanB1H7JZooRvu4MiBQGeMaMOYa9dzI/MbyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3822dd34cb6a8d6503cf6e3983252080a1c031dc7c0627c0035baf23e1270d","last_reissued_at":"2026-05-18T00:10:44.628820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.628820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08001","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0E+FnUTvdtOSTYwUl1+1MwEOVOHFm1xsWonrGUbcm+IH7lErca/fGQy0NDrdHTxCfSBeoPnwjm6gRZEFwtGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:32:30.438991Z"},"content_sha256":"51485e241f589fa5bc0d7a3e3f7306b7cf74e46d9b6facf2b15f23b23ec2e6f0","schema_version":"1.0","event_id":"sha256:51485e241f589fa5bc0d7a3e3f7306b7cf74e46d9b6facf2b15f23b23ec2e6f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PI4CFXJUZNVI2ZIDZ5XDTAZFEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private k-Means with Constant Multiplicative Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Uri Stemmer","submitted_at":"2018-04-21T17:41:04Z","abstract_excerpt":"We design new differentially private algorithms for the Euclidean k-means problem, both in the centralized model and in the local model of differential privacy. In both models, our algorithms achieve significantly improved error guarantees than the previous state-of-the-art. In addition, in the local model, our algorithm significantly reduces the number of interaction rounds.\n  Although the problem has been widely studied in the context of differential privacy, all of the existing constructions achieve only super constant approximation factors. We present, for the first time, efficient private"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08001","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tJoruW54cfDYdFT8eLBAdN916TejtsRBmVhUmZu26mDSfYWRrPHZzyOAdTMSR2Z4pPiEfrTRmTmU6p2q7YgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:32:30.439354Z"},"content_sha256":"b73dafe041edb49356908364606aa3050291e11d4206845cb56c1dcd9f30705f","schema_version":"1.0","event_id":"sha256:b73dafe041edb49356908364606aa3050291e11d4206845cb56c1dcd9f30705f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/bundle.json","state_url":"https://pith.science/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T07:32:30Z","links":{"resolver":"https://pith.science/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC","bundle":"https://pith.science/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/bundle.json","state":"https://pith.science/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PI4CFXJUZNVI2ZIDZ5XDTAZFEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PI4CFXJUZNVI2ZIDZ5XDTAZFEC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3989912af9998a70b4ab2925d16303ee9083078b9846ccef54bb4e0f073165e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T17:41:04Z","title_canon_sha256":"bddb7ccb03dd7b47423196361241b0f18e5d027bcfbdec0e9efde28ec829a4e8"},"schema_version":"1.0","source":{"id":"1804.08001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08001","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08001v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08001","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"PI4CFXJUZNVI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PI4CFXJUZNVI2ZID","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PI4CFXJU","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b73dafe041edb49356908364606aa3050291e11d4206845cb56c1dcd9f30705f","target":"graph","created_at":"2026-05-18T00:10:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We design new differentially private algorithms for the Euclidean k-means problem, both in the centralized model and in the local model of differential privacy. In both models, our algorithms achieve significantly improved error guarantees than the previous state-of-the-art. In addition, in the local model, our algorithm significantly reduces the number of interaction rounds.\n  Although the problem has been widely studied in the context of differential privacy, all of the existing constructions achieve only super constant approximation factors. We present, for the first time, efficient private","authors_text":"Haim Kaplan, Uri Stemmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T17:41:04Z","title":"Differentially Private k-Means with Constant Multiplicative Error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08001","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:51485e241f589fa5bc0d7a3e3f7306b7cf74e46d9b6facf2b15f23b23ec2e6f0","target":"record","created_at":"2026-05-18T00:10:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3989912af9998a70b4ab2925d16303ee9083078b9846ccef54bb4e0f073165e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T17:41:04Z","title_canon_sha256":"bddb7ccb03dd7b47423196361241b0f18e5d027bcfbdec0e9efde28ec829a4e8"},"schema_version":"1.0","source":{"id":"1804.08001","kind":"arxiv","version":2}},"canonical_sha256":"7a3822dd34cb6a8d6503cf6e3983252080a1c031dc7c0627c0035baf23e1270d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a3822dd34cb6a8d6503cf6e3983252080a1c031dc7c0627c0035baf23e1270d","first_computed_at":"2026-05-18T00:10:44.628820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.628820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tk0IT7FKzLxr15k3gyEZ2fm4jtmm2Tf3Mx46Vs1f49pwNjhuLYanB1H7JZooRvu4MiBQGeMaMOYa9dzI/MbyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.629243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51485e241f589fa5bc0d7a3e3f7306b7cf74e46d9b6facf2b15f23b23ec2e6f0","sha256:b73dafe041edb49356908364606aa3050291e11d4206845cb56c1dcd9f30705f"],"state_sha256":"8719a22fdf19d54df8053e077d0de588d426fde89e9f27e6e398bfb822c88ff9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yL8zlP18P61EzcL/S0vDFWQpBDyN5U8HynD7GSv4EnVHgE9jdjRmWIIuxKdLMw8Vs/GwMMIW094NFec1Y/U1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:32:30.441664Z","bundle_sha256":"4e31bf1c4046ea4a876ed814bfaec15286d130d2829d6cfe969465059ed48b4f"}}