{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G2ERNVL3QXWD6AZ4QA7DZTGHUX","short_pith_number":"pith:G2ERNVL3","canonical_record":{"source":{"id":"1807.04261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T17:52:07Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.PR"],"title_canon_sha256":"c6ec35624bf39c2cf2074a1acd8662098ff35d2723f28942ec6bdae0b9522183","abstract_canon_sha256":"5bdc49796e94e81d585f1273e3acfce550746d53334e08009993d2c40cf4d726"},"schema_version":"1.0"},"canonical_sha256":"368916d57b85ec3f033c803e3cccc7a5c2a1dd4372ffc55a7d0257138514be21","source":{"kind":"arxiv","id":"1807.04261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04261","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04261v1","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04261","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"G2ERNVL3QXWD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2ERNVL3QXWD6AZ4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2ERNVL3","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G2ERNVL3QXWD6AZ4QA7DZTGHUX","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T17:52:07Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.PR"],"title_canon_sha256":"c6ec35624bf39c2cf2074a1acd8662098ff35d2723f28942ec6bdae0b9522183","abstract_canon_sha256":"5bdc49796e94e81d585f1273e3acfce550746d53334e08009993d2c40cf4d726"},"schema_version":"1.0"},"canonical_sha256":"368916d57b85ec3f033c803e3cccc7a5c2a1dd4372ffc55a7d0257138514be21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.523359Z","signature_b64":"zlT8yU1yoGY1LsntjfB77eDF6kQ50xWRTXQ5RfCiDQiWaMhpQCJEdmePXvYqbMnWWXzVge9mkdFpb8ATtr7QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368916d57b85ec3f033c803e3cccc7a5c2a1dd4372ffc55a7d0257138514be21","last_reissued_at":"2026-05-18T00:10:57.522636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.522636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04261","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-18T00:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtBXCRXT0YJL5+69L5CKiT+s/TBoqiMHqYoPa/6x8fmBOMC7B2VZ7J43M5KVshptXOT/tm+eBrIbo0x/n1TJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:07:11.601097Z"},"content_sha256":"d867800c130a6c8ffa4a1e0cfa5579f4c0e47af7503191c62d78d19d2daa72b7","schema_version":"1.0","event_id":"sha256:d867800c130a6c8ffa4a1e0cfa5579f4c0e47af7503191c62d78d19d2daa72b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G2ERNVL3QXWD6AZ4QA7DZTGHUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Retrieval Under a Generative Prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC","math.PR"],"primary_cat":"cs.IT","authors_text":"Oscar Leong, Paul Hand, Vladislav Voroninski","submitted_at":"2018-07-11T17:52:07Z","abstract_excerpt":"The phase retrieval problem asks to recover a natural signal $y_0 \\in \\mathbb{R}^n$ from $m$ quadratic observations, where $m$ is to be minimized. As is common in many imaging problems, natural signals are considered sparse with respect to a known basis, and the generic sparsity prior is enforced via $\\ell_1$ regularization. While successful in the realm of linear inverse problems, such $\\ell_1$ methods have encountered possibly fundamental limitations, as no computationally efficient algorithm for phase retrieval of a $k$-sparse signal has been proven to succeed with fewer than $O(k^2\\log n)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04261","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-18T00:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Psz0/iDAl+D8Ij35h17ZXcpoocts86EMsYkpz9FSUjhJQU/z06AiY4aecIjzKkqKxe08x3ieBY+5t8KLGvTbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:07:11.601916Z"},"content_sha256":"befd12170daa7379f3988eb8b8f0c01a50d02b3e0790b1ebb058ec579aad618f","schema_version":"1.0","event_id":"sha256:befd12170daa7379f3988eb8b8f0c01a50d02b3e0790b1ebb058ec579aad618f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/bundle.json","state_url":"https://pith.science/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/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-01T01:07:11Z","links":{"resolver":"https://pith.science/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX","bundle":"https://pith.science/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/bundle.json","state":"https://pith.science/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2ERNVL3QXWD6AZ4QA7DZTGHUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G2ERNVL3QXWD6AZ4QA7DZTGHUX","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":"5bdc49796e94e81d585f1273e3acfce550746d53334e08009993d2c40cf4d726","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T17:52:07Z","title_canon_sha256":"c6ec35624bf39c2cf2074a1acd8662098ff35d2723f28942ec6bdae0b9522183"},"schema_version":"1.0","source":{"id":"1807.04261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04261","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04261v1","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04261","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"G2ERNVL3QXWD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2ERNVL3QXWD6AZ4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2ERNVL3","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:befd12170daa7379f3988eb8b8f0c01a50d02b3e0790b1ebb058ec579aad618f","target":"graph","created_at":"2026-05-18T00:10:57Z","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":"The phase retrieval problem asks to recover a natural signal $y_0 \\in \\mathbb{R}^n$ from $m$ quadratic observations, where $m$ is to be minimized. As is common in many imaging problems, natural signals are considered sparse with respect to a known basis, and the generic sparsity prior is enforced via $\\ell_1$ regularization. While successful in the realm of linear inverse problems, such $\\ell_1$ methods have encountered possibly fundamental limitations, as no computationally efficient algorithm for phase retrieval of a $k$-sparse signal has been proven to succeed with fewer than $O(k^2\\log n)$","authors_text":"Oscar Leong, Paul Hand, Vladislav Voroninski","cross_cats":["cs.LG","math.IT","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T17:52:07Z","title":"Phase Retrieval Under a Generative Prior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04261","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:d867800c130a6c8ffa4a1e0cfa5579f4c0e47af7503191c62d78d19d2daa72b7","target":"record","created_at":"2026-05-18T00:10:57Z","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":"5bdc49796e94e81d585f1273e3acfce550746d53334e08009993d2c40cf4d726","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T17:52:07Z","title_canon_sha256":"c6ec35624bf39c2cf2074a1acd8662098ff35d2723f28942ec6bdae0b9522183"},"schema_version":"1.0","source":{"id":"1807.04261","kind":"arxiv","version":1}},"canonical_sha256":"368916d57b85ec3f033c803e3cccc7a5c2a1dd4372ffc55a7d0257138514be21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"368916d57b85ec3f033c803e3cccc7a5c2a1dd4372ffc55a7d0257138514be21","first_computed_at":"2026-05-18T00:10:57.522636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:57.522636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlT8yU1yoGY1LsntjfB77eDF6kQ50xWRTXQ5RfCiDQiWaMhpQCJEdmePXvYqbMnWWXzVge9mkdFpb8ATtr7QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:57.523359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d867800c130a6c8ffa4a1e0cfa5579f4c0e47af7503191c62d78d19d2daa72b7","sha256:befd12170daa7379f3988eb8b8f0c01a50d02b3e0790b1ebb058ec579aad618f"],"state_sha256":"cb70e65602841c51f99105dd283a85a389d7976d94db8caecc472f855f78482c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79jNUmB/Vh2Rk7kmWFBJSSE9rC015Ddsq5Ma94eIh6WUD2jWLkZncP6nyutBOhiyqoG4m1EUM7pB1BD5JYFwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:07:11.606511Z","bundle_sha256":"032221028b27cf577c94bb61d7b4cea417042ca16385b34f2b65be2c928c6e3d"}}