{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BXVATFRLKX6JP65JECV67U45VO","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":"d79bc056cc49e4bc846bd1f5ac31af87a458ccbb010e026d0764d9e9f6149fe9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-07-11T03:16:10Z","title_canon_sha256":"c6b4319fb3547ee7c22f4d4ba6d5161cbcaedabd911e3331f6f450b6d55d3b7d"},"schema_version":"1.0","source":{"id":"2207.04600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.04600","created_at":"2026-07-05T06:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"2207.04600v2","created_at":"2026-07-05T06:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04600","created_at":"2026-07-05T06:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"BXVATFRLKX6J","created_at":"2026-07-05T06:18:17Z"},{"alias_kind":"pith_short_16","alias_value":"BXVATFRLKX6JP65J","created_at":"2026-07-05T06:18:17Z"},{"alias_kind":"pith_short_8","alias_value":"BXVATFRL","created_at":"2026-07-05T06:18:17Z"}],"graph_snapshots":[{"event_id":"sha256:59a6bc625bdb1a864e33b2e3017c690f5f15609549f1eeda027ae6d2758fd629","target":"graph","created_at":"2026-07-05T06:18:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.04600/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the computational and statistical limits in clustering matrix-valued observations. We propose a low-rank mixture model (LrMM), adapted from the classical Gaussian mixture model (GMM) to treat matrix-valued observations, which assumes low-rankness for population center matrices. A computationally efficient clustering method is designed by integrating Lloyd's algorithm and low-rank approximation. Once well-initialized, the algorithm converges fast and achieves an exponential-type clustering error rate that is minimax optimal. Meanwhile, we show that a tensor-based spectra","authors_text":"Dong Xia, Zhongyuan Lyu","cross_cats":["cs.IT","cs.LG","math.IT","stat.ME","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-07-11T03:16:10Z","title":"Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04600","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:a5197b6fbd6328c0c74aa8aca92e9083cbbb79387fb05f8dab6d9d0f81ffed46","target":"record","created_at":"2026-07-05T06:18:17Z","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":"d79bc056cc49e4bc846bd1f5ac31af87a458ccbb010e026d0764d9e9f6149fe9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ME","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-07-11T03:16:10Z","title_canon_sha256":"c6b4319fb3547ee7c22f4d4ba6d5161cbcaedabd911e3331f6f450b6d55d3b7d"},"schema_version":"1.0","source":{"id":"2207.04600","kind":"arxiv","version":2}},"canonical_sha256":"0dea09962b55fc97fba920abefd39daba11c334b914e1a35f5b1912de7ec9efa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dea09962b55fc97fba920abefd39daba11c334b914e1a35f5b1912de7ec9efa","first_computed_at":"2026-07-05T06:18:17.129833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:18:17.129833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rXNHA0ZCdsIxuvnT0WBb7u3hs7AR05vmw+w3lKb2wTv2u8gQQZ3/7iy2DCJW577hBtdEvdD/1jIhKvalN3gCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:18:17.130242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.04600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5197b6fbd6328c0c74aa8aca92e9083cbbb79387fb05f8dab6d9d0f81ffed46","sha256:59a6bc625bdb1a864e33b2e3017c690f5f15609549f1eeda027ae6d2758fd629"],"state_sha256":"1ef287b2c847576c0f449d95254918865710dc989ca3ff48591ea0451502f85c"}