{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OG3OA2D2Y66WEF3SWD2UDDK6HR","short_pith_number":"pith:OG3OA2D2","canonical_record":{"source":{"id":"1810.07852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-18T01:04:14Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"1501f858175aaf6b8b73ca79a5a8ff3aa465f62b25d4e1c078ccaaa869b6b82d","abstract_canon_sha256":"d8013c42d00158869003f9e991c9d3ff90a1c024cdd5dafb62c7af1c2bdbd723"},"schema_version":"1.0"},"canonical_sha256":"71b6e0687ac7bd621772b0f5418d5e3c4c708763b90dc0974786f99fca0a08f3","source":{"kind":"arxiv","id":"1810.07852","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07852","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07852v2","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07852","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"OG3OA2D2Y66W","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OG3OA2D2Y66WEF3S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OG3OA2D2","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OG3OA2D2Y66WEF3SWD2UDDK6HR","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-18T01:04:14Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"1501f858175aaf6b8b73ca79a5a8ff3aa465f62b25d4e1c078ccaaa869b6b82d","abstract_canon_sha256":"d8013c42d00158869003f9e991c9d3ff90a1c024cdd5dafb62c7af1c2bdbd723"},"schema_version":"1.0"},"canonical_sha256":"71b6e0687ac7bd621772b0f5418d5e3c4c708763b90dc0974786f99fca0a08f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:38.134992Z","signature_b64":"Mm6p2tWG7BL9Y1QD47hWi5bJI3HETXcPrf4t44nNsfMfbqXnUIayZ8toozS1VBQSvOHpAKr9TroiQVydinitAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b6e0687ac7bd621772b0f5418d5e3c4c708763b90dc0974786f99fca0a08f3","last_reissued_at":"2026-05-17T23:59:38.134256Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:38.134256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07852","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-17T23:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWZjdgCnj3zCB9bxdIEnaBwXffqHvMkuKQmxIZFEBmCPwuqr0Rl8WxXrmG4xgAdTMru8Gacttcay7UYGnrdaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:25:05.056403Z"},"content_sha256":"6572b21a6ffc6e378c59c82992058e6247e4ca89d9c8f7342e82819019f2ae9d","schema_version":"1.0","event_id":"sha256:6572b21a6ffc6e378c59c82992058e6247e4ca89d9c8f7342e82819019f2ae9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OG3OA2D2Y66WEF3SWD2UDDK6HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed $k$-Clustering for Data with Heavy Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Shi Li, Xiangyu Guo","submitted_at":"2018-10-18T01:04:14Z","abstract_excerpt":"In this paper, we consider the $k$-center/median/means clustering with outliers problems (or the $(k, z)$-center/median/means problems) in the distributed setting. Most previous distributed algorithms have their communication costs linearly depending on $z$, the number of outliers. Recently Guha et al. overcame this dependence issue by considering bi-criteria approximation algorithms that output solutions with $2z$ outliers. For the case where $z$ is large, the extra $z$ outliers discarded by the algorithms might be too large, considering that the data gathering process might be costly. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07852","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-17T23:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vps1sgWbuXa52iw+ryFVotOpWL3wZV3pF9skHQAwDpwltVR8YMO7mw+0gfXVbTE4iPsla6O1tD/i44vMnFdxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:25:05.056744Z"},"content_sha256":"47726b18476e5a2aaff645ad7817a9f87cfb443e1def124705642218ec886968","schema_version":"1.0","event_id":"sha256:47726b18476e5a2aaff645ad7817a9f87cfb443e1def124705642218ec886968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/bundle.json","state_url":"https://pith.science/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/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-20T09:25:05Z","links":{"resolver":"https://pith.science/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR","bundle":"https://pith.science/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/bundle.json","state":"https://pith.science/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG3OA2D2Y66WEF3SWD2UDDK6HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OG3OA2D2Y66WEF3SWD2UDDK6HR","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":"d8013c42d00158869003f9e991c9d3ff90a1c024cdd5dafb62c7af1c2bdbd723","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-18T01:04:14Z","title_canon_sha256":"1501f858175aaf6b8b73ca79a5a8ff3aa465f62b25d4e1c078ccaaa869b6b82d"},"schema_version":"1.0","source":{"id":"1810.07852","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07852","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07852v2","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07852","created_at":"2026-05-17T23:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"OG3OA2D2Y66W","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OG3OA2D2Y66WEF3S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OG3OA2D2","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:47726b18476e5a2aaff645ad7817a9f87cfb443e1def124705642218ec886968","target":"graph","created_at":"2026-05-17T23:59:38Z","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":"In this paper, we consider the $k$-center/median/means clustering with outliers problems (or the $(k, z)$-center/median/means problems) in the distributed setting. Most previous distributed algorithms have their communication costs linearly depending on $z$, the number of outliers. Recently Guha et al. overcame this dependence issue by considering bi-criteria approximation algorithms that output solutions with $2z$ outliers. For the case where $z$ is large, the extra $z$ outliers discarded by the algorithms might be too large, considering that the data gathering process might be costly. In thi","authors_text":"Shi Li, Xiangyu Guo","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-18T01:04:14Z","title":"Distributed $k$-Clustering for Data with Heavy Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07852","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:6572b21a6ffc6e378c59c82992058e6247e4ca89d9c8f7342e82819019f2ae9d","target":"record","created_at":"2026-05-17T23:59:38Z","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":"d8013c42d00158869003f9e991c9d3ff90a1c024cdd5dafb62c7af1c2bdbd723","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-18T01:04:14Z","title_canon_sha256":"1501f858175aaf6b8b73ca79a5a8ff3aa465f62b25d4e1c078ccaaa869b6b82d"},"schema_version":"1.0","source":{"id":"1810.07852","kind":"arxiv","version":2}},"canonical_sha256":"71b6e0687ac7bd621772b0f5418d5e3c4c708763b90dc0974786f99fca0a08f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71b6e0687ac7bd621772b0f5418d5e3c4c708763b90dc0974786f99fca0a08f3","first_computed_at":"2026-05-17T23:59:38.134256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:38.134256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mm6p2tWG7BL9Y1QD47hWi5bJI3HETXcPrf4t44nNsfMfbqXnUIayZ8toozS1VBQSvOHpAKr9TroiQVydinitAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:38.134992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07852","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6572b21a6ffc6e378c59c82992058e6247e4ca89d9c8f7342e82819019f2ae9d","sha256:47726b18476e5a2aaff645ad7817a9f87cfb443e1def124705642218ec886968"],"state_sha256":"4441d0cea5cf8eae17fdd54d0cbbe6f013cc8cdd127cbd6bbe6833a518e45114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fRIfLTGtEaOk0YHnZr0QoZPqlHcnPwWcuM7xWesG3WL78NTiZZZOxxolDlNv31xR92AsXqhfM9Wo3e6TMv9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:25:05.058647Z","bundle_sha256":"d54fafd0dd6686fe29b89ab591476e79f44f2ac94739ab458a309aab553c1c15"}}