{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W2VEZEOB3SSFY6UV54BVE7R4NV","short_pith_number":"pith:W2VEZEOB","schema_version":"1.0","canonical_sha256":"b6aa4c91c1dca45c7a95ef03527e3c6d478bb3c42c963127fe10a59c356d684e","source":{"kind":"arxiv","id":"1806.03763","version":2},"attestation_state":"computed","paper":{"title":"Smoothed analysis of the low-rank approach for smooth semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Boumal, Samy Jelassi, Thomas Pumir","submitted_at":"2018-06-11T01:44:00Z","abstract_excerpt":"We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size $n$ by $k$ such that $X = YY^*$ is the SDP variable. The advantages of such formulation are twofold: the dimension of the optimization variable is reduced and positive semidefiniteness is naturally enforced. However, the problem in Y is non-convex. In prior work, it has been shown that, when the constraints on the factorized variable regularly define a smooth manifold, provided k is l"},"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":"1806.03763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-11T01:44:00Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2911cd28582b6853f1b65c3bea1ef75992f29bf1662ee34f9e898bf3210d9a43","abstract_canon_sha256":"053386917b87c0e0349912f35921456e24b920da32eb99bb231168ade3eb19ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.654952Z","signature_b64":"RK6zzIDCHn/UGgpP2bvpc5l/M1/Zru2UUvAYpOC9ydhf43rdqq/t1UI6QXc/m6oxtf6y3/+SkW25TkDQyOKoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6aa4c91c1dca45c7a95ef03527e3c6d478bb3c42c963127fe10a59c356d684e","last_reissued_at":"2026-05-17T23:59:44.654550Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.654550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothed analysis of the low-rank approach for smooth semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Boumal, Samy Jelassi, Thomas Pumir","submitted_at":"2018-06-11T01:44:00Z","abstract_excerpt":"We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size $n$ by $k$ such that $X = YY^*$ is the SDP variable. The advantages of such formulation are twofold: the dimension of the optimization variable is reduced and positive semidefiniteness is naturally enforced. However, the problem in Y is non-convex. In prior work, it has been shown that, when the constraints on the factorized variable regularly define a smooth manifold, provided k is l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03763","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":"1806.03763","created_at":"2026-05-17T23:59:44.654607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03763v2","created_at":"2026-05-17T23:59:44.654607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03763","created_at":"2026-05-17T23:59:44.654607+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2VEZEOB3SSF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2VEZEOB3SSFY6UV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2VEZEOB","created_at":"2026-05-18T12:32:59.047623+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/W2VEZEOB3SSFY6UV54BVE7R4NV","json":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV.json","graph_json":"https://pith.science/api/pith-number/W2VEZEOB3SSFY6UV54BVE7R4NV/graph.json","events_json":"https://pith.science/api/pith-number/W2VEZEOB3SSFY6UV54BVE7R4NV/events.json","paper":"https://pith.science/paper/W2VEZEOB"},"agent_actions":{"view_html":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV","download_json":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV.json","view_paper":"https://pith.science/paper/W2VEZEOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03763&json=true","fetch_graph":"https://pith.science/api/pith-number/W2VEZEOB3SSFY6UV54BVE7R4NV/graph.json","fetch_events":"https://pith.science/api/pith-number/W2VEZEOB3SSFY6UV54BVE7R4NV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV/action/storage_attestation","attest_author":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV/action/author_attestation","sign_citation":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV/action/citation_signature","submit_replication":"https://pith.science/pith/W2VEZEOB3SSFY6UV54BVE7R4NV/action/replication_record"}},"created_at":"2026-05-17T23:59:44.654607+00:00","updated_at":"2026-05-17T23:59:44.654607+00:00"}