{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DHOPR4XMJG37HGI4GAPLR6D3QB","short_pith_number":"pith:DHOPR4XM","schema_version":"1.0","canonical_sha256":"19dcf8f2ec49b7f3991c301eb8f87b804f43114344ec4212e4b0253982f10865","source":{"kind":"arxiv","id":"1703.06605","version":1},"attestation_state":"computed","paper":{"title":"Near-optimal bounds for phase synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nicolas Boumal, Yiqiao Zhong","submitted_at":"2017-03-20T05:20:44Z","abstract_excerpt":"The problem of phase synchronization is to estimate the phases (angles) of a complex unit-modulus vector $z$ from their noisy pairwise relative measurements $C = zz^* + \\sigma W$, where $W$ is a complex-valued Gaussian random matrix. The maximum likelihood estimator (MLE) is a solution to a unit-modulus constrained quadratic programming problem, which is nonconvex. Existing works have proposed polynomial-time algorithms such as a semidefinite relaxation (SDP) approach or the generalized power method (GPM) to solve it. Numerical experiments suggest both of these methods succeed with high probab"},"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.06605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-20T05:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"b35ad918cf2d0860ec7125f7eae9918c2281031f3e090d15c35660ffff8dfc99","abstract_canon_sha256":"a28d9bbd3849b75ce4d407ec9133659c9585992cd861bab3b9f31a7c2f1492a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:04.210884Z","signature_b64":"d4+cGjjCZknd0gM5Y/fSWlAYo7CuXjvC0ScyBhWKBrp2QVYHovqlk9WRMJvJ7GelXfMoB0Hkl/QQaq4A/GO1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19dcf8f2ec49b7f3991c301eb8f87b804f43114344ec4212e4b0253982f10865","last_reissued_at":"2026-05-18T00:19:04.210217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:04.210217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal bounds for phase synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nicolas Boumal, Yiqiao Zhong","submitted_at":"2017-03-20T05:20:44Z","abstract_excerpt":"The problem of phase synchronization is to estimate the phases (angles) of a complex unit-modulus vector $z$ from their noisy pairwise relative measurements $C = zz^* + \\sigma W$, where $W$ is a complex-valued Gaussian random matrix. The maximum likelihood estimator (MLE) is a solution to a unit-modulus constrained quadratic programming problem, which is nonconvex. Existing works have proposed polynomial-time algorithms such as a semidefinite relaxation (SDP) approach or the generalized power method (GPM) to solve it. Numerical experiments suggest both of these methods succeed with high probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06605","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":"1703.06605","created_at":"2026-05-18T00:19:04.210308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06605v1","created_at":"2026-05-18T00:19:04.210308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06605","created_at":"2026-05-18T00:19:04.210308+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHOPR4XMJG37","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHOPR4XMJG37HGI4","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHOPR4XM","created_at":"2026-05-18T12:31:10.602751+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/DHOPR4XMJG37HGI4GAPLR6D3QB","json":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB.json","graph_json":"https://pith.science/api/pith-number/DHOPR4XMJG37HGI4GAPLR6D3QB/graph.json","events_json":"https://pith.science/api/pith-number/DHOPR4XMJG37HGI4GAPLR6D3QB/events.json","paper":"https://pith.science/paper/DHOPR4XM"},"agent_actions":{"view_html":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB","download_json":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB.json","view_paper":"https://pith.science/paper/DHOPR4XM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06605&json=true","fetch_graph":"https://pith.science/api/pith-number/DHOPR4XMJG37HGI4GAPLR6D3QB/graph.json","fetch_events":"https://pith.science/api/pith-number/DHOPR4XMJG37HGI4GAPLR6D3QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB/action/storage_attestation","attest_author":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB/action/author_attestation","sign_citation":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB/action/citation_signature","submit_replication":"https://pith.science/pith/DHOPR4XMJG37HGI4GAPLR6D3QB/action/replication_record"}},"created_at":"2026-05-18T00:19:04.210308+00:00","updated_at":"2026-05-18T00:19:04.210308+00:00"}