{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NC4IDJBXB5AKPQC5WULLGRL3SK","short_pith_number":"pith:NC4IDJBX","schema_version":"1.0","canonical_sha256":"68b881a4370f40a7c05db516b3457b92ab4d82f057492c8a432d30f07847b5f5","source":{"kind":"arxiv","id":"1911.13179","version":2},"attestation_state":"computed","paper":{"title":"A note on Douglas-Rachford, gradients, and phase retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Levin, Tamir Bendory","submitted_at":"2019-11-29T16:24:54Z","abstract_excerpt":"The properties of gradient techniques for the phase retrieval problem have received a considerable attention in recent years. In almost all applications, however, the phase retrieval problem is solved using a family of algorithms that can be interpreted as variants of Douglas-Rachford splitting. In this work, we establish a connection between Douglas-Rachford and gradient algorithms. Specifically, we show that in some cases a generalization of Douglas-Rachford, called relaxed-reflect-reflect (RRR), can be viewed as gradient descent on a certain objective function. The solutions coincide with t"},"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":"1911.13179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-29T16:24:54Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"cf936a7cc4538eebffc721331cf583049029b7a10d111140a8c4cce2159151ef","abstract_canon_sha256":"3aa25ed35e57d88a704a11c0498e34a9bd0f21dd0e6960fabab47d4ea99e58d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:51.441571Z","signature_b64":"1Ewwu1fu/9wmZ5qho6kZNjWR37I1keT6ztcf3z1F4d7vKzMKJiROmJghqOLMW/A+Uv3sSd5QmmfhrVz5Q6+wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68b881a4370f40a7c05db516b3457b92ab4d82f057492c8a432d30f07847b5f5","last_reissued_at":"2026-07-05T01:07:51.441111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:51.441111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Douglas-Rachford, gradients, and phase retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Levin, Tamir Bendory","submitted_at":"2019-11-29T16:24:54Z","abstract_excerpt":"The properties of gradient techniques for the phase retrieval problem have received a considerable attention in recent years. In almost all applications, however, the phase retrieval problem is solved using a family of algorithms that can be interpreted as variants of Douglas-Rachford splitting. In this work, we establish a connection between Douglas-Rachford and gradient algorithms. Specifically, we show that in some cases a generalization of Douglas-Rachford, called relaxed-reflect-reflect (RRR), can be viewed as gradient descent on a certain objective function. The solutions coincide with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.13179","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.13179/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.13179","created_at":"2026-07-05T01:07:51.441167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.13179v2","created_at":"2026-07-05T01:07:51.441167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.13179","created_at":"2026-07-05T01:07:51.441167+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC4IDJBXB5AK","created_at":"2026-07-05T01:07:51.441167+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC4IDJBXB5AKPQC5","created_at":"2026-07-05T01:07:51.441167+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC4IDJBX","created_at":"2026-07-05T01:07:51.441167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.04766","citing_title":"Phase Retrieval via Gain-Based Photonic XY-Hamiltonian Optimization","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK","json":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK.json","graph_json":"https://pith.science/api/pith-number/NC4IDJBXB5AKPQC5WULLGRL3SK/graph.json","events_json":"https://pith.science/api/pith-number/NC4IDJBXB5AKPQC5WULLGRL3SK/events.json","paper":"https://pith.science/paper/NC4IDJBX"},"agent_actions":{"view_html":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK","download_json":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK.json","view_paper":"https://pith.science/paper/NC4IDJBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.13179&json=true","fetch_graph":"https://pith.science/api/pith-number/NC4IDJBXB5AKPQC5WULLGRL3SK/graph.json","fetch_events":"https://pith.science/api/pith-number/NC4IDJBXB5AKPQC5WULLGRL3SK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK/action/storage_attestation","attest_author":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK/action/author_attestation","sign_citation":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK/action/citation_signature","submit_replication":"https://pith.science/pith/NC4IDJBXB5AKPQC5WULLGRL3SK/action/replication_record"}},"created_at":"2026-07-05T01:07:51.441167+00:00","updated_at":"2026-07-05T01:07:51.441167+00:00"}