{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WMSPB4FZWPB2JDIXEDE4AESS7E","short_pith_number":"pith:WMSPB4FZ","canonical_record":{"source":{"id":"1509.08451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T16:21:10Z","cross_cats_sorted":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"title_canon_sha256":"fdbcec8da43ce92e324989945d4e6d0a79dd0c96ff1da5b93eb91af063539d0e","abstract_canon_sha256":"e1b6ef689d751ee5dbfaec06444df560bd47209a71e8e12caf68e9c4d1710f6d"},"schema_version":"1.0"},"canonical_sha256":"b324f0f0b9b3c3a48d1720c9c01252f9131c6105ea914864dfe01c6da1320af2","source":{"kind":"arxiv","id":"1509.08451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08451","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08451v2","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08451","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"WMSPB4FZWPB2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMSPB4FZWPB2JDIX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMSPB4FZ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WMSPB4FZWPB2JDIXEDE4AESS7E","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T16:21:10Z","cross_cats_sorted":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"title_canon_sha256":"fdbcec8da43ce92e324989945d4e6d0a79dd0c96ff1da5b93eb91af063539d0e","abstract_canon_sha256":"e1b6ef689d751ee5dbfaec06444df560bd47209a71e8e12caf68e9c4d1710f6d"},"schema_version":"1.0"},"canonical_sha256":"b324f0f0b9b3c3a48d1720c9c01252f9131c6105ea914864dfe01c6da1320af2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:22.470825Z","signature_b64":"jcR//ezWlk0mPQkZ28JUzKKKs2vNbuDNHO8fKLwkudSiMM5gT0LvG2xCkUvr2qKYBp/aKNf6v8LnwAMZossHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b324f0f0b9b3c3a48d1720c9c01252f9131c6105ea914864dfe01c6da1320af2","last_reissued_at":"2026-05-18T01:04:22.470153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:22.470153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08451","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:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pky/0yWaqwEgBxWQvnzUwK70CtbzpbtRuuJh88nH46ZqbC9cb0rSF7npfk4Fd5jmaTjuT6Msm2c16YQgY4dFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:55:25.766896Z"},"content_sha256":"26c27f9e9e911f930e80120a03414367d13c0272b86f89d9911e0401b475cc41","schema_version":"1.0","event_id":"sha256:26c27f9e9e911f930e80120a03414367d13c0272b86f89d9911e0401b475cc41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WMSPB4FZWPB2JDIXEDE4AESS7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cram\\'er-Rao Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Cheng Qian, H. C. So, Kejun Huang, Lei Huang, Nicholas D. Sidiropoulos","submitted_at":"2015-09-24T16:21:10Z","abstract_excerpt":"Reconstructing a signal from squared linear (rank-one quadratic) measurements is a challenging problem with important applications in optics and imaging, where it is known as phase retrieval. This paper proposes two new phase retrieval algorithms based on non-convex quadratically constrained quadratic programming (QCQP) formulations, and a recently proposed approximation technique dubbed feasible point pursuit (FPP). The first is designed for uniformly distributed bounded measurement errors, such as those arising from high-rate quantization (B-FPP). The second is designed for Gaussian measurem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08451","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:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IoptF817JqzYBiu+p2FZaHugTq1f0UDPAnM6fxIskXOaIKm1JJc4ahr2jwMJG6uIxdpVDuFr7BfRQzvXjPfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:55:25.767575Z"},"content_sha256":"ae44f7f0ecba516acb5f7f850e58ef0a5a9f3ac3f2aabc3fdc70898e08db93d1","schema_version":"1.0","event_id":"sha256:ae44f7f0ecba516acb5f7f850e58ef0a5a9f3ac3f2aabc3fdc70898e08db93d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/bundle.json","state_url":"https://pith.science/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/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-09T18:55:25Z","links":{"resolver":"https://pith.science/pith/WMSPB4FZWPB2JDIXEDE4AESS7E","bundle":"https://pith.science/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/bundle.json","state":"https://pith.science/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMSPB4FZWPB2JDIXEDE4AESS7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WMSPB4FZWPB2JDIXEDE4AESS7E","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":"e1b6ef689d751ee5dbfaec06444df560bd47209a71e8e12caf68e9c4d1710f6d","cross_cats_sorted":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T16:21:10Z","title_canon_sha256":"fdbcec8da43ce92e324989945d4e6d0a79dd0c96ff1da5b93eb91af063539d0e"},"schema_version":"1.0","source":{"id":"1509.08451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08451","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08451v2","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08451","created_at":"2026-05-18T01:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"WMSPB4FZWPB2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMSPB4FZWPB2JDIX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMSPB4FZ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:ae44f7f0ecba516acb5f7f850e58ef0a5a9f3ac3f2aabc3fdc70898e08db93d1","target":"graph","created_at":"2026-05-18T01:04:22Z","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":"Reconstructing a signal from squared linear (rank-one quadratic) measurements is a challenging problem with important applications in optics and imaging, where it is known as phase retrieval. This paper proposes two new phase retrieval algorithms based on non-convex quadratically constrained quadratic programming (QCQP) formulations, and a recently proposed approximation technique dubbed feasible point pursuit (FPP). The first is designed for uniformly distributed bounded measurement errors, such as those arising from high-rate quantization (B-FPP). The second is designed for Gaussian measurem","authors_text":"Cheng Qian, H. C. So, Kejun Huang, Lei Huang, Nicholas D. Sidiropoulos","cross_cats":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T16:21:10Z","title":"Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cram\\'er-Rao Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08451","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:26c27f9e9e911f930e80120a03414367d13c0272b86f89d9911e0401b475cc41","target":"record","created_at":"2026-05-18T01:04:22Z","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":"e1b6ef689d751ee5dbfaec06444df560bd47209a71e8e12caf68e9c4d1710f6d","cross_cats_sorted":["math.IT","math.NA","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-24T16:21:10Z","title_canon_sha256":"fdbcec8da43ce92e324989945d4e6d0a79dd0c96ff1da5b93eb91af063539d0e"},"schema_version":"1.0","source":{"id":"1509.08451","kind":"arxiv","version":2}},"canonical_sha256":"b324f0f0b9b3c3a48d1720c9c01252f9131c6105ea914864dfe01c6da1320af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b324f0f0b9b3c3a48d1720c9c01252f9131c6105ea914864dfe01c6da1320af2","first_computed_at":"2026-05-18T01:04:22.470153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:22.470153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcR//ezWlk0mPQkZ28JUzKKKs2vNbuDNHO8fKLwkudSiMM5gT0LvG2xCkUvr2qKYBp/aKNf6v8LnwAMZossHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:22.470825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26c27f9e9e911f930e80120a03414367d13c0272b86f89d9911e0401b475cc41","sha256:ae44f7f0ecba516acb5f7f850e58ef0a5a9f3ac3f2aabc3fdc70898e08db93d1"],"state_sha256":"ec61268e6fc1ed7962edd0d6e19067f9aec8f291de65e8b517082f1816a060d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqOHgPnjYPRBfJw8DDMid6dtUg3S9gfh54daFoadWwIeQVWpzl+ufG/5XJQk5S6lU5k5CPUsyLF4JV9PUaTsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:55:25.771079Z","bundle_sha256":"5c968a81179e3c3e614a72b3e959580b68c11af6a078fe337447a9b1a4723af8"}}