{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMYEB3KYZXW3KVQSC7MLL2FU7I","short_pith_number":"pith:WMYEB3KY","schema_version":"1.0","canonical_sha256":"b33040ed58cdedb5561217d8b5e8b4fa3d6ea8637fc5b2aa9bf4d05f260ebcb8","source":{"kind":"arxiv","id":"1806.08091","version":1},"attestation_state":"computed","paper":{"title":"Blind Deconvolutional Phase Retrieval 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":"2018-06-21T07:16:21Z","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 >> (k+n) \\log^2 m$ phaseless measurements. Our method provides the first theoretical recovery guarantee for this prob"},"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":"1806.08091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-21T07:16:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc69f1c4eeb384db23dedb2e25e69bb3a1df34d3a4def59b3dd6cd84d1a95109","abstract_canon_sha256":"7a89e7faedb8411bcafccf642839809fbf91b157a7dc5476930a13f583302820"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.077290Z","signature_b64":"gwG7wTcaEY+CcmXXE1/ADlzAh2XcIh6uUkZbRZW1miCHNgQE/Q6G+1E2YRjXvAypZ9OUvOY9Tr56kLjpPHsIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b33040ed58cdedb5561217d8b5e8b4fa3d6ea8637fc5b2aa9bf4d05f260ebcb8","last_reissued_at":"2026-05-18T00:12:42.076688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.076688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blind Deconvolutional Phase Retrieval 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":"2018-06-21T07:16:21Z","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 >> (k+n) \\log^2 m$ phaseless measurements. Our method provides the first theoretical recovery guarantee for this prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08091","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.08091","created_at":"2026-05-18T00:12:42.076768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08091v1","created_at":"2026-05-18T00:12:42.076768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08091","created_at":"2026-05-18T00:12:42.076768+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMYEB3KYZXW3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMYEB3KYZXW3KVQS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMYEB3KY","created_at":"2026-05-18T12:33:01.666342+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/WMYEB3KYZXW3KVQSC7MLL2FU7I","json":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I.json","graph_json":"https://pith.science/api/pith-number/WMYEB3KYZXW3KVQSC7MLL2FU7I/graph.json","events_json":"https://pith.science/api/pith-number/WMYEB3KYZXW3KVQSC7MLL2FU7I/events.json","paper":"https://pith.science/paper/WMYEB3KY"},"agent_actions":{"view_html":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I","download_json":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I.json","view_paper":"https://pith.science/paper/WMYEB3KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08091&json=true","fetch_graph":"https://pith.science/api/pith-number/WMYEB3KYZXW3KVQSC7MLL2FU7I/graph.json","fetch_events":"https://pith.science/api/pith-number/WMYEB3KYZXW3KVQSC7MLL2FU7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I/action/storage_attestation","attest_author":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I/action/author_attestation","sign_citation":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I/action/citation_signature","submit_replication":"https://pith.science/pith/WMYEB3KYZXW3KVQSC7MLL2FU7I/action/replication_record"}},"created_at":"2026-05-18T00:12:42.076768+00:00","updated_at":"2026-05-18T00:12:42.076768+00:00"}