{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PGQPNAY25NSLS7RAHG6VP5SPKO","short_pith_number":"pith:PGQPNAY2","schema_version":"1.0","canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","source":{"kind":"arxiv","id":"1803.00186","version":1},"attestation_state":"computed","paper":{"title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Boumal, Praneeth Netrapalli, Prateek Jain, Srinadh Bhojanapalli","submitted_at":"2018-03-01T03:11:11Z","abstract_excerpt":"Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer--Monteiro factorization approach for solving SDPs. We show that all approximate local optima are global optima for the penalty formulation of appropriately rank-constrained SDPs as long as the number of constraints scales sub-quadratically with the desired rank of the optimal solution. Our result is based on a simple penalty function formulation of the rank-constrained SDP along with a smoothed ana"},"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":"1803.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2a6ca88a7fa5ee06cbb3b0b82982d07c13e57aedf7e761c3fcd097a6c3d94b46","abstract_canon_sha256":"5777bdba5be34401bdb598ed43989e0238b3e42342d7a21c4b31c9dc87f05428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:13.092925Z","signature_b64":"9UZ1A2PqF2JScX4H3FmHetDjoX2jCGCiVOdZayh+zbl4ZF7AH3fC5sycZwe8kuMo+BO9FFCRXYax8oc2evHyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","last_reissued_at":"2026-05-18T00:22:13.092223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:13.092223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Boumal, Praneeth Netrapalli, Prateek Jain, Srinadh Bhojanapalli","submitted_at":"2018-03-01T03:11:11Z","abstract_excerpt":"Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer--Monteiro factorization approach for solving SDPs. We show that all approximate local optima are global optima for the penalty formulation of appropriately rank-constrained SDPs as long as the number of constraints scales sub-quadratically with the desired rank of the optimal solution. Our result is based on a simple penalty function formulation of the rank-constrained SDP along with a smoothed ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00186","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":"1803.00186","created_at":"2026-05-18T00:22:13.092304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00186v1","created_at":"2026-05-18T00:22:13.092304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00186","created_at":"2026-05-18T00:22:13.092304+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGQPNAY25NSL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGQPNAY25NSLS7RA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGQPNAY2","created_at":"2026-05-18T12:32:43.782077+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/PGQPNAY25NSLS7RAHG6VP5SPKO","json":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO.json","graph_json":"https://pith.science/api/pith-number/PGQPNAY25NSLS7RAHG6VP5SPKO/graph.json","events_json":"https://pith.science/api/pith-number/PGQPNAY25NSLS7RAHG6VP5SPKO/events.json","paper":"https://pith.science/paper/PGQPNAY2"},"agent_actions":{"view_html":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO","download_json":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO.json","view_paper":"https://pith.science/paper/PGQPNAY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00186&json=true","fetch_graph":"https://pith.science/api/pith-number/PGQPNAY25NSLS7RAHG6VP5SPKO/graph.json","fetch_events":"https://pith.science/api/pith-number/PGQPNAY25NSLS7RAHG6VP5SPKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/action/storage_attestation","attest_author":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/action/author_attestation","sign_citation":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/action/citation_signature","submit_replication":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/action/replication_record"}},"created_at":"2026-05-18T00:22:13.092304+00:00","updated_at":"2026-05-18T00:22:13.092304+00:00"}