{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A4LHCKWWD3FC7QSRXCFPKVZW7U","short_pith_number":"pith:A4LHCKWW","schema_version":"1.0","canonical_sha256":"0716712ad61eca2fc251b88af55736fd20b0d37653896623fa4a865ce7c4a284","source":{"kind":"arxiv","id":"1802.02497","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.02497","created_at":"2026-05-18T00:23:11.402200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02497v2","created_at":"2026-05-18T00:23:11.402200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02497","created_at":"2026-05-18T00:23:11.402200+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4LHCKWWD3FC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4LHCKWWD3FC7QSR","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4LHCKWW","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13759","citing_title":"Fast and effective algorithms for fair clustering at scale","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U","json":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U.json","graph_json":"https://pith.science/api/pith-number/A4LHCKWWD3FC7QSRXCFPKVZW7U/graph.json","events_json":"https://pith.science/api/pith-number/A4LHCKWWD3FC7QSRXCFPKVZW7U/events.json","paper":"https://pith.science/paper/A4LHCKWW"},"agent_actions":{"view_html":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U","download_json":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U.json","view_paper":"https://pith.science/paper/A4LHCKWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02497&json=true","fetch_graph":"https://pith.science/api/pith-number/A4LHCKWWD3FC7QSRXCFPKVZW7U/graph.json","fetch_events":"https://pith.science/api/pith-number/A4LHCKWWD3FC7QSRXCFPKVZW7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/action/storage_attestation","attest_author":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/action/author_attestation","sign_citation":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/action/citation_signature","submit_replication":"https://pith.science/pith/A4LHCKWWD3FC7QSRXCFPKVZW7U/action/replication_record"}},"created_at":"2026-05-18T00:23:11.402200+00:00","updated_at":"2026-05-18T00:23:11.402200+00:00"}