{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TMQEE74MRM74BV7K7ZRELABMNU","short_pith_number":"pith:TMQEE74M","canonical_record":{"source":{"id":"1607.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T05:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"b6ffdefa9c91389f9cb3c1c3b9d3c43ec5d2331247510066962a9245e39c78a1","abstract_canon_sha256":"63b79323a510a320e7296aab5b6d37b6a10de4213f79803923fcdc38c159f08a"},"schema_version":"1.0"},"canonical_sha256":"9b20427f8c8b3fc0d7eafe6245802c6d271d682f90dfa8f1607091a3b763808f","source":{"kind":"arxiv","id":"1607.01121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01121","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01121v1","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01121","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"TMQEE74MRM74","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMQEE74MRM74BV7K","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMQEE74M","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TMQEE74MRM74BV7K7ZRELABMNU","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T05:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"b6ffdefa9c91389f9cb3c1c3b9d3c43ec5d2331247510066962a9245e39c78a1","abstract_canon_sha256":"63b79323a510a320e7296aab5b6d37b6a10de4213f79803923fcdc38c159f08a"},"schema_version":"1.0"},"canonical_sha256":"9b20427f8c8b3fc0d7eafe6245802c6d271d682f90dfa8f1607091a3b763808f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:30.116475Z","signature_b64":"hDZyJNAru/HjNGBMpE7WiVb7tPhd1y/vye2NqjfDEfJft5qOXhpHsHcVhl4UBvgKsCwt0TzXTJ3BO1RofvBDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b20427f8c8b3fc0d7eafe6245802c6d271d682f90dfa8f1607091a3b763808f","last_reissued_at":"2026-05-18T01:11:30.116113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:30.116113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01121","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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9d3ROEIQKJB9Og4LkvrwfNKYCqGqCiWF5YvRG8Rm8eqyCUTu0OSplnS65DY9iE0uPMIBUMcXqvqxPHl7PNOADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:42.545864Z"},"content_sha256":"229a260b2d52d485d7571106154f4b6375269fe0fdef7b2f06f98159d1b41731","schema_version":"1.0","event_id":"sha256:229a260b2d52d485d7571106154f4b6375269fe0fdef7b2f06f98159d1b41731"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TMQEE74MRM74BV7K7ZRELABMNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Gradient Descent Algorithm for Generalized Phase Retrieval Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ji Li, Tie Zhou","submitted_at":"2016-07-05T05:51:53Z","abstract_excerpt":"In this paper, we study the generalized phase retrieval problem: to recover a signal $\\bm{x}\\in\\mathbb{C}^n$ from the measurements $y_r=\\lvert \\langle\\bm{a}_r,\\bm{x}\\rangle\\rvert^2$, $r=1,2,\\ldots,m$. The problem can be reformulated as a least-squares minimization problem. Although the cost function is nonconvex, the global convergence of gradient descent algorithm from a random initialization is studied, when $m$ is large enough. We improve the known result of the local convergence from a spectral initialization. When the signal $\\bm{x}$ is real-valued, we prove that the cost function is loca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01121","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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QRGn8ZG6DFWViauCO9Ar66/LqysnqKTNXRIaLLs34eDBlmOa0BO7GPmfM+4EDNNOKUL+PABDf6MlAToeLnbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:42.546256Z"},"content_sha256":"8b5004ebaca7970af4144af591c040aff2cd1816871d37b21cdb7a8bc2d68a6d","schema_version":"1.0","event_id":"sha256:8b5004ebaca7970af4144af591c040aff2cd1816871d37b21cdb7a8bc2d68a6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMQEE74MRM74BV7K7ZRELABMNU/bundle.json","state_url":"https://pith.science/pith/TMQEE74MRM74BV7K7ZRELABMNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMQEE74MRM74BV7K7ZRELABMNU/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-05-25T10:21:42Z","links":{"resolver":"https://pith.science/pith/TMQEE74MRM74BV7K7ZRELABMNU","bundle":"https://pith.science/pith/TMQEE74MRM74BV7K7ZRELABMNU/bundle.json","state":"https://pith.science/pith/TMQEE74MRM74BV7K7ZRELABMNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMQEE74MRM74BV7K7ZRELABMNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TMQEE74MRM74BV7K7ZRELABMNU","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":"63b79323a510a320e7296aab5b6d37b6a10de4213f79803923fcdc38c159f08a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T05:51:53Z","title_canon_sha256":"b6ffdefa9c91389f9cb3c1c3b9d3c43ec5d2331247510066962a9245e39c78a1"},"schema_version":"1.0","source":{"id":"1607.01121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01121","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01121v1","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01121","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"TMQEE74MRM74","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMQEE74MRM74BV7K","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMQEE74M","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:8b5004ebaca7970af4144af591c040aff2cd1816871d37b21cdb7a8bc2d68a6d","target":"graph","created_at":"2026-05-18T01:11:30Z","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 study the generalized phase retrieval problem: to recover a signal $\\bm{x}\\in\\mathbb{C}^n$ from the measurements $y_r=\\lvert \\langle\\bm{a}_r,\\bm{x}\\rangle\\rvert^2$, $r=1,2,\\ldots,m$. The problem can be reformulated as a least-squares minimization problem. Although the cost function is nonconvex, the global convergence of gradient descent algorithm from a random initialization is studied, when $m$ is large enough. We improve the known result of the local convergence from a spectral initialization. When the signal $\\bm{x}$ is real-valued, we prove that the cost function is loca","authors_text":"Ji Li, Tie Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T05:51:53Z","title":"On Gradient Descent Algorithm for Generalized Phase Retrieval Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01121","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:229a260b2d52d485d7571106154f4b6375269fe0fdef7b2f06f98159d1b41731","target":"record","created_at":"2026-05-18T01:11:30Z","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":"63b79323a510a320e7296aab5b6d37b6a10de4213f79803923fcdc38c159f08a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T05:51:53Z","title_canon_sha256":"b6ffdefa9c91389f9cb3c1c3b9d3c43ec5d2331247510066962a9245e39c78a1"},"schema_version":"1.0","source":{"id":"1607.01121","kind":"arxiv","version":1}},"canonical_sha256":"9b20427f8c8b3fc0d7eafe6245802c6d271d682f90dfa8f1607091a3b763808f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b20427f8c8b3fc0d7eafe6245802c6d271d682f90dfa8f1607091a3b763808f","first_computed_at":"2026-05-18T01:11:30.116113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:30.116113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDZyJNAru/HjNGBMpE7WiVb7tPhd1y/vye2NqjfDEfJft5qOXhpHsHcVhl4UBvgKsCwt0TzXTJ3BO1RofvBDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:30.116475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:229a260b2d52d485d7571106154f4b6375269fe0fdef7b2f06f98159d1b41731","sha256:8b5004ebaca7970af4144af591c040aff2cd1816871d37b21cdb7a8bc2d68a6d"],"state_sha256":"df946c1d168f04b274a7f3c9d1be21ccc9335e2a0821172542b865e2ad3b1ca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEmVXbMKP9cdrpus5xmoB25ft73hiE6BF9jrGjd4Vbz17Pc7V3FmoJa67+5Hp3L5ZIlXfiFLP3+jPCz5T66ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:21:42.548662Z","bundle_sha256":"23afdb8a7dcd98b808ddc0d6630ee69b87625bb56d6735f2e79c75c4dbfa1ba9"}}