{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YL7VEZROVDITABFRBEAXELR7GT","short_pith_number":"pith:YL7VEZRO","schema_version":"1.0","canonical_sha256":"c2ff52662ea8d13004b10901722e3f34c41768cb18e962b1db32fde3dd2b375a","source":{"kind":"arxiv","id":"2209.15130","version":2},"attestation_state":"computed","paper":{"title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NA","eess.SP","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Nicolas Garcia Trillos, Yuetian Luo","submitted_at":"2022-09-29T23:08:41Z","abstract_excerpt":"We study a general matrix optimization problem with a fixed-rank positive semidefinite (PSD) constraint. We perform the Burer-Monteiro factorization and consider a particular Riemannian quotient geometry in a search space that has a total space equipped with the Euclidean metric. When the original objective f satisfies standard restricted strong convexity and smoothness properties, we characterize the global landscape of the factorized objective under the Riemannian quotient geometry. We show the entire search space can be divided into three regions: (R1) the region near the target parameter o"},"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":"2209.15130","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-09-29T23:08:41Z","cross_cats_sorted":["cs.IT","cs.LG","cs.NA","eess.SP","math.IT","math.NA"],"title_canon_sha256":"cb0a06ab58b6a23bbb429285951e0359b173e69b815c4d95292a92256a382013","abstract_canon_sha256":"a2a7b70d805c433ed8cb6d371b99c59f1718061d3e8626f1a3675dbe5137a134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:14.580893Z","signature_b64":"L+bmFSvzgFGj21o2cq8En93eK+SpJP6B57AZCN28VHoVD48Y/ghjd2Z2CL0bjM5GDRC7qFRJGXtcIg5HPXp8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ff52662ea8d13004b10901722e3f34c41768cb18e962b1db32fde3dd2b375a","last_reissued_at":"2026-07-05T05:20:14.580423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:14.580423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.NA","eess.SP","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Nicolas Garcia Trillos, Yuetian Luo","submitted_at":"2022-09-29T23:08:41Z","abstract_excerpt":"We study a general matrix optimization problem with a fixed-rank positive semidefinite (PSD) constraint. We perform the Burer-Monteiro factorization and consider a particular Riemannian quotient geometry in a search space that has a total space equipped with the Euclidean metric. When the original objective f satisfies standard restricted strong convexity and smoothness properties, we characterize the global landscape of the factorized objective under the Riemannian quotient geometry. We show the entire search space can be divided into three regions: (R1) the region near the target parameter o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.15130/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.15130","created_at":"2026-07-05T05:20:14.580479+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15130v2","created_at":"2026-07-05T05:20:14.580479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15130","created_at":"2026-07-05T05:20:14.580479+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL7VEZROVDIT","created_at":"2026-07-05T05:20:14.580479+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL7VEZROVDITABFR","created_at":"2026-07-05T05:20:14.580479+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL7VEZRO","created_at":"2026-07-05T05:20:14.580479+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15419","citing_title":"A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT","json":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT.json","graph_json":"https://pith.science/api/pith-number/YL7VEZROVDITABFRBEAXELR7GT/graph.json","events_json":"https://pith.science/api/pith-number/YL7VEZROVDITABFRBEAXELR7GT/events.json","paper":"https://pith.science/paper/YL7VEZRO"},"agent_actions":{"view_html":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT","download_json":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT.json","view_paper":"https://pith.science/paper/YL7VEZRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15130&json=true","fetch_graph":"https://pith.science/api/pith-number/YL7VEZROVDITABFRBEAXELR7GT/graph.json","fetch_events":"https://pith.science/api/pith-number/YL7VEZROVDITABFRBEAXELR7GT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT/action/storage_attestation","attest_author":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT/action/author_attestation","sign_citation":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT/action/citation_signature","submit_replication":"https://pith.science/pith/YL7VEZROVDITABFRBEAXELR7GT/action/replication_record"}},"created_at":"2026-07-05T05:20:14.580479+00:00","updated_at":"2026-07-05T05:20:14.580479+00:00"}