{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQHRQGFR4BQLMGXYKB23ESAECZ","short_pith_number":"pith:RQHRQGFR","schema_version":"1.0","canonical_sha256":"8c0f1818b1e060b61af85075b248041666734d9236bff8a6077465a2118a0f6f","source":{"kind":"arxiv","id":"1603.05215","version":2},"attestation_state":"computed","paper":{"title":"Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","math.IT","math.ST","stat.AP","stat.TH"],"primary_cat":"math.OC","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Yonina C. Eldar","submitted_at":"2016-03-16T18:47:21Z","abstract_excerpt":"This paper considers phase retrieval from the magnitude of 1D over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a least-squares sense can be found by solving a convex problem, thus establishing a hidden convexity in Fourier phase retrieval. We also show that the standard semidefinite relaxation approach yields the optimal cost function value (albeit not necessarily an optimal solution) in this case. A method is then derived to retrieve an optimal minimum phase solution in polyno"},"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":"1603.05215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T18:47:21Z","cross_cats_sorted":["cs.IR","cs.IT","math.IT","math.ST","stat.AP","stat.TH"],"title_canon_sha256":"ebc7c4a8ab3bc495c56dd474f45628a237cc029d84f2d13f11e912f51aabb2ef","abstract_canon_sha256":"680459880ce62052796833cbb17246dfa7d9154dc13feaa4fc31bd7ff8e8999c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:39.547857Z","signature_b64":"C+PRmV5+6ypRmHYAGv9M+EAtN+/J8DKw19r/tQ51vO83bvVxTNwBRoaWX16fh9JGBg5XXNci7mARJmYtlAMHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0f1818b1e060b61af85075b248041666734d9236bff8a6077465a2118a0f6f","last_reissued_at":"2026-05-18T01:00:39.547246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:39.547246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","math.IT","math.ST","stat.AP","stat.TH"],"primary_cat":"math.OC","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Yonina C. Eldar","submitted_at":"2016-03-16T18:47:21Z","abstract_excerpt":"This paper considers phase retrieval from the magnitude of 1D over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a least-squares sense can be found by solving a convex problem, thus establishing a hidden convexity in Fourier phase retrieval. We also show that the standard semidefinite relaxation approach yields the optimal cost function value (albeit not necessarily an optimal solution) in this case. A method is then derived to retrieve an optimal minimum phase solution in polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05215","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":"1603.05215","created_at":"2026-05-18T01:00:39.547359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05215v2","created_at":"2026-05-18T01:00:39.547359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05215","created_at":"2026-05-18T01:00:39.547359+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQHRQGFR4BQL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQHRQGFR4BQLMGXY","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQHRQGFR","created_at":"2026-05-18T12:30:41.710351+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/RQHRQGFR4BQLMGXYKB23ESAECZ","json":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ.json","graph_json":"https://pith.science/api/pith-number/RQHRQGFR4BQLMGXYKB23ESAECZ/graph.json","events_json":"https://pith.science/api/pith-number/RQHRQGFR4BQLMGXYKB23ESAECZ/events.json","paper":"https://pith.science/paper/RQHRQGFR"},"agent_actions":{"view_html":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ","download_json":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ.json","view_paper":"https://pith.science/paper/RQHRQGFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05215&json=true","fetch_graph":"https://pith.science/api/pith-number/RQHRQGFR4BQLMGXYKB23ESAECZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RQHRQGFR4BQLMGXYKB23ESAECZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ/action/storage_attestation","attest_author":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ/action/author_attestation","sign_citation":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ/action/citation_signature","submit_replication":"https://pith.science/pith/RQHRQGFR4BQLMGXYKB23ESAECZ/action/replication_record"}},"created_at":"2026-05-18T01:00:39.547359+00:00","updated_at":"2026-05-18T01:00:39.547359+00:00"}