{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VWFRRNIXZ376DZYD3Z7AYELH2A","short_pith_number":"pith:VWFRRNIX","schema_version":"1.0","canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","source":{"kind":"arxiv","id":"1411.1087","version":1},"attestation_state":"computed","paper":{"title":"Fast Exact Matrix Completion with Finite Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.NA","authors_text":"Praneeth Netrapalli, Prateek Jain","submitted_at":"2014-11-04T21:16:23Z","abstract_excerpt":"Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-convex optimization based iterative algorithms to solve this problem. However, the sample complexity in all these results is sub-optimal in its dependence on the rank, condition number and the desired accuracy.\n  In this paper, we present a fast iterative algorithm that solves the matrix completion problem by observing $O(nr^5 \\log^3 n)$ entries, which is independent of the condition number and the desired accuracy. Th"},"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.1087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"cb05530dcce48de3619bed85cb841c4ca4543ad95aa736c2fae3db70ff4dbeb6","abstract_canon_sha256":"c2398c5815e53f8b3bbb9a7a1139240f96163714d6afbd42043d745ba565b179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.351205Z","signature_b64":"alQHs7qgYe9gkflWga1z0YgCZYFutOuoubmp623dGccNBGAfZshF6ljcYevyGmwkDwmJ0gExtV2TMkhtRknMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","last_reissued_at":"2026-05-18T02:38:36.350644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.350644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Exact Matrix Completion with Finite Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.NA","authors_text":"Praneeth Netrapalli, Prateek Jain","submitted_at":"2014-11-04T21:16:23Z","abstract_excerpt":"Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-convex optimization based iterative algorithms to solve this problem. However, the sample complexity in all these results is sub-optimal in its dependence on the rank, condition number and the desired accuracy.\n  In this paper, we present a fast iterative algorithm that solves the matrix completion problem by observing $O(nr^5 \\log^3 n)$ entries, which is independent of the condition number and the desired accuracy. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1087","kind":"arxiv","version":1},"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.1087","created_at":"2026-05-18T02:38:36.350716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1087v1","created_at":"2026-05-18T02:38:36.350716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1087","created_at":"2026-05-18T02:38:36.350716+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWFRRNIXZ376","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWFRRNIXZ376DZYD","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWFRRNIX","created_at":"2026-05-18T12:28:54.890064+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/VWFRRNIXZ376DZYD3Z7AYELH2A","json":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A.json","graph_json":"https://pith.science/api/pith-number/VWFRRNIXZ376DZYD3Z7AYELH2A/graph.json","events_json":"https://pith.science/api/pith-number/VWFRRNIXZ376DZYD3Z7AYELH2A/events.json","paper":"https://pith.science/paper/VWFRRNIX"},"agent_actions":{"view_html":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A","download_json":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A.json","view_paper":"https://pith.science/paper/VWFRRNIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1087&json=true","fetch_graph":"https://pith.science/api/pith-number/VWFRRNIXZ376DZYD3Z7AYELH2A/graph.json","fetch_events":"https://pith.science/api/pith-number/VWFRRNIXZ376DZYD3Z7AYELH2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/action/storage_attestation","attest_author":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/action/author_attestation","sign_citation":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/action/citation_signature","submit_replication":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/action/replication_record"}},"created_at":"2026-05-18T02:38:36.350716+00:00","updated_at":"2026-05-18T02:38:36.350716+00:00"}