{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EC62FXLUPHIPLXRY4D5PHSLAUG","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":"c51938d04eb99bf778b800610e262258a2de82dd4e6be3c1d5a6e57cb4e86f9f","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-03-02T09:05:15Z","title_canon_sha256":"483fd07522428c8719a125ac645afcd65fcd50dd78923bc5b6766e1eb31b57a2"},"schema_version":"1.0","source":{"id":"2203.00953","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00953","created_at":"2026-07-05T06:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00953v4","created_at":"2026-07-05T06:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00953","created_at":"2026-07-05T06:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"EC62FXLUPHIP","created_at":"2026-07-05T06:09:04Z"},{"alias_kind":"pith_short_16","alias_value":"EC62FXLUPHIPLXRY","created_at":"2026-07-05T06:09:04Z"},{"alias_kind":"pith_short_8","alias_value":"EC62FXLU","created_at":"2026-07-05T06:09:04Z"}],"graph_snapshots":[{"event_id":"sha256:b2d140887de61efe196ebe5833e52ecee3f4c5f9d6193424c62ca61cecbb12b8","target":"graph","created_at":"2026-07-05T06:09:04Z","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/2203.00953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank matrix estimation under heavy-tailed noise is challenging, both computationally and statistically. Convex approaches have been proven statistically optimal but suffer from high computational costs, especially since robust loss functions are usually non-smooth. More recently, computationally fast non-convex approaches via sub-gradient descent are proposed, which, unfortunately, fail to deliver a statistically consistent estimator even under sub-Gaussian noise. In this paper, we introduce a novel Riemannian sub-gradient (RsGrad) algorithm which is not only computationally efficient with","authors_text":"Dong Xia, Jian-Feng Cai, Jingyang Li, Yinan Shen","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-03-02T09:05:15Z","title":"Computationally Efficient and Statistically Optimal Robust Low-rank Matrix and Tensor Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00953","kind":"arxiv","version":4},"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:d1a90739a5bce9661c3a3735a635ecac14c6bf6a08b086c76a2d9d84fe8a909f","target":"record","created_at":"2026-07-05T06:09:04Z","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":"c51938d04eb99bf778b800610e262258a2de82dd4e6be3c1d5a6e57cb4e86f9f","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2022-03-02T09:05:15Z","title_canon_sha256":"483fd07522428c8719a125ac645afcd65fcd50dd78923bc5b6766e1eb31b57a2"},"schema_version":"1.0","source":{"id":"2203.00953","kind":"arxiv","version":4}},"canonical_sha256":"20bda2dd7479d0f5de38e0faf3c960a18e8ca01489f1966c51042f7de24a1207","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20bda2dd7479d0f5de38e0faf3c960a18e8ca01489f1966c51042f7de24a1207","first_computed_at":"2026-07-05T06:09:04.248213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:04.248213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ztSHHm5gxKDnaGTOH3MPeKCFqnJQPI7vff4SU7z2SFTNHQ1WoRp0EuOV/Byqcz893KuhJZsDn8O9TDt4fxVaAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:04.248648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00953","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a90739a5bce9661c3a3735a635ecac14c6bf6a08b086c76a2d9d84fe8a909f","sha256:b2d140887de61efe196ebe5833e52ecee3f4c5f9d6193424c62ca61cecbb12b8"],"state_sha256":"d08adb88c78b6cad58e18e7e2467e71a4ac5c2f69cbda40f4147723096e1dab7"}