{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5Z54SAJ2I3J4YP5VH6SCZAMLC4","short_pith_number":"pith:5Z54SAJ2","schema_version":"1.0","canonical_sha256":"ee7bc9013a46d3cc3fb53fa42c818b173ba2574411b4e6779a0c6a3dae758ccc","source":{"kind":"arxiv","id":"2106.08537","version":2},"attestation_state":"computed","paper":{"title":"Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Daniel Kongsgaard, Daniel M. Kane, Ilias Diakonikolas, Jerry Li, Kevin Tian","submitted_at":"2021-06-16T03:34:14Z","abstract_excerpt":"We study the problem of list-decodable mean estimation, where an adversary can corrupt a majority of the dataset. Specifically, we are given a set $T$ of $n$ points in $\\mathbb{R}^d$ and a parameter $0< \\alpha <\\frac 1 2$ such that an $\\alpha$-fraction of the points in $T$ are i.i.d. samples from a well-behaved distribution $\\mathcal{D}$ and the remaining $(1-\\alpha)$-fraction are arbitrary. The goal is to output a small list of vectors, at least one of which is close to the mean of $\\mathcal{D}$. We develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistica"},"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":"2106.08537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-16T03:34:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8aea7cfd30e2d1e0034954a08fa6e2851443338b53eef686ce9346fb9e197842","abstract_canon_sha256":"0c91ead31629888fc67eeb3ac26436a632d89e0827ab816a33418a43ea187b5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:03.268534Z","signature_b64":"vgvqjhlb5MbneIwDCmqyDL5kf2dGgec+4CL+2tFAu0Gy9xDF69TOoiFi7jV0H4FYZaen2tr6TRezRi6UAgb7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee7bc9013a46d3cc3fb53fa42c818b173ba2574411b4e6779a0c6a3dae758ccc","last_reissued_at":"2026-07-05T03:31:03.267905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:03.267905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Daniel Kongsgaard, Daniel M. Kane, Ilias Diakonikolas, Jerry Li, Kevin Tian","submitted_at":"2021-06-16T03:34:14Z","abstract_excerpt":"We study the problem of list-decodable mean estimation, where an adversary can corrupt a majority of the dataset. Specifically, we are given a set $T$ of $n$ points in $\\mathbb{R}^d$ and a parameter $0< \\alpha <\\frac 1 2$ such that an $\\alpha$-fraction of the points in $T$ are i.i.d. samples from a well-behaved distribution $\\mathcal{D}$ and the remaining $(1-\\alpha)$-fraction are arbitrary. The goal is to output a small list of vectors, at least one of which is close to the mean of $\\mathcal{D}$. We develop new algorithms for list-decodable mean estimation, achieving nearly-optimal statistica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08537","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/2106.08537/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":"2106.08537","created_at":"2026-07-05T03:31:03.267985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08537v2","created_at":"2026-07-05T03:31:03.267985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08537","created_at":"2026-07-05T03:31:03.267985+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z54SAJ2I3J4","created_at":"2026-07-05T03:31:03.267985+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z54SAJ2I3J4YP5V","created_at":"2026-07-05T03:31:03.267985+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z54SAJ2","created_at":"2026-07-05T03:31:03.267985+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/5Z54SAJ2I3J4YP5VH6SCZAMLC4","json":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4.json","graph_json":"https://pith.science/api/pith-number/5Z54SAJ2I3J4YP5VH6SCZAMLC4/graph.json","events_json":"https://pith.science/api/pith-number/5Z54SAJ2I3J4YP5VH6SCZAMLC4/events.json","paper":"https://pith.science/paper/5Z54SAJ2"},"agent_actions":{"view_html":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4","download_json":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4.json","view_paper":"https://pith.science/paper/5Z54SAJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08537&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z54SAJ2I3J4YP5VH6SCZAMLC4/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z54SAJ2I3J4YP5VH6SCZAMLC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4/action/storage_attestation","attest_author":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4/action/author_attestation","sign_citation":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4/action/citation_signature","submit_replication":"https://pith.science/pith/5Z54SAJ2I3J4YP5VH6SCZAMLC4/action/replication_record"}},"created_at":"2026-07-05T03:31:03.267985+00:00","updated_at":"2026-07-05T03:31:03.267985+00:00"}