{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A4LHCKWWD3FC7QSRXCFPKVZW7U","short_pith_number":"pith:A4LHCKWW","canonical_record":{"source":{"id":"1802.02497","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T15:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"5f68aa150f51c60bef2ba5d545d01e7aff0145bdc97b800d0db614c8e94d4e56","abstract_canon_sha256":"64ae9ebc5926a62433043ae7ab0fe34f0c78cec377bc1ca12ff8721991c0ab47"},"schema_version":"1.0"},"canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","source":{"kind":"arxiv","id":"1802.02497","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02497","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02497v2","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02497","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"A4LHCKWWD3FC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4LHCKWWD3FC7QSR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4LHCKWW","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A4LHCKWWD3FC7QSRXCFPKVZW7U","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02497","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T15:57:43Z","cross_cats_sorted":[],"title_canon_sha256":"5f68aa150f51c60bef2ba5d545d01e7aff0145bdc97b800d0db614c8e94d4e56","abstract_canon_sha256":"64ae9ebc5926a62433043ae7ab0fe34f0c78cec377bc1ca12ff8721991c0ab47"},"schema_version":"1.0"},"canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:11.402783Z","signature_b64":"B0QkwBXBNSSVW39nQ4QHbPneoTcfidmXAOCzQ7YaEzI3slAZ0fslIJ/4NtmKQrtI+x1NaJua14DvUrbQNyXgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","last_reissued_at":"2026-05-18T00:23:11.402105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:11.402105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02497","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:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKsUdTYyydd8wzHU9YVEdYOdAcolK/lOqkMwhAwSrTSJL+coUs3esGoLhnRQbe49X2EpH4euXAkeNnGdzwpDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:00:01.301503Z"},"content_sha256":"6300aedfbd2b59bc808df349eef0876aa53aeaf724f5d4447250641fd30c20f2","schema_version":"1.0","event_id":"sha256:6300aedfbd2b59bc808df349eef0876aa53aeaf724f5d4447250641fd30c20f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A4LHCKWWD3FC7QSRXCFPKVZW7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Privacy preserving clustering with constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Clemens R\\\"osner, Melanie Schmidt","submitted_at":"2018-02-07T15:57:43Z","abstract_excerpt":"The $k$-center problem is a classical combinatorial optimization problem which asks to find $k$ centers such that the maximum distance of any input point in a set $P$ to its assigned center is minimized. The problem allows for elegant $2$-approximations. However, the situation becomes significantly more difficult when constraints are added to the problem. We raise the question whether general methods can be derived to turn an approximation algorithm for a clustering problem with some constraints into an approximation algorithm that respects one constraint more. Our constraint of choice is priv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02497","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:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjTnJYnm+3GVE6nZujkORkmR3pRNGmJFYNsY+5uZwhyUARrCv9ZVv9mYF7WPX2H7CDtIoQcCY+29ZPq/dsr6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:00:01.302178Z"},"content_sha256":"776d3748771252ceefed5d4a1013946b7bd794788085c2d4447d0c9835d2424a","schema_version":"1.0","event_id":"sha256:776d3748771252ceefed5d4a1013946b7bd794788085c2d4447d0c9835d2424a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/bundle.json","state_url":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/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-05-26T10:00:01Z","links":{"resolver":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U","bundle":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/bundle.json","state":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A4LHCKWWD3FC7QSRXCFPKVZW7U","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":"64ae9ebc5926a62433043ae7ab0fe34f0c78cec377bc1ca12ff8721991c0ab47","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T15:57:43Z","title_canon_sha256":"5f68aa150f51c60bef2ba5d545d01e7aff0145bdc97b800d0db614c8e94d4e56"},"schema_version":"1.0","source":{"id":"1802.02497","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02497","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02497v2","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02497","created_at":"2026-05-18T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"A4LHCKWWD3FC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4LHCKWWD3FC7QSR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4LHCKWW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:776d3748771252ceefed5d4a1013946b7bd794788085c2d4447d0c9835d2424a","target":"graph","created_at":"2026-05-18T00:23:11Z","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":"The $k$-center problem is a classical combinatorial optimization problem which asks to find $k$ centers such that the maximum distance of any input point in a set $P$ to its assigned center is minimized. The problem allows for elegant $2$-approximations. However, the situation becomes significantly more difficult when constraints are added to the problem. We raise the question whether general methods can be derived to turn an approximation algorithm for a clustering problem with some constraints into an approximation algorithm that respects one constraint more. Our constraint of choice is priv","authors_text":"Clemens R\\\"osner, Melanie Schmidt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T15:57:43Z","title":"Privacy preserving clustering with constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02497","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:6300aedfbd2b59bc808df349eef0876aa53aeaf724f5d4447250641fd30c20f2","target":"record","created_at":"2026-05-18T00:23:11Z","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":"64ae9ebc5926a62433043ae7ab0fe34f0c78cec377bc1ca12ff8721991c0ab47","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T15:57:43Z","title_canon_sha256":"5f68aa150f51c60bef2ba5d545d01e7aff0145bdc97b800d0db614c8e94d4e56"},"schema_version":"1.0","source":{"id":"1802.02497","kind":"arxiv","version":2}},"canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","first_computed_at":"2026-05-18T00:23:11.402105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:11.402105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0QkwBXBNSSVW39nQ4QHbPneoTcfidmXAOCzQ7YaEzI3slAZ0fslIJ/4NtmKQrtI+x1NaJua14DvUrbQNyXgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:11.402783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02497","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6300aedfbd2b59bc808df349eef0876aa53aeaf724f5d4447250641fd30c20f2","sha256:776d3748771252ceefed5d4a1013946b7bd794788085c2d4447d0c9835d2424a"],"state_sha256":"82c2e8c8ef231632b2d31b56b239b54cad83027192cff0f40eb4786f5dc87185"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4oHG+nhhOkQ8ecraBvJLgm67g8KKVDkHgYpGU8mA/lsKFD0JPW92p95csVH36+Tk/oRqQER/6VLZBbmYSNGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:00:01.305456Z","bundle_sha256":"4a227891d664e73e5be85d5bf7dbe534c196faea7d3e15bba8e8be62feef1f70"}}