{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7L6MPCWSRTHHPW3UDHWMD3FB3I","short_pith_number":"pith:7L6MPCWS","schema_version":"1.0","canonical_sha256":"fafcc78ad28cce77db7419ecc1eca1da3d4d58a8d61a5501aed4eb706504b5ba","source":{"kind":"arxiv","id":"2006.10715","version":2},"attestation_state":"computed","paper":{"title":"List-Decodable Mean Estimation via Iterative Multi-Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel Kongsgaard, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2020-06-18T17:47:37Z","abstract_excerpt":"We study the problem of {\\em list-decodable mean estimation} for bounded covariance distributions. Specifically, we are given a set $T$ of points in $\\mathbb{R}^d$ with the promise that an unknown $\\alpha$-fraction of points in $T$, where $0< \\alpha < 1/2$, are drawn from an unknown mean and bounded covariance distribution $D$, and no assumptions are made on the remaining points. The goal is to output a small list of hypothesis vectors such that at least one of them is close to the mean of $D$. We give the first practically viable estimator for this problem. In more detail, our algorithm is sa"},"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":"2006.10715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-18T17:47:37Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1b83192f2b7e9fb301e39b1dd13d11dfcc279d8b1ae305d8b77eb2935f1cc3aa","abstract_canon_sha256":"00b6d9db56d6f47dc7381574d4b1b656784825ec3b4c980a577f841c0173dd7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:48.580722Z","signature_b64":"8riAtBmnRL1Bz8Xw++y3QBDHaHt1ogCpqGKL9RD7o1gqzPQJh4eKwSWbJ0Y8y52NiEOEGsKEccKqz99QK76UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fafcc78ad28cce77db7419ecc1eca1da3d4d58a8d61a5501aed4eb706504b5ba","last_reissued_at":"2026-07-05T01:11:48.580311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:48.580311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-Decodable Mean Estimation via Iterative Multi-Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Daniel Kongsgaard, Daniel M. Kane, Ilias Diakonikolas","submitted_at":"2020-06-18T17:47:37Z","abstract_excerpt":"We study the problem of {\\em list-decodable mean estimation} for bounded covariance distributions. Specifically, we are given a set $T$ of points in $\\mathbb{R}^d$ with the promise that an unknown $\\alpha$-fraction of points in $T$, where $0< \\alpha < 1/2$, are drawn from an unknown mean and bounded covariance distribution $D$, and no assumptions are made on the remaining points. The goal is to output a small list of hypothesis vectors such that at least one of them is close to the mean of $D$. We give the first practically viable estimator for this problem. In more detail, our algorithm is sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10715","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/2006.10715/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":"2006.10715","created_at":"2026-07-05T01:11:48.580381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.10715v2","created_at":"2026-07-05T01:11:48.580381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10715","created_at":"2026-07-05T01:11:48.580381+00:00"},{"alias_kind":"pith_short_12","alias_value":"7L6MPCWSRTHH","created_at":"2026-07-05T01:11:48.580381+00:00"},{"alias_kind":"pith_short_16","alias_value":"7L6MPCWSRTHHPW3U","created_at":"2026-07-05T01:11:48.580381+00:00"},{"alias_kind":"pith_short_8","alias_value":"7L6MPCWS","created_at":"2026-07-05T01:11:48.580381+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/7L6MPCWSRTHHPW3UDHWMD3FB3I","json":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I.json","graph_json":"https://pith.science/api/pith-number/7L6MPCWSRTHHPW3UDHWMD3FB3I/graph.json","events_json":"https://pith.science/api/pith-number/7L6MPCWSRTHHPW3UDHWMD3FB3I/events.json","paper":"https://pith.science/paper/7L6MPCWS"},"agent_actions":{"view_html":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I","download_json":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I.json","view_paper":"https://pith.science/paper/7L6MPCWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.10715&json=true","fetch_graph":"https://pith.science/api/pith-number/7L6MPCWSRTHHPW3UDHWMD3FB3I/graph.json","fetch_events":"https://pith.science/api/pith-number/7L6MPCWSRTHHPW3UDHWMD3FB3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I/action/storage_attestation","attest_author":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I/action/author_attestation","sign_citation":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I/action/citation_signature","submit_replication":"https://pith.science/pith/7L6MPCWSRTHHPW3UDHWMD3FB3I/action/replication_record"}},"created_at":"2026-07-05T01:11:48.580381+00:00","updated_at":"2026-07-05T01:11:48.580381+00:00"}