{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NDZDLHGCN6ZOM3L5JC2NLJTG4I","short_pith_number":"pith:NDZDLHGC","schema_version":"1.0","canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","source":{"kind":"arxiv","id":"1707.04295","version":1},"attestation_state":"computed","paper":{"title":"Approximation Schemes for Clustering with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kamyar Khodamoradi, Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","submitted_at":"2017-07-13T20:08:24Z","abstract_excerpt":"Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location problems, $k$-median, and $k$-means to name a few. In some cases, not all data points need to be clustered; some may be discarded for various reasons.\n  We study clustering problems with outliers. More specifically, we look at Uncapacitated Facility Location (UFL), $k$-Median, and $k$-Means. In UFL with outliers, we have to open some centres, discard up to $z$ points of $\\cal X$ and assign every other point to the nearest"},"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.04295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T20:08:24Z","cross_cats_sorted":[],"title_canon_sha256":"3ec3bd1b747b5e8e975d7db38c8d62eaaae71ab902ca75a9ae999a491cd4eb07","abstract_canon_sha256":"6166497113475ef36ebc85e86e931a00f211510104d9cf10f4747f02524361bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.755083Z","signature_b64":"Ub9g7RSnU5PUDBOnh319bD9vfyOjf6FE0w/6BVudu0Up+73jScJa5mzZ97JDBVpmoxcdDu1ayRCqjmoXcBwNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","last_reissued_at":"2026-05-18T00:40:18.754386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.754386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Schemes for Clustering with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kamyar Khodamoradi, Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","submitted_at":"2017-07-13T20:08:24Z","abstract_excerpt":"Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location problems, $k$-median, and $k$-means to name a few. In some cases, not all data points need to be clustered; some may be discarded for various reasons.\n  We study clustering problems with outliers. More specifically, we look at Uncapacitated Facility Location (UFL), $k$-Median, and $k$-Means. In UFL with outliers, we have to open some centres, discard up to $z$ points of $\\cal X$ and assign every other point to the nearest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04295","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.04295","created_at":"2026-05-18T00:40:18.754486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04295v1","created_at":"2026-05-18T00:40:18.754486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04295","created_at":"2026-05-18T00:40:18.754486+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDZDLHGCN6ZO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDZDLHGCN6ZOM3L5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDZDLHGC","created_at":"2026-05-18T12:31:31.346846+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/NDZDLHGCN6ZOM3L5JC2NLJTG4I","json":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I.json","graph_json":"https://pith.science/api/pith-number/NDZDLHGCN6ZOM3L5JC2NLJTG4I/graph.json","events_json":"https://pith.science/api/pith-number/NDZDLHGCN6ZOM3L5JC2NLJTG4I/events.json","paper":"https://pith.science/paper/NDZDLHGC"},"agent_actions":{"view_html":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I","download_json":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I.json","view_paper":"https://pith.science/paper/NDZDLHGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04295&json=true","fetch_graph":"https://pith.science/api/pith-number/NDZDLHGCN6ZOM3L5JC2NLJTG4I/graph.json","fetch_events":"https://pith.science/api/pith-number/NDZDLHGCN6ZOM3L5JC2NLJTG4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/action/storage_attestation","attest_author":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/action/author_attestation","sign_citation":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/action/citation_signature","submit_replication":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/action/replication_record"}},"created_at":"2026-05-18T00:40:18.754486+00:00","updated_at":"2026-05-18T00:40:18.754486+00:00"}