{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4ZAIRSZT52ZZ64EJSWJTQBJRUM","short_pith_number":"pith:4ZAIRSZT","schema_version":"1.0","canonical_sha256":"e64088cb33eeb39f70899593380531a324f9cbed07f6976941b8671ced2f3865","source":{"kind":"arxiv","id":"1711.08841","version":1},"attestation_state":"computed","paper":{"title":"Clustering Semi-Random Mixtures of Gaussians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Pranjal Awasthi","submitted_at":"2017-11-23T23:17:37Z","abstract_excerpt":"Gaussian mixture models (GMM) are the most widely used statistical model for the $k$-means clustering problem and form a popular framework for clustering in machine learning and data analysis. In this paper, we propose a natural semi-random model for $k$-means clustering that generalizes the Gaussian mixture model, and that we believe will be useful in identifying robust algorithms. In our model, a semi-random adversary is allowed to make arbitrary \"monotone\" or helpful changes to the data generated from the Gaussian mixture model.\n  Our first contribution is a polynomial time algorithm that p"},"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":"1711.08841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-23T23:17:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c822142953b1dfa65848f5cd635a84d39742d39b6c1200a4ce3d39c3edbced88","abstract_canon_sha256":"b3707bd17b078ec6d20708aa11430dccf895934c50f9a3becd688056981c2afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:42.014331Z","signature_b64":"AXeMDFIlXXkXtN1AX/l/TAqZRrKiNd9EN5rFTHlKZIwkGKcNPKIv7fmxiJskQz264rMPtJITlord/RriNsyaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e64088cb33eeb39f70899593380531a324f9cbed07f6976941b8671ced2f3865","last_reissued_at":"2026-05-18T00:29:42.013638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:42.013638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering Semi-Random Mixtures of Gaussians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Pranjal Awasthi","submitted_at":"2017-11-23T23:17:37Z","abstract_excerpt":"Gaussian mixture models (GMM) are the most widely used statistical model for the $k$-means clustering problem and form a popular framework for clustering in machine learning and data analysis. In this paper, we propose a natural semi-random model for $k$-means clustering that generalizes the Gaussian mixture model, and that we believe will be useful in identifying robust algorithms. In our model, a semi-random adversary is allowed to make arbitrary \"monotone\" or helpful changes to the data generated from the Gaussian mixture model.\n  Our first contribution is a polynomial time algorithm that p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08841","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":"1711.08841","created_at":"2026-05-18T00:29:42.013756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08841v1","created_at":"2026-05-18T00:29:42.013756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08841","created_at":"2026-05-18T00:29:42.013756+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZAIRSZT52ZZ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZAIRSZT52ZZ64EJ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZAIRSZT","created_at":"2026-05-18T12:31:00.734936+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/4ZAIRSZT52ZZ64EJSWJTQBJRUM","json":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM.json","graph_json":"https://pith.science/api/pith-number/4ZAIRSZT52ZZ64EJSWJTQBJRUM/graph.json","events_json":"https://pith.science/api/pith-number/4ZAIRSZT52ZZ64EJSWJTQBJRUM/events.json","paper":"https://pith.science/paper/4ZAIRSZT"},"agent_actions":{"view_html":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM","download_json":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM.json","view_paper":"https://pith.science/paper/4ZAIRSZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08841&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZAIRSZT52ZZ64EJSWJTQBJRUM/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZAIRSZT52ZZ64EJSWJTQBJRUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM/action/storage_attestation","attest_author":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM/action/author_attestation","sign_citation":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM/action/citation_signature","submit_replication":"https://pith.science/pith/4ZAIRSZT52ZZ64EJSWJTQBJRUM/action/replication_record"}},"created_at":"2026-05-18T00:29:42.013756+00:00","updated_at":"2026-05-18T00:29:42.013756+00:00"}