{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4NH7WJZC3NJF4QC42XLF5ILUQ5","short_pith_number":"pith:4NH7WJZC","schema_version":"1.0","canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","source":{"kind":"arxiv","id":"1209.0430","version":2},"attestation_state":"computed","paper":{"title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"B. Mishra, G. Meyer, R. Sepulchre, S. Bonnabel","submitted_at":"2012-09-03T18:48:37Z","abstract_excerpt":"Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fix"},"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.0430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-03T18:48:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8c651b19c1fff450033a9e435d27ccfc46a5434bcec20a46f546ce8367380d5d","abstract_canon_sha256":"d3b8d026e6f5a6a8355c785b70ecfe8dc314e356f3ff8b0371b0b5850f1f2310"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.853549Z","signature_b64":"JTS/zyh0juV6gsg5rFcQZIPpbHbld/YTePoYrYyU4XRLsnP8qijxKuLuEpwva+z+ESMb3j3+ncmERqvuTOyIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34ffb2722db525e405cd5d65ea174877ae72cf3a555201b9c63cc480fd5f018","last_reissued_at":"2026-05-18T03:27:13.852774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.852774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"B. Mishra, G. Meyer, R. Sepulchre, S. Bonnabel","submitted_at":"2012-09-03T18:48:37Z","abstract_excerpt":"Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0430","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":"1209.0430","created_at":"2026-05-18T03:27:13.852876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0430v2","created_at":"2026-05-18T03:27:13.852876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0430","created_at":"2026-05-18T03:27:13.852876+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NH7WJZC3NJF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NH7WJZC3NJF4QC4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NH7WJZC","created_at":"2026-05-18T12:26:53.410803+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/4NH7WJZC3NJF4QC42XLF5ILUQ5","json":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5.json","graph_json":"https://pith.science/api/pith-number/4NH7WJZC3NJF4QC42XLF5ILUQ5/graph.json","events_json":"https://pith.science/api/pith-number/4NH7WJZC3NJF4QC42XLF5ILUQ5/events.json","paper":"https://pith.science/paper/4NH7WJZC"},"agent_actions":{"view_html":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5","download_json":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5.json","view_paper":"https://pith.science/paper/4NH7WJZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0430&json=true","fetch_graph":"https://pith.science/api/pith-number/4NH7WJZC3NJF4QC42XLF5ILUQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/4NH7WJZC3NJF4QC42XLF5ILUQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/action/storage_attestation","attest_author":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/action/author_attestation","sign_citation":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/action/citation_signature","submit_replication":"https://pith.science/pith/4NH7WJZC3NJF4QC42XLF5ILUQ5/action/replication_record"}},"created_at":"2026-05-18T03:27:13.852876+00:00","updated_at":"2026-05-18T03:27:13.852876+00:00"}