{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IOKLJXPRZOZRSXYQIF5HWZF2B4","short_pith_number":"pith:IOKLJXPR","schema_version":"1.0","canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","source":{"kind":"arxiv","id":"1411.8003","version":3},"attestation_state":"computed","paper":{"title":"Guaranteed Matrix Completion via Non-convex Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2014-11-28T20:52:47Z","abstract_excerpt":"Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity caused by the factorization model, there is a limited theoretical understanding of this formulation. In this paper, we establish a theoretical guarantee for the factorization formulation to correctly recover the underlying low-rank matrix. In particular, we show that under similar conditions to those in previous works, many standard optimization algorithms con"},"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":"1411.8003","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-28T20:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"eadbb3ebcb536ff7a1583ce3c6011ae451d71878e59c6943a30c54a1c1051bdf","abstract_canon_sha256":"7431cca5d0119717e1b51ae3ce739fbd6222a56ba37a411de894f920c6a5f3f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.289500Z","signature_b64":"YRPfxCm4Et49FPGnyM+CjX3K0M/XYaQvbYjnUBuM9eDiKCue0fRUR/cSNYDibcyNaY7MFv2wVYsT5GgJNOKjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4394b4ddf1cbb3195f10417a7b64ba0f0c2702a1ebc5bfd2595c7cca11d722fb","last_reissued_at":"2026-05-18T00:57:51.289013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.289013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed Matrix Completion via Non-convex Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2014-11-28T20:52:47Z","abstract_excerpt":"Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity caused by the factorization model, there is a limited theoretical understanding of this formulation. In this paper, we establish a theoretical guarantee for the factorization formulation to correctly recover the underlying low-rank matrix. In particular, we show that under similar conditions to those in previous works, many standard optimization algorithms con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.8003","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1411.8003","created_at":"2026-05-18T00:57:51.289095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.8003v3","created_at":"2026-05-18T00:57:51.289095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.8003","created_at":"2026-05-18T00:57:51.289095+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOKLJXPRZOZR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOKLJXPRZOZRSXYQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOKLJXPR","created_at":"2026-05-18T12:28:33.132498+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/IOKLJXPRZOZRSXYQIF5HWZF2B4","json":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4.json","graph_json":"https://pith.science/api/pith-number/IOKLJXPRZOZRSXYQIF5HWZF2B4/graph.json","events_json":"https://pith.science/api/pith-number/IOKLJXPRZOZRSXYQIF5HWZF2B4/events.json","paper":"https://pith.science/paper/IOKLJXPR"},"agent_actions":{"view_html":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4","download_json":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4.json","view_paper":"https://pith.science/paper/IOKLJXPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.8003&json=true","fetch_graph":"https://pith.science/api/pith-number/IOKLJXPRZOZRSXYQIF5HWZF2B4/graph.json","fetch_events":"https://pith.science/api/pith-number/IOKLJXPRZOZRSXYQIF5HWZF2B4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/action/storage_attestation","attest_author":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/action/author_attestation","sign_citation":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/action/citation_signature","submit_replication":"https://pith.science/pith/IOKLJXPRZOZRSXYQIF5HWZF2B4/action/replication_record"}},"created_at":"2026-05-18T00:57:51.289095+00:00","updated_at":"2026-05-18T00:57:51.289095+00:00"}