{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YF6QHLESSVYWWO34K3V67AMDZR","short_pith_number":"pith:YF6QHLES","schema_version":"1.0","canonical_sha256":"c17d03ac9295716b3b7c56ebef8183cc4afa3e6b4f4e021809089c9f871473b5","source":{"kind":"arxiv","id":"1606.04970","version":3},"attestation_state":"computed","paper":{"title":"The non-convex Burer-Monteiro approach works on smooth semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski","submitted_at":"2016-06-15T20:31:29Z","abstract_excerpt":"Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and Monteiro proposed to solve SDPs with few equality constraints via rank-restricted, non-convex surrogates. Remarkably, for some applications, local optimization methods seem to converge to global optima of these non-convex surrogates reliably. Although some theory supports this empirical success, a complete explanation of it remains an open question. In this paper, we consider a class of SDPs which includes applicatio"},"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":"1606.04970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T20:31:29Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a6d42692f54e09f031754526e9eaf4780260aa30b17ffb9de5ebb1ac04a858e0","abstract_canon_sha256":"6f8c947d88b5f69bfbfec63d25c9c8e6b8375555d16117a58b35b328042891fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.932107Z","signature_b64":"XLa6bO+EgZIu+WkDf683emMSPA2nvCzm+XAUZiTkWoS10AlVc+/gUbconCPWuJVfUkx7/LxODSLau2G/abTYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17d03ac9295716b3b7c56ebef8183cc4afa3e6b4f4e021809089c9f871473b5","last_reissued_at":"2026-05-18T00:18:46.931426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.931426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The non-convex Burer-Monteiro approach works on smooth semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski","submitted_at":"2016-06-15T20:31:29Z","abstract_excerpt":"Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and Monteiro proposed to solve SDPs with few equality constraints via rank-restricted, non-convex surrogates. Remarkably, for some applications, local optimization methods seem to converge to global optima of these non-convex surrogates reliably. Although some theory supports this empirical success, a complete explanation of it remains an open question. In this paper, we consider a class of SDPs which includes applicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04970","kind":"arxiv","version":3},"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":"1606.04970","created_at":"2026-05-18T00:18:46.931542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04970v3","created_at":"2026-05-18T00:18:46.931542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04970","created_at":"2026-05-18T00:18:46.931542+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF6QHLESSVYW","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF6QHLESSVYWWO34","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF6QHLES","created_at":"2026-05-18T12:30:53.716459+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/YF6QHLESSVYWWO34K3V67AMDZR","json":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR.json","graph_json":"https://pith.science/api/pith-number/YF6QHLESSVYWWO34K3V67AMDZR/graph.json","events_json":"https://pith.science/api/pith-number/YF6QHLESSVYWWO34K3V67AMDZR/events.json","paper":"https://pith.science/paper/YF6QHLES"},"agent_actions":{"view_html":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR","download_json":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR.json","view_paper":"https://pith.science/paper/YF6QHLES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04970&json=true","fetch_graph":"https://pith.science/api/pith-number/YF6QHLESSVYWWO34K3V67AMDZR/graph.json","fetch_events":"https://pith.science/api/pith-number/YF6QHLESSVYWWO34K3V67AMDZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR/action/storage_attestation","attest_author":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR/action/author_attestation","sign_citation":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR/action/citation_signature","submit_replication":"https://pith.science/pith/YF6QHLESSVYWWO34K3V67AMDZR/action/replication_record"}},"created_at":"2026-05-18T00:18:46.931542+00:00","updated_at":"2026-05-18T00:18:46.931542+00:00"}