{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P625EF5XHABHCOMP6UE36EPAR4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"efb2d88c93780e4abd32ebe6a1046ee99a41dbaea28c6d97fe35b8f11c60b90f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T05:38:54Z","title_canon_sha256":"5d28872f41f8b501dd0989f6f5528779a9baf82ebf0818c4ac2b7462b1cb9cf9"},"schema_version":"1.0","source":{"id":"2608.04465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04465","created_at":"2026-08-06T01:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04465v1","created_at":"2026-08-06T01:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04465","created_at":"2026-08-06T01:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"P625EF5XHABH","created_at":"2026-08-06T01:35:39Z"},{"alias_kind":"pith_short_16","alias_value":"P625EF5XHABHCOMP","created_at":"2026-08-06T01:35:39Z"},{"alias_kind":"pith_short_8","alias_value":"P625EF5X","created_at":"2026-08-06T01:35:39Z"}],"graph_snapshots":[{"event_id":"sha256:36f275af61fe169b7fbeef179435cec20eea704e068adeef8a9e211de114f5d2","target":"graph","created_at":"2026-08-06T01:35:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.04465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Baiyang Guo, Junpeng Shi, Shixiang Chen, Wenlong Wang, Zai Yang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T05:38:54Z","title":"Jointly Sparse Blind Deconvolution via Riemannian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04465","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67d8fcf3bd18440a6470336a27e489407bbc2274a3d3c1c9306aa546fabcd694","target":"record","created_at":"2026-08-06T01:35:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"efb2d88c93780e4abd32ebe6a1046ee99a41dbaea28c6d97fe35b8f11c60b90f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T05:38:54Z","title_canon_sha256":"5d28872f41f8b501dd0989f6f5528779a9baf82ebf0818c4ac2b7462b1cb9cf9"},"schema_version":"1.0","source":{"id":"2608.04465","kind":"arxiv","version":1}},"canonical_sha256":"7fb5d217b7380271398ff509bf11e08f137311c0b0428471297e6e774da375d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fb5d217b7380271398ff509bf11e08f137311c0b0428471297e6e774da375d5","first_computed_at":"2026-08-06T01:35:39.741206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:35:39.741206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ndIOeuEk9+Uc1dmYI9Rpet4C7J0Obp9rFANVFqSCIHLfb7nu/2hQO70kaUWxSKi8UoHaHuGvnhhI1JIG1qFCg==","signature_status":"signed_v1","signed_at":"2026-08-06T01:35:39.742585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67d8fcf3bd18440a6470336a27e489407bbc2274a3d3c1c9306aa546fabcd694","sha256:36f275af61fe169b7fbeef179435cec20eea704e068adeef8a9e211de114f5d2"],"state_sha256":"7fb963e3e6889180eaa2e5c1b22c5506a5991c41c440112de87a690373b7dde7"}