{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HB7EBGUEVT5BB2JTW62UUO5OE5","short_pith_number":"pith:HB7EBGUE","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"},"canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","source":{"kind":"arxiv","id":"1810.09061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09061","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09061v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09061","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"HB7EBGUEVT5B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HB7EBGUEVT5BB2JT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HB7EBGUE","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HB7EBGUEVT5BB2JTW62UUO5OE5","target":"record","payload":{"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"},"canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","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"},"source_kind":"arxiv","source_id":"1810.09061","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFNckLZLgcKo1iVpkRCulw/k5IV9JshMyNIIu44KL0M6gms5AqPunHi5DHaJ36iRgI8vcv4rspxFPVw5fcq6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:36:33.514891Z"},"content_sha256":"53e879b72d38faa8bcb4c2c1b7e7fc0a681b918202cc006a5684aad18dc0906a","schema_version":"1.0","event_id":"sha256:53e879b72d38faa8bcb4c2c1b7e7fc0a681b918202cc006a5684aad18dc0906a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HB7EBGUEVT5BB2JTW62UUO5OE5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hf9W8KWudzoAG32aBXLrSVgZ2MqR2h8zrinp3thPYm6Xgtp9ircaiSrD4SWhhHQaffoCiZn+vMUDuaR4S33bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:36:33.515508Z"},"content_sha256":"0ebd03972eb2e1257b291b1c374e6963fcad79b84c6215b1ee8e274a096c5bc7","schema_version":"1.0","event_id":"sha256:0ebd03972eb2e1257b291b1c374e6963fcad79b84c6215b1ee8e274a096c5bc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/bundle.json","state_url":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T22:36:33Z","links":{"resolver":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5","bundle":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/bundle.json","state":"https://pith.science/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HB7EBGUEVT5BB2JTW62UUO5OE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HB7EBGUEVT5BB2JTW62UUO5OE5","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":"d601a9b9d8a7f42cbc84581046c9232865bf29767c7f166fe3a22a240d87f7f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-22T02:16:44Z","title_canon_sha256":"fd0eb32b52ac33449f87122b91eff0be341b41941c9f418bdb0ef4a8f337c38b"},"schema_version":"1.0","source":{"id":"1810.09061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09061","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09061v1","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09061","created_at":"2026-05-18T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"HB7EBGUEVT5B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HB7EBGUEVT5BB2JT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HB7EBGUE","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:0ebd03972eb2e1257b291b1c374e6963fcad79b84c6215b1ee8e274a096c5bc7","target":"graph","created_at":"2026-05-18T00:02:41Z","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":"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","authors_text":"Abraham Varghese, Meng Huang, Ming-Jun Lai, Zhiqiang Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-22T02:16:44Z","title":"On DC based Methods for Phase Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09061","kind":"arxiv","version":1},"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:53e879b72d38faa8bcb4c2c1b7e7fc0a681b918202cc006a5684aad18dc0906a","target":"record","created_at":"2026-05-18T00:02:41Z","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":"d601a9b9d8a7f42cbc84581046c9232865bf29767c7f166fe3a22a240d87f7f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-22T02:16:44Z","title_canon_sha256":"fd0eb32b52ac33449f87122b91eff0be341b41941c9f418bdb0ef4a8f337c38b"},"schema_version":"1.0","source":{"id":"1810.09061","kind":"arxiv","version":1}},"canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"387e409a84acfa10e933b7b54a3bae276313d43842e6f37da22134d6b6652acd","first_computed_at":"2026-05-18T00:02:41.116177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:41.116177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JOuQGe4xekdr+e4d1ehbetYLunCpnsNK80NWnmHlgic+9++6zuqTMbFc+/eg1lsg2FPrhMYuy4tSlqqPZoieDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:41.116826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53e879b72d38faa8bcb4c2c1b7e7fc0a681b918202cc006a5684aad18dc0906a","sha256:0ebd03972eb2e1257b291b1c374e6963fcad79b84c6215b1ee8e274a096c5bc7"],"state_sha256":"a4c132f7aa1a067aba5640e5bdf8619a881762c56f8b5efdb22434cb98e5a25c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUEzAyh8J6jADRAtKG8Pc0Aft1yOwjOXVaI+U0tDNCeNJdKZ112QNCBa5w5ipundXfM8B+927+D4HPXVsPD7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:36:33.518849Z","bundle_sha256":"428153f29f2ff49aff7a8cac94ec61bea894bb220b02071802fa64255386cf8e"}}