{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DTSDA3XQHP6HNXS3G24SMXRQTD","short_pith_number":"pith:DTSDA3XQ","schema_version":"1.0","canonical_sha256":"1ce4306ef03bfc76de5b36b9265e3098ff5fc1e448b1294307c8444215195dd3","source":{"kind":"arxiv","id":"2110.02141","version":2},"attestation_state":"computed","paper":{"title":"Short-and-Sparse Deconvolution Via Rank-One Constrained Optimization (ROCO)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-05T16:14:48Z","abstract_excerpt":"Short-and-sparse deconvolution (SaSD) aims to recover a short kernel and a long and sparse signal from their convolution. In the literature, formulations of blind deconvolution is either a convex programming via a matrix lifting of convolution, or a bilinear Lasso. Optimization solvers are typically based on bilinear factorizations. In this paper, we formulate SaSD as a non-convex optimization with a rank-one matrix constraint, hence referred to as Rank-One Constrained Optimization (ROCO). The solver is based on alternating direction method of multipliers (ADMM). It operates on the full rank-o"},"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":"2110.02141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-05T16:14:48Z","cross_cats_sorted":[],"title_canon_sha256":"f2ee7012af191d8c898fcac09eb9f56e3dfc5608eff81ec199452fffc727c780","abstract_canon_sha256":"01f7305d380823266fd37fe1a00f89d1550f36c182d23a546e36953cb6f5b001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:50.357306Z","signature_b64":"Jtee/5oi8Hg2tfpaSAgB4MV2FT7MFucQ6uxEuOe9iM3js/oSERxEFFL+qeO5XyuTk7clA+gxQ6Y6Lfr9eFf6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce4306ef03bfc76de5b36b9265e3098ff5fc1e448b1294307c8444215195dd3","last_reissued_at":"2026-07-05T03:33:50.356836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:50.356836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short-and-Sparse Deconvolution Via Rank-One Constrained Optimization (ROCO)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-05T16:14:48Z","abstract_excerpt":"Short-and-sparse deconvolution (SaSD) aims to recover a short kernel and a long and sparse signal from their convolution. In the literature, formulations of blind deconvolution is either a convex programming via a matrix lifting of convolution, or a bilinear Lasso. Optimization solvers are typically based on bilinear factorizations. In this paper, we formulate SaSD as a non-convex optimization with a rank-one matrix constraint, hence referred to as Rank-One Constrained Optimization (ROCO). The solver is based on alternating direction method of multipliers (ADMM). It operates on the full rank-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02141","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.02141/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.02141","created_at":"2026-07-05T03:33:50.356891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02141v2","created_at":"2026-07-05T03:33:50.356891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02141","created_at":"2026-07-05T03:33:50.356891+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTSDA3XQHP6H","created_at":"2026-07-05T03:33:50.356891+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTSDA3XQHP6HNXS3","created_at":"2026-07-05T03:33:50.356891+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTSDA3XQ","created_at":"2026-07-05T03:33:50.356891+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/DTSDA3XQHP6HNXS3G24SMXRQTD","json":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD.json","graph_json":"https://pith.science/api/pith-number/DTSDA3XQHP6HNXS3G24SMXRQTD/graph.json","events_json":"https://pith.science/api/pith-number/DTSDA3XQHP6HNXS3G24SMXRQTD/events.json","paper":"https://pith.science/paper/DTSDA3XQ"},"agent_actions":{"view_html":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD","download_json":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD.json","view_paper":"https://pith.science/paper/DTSDA3XQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02141&json=true","fetch_graph":"https://pith.science/api/pith-number/DTSDA3XQHP6HNXS3G24SMXRQTD/graph.json","fetch_events":"https://pith.science/api/pith-number/DTSDA3XQHP6HNXS3G24SMXRQTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD/action/storage_attestation","attest_author":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD/action/author_attestation","sign_citation":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD/action/citation_signature","submit_replication":"https://pith.science/pith/DTSDA3XQHP6HNXS3G24SMXRQTD/action/replication_record"}},"created_at":"2026-07-05T03:33:50.356891+00:00","updated_at":"2026-07-05T03:33:50.356891+00:00"}