{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5XFYPYKV4PSL4AASTTGQKED26S","short_pith_number":"pith:5XFYPYKV","canonical_record":{"source":{"id":"1610.04210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-13T19:35:28Z","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"title_canon_sha256":"ff429b901271033030c8f29045c82c2ea3236fd56bfcfdc900dbcc6139508c4e","abstract_canon_sha256":"bf8f1ceced0536dc01d8da1b29f65386212f2ac21975e092ba25ed7cc537de05"},"schema_version":"1.0"},"canonical_sha256":"edcb87e155e3e4be00129ccd05107af481d22a7ac15b9c5ac161d21daa1846aa","source":{"kind":"arxiv","id":"1610.04210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04210","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04210v2","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04210","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"5XFYPYKV4PSL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5XFYPYKV4PSL4AAS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5XFYPYKV","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5XFYPYKV4PSL4AASTTGQKED26S","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-13T19:35:28Z","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"title_canon_sha256":"ff429b901271033030c8f29045c82c2ea3236fd56bfcfdc900dbcc6139508c4e","abstract_canon_sha256":"bf8f1ceced0536dc01d8da1b29f65386212f2ac21975e092ba25ed7cc537de05"},"schema_version":"1.0"},"canonical_sha256":"edcb87e155e3e4be00129ccd05107af481d22a7ac15b9c5ac161d21daa1846aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:37.046879Z","signature_b64":"WurATlbazjROkzzujYHtBhKhalEPGr9ikW3TGJDfzy9L7qohB84oGHNZTIB0b5FXC1l/cO5m1OdL5R2x3F+cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edcb87e155e3e4be00129ccd05107af481d22a7ac15b9c5ac161d21daa1846aa","last_reissued_at":"2026-05-18T00:48:37.046200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:37.046200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04210","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-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOBxDiUGpmuLbD6B6IRUTorMfmNBps7xmFmljh/0WJbyTaEZDwkCCp+ArHltr+95DWJ90ubR2uzlYZmymbaIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:38:25.549161Z"},"content_sha256":"31d509394be265b7da2e75d385b7dbf01deaa5943e6ea792f3b2cdb8f552424b","schema_version":"1.0","event_id":"sha256:31d509394be265b7da2e75d385b7dbf01deaa5943e6ea792f3b2cdb8f552424b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5XFYPYKV4PSL4AASTTGQKED26S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Justin Romberg, Sohail Bahmani","submitted_at":"2016-10-13T19:35:28Z","abstract_excerpt":"We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with \"lifting\" and semidefinite programming (SDP) in methods such as PhaseLift and compete with recently developed non-convex techniques for phase retrieval. We relax the quadratic equations for phaseless measurements to inequality constraints each of which representing a symmetric \"slab\". Through a simple convex program, our proposed estimator finds an extreme point of the intersection of these slabs that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04210","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-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBHjQ5hducXJk/seaX4z+thBuHTzYQfJXH/GhuXS6zze4r22PC3YxDivCcXZEnxhuq2Y6+LL/RIFN1qkjrdeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:38:25.549856Z"},"content_sha256":"7fcf642b9cc8c8558545931c91432b3546efbb82f2ef721a91bf5bdee777d6f4","schema_version":"1.0","event_id":"sha256:7fcf642b9cc8c8558545931c91432b3546efbb82f2ef721a91bf5bdee777d6f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XFYPYKV4PSL4AASTTGQKED26S/bundle.json","state_url":"https://pith.science/pith/5XFYPYKV4PSL4AASTTGQKED26S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XFYPYKV4PSL4AASTTGQKED26S/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-27T05:38:25Z","links":{"resolver":"https://pith.science/pith/5XFYPYKV4PSL4AASTTGQKED26S","bundle":"https://pith.science/pith/5XFYPYKV4PSL4AASTTGQKED26S/bundle.json","state":"https://pith.science/pith/5XFYPYKV4PSL4AASTTGQKED26S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XFYPYKV4PSL4AASTTGQKED26S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5XFYPYKV4PSL4AASTTGQKED26S","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":"bf8f1ceced0536dc01d8da1b29f65386212f2ac21975e092ba25ed7cc537de05","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-13T19:35:28Z","title_canon_sha256":"ff429b901271033030c8f29045c82c2ea3236fd56bfcfdc900dbcc6139508c4e"},"schema_version":"1.0","source":{"id":"1610.04210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04210","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04210v2","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04210","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"5XFYPYKV4PSL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5XFYPYKV4PSL4AAS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5XFYPYKV","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7fcf642b9cc8c8558545931c91432b3546efbb82f2ef721a91bf5bdee777d6f4","target":"graph","created_at":"2026-05-18T00:48:37Z","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":"We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with \"lifting\" and semidefinite programming (SDP) in methods such as PhaseLift and compete with recently developed non-convex techniques for phase retrieval. We relax the quadratic equations for phaseless measurements to inequality constraints each of which representing a symmetric \"slab\". Through a simple convex program, our proposed estimator finds an extreme point of the intersection of these slabs that i","authors_text":"Justin Romberg, Sohail Bahmani","cross_cats":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-13T19:35:28Z","title":"Phase Retrieval Meets Statistical Learning Theory: A Flexible Convex Relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04210","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:31d509394be265b7da2e75d385b7dbf01deaa5943e6ea792f3b2cdb8f552424b","target":"record","created_at":"2026-05-18T00:48:37Z","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":"bf8f1ceced0536dc01d8da1b29f65386212f2ac21975e092ba25ed7cc537de05","cross_cats_sorted":["cs.LG","math.FA","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-13T19:35:28Z","title_canon_sha256":"ff429b901271033030c8f29045c82c2ea3236fd56bfcfdc900dbcc6139508c4e"},"schema_version":"1.0","source":{"id":"1610.04210","kind":"arxiv","version":2}},"canonical_sha256":"edcb87e155e3e4be00129ccd05107af481d22a7ac15b9c5ac161d21daa1846aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edcb87e155e3e4be00129ccd05107af481d22a7ac15b9c5ac161d21daa1846aa","first_computed_at":"2026-05-18T00:48:37.046200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:37.046200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WurATlbazjROkzzujYHtBhKhalEPGr9ikW3TGJDfzy9L7qohB84oGHNZTIB0b5FXC1l/cO5m1OdL5R2x3F+cAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:37.046879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31d509394be265b7da2e75d385b7dbf01deaa5943e6ea792f3b2cdb8f552424b","sha256:7fcf642b9cc8c8558545931c91432b3546efbb82f2ef721a91bf5bdee777d6f4"],"state_sha256":"5c39c7fd4169b9583465cec2154dce92f48945a2e2b5602bd05e487a7219740c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQZIfUFusxPCc4Z7HAFmm5d1aJCug913TA6CD8LGggs/f0G6/K1iok/8JVQI6C9qTUJ5FoOP+YOv6nWPx2eCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:38:25.553362Z","bundle_sha256":"2c2f08753c31348f5e7a7595c679418278713560bf6669734d678be8b3d0c2c8"}}