{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2SN6EYAOMVNHFFK5NO5FEUUTGH","short_pith_number":"pith:2SN6EYAO","schema_version":"1.0","canonical_sha256":"d49be2600e655a72955d6bba52529331ccccafbc3ecc8cb31f6967dbc0f620ec","source":{"kind":"arxiv","id":"1904.12680","version":2},"attestation_state":"computed","paper":{"title":"Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Ahmed, Alireza Aghasi, Paul Hand","submitted_at":"2019-04-26T07:01:59Z","abstract_excerpt":"We consider the task of recovering two real or complex $m$-vectors from phaseless Fourier measurements of their circular convolution. Our method is a novel convex relaxation that is based on a lifted matrix recovery formulation that allows a nontrivial convex relaxation of the bilinear measurements from convolution. We prove that if the two signals belong to known random subspaces of dimensions $k$ and $n$, then they can be recovered up to the inherent scaling ambiguity with $m \\gg (k+n) \\log^2 m$ phaseless measurements. Our method provides the first theoretical recovery guarantee for this pro"},"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":"1904.12680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-26T07:01:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"614dc90de425a929c514f089f4fa2acea771aab32cb1f4006002d3eff1be7335","abstract_canon_sha256":"9cf2801d99eea710b829837649ce0ffc79b8cc44cce981a127c7ba3d4373cdb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:25.664607Z","signature_b64":"BQRfAC5DXVJUDtff4FTw1ZTusc3SqKZ8dZuBLr5z7l4iYxSTEsTp41hKsiOGa9NrQkwcjZ8ri+5te1eBUgG/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49be2600e655a72955d6bba52529331ccccafbc3ecc8cb31f6967dbc0f620ec","last_reissued_at":"2026-05-17T23:46:25.663977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:25.663977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Ahmed, Alireza Aghasi, Paul Hand","submitted_at":"2019-04-26T07:01:59Z","abstract_excerpt":"We consider the task of recovering two real or complex $m$-vectors from phaseless Fourier measurements of their circular convolution. Our method is a novel convex relaxation that is based on a lifted matrix recovery formulation that allows a nontrivial convex relaxation of the bilinear measurements from convolution. We prove that if the two signals belong to known random subspaces of dimensions $k$ and $n$, then they can be recovered up to the inherent scaling ambiguity with $m \\gg (k+n) \\log^2 m$ phaseless measurements. Our method provides the first theoretical recovery guarantee for this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12680","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":"1904.12680","created_at":"2026-05-17T23:46:25.664077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12680v2","created_at":"2026-05-17T23:46:25.664077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12680","created_at":"2026-05-17T23:46:25.664077+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SN6EYAOMVNH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SN6EYAOMVNHFFK5","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SN6EYAO","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH","json":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH.json","graph_json":"https://pith.science/api/pith-number/2SN6EYAOMVNHFFK5NO5FEUUTGH/graph.json","events_json":"https://pith.science/api/pith-number/2SN6EYAOMVNHFFK5NO5FEUUTGH/events.json","paper":"https://pith.science/paper/2SN6EYAO"},"agent_actions":{"view_html":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH","download_json":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH.json","view_paper":"https://pith.science/paper/2SN6EYAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12680&json=true","fetch_graph":"https://pith.science/api/pith-number/2SN6EYAOMVNHFFK5NO5FEUUTGH/graph.json","fetch_events":"https://pith.science/api/pith-number/2SN6EYAOMVNHFFK5NO5FEUUTGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH/action/storage_attestation","attest_author":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH/action/author_attestation","sign_citation":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH/action/citation_signature","submit_replication":"https://pith.science/pith/2SN6EYAOMVNHFFK5NO5FEUUTGH/action/replication_record"}},"created_at":"2026-05-17T23:46:25.664077+00:00","updated_at":"2026-05-17T23:46:25.664077+00:00"}