{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HB7EBGUEVT5BB2JTW62UUO5OE5","short_pith_number":"pith:HB7EBGUE","schema_version":"1.0","canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","source":{"kind":"arxiv","id":"1810.09061","version":1},"attestation_state":"computed","paper":{"title":"On DC based Methods for Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abraham Varghese, Meng Huang, Ming-Jun Lai, Zhiqiang Xu","submitted_at":"2018-10-22T02:16:44Z","abstract_excerpt":"In this paper, we develop a new computational approach which is based on minimizing the difference of two convex functionals (DC) to solve a broader class of phase retrieval problems. The approach splits a standard nonlinear least squares minimizing function associated with the phase retrieval problem into the difference of two convex functions and then solves a sequence of convex minimization sub-problems. For each subproblem, the Nesterov's accelerated gradient descent algorithm or the Barzilai-Borwein (BB) algorithm is used. In the setting of sparse phase retrieval, a standard $\\ell_1$ norm"},"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":"1810.09061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-22T02:16:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd0eb32b52ac33449f87122b91eff0be341b41941c9f418bdb0ef4a8f337c38b","abstract_canon_sha256":"d601a9b9d8a7f42cbc84581046c9232865bf29767c7f166fe3a22a240d87f7f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:41.116826Z","signature_b64":"JOuQGe4xekdr+e4d1ehbetYLunCpnsNK80NWnmHlgic+9++6zuqTMbFc+/eg1lsg2FPrhMYuy4tSlqqPZoieDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","last_reissued_at":"2026-05-18T00:02:41.116177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:41.116177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On DC based Methods for Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abraham Varghese, Meng Huang, Ming-Jun Lai, Zhiqiang Xu","submitted_at":"2018-10-22T02:16:44Z","abstract_excerpt":"In this paper, we develop a new computational approach which is based on minimizing the difference of two convex functionals (DC) to solve a broader class of phase retrieval problems. The approach splits a standard nonlinear least squares minimizing function associated with the phase retrieval problem into the difference of two convex functions and then solves a sequence of convex minimization sub-problems. For each subproblem, the Nesterov's accelerated gradient descent algorithm or the Barzilai-Borwein (BB) algorithm is used. In the setting of sparse phase retrieval, a standard $\\ell_1$ norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09061","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":"1810.09061","created_at":"2026-05-18T00:02:41.116280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09061v1","created_at":"2026-05-18T00:02:41.116280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09061","created_at":"2026-05-18T00:02:41.116280+00:00"},{"alias_kind":"pith_short_12","alias_value":"HB7EBGUEVT5B","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HB7EBGUEVT5BB2JT","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HB7EBGUE","created_at":"2026-05-18T12:32:28.185984+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/HB7EBGUEVT5BB2JTW62UUO5OE5","json":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5.json","graph_json":"https://pith.science/api/pith-number/HB7EBGUEVT5BB2JTW62UUO5OE5/graph.json","events_json":"https://pith.science/api/pith-number/HB7EBGUEVT5BB2JTW62UUO5OE5/events.json","paper":"https://pith.science/paper/HB7EBGUE"},"agent_actions":{"view_html":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5","download_json":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5.json","view_paper":"https://pith.science/paper/HB7EBGUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09061&json=true","fetch_graph":"https://pith.science/api/pith-number/HB7EBGUEVT5BB2JTW62UUO5OE5/graph.json","fetch_events":"https://pith.science/api/pith-number/HB7EBGUEVT5BB2JTW62UUO5OE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/action/storage_attestation","attest_author":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/action/author_attestation","sign_citation":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/action/citation_signature","submit_replication":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/action/replication_record"}},"created_at":"2026-05-18T00:02:41.116280+00:00","updated_at":"2026-05-18T00:02:41.116280+00:00"}