{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4JEG4CFMEZ7CIHOF2KN54OKJJ3","short_pith_number":"pith:4JEG4CFM","canonical_record":{"source":{"id":"1902.09151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-25T09:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"682a24dc66cf851ddf30ab5ddcecf99ed94567d135fcaf20ea331f6391ce3c79","abstract_canon_sha256":"fb4b8a1e95804065029002b2c7de8030111163f016be63297f150e21e3a219b7"},"schema_version":"1.0"},"canonical_sha256":"e2486e08ac267e241dc5d29bde39494ed5a5d6c2586c742078826e3da1e77770","source":{"kind":"arxiv","id":"1902.09151","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09151","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09151v2","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09151","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"4JEG4CFMEZ7C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4JEG4CFMEZ7CIHOF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4JEG4CFM","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4JEG4CFMEZ7CIHOF2KN54OKJJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-25T09:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"682a24dc66cf851ddf30ab5ddcecf99ed94567d135fcaf20ea331f6391ce3c79","abstract_canon_sha256":"fb4b8a1e95804065029002b2c7de8030111163f016be63297f150e21e3a219b7"},"schema_version":"1.0"},"canonical_sha256":"e2486e08ac267e241dc5d29bde39494ed5a5d6c2586c742078826e3da1e77770","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.744372Z","signature_b64":"lPhcBoUswwaETMl2GQ2RCrPVy29rLA9wDqJK1LCvuMJH8d3QrZRUruhchnSD6yIb6GTyjnQ1FO1Z5Y8tJ+nvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2486e08ac267e241dc5d29bde39494ed5a5d6c2586c742078826e3da1e77770","last_reissued_at":"2026-05-17T23:52:35.743818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.743818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09151","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7QZzdJtkfRNDVwgoWjasUm+T8Ib1PU7oQ9cJf/iio9hquKAJZVVnsw5o+VqfbdGKsaySImJYlgLbKpjnTqlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:20.308002Z"},"content_sha256":"6c3bbe301e0109368bbc96004992b264ee748e502bc2cecd4ff76cb94dc9f893","schema_version":"1.0","event_id":"sha256:6c3bbe301e0109368bbc96004992b264ee748e502bc2cecd4ff76cb94dc9f893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4JEG4CFMEZ7CIHOF2KN54OKJJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifiability Conditions for Multi-channel Blind Deconvolution with Short Filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Antoine Paris, Laurent Jacques","submitted_at":"2019-02-25T09:06:53Z","abstract_excerpt":"This work considers the multi-channel blind deconvolution problem under the assumption that the channels are short. First, we investigate the ill-posedness issues inherent to blind deconvolution problems and sufficient and necessary conditions on the channels that guarantee well-posedness are derived. Following previous work on blind deconvolution, the problem is then reformulated as a low-rank matrix recovery problem and solved by nuclear norm minimization. Numerical experiments show the effectiveness of this algorithm under a certain generative model for the input signal and the channels, bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09151","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ppd3/ZxSxUYk375m59BuOmeyMVbbtBF6g0lbazU0daNPKaaNBV2d3yrmpTFQLs1y2oWvfuyqe3ZmMW46ScvLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:23:20.308635Z"},"content_sha256":"e6ae0834c50cc2848932a1c1fd2acf15ccc21cb31317877c38621e9c27ef410a","schema_version":"1.0","event_id":"sha256:e6ae0834c50cc2848932a1c1fd2acf15ccc21cb31317877c38621e9c27ef410a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/bundle.json","state_url":"https://pith.science/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:23:20Z","links":{"resolver":"https://pith.science/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3","bundle":"https://pith.science/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/bundle.json","state":"https://pith.science/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JEG4CFMEZ7CIHOF2KN54OKJJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4JEG4CFMEZ7CIHOF2KN54OKJJ3","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":"fb4b8a1e95804065029002b2c7de8030111163f016be63297f150e21e3a219b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-25T09:06:53Z","title_canon_sha256":"682a24dc66cf851ddf30ab5ddcecf99ed94567d135fcaf20ea331f6391ce3c79"},"schema_version":"1.0","source":{"id":"1902.09151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09151","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09151v2","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09151","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"4JEG4CFMEZ7C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4JEG4CFMEZ7CIHOF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4JEG4CFM","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e6ae0834c50cc2848932a1c1fd2acf15ccc21cb31317877c38621e9c27ef410a","target":"graph","created_at":"2026-05-17T23:52:35Z","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"},"paper":{"abstract_excerpt":"This work considers the multi-channel blind deconvolution problem under the assumption that the channels are short. First, we investigate the ill-posedness issues inherent to blind deconvolution problems and sufficient and necessary conditions on the channels that guarantee well-posedness are derived. Following previous work on blind deconvolution, the problem is then reformulated as a low-rank matrix recovery problem and solved by nuclear norm minimization. Numerical experiments show the effectiveness of this algorithm under a certain generative model for the input signal and the channels, bo","authors_text":"Antoine Paris, Laurent Jacques","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-25T09:06:53Z","title":"Identifiability Conditions for Multi-channel Blind Deconvolution with Short Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09151","kind":"arxiv","version":2},"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:6c3bbe301e0109368bbc96004992b264ee748e502bc2cecd4ff76cb94dc9f893","target":"record","created_at":"2026-05-17T23:52:35Z","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":"fb4b8a1e95804065029002b2c7de8030111163f016be63297f150e21e3a219b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-25T09:06:53Z","title_canon_sha256":"682a24dc66cf851ddf30ab5ddcecf99ed94567d135fcaf20ea331f6391ce3c79"},"schema_version":"1.0","source":{"id":"1902.09151","kind":"arxiv","version":2}},"canonical_sha256":"e2486e08ac267e241dc5d29bde39494ed5a5d6c2586c742078826e3da1e77770","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2486e08ac267e241dc5d29bde39494ed5a5d6c2586c742078826e3da1e77770","first_computed_at":"2026-05-17T23:52:35.743818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:35.743818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lPhcBoUswwaETMl2GQ2RCrPVy29rLA9wDqJK1LCvuMJH8d3QrZRUruhchnSD6yIb6GTyjnQ1FO1Z5Y8tJ+nvBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:35.744372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c3bbe301e0109368bbc96004992b264ee748e502bc2cecd4ff76cb94dc9f893","sha256:e6ae0834c50cc2848932a1c1fd2acf15ccc21cb31317877c38621e9c27ef410a"],"state_sha256":"361319991ff838194e0ab2cd56502181fa6ae272f16c67836e0755455d7bdf1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sxPyVB1uupbDvnv0ek/Covyf31NqKIpIb80ILb14iSbAyjIzkalwrvblEd9/s9BCyzGFiwT+Pi75q2Yrvr3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:23:20.311744Z","bundle_sha256":"16e11aa9ed8347b5c2362345b621f8ddfc63f8c9d0bf535d72bde6d586c8c12e"}}