{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NDZDLHGCN6ZOM3L5JC2NLJTG4I","short_pith_number":"pith:NDZDLHGC","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"},"canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","source":{"kind":"arxiv","id":"1707.04295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04295","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04295v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04295","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"NDZDLHGCN6ZO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NDZDLHGCN6ZOM3L5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NDZDLHGC","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NDZDLHGCN6ZOM3L5JC2NLJTG4I","target":"record","payload":{"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"},"canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","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"},"source_kind":"arxiv","source_id":"1707.04295","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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2fUjG7y2DQyDNMj3nKNGl0KpeKBLFOEWRWFCkCbfbEz1I/3iszH6pgt9RPoOWH+kXg+JRyE+lP3XrU0QXgNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:15:29.810308Z"},"content_sha256":"997199bdfc6c8c1d74263a22f8b60b55162cb562f6cf12ed870ef614cd77c472","schema_version":"1.0","event_id":"sha256:997199bdfc6c8c1d74263a22f8b60b55162cb562f6cf12ed870ef614cd77c472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NDZDLHGCN6ZOM3L5JC2NLJTG4I","target":"graph","payload":{"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"},"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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNqfdnD6PtLeHgUkJ0tsxZgfDXAd347rTIEG4ukbt4J44xKJ3SHkHcRr3JfnuzMiZrqEAU2sm2OB6S+K8mHCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:15:29.811043Z"},"content_sha256":"0668fdf42af20607cd1c522258e546f4b778039d8ba40b67e4dba8b6a89d9ed8","schema_version":"1.0","event_id":"sha256:0668fdf42af20607cd1c522258e546f4b778039d8ba40b67e4dba8b6a89d9ed8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/bundle.json","state_url":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/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-27T14:15:29Z","links":{"resolver":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I","bundle":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/bundle.json","state":"https://pith.science/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDZDLHGCN6ZOM3L5JC2NLJTG4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NDZDLHGCN6ZOM3L5JC2NLJTG4I","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":"6166497113475ef36ebc85e86e931a00f211510104d9cf10f4747f02524361bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T20:08:24Z","title_canon_sha256":"3ec3bd1b747b5e8e975d7db38c8d62eaaae71ab902ca75a9ae999a491cd4eb07"},"schema_version":"1.0","source":{"id":"1707.04295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04295","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04295v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04295","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"NDZDLHGCN6ZO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NDZDLHGCN6ZOM3L5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NDZDLHGC","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:0668fdf42af20607cd1c522258e546f4b778039d8ba40b67e4dba8b6a89d9ed8","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"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","authors_text":"Kamyar Khodamoradi, Mohammad R. Salavatipour, Mohsen Rezapour, Zachary Friggstad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T20:08:24Z","title":"Approximation Schemes for Clustering with Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04295","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:997199bdfc6c8c1d74263a22f8b60b55162cb562f6cf12ed870ef614cd77c472","target":"record","created_at":"2026-05-18T00:40:18Z","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":"6166497113475ef36ebc85e86e931a00f211510104d9cf10f4747f02524361bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-13T20:08:24Z","title_canon_sha256":"3ec3bd1b747b5e8e975d7db38c8d62eaaae71ab902ca75a9ae999a491cd4eb07"},"schema_version":"1.0","source":{"id":"1707.04295","kind":"arxiv","version":1}},"canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f2359cc26fb2e66d7d48b4d5a666e237314df54542d7ba5f982919fe54d0f6","first_computed_at":"2026-05-18T00:40:18.754386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.754386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ub9g7RSnU5PUDBOnh319bD9vfyOjf6FE0w/6BVudu0Up+73jScJa5mzZ97JDBVpmoxcdDu1ayRCqjmoXcBwNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.755083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:997199bdfc6c8c1d74263a22f8b60b55162cb562f6cf12ed870ef614cd77c472","sha256:0668fdf42af20607cd1c522258e546f4b778039d8ba40b67e4dba8b6a89d9ed8"],"state_sha256":"9b8d1f957e0aadec3e6aa14e83fbca72af1c8d7a538c44ebe1f2d65140c248b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXEsKi6OR4YnMo0Q5GPGflcE/gW3TXn4uVERJ9zZ4qsLhcyG2hLE3jfr5yiDrXaws32SZAm0/EAXQmerx2SrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:15:29.814514Z","bundle_sha256":"9137f16d8bfbc3ead5f1e323efc7e1e123058f22281676f7a04bbaaf878156e4"}}