{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AJLHBGB3JEAO2MFY3SWBQ4I3RI","short_pith_number":"pith:AJLHBGB3","schema_version":"1.0","canonical_sha256":"025670983b4900ed30b8dcac18711b8a3731e9ad584ceaa53368be18cea3f9ee","source":{"kind":"arxiv","id":"1701.04890","version":1},"attestation_state":"computed","paper":{"title":"Blind Deconvolution with Additional Autocorrelations via Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, G\\\"otz E. Pfander, Peter Jung, Philipp Walk","submitted_at":"2017-01-17T22:29:53Z","abstract_excerpt":"In this work we characterize all ambiguities of the linear (aperiodic) one-dimensional convolution on two fixed finite-dimensional complex vector spaces. It will be shown that the convolution ambiguities can be mapped one-to-one to factorization ambiguities in the $z-$domain, which are generated by swapping the zeros of the input signals. We use this polynomial description to show a deterministic version of a recently introduced masked Fourier phase retrieval design. In the noise-free case a (convex) semi-definite program can be used to recover exactly the input signals if they share no common"},"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":"1701.04890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T22:29:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdb9c753ca9f5b7c833b58a411a5c6d680d61fe5c2b3ba4c6f944d928df1a51f","abstract_canon_sha256":"f89c754cef2b2ab353b4dad9023fd3810e89853530a6f6791475472759434772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.588733Z","signature_b64":"or+Ly+VHTtTL0lKxwCn44KjjUpPHuSNunqBi50kGrXtixqFWEZoR5MbImSL936Jw9ML/VvqypRoZpzfIIZDpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025670983b4900ed30b8dcac18711b8a3731e9ad584ceaa53368be18cea3f9ee","last_reissued_at":"2026-05-18T00:52:33.588346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.588346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blind Deconvolution with Additional Autocorrelations via Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, G\\\"otz E. Pfander, Peter Jung, Philipp Walk","submitted_at":"2017-01-17T22:29:53Z","abstract_excerpt":"In this work we characterize all ambiguities of the linear (aperiodic) one-dimensional convolution on two fixed finite-dimensional complex vector spaces. It will be shown that the convolution ambiguities can be mapped one-to-one to factorization ambiguities in the $z-$domain, which are generated by swapping the zeros of the input signals. We use this polynomial description to show a deterministic version of a recently introduced masked Fourier phase retrieval design. In the noise-free case a (convex) semi-definite program can be used to recover exactly the input signals if they share no common"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04890","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":"1701.04890","created_at":"2026-05-18T00:52:33.588408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04890v1","created_at":"2026-05-18T00:52:33.588408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04890","created_at":"2026-05-18T00:52:33.588408+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJLHBGB3JEAO","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJLHBGB3JEAO2MFY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJLHBGB3","created_at":"2026-05-18T12:31:05.417338+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/AJLHBGB3JEAO2MFY3SWBQ4I3RI","json":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI.json","graph_json":"https://pith.science/api/pith-number/AJLHBGB3JEAO2MFY3SWBQ4I3RI/graph.json","events_json":"https://pith.science/api/pith-number/AJLHBGB3JEAO2MFY3SWBQ4I3RI/events.json","paper":"https://pith.science/paper/AJLHBGB3"},"agent_actions":{"view_html":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI","download_json":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI.json","view_paper":"https://pith.science/paper/AJLHBGB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04890&json=true","fetch_graph":"https://pith.science/api/pith-number/AJLHBGB3JEAO2MFY3SWBQ4I3RI/graph.json","fetch_events":"https://pith.science/api/pith-number/AJLHBGB3JEAO2MFY3SWBQ4I3RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI/action/storage_attestation","attest_author":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI/action/author_attestation","sign_citation":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI/action/citation_signature","submit_replication":"https://pith.science/pith/AJLHBGB3JEAO2MFY3SWBQ4I3RI/action/replication_record"}},"created_at":"2026-05-18T00:52:33.588408+00:00","updated_at":"2026-05-18T00:52:33.588408+00:00"}