{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5B3H5RTSCG24GE35WHGYEJPPH3","short_pith_number":"pith:5B3H5RTS","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"},"canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","source":{"kind":"arxiv","id":"1707.04766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04766","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04766v1","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04766","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"5B3H5RTSCG24","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5B3H5RTSCG24GE35","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5B3H5RTS","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5B3H5RTSCG24GE35WHGYEJPPH3","target":"record","payload":{"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"},"canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","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"},"source_kind":"arxiv","source_id":"1707.04766","source_version":1,"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:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/Y3Yvr1yzIbG8e3wA/SfAD6SAeut8VYJT1z39CSjhZnrIIcQEiozyLVBZEcOZ2/8+FT4yKA6ykQr2d3tbgtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:19:25.231000Z"},"content_sha256":"d9042aec9c84d36e99bc7b1b27d2cd0c72957fd7008aa6d2a57138b38056bc7c","schema_version":"1.0","event_id":"sha256:d9042aec9c84d36e99bc7b1b27d2cd0c72957fd7008aa6d2a57138b38056bc7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5B3H5RTSCG24GE35WHGYEJPPH3","target":"graph","payload":{"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"},"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:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmB3YcUolqsl/YwFNhxTFcR5rudMgQYF04p/GnZkzxjOgjksO3cKYZQRLMrugpSFDpALUnZMtjltpI93hwDEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:19:25.231366Z"},"content_sha256":"f4d120cf5b3d2000d98122dd5f5ab040004d986e075622e99dc3847f10779e01","schema_version":"1.0","event_id":"sha256:f4d120cf5b3d2000d98122dd5f5ab040004d986e075622e99dc3847f10779e01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/bundle.json","state_url":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5B3H5RTSCG24GE35WHGYEJPPH3/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-02T00:19:25Z","links":{"resolver":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3","bundle":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/bundle.json","state":"https://pith.science/pith/5B3H5RTSCG24GE35WHGYEJPPH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5B3H5RTSCG24GE35WHGYEJPPH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5B3H5RTSCG24GE35WHGYEJPPH3","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":"a6cd8de710f4ebf20333d4fb368120ec9fd377b60bc2813d83176e31cf0b030f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-15T17:39:12Z","title_canon_sha256":"c4eeaab3841126b6e0e8bb1ae3307b8a4895bcd431f73be66c651deef860e751"},"schema_version":"1.0","source":{"id":"1707.04766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04766","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04766v1","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04766","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"5B3H5RTSCG24","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5B3H5RTSCG24GE35","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5B3H5RTS","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f4d120cf5b3d2000d98122dd5f5ab040004d986e075622e99dc3847f10779e01","target":"graph","created_at":"2026-05-18T00:40:12Z","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 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","authors_text":"Kobbi Nissim, Uri Stemmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-15T17:39:12Z","title":"Clustering Algorithms for the Centralized and Local Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04766","kind":"arxiv","version":1},"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:d9042aec9c84d36e99bc7b1b27d2cd0c72957fd7008aa6d2a57138b38056bc7c","target":"record","created_at":"2026-05-18T00:40:12Z","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":"a6cd8de710f4ebf20333d4fb368120ec9fd377b60bc2813d83176e31cf0b030f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-15T17:39:12Z","title_canon_sha256":"c4eeaab3841126b6e0e8bb1ae3307b8a4895bcd431f73be66c651deef860e751"},"schema_version":"1.0","source":{"id":"1707.04766","kind":"arxiv","version":1}},"canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8767ec67211b5c3137db1cd8225ef3ecc73af4bccc4ca169239fb52fdc996ac","first_computed_at":"2026-05-18T00:40:12.339057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:12.339057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8MllNiF0YSL2OJfHDfxLNAkfv/qmQeC/BQB/fDVYfKMQXJs19T5ZfBCFlxH2o6ZjWB8dYvazzFmh9ICQcATBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:12.339742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9042aec9c84d36e99bc7b1b27d2cd0c72957fd7008aa6d2a57138b38056bc7c","sha256:f4d120cf5b3d2000d98122dd5f5ab040004d986e075622e99dc3847f10779e01"],"state_sha256":"ff60761a79664d050617caf2e4fdb261ac38267524c2927d18a16ac87db6e383"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkKfycieKW8prh2NLcj5WxNvX88jAhtDMy0UnaMqXC62jPPZ5ci6qqxF3TxUpqmsi9x/9DHQEm+q2w+HvLIHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:19:25.233442Z","bundle_sha256":"4abffb6745ff8e586f8e49ba6f0cb354a15c19049fab02831bc284738dd119d3"}}