{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WZJMWXDSGG6DNCCWYY5AV6KZCZ","short_pith_number":"pith:WZJMWXDS","schema_version":"1.0","canonical_sha256":"b652cb5c7231bc368856c63a0af959166a196d957898182bf52f7784d3336b35","source":{"kind":"arxiv","id":"1706.09993","version":2},"attestation_state":"computed","paper":{"title":"Phase Retrieval via Randomized Kaczmarz: Theoretical Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Roman Vershynin, Yan Shuo Tan","submitted_at":"2017-06-30T01:21:55Z","abstract_excerpt":"We consider the problem of phase retrieval, i.e. that of solving systems of quadratic equations. A simple variant of the randomized Kaczmarz method was recently proposed for phase retrieval, and it was shown numerically to have a computational edge over state-of-the-art Wirtinger flow methods. In this paper, we provide the first theoretical guarantee for the convergence of the randomized Kaczmarz method for phase retrieval. We show that it is sufficient to have as many Gaussian measurements as the dimension, up to a constant factor. Along the way, we introduce a sufficient condition on measure"},"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":"1706.09993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-30T01:21:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"title_canon_sha256":"c27324e6e402b8f0154a2bdfabec8fb4b251e69061e30fc07766795e8e53a2e9","abstract_canon_sha256":"7ede199bb8ab605bac5e3bbb44e44355d5eff3c44e249969e4e57efcf0489129"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:07.907747Z","signature_b64":"SLEgmZC8yIB/0LsXGjMY6jOJt0VFXO2ZXI6faT4LS4kVw5M07dMx+utmM2DIStxlFsiW9D+taTgRbtaTqyVnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b652cb5c7231bc368856c63a0af959166a196d957898182bf52f7784d3336b35","last_reissued_at":"2026-05-18T00:26:07.906939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:07.906939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Retrieval via Randomized Kaczmarz: Theoretical Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Roman Vershynin, Yan Shuo Tan","submitted_at":"2017-06-30T01:21:55Z","abstract_excerpt":"We consider the problem of phase retrieval, i.e. that of solving systems of quadratic equations. A simple variant of the randomized Kaczmarz method was recently proposed for phase retrieval, and it was shown numerically to have a computational edge over state-of-the-art Wirtinger flow methods. In this paper, we provide the first theoretical guarantee for the convergence of the randomized Kaczmarz method for phase retrieval. We show that it is sufficient to have as many Gaussian measurements as the dimension, up to a constant factor. Along the way, we introduce a sufficient condition on measure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09993","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":""},"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":"1706.09993","created_at":"2026-05-18T00:26:07.907070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09993v2","created_at":"2026-05-18T00:26:07.907070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09993","created_at":"2026-05-18T00:26:07.907070+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZJMWXDSGG6D","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZJMWXDSGG6DNCCW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZJMWXDS","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09255","citing_title":"Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation","ref_index":67,"is_internal_anchor":true},{"citing_arxiv_id":"2604.13678","citing_title":"Weighted Riemannian Optimization for Solving Quadratic Equations from Gaussian Magnitude Measurements","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ","json":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ.json","graph_json":"https://pith.science/api/pith-number/WZJMWXDSGG6DNCCWYY5AV6KZCZ/graph.json","events_json":"https://pith.science/api/pith-number/WZJMWXDSGG6DNCCWYY5AV6KZCZ/events.json","paper":"https://pith.science/paper/WZJMWXDS"},"agent_actions":{"view_html":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ","download_json":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ.json","view_paper":"https://pith.science/paper/WZJMWXDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09993&json=true","fetch_graph":"https://pith.science/api/pith-number/WZJMWXDSGG6DNCCWYY5AV6KZCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WZJMWXDSGG6DNCCWYY5AV6KZCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ/action/storage_attestation","attest_author":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ/action/author_attestation","sign_citation":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ/action/citation_signature","submit_replication":"https://pith.science/pith/WZJMWXDSGG6DNCCWYY5AV6KZCZ/action/replication_record"}},"created_at":"2026-05-18T00:26:07.907070+00:00","updated_at":"2026-05-18T00:26:07.907070+00:00"}