{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QLRHNEBXRFODTYIOL2HGB4CONH","short_pith_number":"pith:QLRHNEBX","schema_version":"1.0","canonical_sha256":"82e2769037895c39e10e5e8e60f04e69d5eadbb0ca28e9030854af063280d59f","source":{"kind":"arxiv","id":"1505.03399","version":1},"attestation_state":"computed","paper":{"title":"Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","submitted_at":"2015-05-13T14:19:14Z","abstract_excerpt":"Blind deconvolution (BD), the resolution of a signal and a filter given their convolution, arises in many applications. Without further constraints, BD is ill-posed. In practice, subspace or sparsity constraints have been imposed to reduce the search space, and have shown some empirical success. However, existing theoretical analysis on uniqueness in BD is rather limited. As an effort to address the still mysterious question, we derive sufficient conditions under which two vectors can be uniquely identified from their circular convolution, subject to subspace or sparsity constraints. These suf"},"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":"1505.03399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-13T14:19:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"21403e0372a91123c6bfbb1542d5ddfe0d0a5dc5df7984594d5246077918677c","abstract_canon_sha256":"d099cbf1a9af73c5f1223de1aef372d709720dd94693f8094a46c69d9021f90f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:09.268449Z","signature_b64":"3aGzRH9pzgx1LSh7X/sRCV7D+l55ySspnNYsGUBvNitk1UuSHo7sCzH+djZsI9uLUfEO1Y5w9zBhvOIZ9NNWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e2769037895c39e10e5e8e60f04e69d5eadbb0ca28e9030854af063280d59f","last_reissued_at":"2026-05-18T02:12:09.267580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:09.267580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","submitted_at":"2015-05-13T14:19:14Z","abstract_excerpt":"Blind deconvolution (BD), the resolution of a signal and a filter given their convolution, arises in many applications. Without further constraints, BD is ill-posed. In practice, subspace or sparsity constraints have been imposed to reduce the search space, and have shown some empirical success. However, existing theoretical analysis on uniqueness in BD is rather limited. As an effort to address the still mysterious question, we derive sufficient conditions under which two vectors can be uniquely identified from their circular convolution, subject to subspace or sparsity constraints. These suf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03399","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":"1505.03399","created_at":"2026-05-18T02:12:09.267725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03399v1","created_at":"2026-05-18T02:12:09.267725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03399","created_at":"2026-05-18T02:12:09.267725+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLRHNEBXRFOD","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLRHNEBXRFODTYIO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLRHNEBX","created_at":"2026-05-18T12:29:37.295048+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/QLRHNEBXRFODTYIOL2HGB4CONH","json":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH.json","graph_json":"https://pith.science/api/pith-number/QLRHNEBXRFODTYIOL2HGB4CONH/graph.json","events_json":"https://pith.science/api/pith-number/QLRHNEBXRFODTYIOL2HGB4CONH/events.json","paper":"https://pith.science/paper/QLRHNEBX"},"agent_actions":{"view_html":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH","download_json":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH.json","view_paper":"https://pith.science/paper/QLRHNEBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03399&json=true","fetch_graph":"https://pith.science/api/pith-number/QLRHNEBXRFODTYIOL2HGB4CONH/graph.json","fetch_events":"https://pith.science/api/pith-number/QLRHNEBXRFODTYIOL2HGB4CONH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH/action/storage_attestation","attest_author":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH/action/author_attestation","sign_citation":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH/action/citation_signature","submit_replication":"https://pith.science/pith/QLRHNEBXRFODTYIOL2HGB4CONH/action/replication_record"}},"created_at":"2026-05-18T02:12:09.267725+00:00","updated_at":"2026-05-18T02:12:09.267725+00:00"}