{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5IHPNDGGNUMZS7GS7FRS3PZJBN","short_pith_number":"pith:5IHPNDGG","canonical_record":{"source":{"id":"1306.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-02T00:45:12Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b275a0bf8b95a66d96cd3360919d411180e17d69408b4ab1cba326bb2c6b0b06","abstract_canon_sha256":"b582e263dcbaa179f15985bec6b8810aa394fd490e894206fc0a7e54b10a1bbc"},"schema_version":"1.0"},"canonical_sha256":"ea0ef68cc66d19997cd2f9632dbf290b7b182e678d5bb74dee641f89aa785f50","source":{"kind":"arxiv","id":"1306.0160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0160","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0160v2","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0160","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"5IHPNDGGNUMZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5IHPNDGGNUMZS7GS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5IHPNDGG","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5IHPNDGGNUMZS7GS7FRS3PZJBN","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-02T00:45:12Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b275a0bf8b95a66d96cd3360919d411180e17d69408b4ab1cba326bb2c6b0b06","abstract_canon_sha256":"b582e263dcbaa179f15985bec6b8810aa394fd490e894206fc0a7e54b10a1bbc"},"schema_version":"1.0"},"canonical_sha256":"ea0ef68cc66d19997cd2f9632dbf290b7b182e678d5bb74dee641f89aa785f50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:25.401595Z","signature_b64":"GIc8BN4gWwliAM0kKBFPFWHgF6Ua62GgbkK6uJCq9JyqLvNxiBO/FI/x/iSb2SYbBw7gAs/yhWVqS+HI0C7mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea0ef68cc66d19997cd2f9632dbf290b7b182e678d5bb74dee641f89aa785f50","last_reissued_at":"2026-05-18T01:51:25.400982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:25.400982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0160","source_version":2,"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+daJ70JMKtHbDo3l8QM8jQj0VcNKj5+g2O4tOwtJ9zuJX/JR7zW+Ex2t0Ukx9HK+4sxrvBjOHsoPDiK7WxVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:54:06.154029Z"},"content_sha256":"f793596f3bfc1d0ba530eca17b4492af3c89c2097b020911b8e1df25fb2ee11c","schema_version":"1.0","event_id":"sha256:f793596f3bfc1d0ba530eca17b4492af3c89c2097b020911b8e1df25fb2ee11c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5IHPNDGGNUMZS7GS7FRS3PZJBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Retrieval using Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","submitted_at":"2013-06-02T00:45:12Z","abstract_excerpt":"Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of (Gerchberg and Saxton 1972) and (Fienup 1982) is still the popular choice for solving many variants of this problem. The algorithm is based on alternating minimization; i.e. it alternates between estimating the missing phase information, and the candidate solution. Despite its wide usage in practice, no global convergence guarantees for this algorithm are known. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0160","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"},"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CvFyBD4QoJ43rWBeOSPhzyViXvhHSO8q11DFYsbwNPG/56qMbC2npg5t5GiJi/6OIPrU5d3XnYgyD9nClZ+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:54:06.154725Z"},"content_sha256":"282941ef2619f79d2d55266a8cf899e4c8431282b12ba743a50fab69fc6c683c","schema_version":"1.0","event_id":"sha256:282941ef2619f79d2d55266a8cf899e4c8431282b12ba743a50fab69fc6c683c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/bundle.json","state_url":"https://pith.science/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/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-26T03:54:06Z","links":{"resolver":"https://pith.science/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN","bundle":"https://pith.science/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/bundle.json","state":"https://pith.science/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IHPNDGGNUMZS7GS7FRS3PZJBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5IHPNDGGNUMZS7GS7FRS3PZJBN","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":"b582e263dcbaa179f15985bec6b8810aa394fd490e894206fc0a7e54b10a1bbc","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-02T00:45:12Z","title_canon_sha256":"b275a0bf8b95a66d96cd3360919d411180e17d69408b4ab1cba326bb2c6b0b06"},"schema_version":"1.0","source":{"id":"1306.0160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0160","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0160v2","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0160","created_at":"2026-05-18T01:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"5IHPNDGGNUMZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5IHPNDGGNUMZS7GS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5IHPNDGG","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:282941ef2619f79d2d55266a8cf899e4c8431282b12ba743a50fab69fc6c683c","target":"graph","created_at":"2026-05-18T01:51:25Z","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":"Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of (Gerchberg and Saxton 1972) and (Fienup 1982) is still the popular choice for solving many variants of this problem. The algorithm is based on alternating minimization; i.e. it alternates between estimating the missing phase information, and the candidate solution. Despite its wide usage in practice, no global convergence guarantees for this algorithm are known. In this paper, w","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-02T00:45:12Z","title":"Phase Retrieval using Alternating Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0160","kind":"arxiv","version":2},"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:f793596f3bfc1d0ba530eca17b4492af3c89c2097b020911b8e1df25fb2ee11c","target":"record","created_at":"2026-05-18T01:51:25Z","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":"b582e263dcbaa179f15985bec6b8810aa394fd490e894206fc0a7e54b10a1bbc","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-02T00:45:12Z","title_canon_sha256":"b275a0bf8b95a66d96cd3360919d411180e17d69408b4ab1cba326bb2c6b0b06"},"schema_version":"1.0","source":{"id":"1306.0160","kind":"arxiv","version":2}},"canonical_sha256":"ea0ef68cc66d19997cd2f9632dbf290b7b182e678d5bb74dee641f89aa785f50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea0ef68cc66d19997cd2f9632dbf290b7b182e678d5bb74dee641f89aa785f50","first_computed_at":"2026-05-18T01:51:25.400982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:51:25.400982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GIc8BN4gWwliAM0kKBFPFWHgF6Ua62GgbkK6uJCq9JyqLvNxiBO/FI/x/iSb2SYbBw7gAs/yhWVqS+HI0C7mAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:51:25.401595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f793596f3bfc1d0ba530eca17b4492af3c89c2097b020911b8e1df25fb2ee11c","sha256:282941ef2619f79d2d55266a8cf899e4c8431282b12ba743a50fab69fc6c683c"],"state_sha256":"be5f287386e676886bf66452db821d27d911f9c3a97ba3215168e7de17614247"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhWqySQHzRP+ATPi7hC/fwy5NJJf3cqYYjXq7Aew8nujf0By46bVd+uCOgjDg8MxUur7WY9oFWYh7FQM7YQ5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:54:06.158246Z","bundle_sha256":"f23a1ad6c07cc7310b64c7909f712ed820796036bc40c14dcb22fa100e87f4ff"}}