{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:P625EF5XHABHCOMP6UE36EPAR4","short_pith_number":"pith:P625EF5X","schema_version":"1.0","canonical_sha256":"7fb5d217b7380271398ff509bf11e08f137311c0b0428471297e6e774da375d5","source":{"kind":"arxiv","id":"2608.04465","version":1},"attestation_state":"computed","paper":{"title":"Jointly Sparse Blind Deconvolution via Riemannian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Baiyang Guo, Junpeng Shi, Shixiang Chen, Wenlong Wang, Zai Yang","submitted_at":"2026-08-05T05:38:54Z","abstract_excerpt":"Blind deconvolution has been widely applied in system identification and signal processing. While joint sparsity commonly arises in practical scenarios, effectively exploiting this structure to enhance recovery performance remains a challenging and largely open problem. In this paper, we propose a joint-sparsity-promoting optimization problem and develop a Riemannian optimization algorithm for its accurate and efficient solution. We further establish theoretical guarantees that characterize the non-asymptotic relationship between the estimation error and the sample complexity, showing that exp"},"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":"2608.04465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T05:38:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5d28872f41f8b501dd0989f6f5528779a9baf82ebf0818c4ac2b7462b1cb9cf9","abstract_canon_sha256":"efb2d88c93780e4abd32ebe6a1046ee99a41dbaea28c6d97fe35b8f11c60b90f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:35:39.742585Z","signature_b64":"4ndIOeuEk9+Uc1dmYI9Rpet4C7J0Obp9rFANVFqSCIHLfb7nu/2hQO70kaUWxSKi8UoHaHuGvnhhI1JIG1qFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb5d217b7380271398ff509bf11e08f137311c0b0428471297e6e774da375d5","last_reissued_at":"2026-08-06T01:35:39.741206Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:35:39.741206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jointly Sparse Blind Deconvolution via Riemannian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Baiyang Guo, Junpeng Shi, Shixiang Chen, Wenlong Wang, Zai Yang","submitted_at":"2026-08-05T05:38:54Z","abstract_excerpt":"Blind deconvolution has been widely applied in system identification and signal processing. While joint sparsity commonly arises in practical scenarios, effectively exploiting this structure to enhance recovery performance remains a challenging and largely open problem. In this paper, we propose a joint-sparsity-promoting optimization problem and develop a Riemannian optimization algorithm for its accurate and efficient solution. We further establish theoretical guarantees that characterize the non-asymptotic relationship between the estimation error and the sample complexity, showing that exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.04465/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":"2608.04465","created_at":"2026-08-06T01:35:39.742993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04465v1","created_at":"2026-08-06T01:35:39.742993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04465","created_at":"2026-08-06T01:35:39.742993+00:00"},{"alias_kind":"pith_short_12","alias_value":"P625EF5XHABH","created_at":"2026-08-06T01:35:39.742993+00:00"},{"alias_kind":"pith_short_16","alias_value":"P625EF5XHABHCOMP","created_at":"2026-08-06T01:35:39.742993+00:00"},{"alias_kind":"pith_short_8","alias_value":"P625EF5X","created_at":"2026-08-06T01:35:39.742993+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/P625EF5XHABHCOMP6UE36EPAR4","json":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4.json","graph_json":"https://pith.science/api/pith-number/P625EF5XHABHCOMP6UE36EPAR4/graph.json","events_json":"https://pith.science/api/pith-number/P625EF5XHABHCOMP6UE36EPAR4/events.json","paper":"https://pith.science/paper/P625EF5X"},"agent_actions":{"view_html":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4","download_json":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4.json","view_paper":"https://pith.science/paper/P625EF5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04465&json=true","fetch_graph":"https://pith.science/api/pith-number/P625EF5XHABHCOMP6UE36EPAR4/graph.json","fetch_events":"https://pith.science/api/pith-number/P625EF5XHABHCOMP6UE36EPAR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4/action/storage_attestation","attest_author":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4/action/author_attestation","sign_citation":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4/action/citation_signature","submit_replication":"https://pith.science/pith/P625EF5XHABHCOMP6UE36EPAR4/action/replication_record"}},"created_at":"2026-08-06T01:35:39.742993+00:00","updated_at":"2026-08-06T01:35:39.742993+00:00"}