{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NVMJXTFXGVLYHOSDWQFGPTBOYS","short_pith_number":"pith:NVMJXTFX","schema_version":"1.0","canonical_sha256":"6d589bccb7355783ba43b40a67cc2ec4a0600789217bbf9db86cf52ad257141c","source":{"kind":"arxiv","id":"0906.2027","version":2},"attestation_state":"computed","paper":{"title":"Matrix Completion from Noisy Entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Montanari, Raghunandan H. Keshavan, Sewoong Oh","submitted_at":"2009-06-11T00:22:58Z","abstract_excerpt":"Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm introduced by Keshavan et al.(2009), based on a combination of spectral techniques and manifold optimization, that we call here OptSpace. We prove performance guarantees that are order-optimal in a number of circumstances."},"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":"0906.2027","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-06-11T00:22:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a0c3f2fa189b189b710861d79e4fa161a38b75a9012e7819db8de5439be0464c","abstract_canon_sha256":"351cc02ef7341f28fac41054ddc5c8a2719ef3ec4606936b7dc0d0dd28dbe28c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:25.105222Z","signature_b64":"2qQtbvzYTdIIilOnKNWwNx4Uf70ZtIHIZhvFGUboQ8CdwUAcAYcWFUyXU4za3jFG8WyW44J6wCiuHTg/F7tHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d589bccb7355783ba43b40a67cc2ec4a0600789217bbf9db86cf52ad257141c","last_reissued_at":"2026-05-18T03:58:25.104634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:25.104634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Completion from Noisy Entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Montanari, Raghunandan H. Keshavan, Sewoong Oh","submitted_at":"2009-06-11T00:22:58Z","abstract_excerpt":"Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm introduced by Keshavan et al.(2009), based on a combination of spectral techniques and manifold optimization, that we call here OptSpace. We prove performance guarantees that are order-optimal in a number of circumstances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2027","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":""},"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":"0906.2027","created_at":"2026-05-18T03:58:25.104733+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.2027v2","created_at":"2026-05-18T03:58:25.104733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2027","created_at":"2026-05-18T03:58:25.104733+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVMJXTFXGVLY","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVMJXTFXGVLYHOSD","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVMJXTFX","created_at":"2026-05-18T12:26:00.592388+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/NVMJXTFXGVLYHOSDWQFGPTBOYS","json":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS.json","graph_json":"https://pith.science/api/pith-number/NVMJXTFXGVLYHOSDWQFGPTBOYS/graph.json","events_json":"https://pith.science/api/pith-number/NVMJXTFXGVLYHOSDWQFGPTBOYS/events.json","paper":"https://pith.science/paper/NVMJXTFX"},"agent_actions":{"view_html":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS","download_json":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS.json","view_paper":"https://pith.science/paper/NVMJXTFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.2027&json=true","fetch_graph":"https://pith.science/api/pith-number/NVMJXTFXGVLYHOSDWQFGPTBOYS/graph.json","fetch_events":"https://pith.science/api/pith-number/NVMJXTFXGVLYHOSDWQFGPTBOYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS/action/storage_attestation","attest_author":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS/action/author_attestation","sign_citation":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS/action/citation_signature","submit_replication":"https://pith.science/pith/NVMJXTFXGVLYHOSDWQFGPTBOYS/action/replication_record"}},"created_at":"2026-05-18T03:58:25.104733+00:00","updated_at":"2026-05-18T03:58:25.104733+00:00"}