{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VH4GKDTYVS4WUELJLD36TGYQTZ","short_pith_number":"pith:VH4GKDTY","schema_version":"1.0","canonical_sha256":"a9f8650e78acb96a116958f7e99b109e57ec9273e71f2a6427b37095a99693a0","source":{"kind":"arxiv","id":"1709.09279","version":1},"attestation_state":"computed","paper":{"title":"From Blind deconvolution to Blind Super-Resolution through convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Augustin Cosse","submitted_at":"2017-09-26T22:52:49Z","abstract_excerpt":"This paper discusses the recovery of an unknown signal $x\\in \\mathbb{R}^L$ through the result of its convolution with an unknown filter $h \\in \\mathbb{R}^L$. This problem, also known as blind deconvolution, has been studied extensively by the signal processing and applied mathematics communities, leading to a diversity of proofs and algorithms based on various assumptions on the filter and its input. Sparsity of this filter, or in contrast, non vanishing of its Fourier transform are instances of such assumptions. The main result of this paper shows that blind deconvolution can be solved throug"},"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":"1709.09279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-26T22:52:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b6d7453f178d3af68a757f55e237b068c73e2339cc1ff469350280741ebb180","abstract_canon_sha256":"7d908c5a31cd1b23657e8bc7db1fee645f12fd466c26893de6d2706d260b9dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:12.311962Z","signature_b64":"G1NUpAmArftjZkNhboglOc5zH3yMpJVtD/mlZCCKgr1xbhAAIYu1crPuuEC/8We9ml7fJx1TiwDsa3cVK+W9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f8650e78acb96a116958f7e99b109e57ec9273e71f2a6427b37095a99693a0","last_reissued_at":"2026-05-18T00:34:12.311394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:12.311394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Blind deconvolution to Blind Super-Resolution through convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Augustin Cosse","submitted_at":"2017-09-26T22:52:49Z","abstract_excerpt":"This paper discusses the recovery of an unknown signal $x\\in \\mathbb{R}^L$ through the result of its convolution with an unknown filter $h \\in \\mathbb{R}^L$. This problem, also known as blind deconvolution, has been studied extensively by the signal processing and applied mathematics communities, leading to a diversity of proofs and algorithms based on various assumptions on the filter and its input. Sparsity of this filter, or in contrast, non vanishing of its Fourier transform are instances of such assumptions. The main result of this paper shows that blind deconvolution can be solved throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09279","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":"1709.09279","created_at":"2026-05-18T00:34:12.311488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09279v1","created_at":"2026-05-18T00:34:12.311488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09279","created_at":"2026-05-18T00:34:12.311488+00:00"},{"alias_kind":"pith_short_12","alias_value":"VH4GKDTYVS4W","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VH4GKDTYVS4WUELJ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VH4GKDTY","created_at":"2026-05-18T12:31:49.984773+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/VH4GKDTYVS4WUELJLD36TGYQTZ","json":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ.json","graph_json":"https://pith.science/api/pith-number/VH4GKDTYVS4WUELJLD36TGYQTZ/graph.json","events_json":"https://pith.science/api/pith-number/VH4GKDTYVS4WUELJLD36TGYQTZ/events.json","paper":"https://pith.science/paper/VH4GKDTY"},"agent_actions":{"view_html":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ","download_json":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ.json","view_paper":"https://pith.science/paper/VH4GKDTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09279&json=true","fetch_graph":"https://pith.science/api/pith-number/VH4GKDTYVS4WUELJLD36TGYQTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VH4GKDTYVS4WUELJLD36TGYQTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ/action/storage_attestation","attest_author":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ/action/author_attestation","sign_citation":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ/action/citation_signature","submit_replication":"https://pith.science/pith/VH4GKDTYVS4WUELJLD36TGYQTZ/action/replication_record"}},"created_at":"2026-05-18T00:34:12.311488+00:00","updated_at":"2026-05-18T00:34:12.311488+00:00"}