{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5B3H5RTSCG24GE35WHGYEJPPH3","short_pith_number":"pith:5B3H5RTS","schema_version":"1.0","canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","source":{"kind":"arxiv","id":"1707.04766","version":1},"attestation_state":"computed","paper":{"title":"Clustering Algorithms for the Centralized and Local Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kobbi Nissim, Uri Stemmer","submitted_at":"2017-07-15T17:39:12Z","abstract_excerpt":"We revisit the problem of finding a minimum enclosing ball with differential privacy: Given a set of $n$ points in the Euclidean space $\\mathbb{R}^d$ and an integer $t\\leq n$, the goal is to find a ball of the smallest radius $r_{opt}$ enclosing at least $t$ input points. The problem is motivated by its various applications to differential privacy, including the sample and aggregate technique, private data exploration, and clustering.\n  Without privacy concerns, minimum enclosing ball has a polynomial time approximation scheme (PTAS), which computes a ball of radius almost $r_{opt}$ (the probl"},"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":"1707.04766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-15T17:39:12Z","cross_cats_sorted":[],"title_canon_sha256":"c4eeaab3841126b6e0e8bb1ae3307b8a4895bcd431f73be66c651deef860e751","abstract_canon_sha256":"a6cd8de710f4ebf20333d4fb368120ec9fd377b60bc2813d83176e31cf0b030f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.339742Z","signature_b64":"U8MllNiF0YSL2OJfHDfxLNAkfv/qmQeC/BQB/fDVYfKMQXJs19T5ZfBCFlxH2o6ZjWB8dYvazzFmh9ICQcATBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","last_reissued_at":"2026-05-18T00:40:12.339057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.339057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering Algorithms for the Centralized and Local Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kobbi Nissim, Uri Stemmer","submitted_at":"2017-07-15T17:39:12Z","abstract_excerpt":"We revisit the problem of finding a minimum enclosing ball with differential privacy: Given a set of $n$ points in the Euclidean space $\\mathbb{R}^d$ and an integer $t\\leq n$, the goal is to find a ball of the smallest radius $r_{opt}$ enclosing at least $t$ input points. The problem is motivated by its various applications to differential privacy, including the sample and aggregate technique, private data exploration, and clustering.\n  Without privacy concerns, minimum enclosing ball has a polynomial time approximation scheme (PTAS), which computes a ball of radius almost $r_{opt}$ (the probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04766","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":""},"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":"1707.04766","created_at":"2026-05-18T00:40:12.339139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04766v1","created_at":"2026-05-18T00:40:12.339139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04766","created_at":"2026-05-18T00:40:12.339139+00:00"},{"alias_kind":"pith_short_12","alias_value":"5B3H5RTSCG24","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5B3H5RTSCG24GE35","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5B3H5RTS","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3","json":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3.json","graph_json":"https://pith.science/api/pith-number/5B3H5RTSCG24GE35WHGYEJPPH3/graph.json","events_json":"https://pith.science/api/pith-number/5B3H5RTSCG24GE35WHGYEJPPH3/events.json","paper":"https://pith.science/paper/5B3H5RTS"},"agent_actions":{"view_html":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3","download_json":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3.json","view_paper":"https://pith.science/paper/5B3H5RTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04766&json=true","fetch_graph":"https://pith.science/api/pith-number/5B3H5RTSCG24GE35WHGYEJPPH3/graph.json","fetch_events":"https://pith.science/api/pith-number/5B3H5RTSCG24GE35WHGYEJPPH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/action/storage_attestation","attest_author":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/action/author_attestation","sign_citation":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/action/citation_signature","submit_replication":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/action/replication_record"}},"created_at":"2026-05-18T00:40:12.339139+00:00","updated_at":"2026-05-18T00:40:12.339139+00:00"}