{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AWNM33S7XAH5O2VJ27KSMETYJM","short_pith_number":"pith:AWNM33S7","schema_version":"1.0","canonical_sha256":"059acdee5fb80fd76aa9d7d52612784b2364c1bc23c57e1249f9887e0419c7db","source":{"kind":"arxiv","id":"1708.07370","version":2},"attestation_state":"computed","paper":{"title":"A Non-Convex Optimization Technique for Sparse Blind Deconvolution -- Initialization Aspects and Error Reduction Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aniruddha Adiga, Chandra Sekhar Seelamantula","submitted_at":"2017-08-24T12:18:32Z","abstract_excerpt":"Sparse blind deconvolution is the problem of estimating the blur kernel and sparse excitation, both of which are unknown. Considering a linear convolution model, as opposed to the standard circular convolution model, we derive a sufficient condition for stable deconvolution. The columns of the linear convolution matrix form a Riesz basis with the tightness of the Riesz bounds determined by the autocorrelation of the blur kernel. Employing a Bayesian framework results in a non-convex, non-smooth cost function consisting of an $\\ell_2$ data-fidelity term and a sparsity promoting $\\ell_p$-norm ($"},"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":"1708.07370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-24T12:18:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47be1d12fc0086da60ab16d520ae95e6ffb461b152d816e00bf8557b14d7786b","abstract_canon_sha256":"caf2c6e79c5b50527330e39398d71357b4d0aeb445698e65441c2eac1398285b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:06.288429Z","signature_b64":"+WqeHHK1XL0/lWwwFhaJ7htAb6y2pvqVv+Ca6FdiVO0l89XfbSgyoHHRIv3jd5gj6f+tbTE3SjOhhJt6rC6vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"059acdee5fb80fd76aa9d7d52612784b2364c1bc23c57e1249f9887e0419c7db","last_reissued_at":"2026-05-18T00:33:06.287884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:06.287884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Non-Convex Optimization Technique for Sparse Blind Deconvolution -- Initialization Aspects and Error Reduction Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aniruddha Adiga, Chandra Sekhar Seelamantula","submitted_at":"2017-08-24T12:18:32Z","abstract_excerpt":"Sparse blind deconvolution is the problem of estimating the blur kernel and sparse excitation, both of which are unknown. Considering a linear convolution model, as opposed to the standard circular convolution model, we derive a sufficient condition for stable deconvolution. The columns of the linear convolution matrix form a Riesz basis with the tightness of the Riesz bounds determined by the autocorrelation of the blur kernel. Employing a Bayesian framework results in a non-convex, non-smooth cost function consisting of an $\\ell_2$ data-fidelity term and a sparsity promoting $\\ell_p$-norm ($"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07370","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":"1708.07370","created_at":"2026-05-18T00:33:06.287971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07370v2","created_at":"2026-05-18T00:33:06.287971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07370","created_at":"2026-05-18T00:33:06.287971+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWNM33S7XAH5","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWNM33S7XAH5O2VJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWNM33S7","created_at":"2026-05-18T12:31:08.081275+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/AWNM33S7XAH5O2VJ27KSMETYJM","json":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM.json","graph_json":"https://pith.science/api/pith-number/AWNM33S7XAH5O2VJ27KSMETYJM/graph.json","events_json":"https://pith.science/api/pith-number/AWNM33S7XAH5O2VJ27KSMETYJM/events.json","paper":"https://pith.science/paper/AWNM33S7"},"agent_actions":{"view_html":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM","download_json":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM.json","view_paper":"https://pith.science/paper/AWNM33S7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07370&json=true","fetch_graph":"https://pith.science/api/pith-number/AWNM33S7XAH5O2VJ27KSMETYJM/graph.json","fetch_events":"https://pith.science/api/pith-number/AWNM33S7XAH5O2VJ27KSMETYJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM/action/storage_attestation","attest_author":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM/action/author_attestation","sign_citation":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM/action/citation_signature","submit_replication":"https://pith.science/pith/AWNM33S7XAH5O2VJ27KSMETYJM/action/replication_record"}},"created_at":"2026-05-18T00:33:06.287971+00:00","updated_at":"2026-05-18T00:33:06.287971+00:00"}