{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4BV4VY5ROMTXRIJLNV3Q6D3ATJ","short_pith_number":"pith:4BV4VY5R","schema_version":"1.0","canonical_sha256":"e06bcae3b1732778a12b6d770f0f609a6c713c60935004df657349f57e34241e","source":{"kind":"arxiv","id":"1703.08729","version":2},"attestation_state":"computed","paper":{"title":"Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Andrea Montanari, Roberto I. Oliveira, Song Mei, Theodor Misiakiewicz","submitted_at":"2017-03-25T18:45:55Z","abstract_excerpt":"A number of statistical estimation problems can be addressed by semidefinite programs (SDP). While SDPs are solvable in polynomial time using interior point methods, in practice generic SDP solvers do not scale well to high-dimensional problems. In order to cope with this problem, Burer and Monteiro proposed a non-convex rank-constrained formulation, which has good performance in practice but is still poorly understood theoretically.\n  In this paper we study the rank-constrained version of SDPs arising in MaxCut and in synchronization problems. We establish a Grothendieck-type inequality that "},"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":"1703.08729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-25T18:45:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"976ed57dd17d1321e565b4c11481a2f76a80f2dc86f25e9225a34c2f48b326b2","abstract_canon_sha256":"8b0588bd077134418bf9f0b08145dc2ba4be071edcf598804f0f0d7ba6146c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.779472Z","signature_b64":"jMefbZ+p/7fLzSfnu94ljLfkjA+lIKiOHB6ZRch6ZTe9wT8j8QhBGezhH1QbH+Znfbp+1FqzOm823VxiP5EXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e06bcae3b1732778a12b6d770f0f609a6c713c60935004df657349f57e34241e","last_reissued_at":"2026-05-18T00:47:37.778847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.778847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Andrea Montanari, Roberto I. Oliveira, Song Mei, Theodor Misiakiewicz","submitted_at":"2017-03-25T18:45:55Z","abstract_excerpt":"A number of statistical estimation problems can be addressed by semidefinite programs (SDP). While SDPs are solvable in polynomial time using interior point methods, in practice generic SDP solvers do not scale well to high-dimensional problems. In order to cope with this problem, Burer and Monteiro proposed a non-convex rank-constrained formulation, which has good performance in practice but is still poorly understood theoretically.\n  In this paper we study the rank-constrained version of SDPs arising in MaxCut and in synchronization problems. We establish a Grothendieck-type inequality that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08729","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":"1703.08729","created_at":"2026-05-18T00:47:37.778923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08729v2","created_at":"2026-05-18T00:47:37.778923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08729","created_at":"2026-05-18T00:47:37.778923+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BV4VY5ROMTX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BV4VY5ROMTXRIJL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BV4VY5R","created_at":"2026-05-18T12:30:58.224056+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/4BV4VY5ROMTXRIJLNV3Q6D3ATJ","json":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ.json","graph_json":"https://pith.science/api/pith-number/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/graph.json","events_json":"https://pith.science/api/pith-number/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/events.json","paper":"https://pith.science/paper/4BV4VY5R"},"agent_actions":{"view_html":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ","download_json":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ.json","view_paper":"https://pith.science/paper/4BV4VY5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08729&json=true","fetch_graph":"https://pith.science/api/pith-number/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/action/storage_attestation","attest_author":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/action/author_attestation","sign_citation":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/action/citation_signature","submit_replication":"https://pith.science/pith/4BV4VY5ROMTXRIJLNV3Q6D3ATJ/action/replication_record"}},"created_at":"2026-05-18T00:47:37.778923+00:00","updated_at":"2026-05-18T00:47:37.778923+00:00"}