{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4COOMNVBKQCNHUTJOYAUOCYGPQ","short_pith_number":"pith:4COOMNVB","schema_version":"1.0","canonical_sha256":"e09ce636a15404d3d2697601470b067c038b18bdb6ff302507d5bab4c3880464","source":{"kind":"arxiv","id":"1306.2672","version":2},"attestation_state":"computed","paper":{"title":"R3MC: A Riemannian three-factor algorithm for low-rank matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"B. Mishra, R. Sepulchre","submitted_at":"2013-06-11T22:42:21Z","abstract_excerpt":"We exploit the versatile framework of Riemannian optimization on quotient manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank matrix completion. The underlying search space of fixed-rank matrices is endowed with a novel Riemannian metric that is tailored to the least-squares cost. Numerical comparisons suggest that R3MC robustly outperforms state-of-the-art algorithms across different problem instances, especially those that combine scarcely sampled and ill-conditioned data."},"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":"1306.2672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-11T22:42:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5d13c84cc2021bf91128ad95464b505a427fa67766b2163404a8f79ee7bb26b1","abstract_canon_sha256":"409374e58e2f7536475ff2626f30568ccd45dbf514378497b5c9c4273581324b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:26.005944Z","signature_b64":"4d3LBKwnk92u8oQL6/zR5bbGsK8hvanjvKPa0CBMkRXl4BBnjyTlHDvmo9SgL8Tb24rKWPJUsw5Jb/3ncjS3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09ce636a15404d3d2697601470b067c038b18bdb6ff302507d5bab4c3880464","last_reissued_at":"2026-05-18T02:42:26.005094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:26.005094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"R3MC: A Riemannian three-factor algorithm for low-rank matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"B. Mishra, R. Sepulchre","submitted_at":"2013-06-11T22:42:21Z","abstract_excerpt":"We exploit the versatile framework of Riemannian optimization on quotient manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank matrix completion. The underlying search space of fixed-rank matrices is endowed with a novel Riemannian metric that is tailored to the least-squares cost. Numerical comparisons suggest that R3MC robustly outperforms state-of-the-art algorithms across different problem instances, especially those that combine scarcely sampled and ill-conditioned data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2672","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":"1306.2672","created_at":"2026-05-18T02:42:26.005215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2672v2","created_at":"2026-05-18T02:42:26.005215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2672","created_at":"2026-05-18T02:42:26.005215+00:00"},{"alias_kind":"pith_short_12","alias_value":"4COOMNVBKQCN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4COOMNVBKQCNHUTJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4COOMNVB","created_at":"2026-05-18T12:27:32.513160+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/4COOMNVBKQCNHUTJOYAUOCYGPQ","json":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ.json","graph_json":"https://pith.science/api/pith-number/4COOMNVBKQCNHUTJOYAUOCYGPQ/graph.json","events_json":"https://pith.science/api/pith-number/4COOMNVBKQCNHUTJOYAUOCYGPQ/events.json","paper":"https://pith.science/paper/4COOMNVB"},"agent_actions":{"view_html":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ","download_json":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ.json","view_paper":"https://pith.science/paper/4COOMNVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2672&json=true","fetch_graph":"https://pith.science/api/pith-number/4COOMNVBKQCNHUTJOYAUOCYGPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4COOMNVBKQCNHUTJOYAUOCYGPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ/action/storage_attestation","attest_author":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ/action/author_attestation","sign_citation":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ/action/citation_signature","submit_replication":"https://pith.science/pith/4COOMNVBKQCNHUTJOYAUOCYGPQ/action/replication_record"}},"created_at":"2026-05-18T02:42:26.005215+00:00","updated_at":"2026-05-18T02:42:26.005215+00:00"}