{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AXKJCCTT25AGWV3UM7UMP4Z5SA","short_pith_number":"pith:AXKJCCTT","schema_version":"1.0","canonical_sha256":"05d4910a73d7406b577467e8c7f33d900048945fe9709c0838f74ca112a9d61f","source":{"kind":"arxiv","id":"2202.08173","version":2},"attestation_state":"computed","paper":{"title":"Distributed k-Means with Outliers in General Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Enrico Dandolo, Geppino Pucci","submitted_at":"2022-02-16T16:24:31Z","abstract_excerpt":"Center-based clustering is a pivotal primitive for unsupervised learning and data analysis. A popular variant is undoubtedly the k-means problem, which, given a set $P$ of points from a metric space and a parameter $k<|P|$, requires to determine a subset $S$ of $k$ centers minimizing the sum of all squared distances of points in $P$ from their closest center. A more general formulation, known as k-means with $z$ outliers, introduced to deal with noisy datasets, features a further parameter $z$ and allows up to $z$ points of $P$ (outliers) to be disregarded when computing the aforementioned sum"},"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":"2202.08173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-16T16:24:31Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"2f30864b7f5847f9d3b2e51ed8463d89fcf89edf1021105210b519a2f48d9c12","abstract_canon_sha256":"9b9179c89e564f7e57dc85288a10301374386edb6d460e21ee9c3df7aa0170ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:06.904363Z","signature_b64":"Epy/sdtsGBzRZwq7kWuBLwU5FCDr5kqVXgLPcHc2sIRYd8WeSgLjN7gA1Wrc77SQyVCVOuOLKc0DKZWvsieTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d4910a73d7406b577467e8c7f33d900048945fe9709c0838f74ca112a9d61f","last_reissued_at":"2026-07-05T03:58:06.903963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:06.903963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed k-Means with Outliers in General Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Enrico Dandolo, Geppino Pucci","submitted_at":"2022-02-16T16:24:31Z","abstract_excerpt":"Center-based clustering is a pivotal primitive for unsupervised learning and data analysis. A popular variant is undoubtedly the k-means problem, which, given a set $P$ of points from a metric space and a parameter $k<|P|$, requires to determine a subset $S$ of $k$ centers minimizing the sum of all squared distances of points in $P$ from their closest center. A more general formulation, known as k-means with $z$ outliers, introduced to deal with noisy datasets, features a further parameter $z$ and allows up to $z$ points of $P$ (outliers) to be disregarded when computing the aforementioned sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.08173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.08173","created_at":"2026-07-05T03:58:06.904026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.08173v2","created_at":"2026-07-05T03:58:06.904026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08173","created_at":"2026-07-05T03:58:06.904026+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXKJCCTT25AG","created_at":"2026-07-05T03:58:06.904026+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXKJCCTT25AGWV3U","created_at":"2026-07-05T03:58:06.904026+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXKJCCTT","created_at":"2026-07-05T03:58:06.904026+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/AXKJCCTT25AGWV3UM7UMP4Z5SA","json":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA.json","graph_json":"https://pith.science/api/pith-number/AXKJCCTT25AGWV3UM7UMP4Z5SA/graph.json","events_json":"https://pith.science/api/pith-number/AXKJCCTT25AGWV3UM7UMP4Z5SA/events.json","paper":"https://pith.science/paper/AXKJCCTT"},"agent_actions":{"view_html":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA","download_json":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA.json","view_paper":"https://pith.science/paper/AXKJCCTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.08173&json=true","fetch_graph":"https://pith.science/api/pith-number/AXKJCCTT25AGWV3UM7UMP4Z5SA/graph.json","fetch_events":"https://pith.science/api/pith-number/AXKJCCTT25AGWV3UM7UMP4Z5SA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA/action/storage_attestation","attest_author":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA/action/author_attestation","sign_citation":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA/action/citation_signature","submit_replication":"https://pith.science/pith/AXKJCCTT25AGWV3UM7UMP4Z5SA/action/replication_record"}},"created_at":"2026-07-05T03:58:06.904026+00:00","updated_at":"2026-07-05T03:58:06.904026+00:00"}