{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MPDBCLDQ7XEJZFXNS45C5UGGPJ","short_pith_number":"pith:MPDBCLDQ","schema_version":"1.0","canonical_sha256":"63c6112c70fdc89c96ed973a2ed0c67a598b0d3a706dd47722a8f5aea81f8eea","source":{"kind":"arxiv","id":"1206.0102","version":3},"attestation_state":"computed","paper":{"title":"Phase Recovery, MaxCut and Complex Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Ir\\`ene Waldspurger, St\\'ephane Mallat","submitted_at":"2012-06-01T07:11:00Z","abstract_excerpt":"Phase retrieval seeks to recover a signal x from the amplitude |Ax| of linear measurements. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar to that of the original greedy algorithm in Gerchberg-Saxton, where each iteration is a matrix vector product. Numerical results show the performance of this approach over three different p"},"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":"1206.0102","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-01T07:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"bee40dde52b68eefd84f82ae51129050e4a48cfc90f7eb76882e7bfd89529b57","abstract_canon_sha256":"4d3f22584e56b7fa795accc5ac27ff4dadb024fcaca0cc3eef43464b22773258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:57.396443Z","signature_b64":"txlztZzBIrfu4tVgoY/WftNCLjMAe9T/9o1PWV7vkdr7xWlLUNeuNjtRGkSQgwctc/dVIXG32wE+iBT7uuydAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c6112c70fdc89c96ed973a2ed0c67a598b0d3a706dd47722a8f5aea81f8eea","last_reissued_at":"2026-05-18T03:17:57.395874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:57.395874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Recovery, MaxCut and Complex Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Ir\\`ene Waldspurger, St\\'ephane Mallat","submitted_at":"2012-06-01T07:11:00Z","abstract_excerpt":"Phase retrieval seeks to recover a signal x from the amplitude |Ax| of linear measurements. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar to that of the original greedy algorithm in Gerchberg-Saxton, where each iteration is a matrix vector product. Numerical results show the performance of this approach over three different p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0102","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":"1206.0102","created_at":"2026-05-18T03:17:57.395964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0102v3","created_at":"2026-05-18T03:17:57.395964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0102","created_at":"2026-05-18T03:17:57.395964+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPDBCLDQ7XEJ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPDBCLDQ7XEJZFXN","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPDBCLDQ","created_at":"2026-05-18T12:27:14.488303+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/MPDBCLDQ7XEJZFXNS45C5UGGPJ","json":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ.json","graph_json":"https://pith.science/api/pith-number/MPDBCLDQ7XEJZFXNS45C5UGGPJ/graph.json","events_json":"https://pith.science/api/pith-number/MPDBCLDQ7XEJZFXNS45C5UGGPJ/events.json","paper":"https://pith.science/paper/MPDBCLDQ"},"agent_actions":{"view_html":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ","download_json":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ.json","view_paper":"https://pith.science/paper/MPDBCLDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0102&json=true","fetch_graph":"https://pith.science/api/pith-number/MPDBCLDQ7XEJZFXNS45C5UGGPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MPDBCLDQ7XEJZFXNS45C5UGGPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ/action/storage_attestation","attest_author":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ/action/author_attestation","sign_citation":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ/action/citation_signature","submit_replication":"https://pith.science/pith/MPDBCLDQ7XEJZFXNS45C5UGGPJ/action/replication_record"}},"created_at":"2026-05-18T03:17:57.395964+00:00","updated_at":"2026-05-18T03:17:57.395964+00:00"}