{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TGI7FZQBH4E74DNN4HXXRXQYMC","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":"970ffafda39124439c30dc0a805347c94b68c8445bb284b434cc3a9a6d1aeaf2","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-18T18:04:39Z","title_canon_sha256":"ff3417f2cb8261e7de2c5c908d6be201c7aa47bb3af9bc20b872afedd7a507c0"},"schema_version":"1.0","source":{"id":"1707.05797","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05797","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05797v3","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05797","created_at":"2026-05-18T00:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"TGI7FZQBH4E7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TGI7FZQBH4E74DNN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TGI7FZQB","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f515dc65013ed55ee3028724081a2410b747aecd8094272ea81151dfeb94c96c","target":"graph","created_at":"2026-05-18T00:16:31Z","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"},"paper":{"abstract_excerpt":"Phase retrieval has important applications in optical imaging, communications and sensing. Lifting the dimensionality of the problem allows phase retrieval to be approximated as a convex optimization problem in a higher-dimensional space. Convex optimization-based phase retrieval has been shown to yield high accuracy, yet its low-complexity implementation has not been explored. In this paper, we study three fundamental approaches for its low-complexity implementation: the projected gradient method, the Nesterov accelerated gradient method, and the alternating direction method of multipliers (A","authors_text":"Joseph M. Kahn, Sercan O. Arik","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-18T18:04:39Z","title":"Low-complexity implementation of convex optimization-based phase retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05797","kind":"arxiv","version":3},"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:471bde3593597e7c6ba154698d21c7f76530f47d6c64eb4e23783f22a3994cd4","target":"record","created_at":"2026-05-18T00:16:31Z","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":"970ffafda39124439c30dc0a805347c94b68c8445bb284b434cc3a9a6d1aeaf2","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-18T18:04:39Z","title_canon_sha256":"ff3417f2cb8261e7de2c5c908d6be201c7aa47bb3af9bc20b872afedd7a507c0"},"schema_version":"1.0","source":{"id":"1707.05797","kind":"arxiv","version":3}},"canonical_sha256":"9991f2e6013f09fe0dade1ef78de18609b627cc7d07db251a965766253830cfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9991f2e6013f09fe0dade1ef78de18609b627cc7d07db251a965766253830cfa","first_computed_at":"2026-05-18T00:16:31.820591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:31.820591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fsiOkfGXhb1I72s199hcYh5ASo0bmk+gxjLoI6oNx06/VA0Siyg+UjaJ0VcmUkWkVGyGPjL4yWnyrwL1PlP8Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:31.821057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05797","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471bde3593597e7c6ba154698d21c7f76530f47d6c64eb4e23783f22a3994cd4","sha256:f515dc65013ed55ee3028724081a2410b747aecd8094272ea81151dfeb94c96c"],"state_sha256":"ce35b8426dff16082c7f345847ee0840a071b4977f75c9cdbe9b5867cc708c87"}