{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6RQDEFKMSDWIWL24KGP7GYSCSS","short_pith_number":"pith:6RQDEFKM","schema_version":"1.0","canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","source":{"kind":"arxiv","id":"1209.3834","version":1},"attestation_state":"computed","paper":{"title":"Low-rank matrix completion by Riemannian optimization---extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.NA"],"primary_cat":"math.OC","authors_text":"Bart Vandereycken","submitted_at":"2012-09-18T03:21:58Z","abstract_excerpt":"The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework of retraction-based optimization on manifolds. We describe all the necessary objects from differential geometry necessary to perform optimization over this low-rank matrix manifold, seen as a submanifold em"},"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":"1209.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","cross_cats_sorted":["math.DG","math.NA"],"title_canon_sha256":"cd44ef75337ac413fa3b93726fb6122b0ebc10c0794ca4ae7b82a6cd0bf79982","abstract_canon_sha256":"b313e541e7a098cba6cb52eb2a79640c7b7294f31279d98a97396bcacfad9591"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.401223Z","signature_b64":"XQjWJsU3GMTrB7dxTaBsqy59dxyPFBY/479VMM7qsGZB44Hy5O7ptH8YwGIT2fUUGrhnUFh1o9BKNQ99BFfBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","last_reissued_at":"2026-05-18T03:45:22.400666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.400666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank matrix completion by Riemannian optimization---extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.NA"],"primary_cat":"math.OC","authors_text":"Bart Vandereycken","submitted_at":"2012-09-18T03:21:58Z","abstract_excerpt":"The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework of retraction-based optimization on manifolds. We describe all the necessary objects from differential geometry necessary to perform optimization over this low-rank matrix manifold, seen as a submanifold em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3834","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":"1209.3834","created_at":"2026-05-18T03:45:22.400758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3834v1","created_at":"2026-05-18T03:45:22.400758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3834","created_at":"2026-05-18T03:45:22.400758+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RQDEFKMSDWI","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RQDEFKMSDWIWL24","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RQDEFKM","created_at":"2026-05-18T12:26:56.085431+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/6RQDEFKMSDWIWL24KGP7GYSCSS","json":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS.json","graph_json":"https://pith.science/api/pith-number/6RQDEFKMSDWIWL24KGP7GYSCSS/graph.json","events_json":"https://pith.science/api/pith-number/6RQDEFKMSDWIWL24KGP7GYSCSS/events.json","paper":"https://pith.science/paper/6RQDEFKM"},"agent_actions":{"view_html":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS","download_json":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS.json","view_paper":"https://pith.science/paper/6RQDEFKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3834&json=true","fetch_graph":"https://pith.science/api/pith-number/6RQDEFKMSDWIWL24KGP7GYSCSS/graph.json","fetch_events":"https://pith.science/api/pith-number/6RQDEFKMSDWIWL24KGP7GYSCSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/action/storage_attestation","attest_author":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/action/author_attestation","sign_citation":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/action/citation_signature","submit_replication":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/action/replication_record"}},"created_at":"2026-05-18T03:45:22.400758+00:00","updated_at":"2026-05-18T03:45:22.400758+00:00"}