{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XLURPRG5SGJSED4ZUN3P7YMYOO","short_pith_number":"pith:XLURPRG5","schema_version":"1.0","canonical_sha256":"bae917c4dd9193220f99a376ffe198738ece4d4bbc9591ca71c299580296a054","source":{"kind":"arxiv","id":"1902.07698","version":2},"attestation_state":"computed","paper":{"title":"Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cong Ma, Jianqing Fan, Yuejie Chi, Yuling Yan, Yuxin Chen","submitted_at":"2019-02-20T18:51:50Z","abstract_excerpt":"This paper studies noisy low-rank matrix completion: given partial and noisy entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently. Arguably one of the most popular paradigms to tackle this problem is convex relaxation, which achieves remarkable efficacy in practice. However, the theoretical support of this approach is still far from optimal in the noisy setting, falling short of explaining its empirical success.\n  We make progress towards demystifying the practical efficacy of convex relaxation vis-\\`a-vis random noise. When the rank and "},"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":"1902.07698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-20T18:51:50Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"50ddab9750a27fea6be23b05d781fdda81dbebb3857c7c199a359c7dce5eb816","abstract_canon_sha256":"cde0b75d1050377c32f6d0857702f7289c5137d4aaada8e9c7a2c3b8e0763065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:00.307751Z","signature_b64":"fjFr9wJbL8pqmruLANmkuKXVjRuohaqcyHXbZ497B7zhCLo4B5duG3QbYsuM1FDqIPWNk2pxuxSesjYNR/TLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae917c4dd9193220f99a376ffe198738ece4d4bbc9591ca71c299580296a054","last_reissued_at":"2026-07-05T00:10:00.307204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:00.307204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cong Ma, Jianqing Fan, Yuejie Chi, Yuling Yan, Yuxin Chen","submitted_at":"2019-02-20T18:51:50Z","abstract_excerpt":"This paper studies noisy low-rank matrix completion: given partial and noisy entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently. Arguably one of the most popular paradigms to tackle this problem is convex relaxation, which achieves remarkable efficacy in practice. However, the theoretical support of this approach is still far from optimal in the noisy setting, falling short of explaining its empirical success.\n  We make progress towards demystifying the practical efficacy of convex relaxation vis-\\`a-vis random noise. When the rank and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07698","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/1902.07698/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":"1902.07698","created_at":"2026-07-05T00:10:00.307275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07698v2","created_at":"2026-07-05T00:10:00.307275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07698","created_at":"2026-07-05T00:10:00.307275+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLURPRG5SGJS","created_at":"2026-07-05T00:10:00.307275+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLURPRG5SGJSED4Z","created_at":"2026-07-05T00:10:00.307275+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLURPRG5","created_at":"2026-07-05T00:10:00.307275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00116","citing_title":"Statistical Inferences of Linear Forms for Noisy Matrix Completion","ref_index":2015,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO","json":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO.json","graph_json":"https://pith.science/api/pith-number/XLURPRG5SGJSED4ZUN3P7YMYOO/graph.json","events_json":"https://pith.science/api/pith-number/XLURPRG5SGJSED4ZUN3P7YMYOO/events.json","paper":"https://pith.science/paper/XLURPRG5"},"agent_actions":{"view_html":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO","download_json":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO.json","view_paper":"https://pith.science/paper/XLURPRG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07698&json=true","fetch_graph":"https://pith.science/api/pith-number/XLURPRG5SGJSED4ZUN3P7YMYOO/graph.json","fetch_events":"https://pith.science/api/pith-number/XLURPRG5SGJSED4ZUN3P7YMYOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO/action/storage_attestation","attest_author":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO/action/author_attestation","sign_citation":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO/action/citation_signature","submit_replication":"https://pith.science/pith/XLURPRG5SGJSED4ZUN3P7YMYOO/action/replication_record"}},"created_at":"2026-07-05T00:10:00.307275+00:00","updated_at":"2026-07-05T00:10:00.307275+00:00"}