{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AAQ346F4UWPAZFWNJKPUWP72TN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"140e75b1bb7d68f021df97e92b28848a157979f4c73ebd6e6fa87fdd3bb8e05c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T05:18:11Z","title_canon_sha256":"9d915f60f3c36bc218c98304fac3e0ce0fd98cb387159ee462f058981e7e3e6f"},"schema_version":"1.0","source":{"id":"1807.04428","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04428","created_at":"2026-07-05T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04428v2","created_at":"2026-07-05T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04428","created_at":"2026-07-05T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"AAQ346F4UWPA","created_at":"2026-07-05T00:21:46Z"},{"alias_kind":"pith_short_16","alias_value":"AAQ346F4UWPAZFWN","created_at":"2026-07-05T00:21:46Z"},{"alias_kind":"pith_short_8","alias_value":"AAQ346F4","created_at":"2026-07-05T00:21:46Z"}],"graph_snapshots":[{"event_id":"sha256:2b538c7c112b78cce55e81aaca9d02f4050b98b92a3c3ac677909f096d85de63","target":"graph","created_at":"2026-07-05T00:21:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1807.04428/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group synchronization. Although SDPs can be solved to arbitrary precision in polynomial time, generic convex solvers do not scale well with the dimension of the problem. In order to address this issue, Burer and Monteiro proposed to reduce the dimension of the problem by appealing to a low-rank factorization and solve the subsequent non-convex problem instead. In this paper, we present coordinate ascent based methods to solve this non-convex problem with provab","authors_text":"Asuman Ozdaglar, Murat A. Erdogdu, Nuri Denizcan Vanli, Pablo A. Parrilo","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T05:18:11Z","title":"Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04428","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30c53dd28e49efcb6067c5e214db0ce136dd3d5f8682498680ca9e772ad2e46b","target":"record","created_at":"2026-07-05T00:21:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"140e75b1bb7d68f021df97e92b28848a157979f4c73ebd6e6fa87fdd3bb8e05c","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T05:18:11Z","title_canon_sha256":"9d915f60f3c36bc218c98304fac3e0ce0fd98cb387159ee462f058981e7e3e6f"},"schema_version":"1.0","source":{"id":"1807.04428","kind":"arxiv","version":2}},"canonical_sha256":"0021be78bca59e0c96cd4a9f4b3ffa9b412d437c7c93fbe2b9c2b547af9480a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0021be78bca59e0c96cd4a9f4b3ffa9b412d437c7c93fbe2b9c2b547af9480a1","first_computed_at":"2026-07-05T00:21:46.883223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:21:46.883223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yk4Wc1WMAp7YQB55dgExm44dmCYEdy7O0eWu4ziIVX+RWlT1I+mwQnJ2azFcWlWNUk62GYRx1hRm8FJllyy2Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:21:46.883694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04428","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30c53dd28e49efcb6067c5e214db0ce136dd3d5f8682498680ca9e772ad2e46b","sha256:2b538c7c112b78cce55e81aaca9d02f4050b98b92a3c3ac677909f096d85de63"],"state_sha256":"3a3affa220d5f26b9f5a747be76966b1da4560abb3fba2ac218dcd88c162e8f5"}