{"as_of":"2026-08-20T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e45ff9fb577b613da84f4035551983358070a69f31ebf7d50874e1a931aec01","coverage":[{"denominator":89,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":89,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:45:07.342390Z","state":"measured"},{"denominator":90,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":90,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:32:19.320018Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T10:32:19.491449Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"cited_work":{"arxiv_id":"1908.10776","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.10776","snapshot_observed_at":"2026-08-14T10:32:19.491449Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","venue":"eess.SP","work_id":"0dee2f72-6b51-4628-bd28-aeb4febcefbc","year":2019},"citing_paper":{"arxiv_id":"1908.10959","last_updated":"2019-10-01T05:25:59Z","snapshot_observed_at":"2026-08-19T14:20:50.134805Z","submitted_at":"2019-08-28T21:52:28Z","title":"Short-and-Sparse Deconvolution -- A Geometric Approach","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-14T10:32:19.320018Z"},"links":{"cited_paper":"/paper/1908.10776","citing_paper":"/paper/1908.10959"},"observation_digest":"sha256:e9eee567f302e06bacbe7b8d09e9b832fc32d3b949a60e033f9209bc48f1a63a","observation_id":"5946175e-b871-4420-a4f9-33314e5fdf18","resolution":{"observed_at":"2026-08-14T10:32:19.495498Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.10776/citation-record","integrity":"/paper/1908.10776/integrity","json":"/paper/1908.10776/citation-record.json","paper":"/paper/1908.10776"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.901013Z","title":"Leveraging diversity and sparsity in blind deconvolution","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.901013Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:20a45626857f8623d14ca9e524f3c7941279a8f20bd30bf5af59185c00cb2ae0","observation_id":"b6b91406-33b3-469c-995f-66aa49f0810b","resolution":{"observed_at":"2026-08-14T10:45:06.901013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.906468Z","title":"Multichannel blind deconvolution and equalization using the natural gradient","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.906468Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:bb52eefe093109d50cd5f66856b8c54e99645ecce7efef541da8ab4da9ec5a86","observation_id":"eef3d67c-1e31-4222-9b46-1cac5dea7d3a","resolution":{"observed_at":"2026-08-14T10:45:06.906468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.912325Z","title":"Optimization algorithms on matrix manifolds","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.912325Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:2841a3210ff84e5b5819d3c1318a9e6291939e45963aa4a50f26204250955b6e","observation_id":"c3dcf3ce-bee3-4634-92de-cdf1ff0aadcf","resolution":{"observed_at":"2026-08-14T10:45:06.912325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.917389Z","title":"Blind deconvolution using convex programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.917389Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:b6170f9841577e9087b1d26b963b22a137fde3f4af8cc9261f97bef7927c8848","observation_id":"7df342cf-2221-4c95-a344-d351365444c5","resolution":{"observed_at":"2026-08-14T10:45:06.917389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.922755Z","title":"Fast convolutional sparse coding","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.922755Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:0f2fe5f72f0f473a9e3f1269861e6f78b3f6dbea67f5d1aae28ba313c98ba170","observation_id":"e683f841-43b9-492e-b514-efb10d73bc02","resolution":{"observed_at":"2026-08-14T10:45:06.922755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.928069Z","title":"Weak sharp minima in mathematical programming","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.928069Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d9ff284eb2c03635c960ee7dba96028ba758a039640a1a147d2e483b173c0507","observation_id":"d78a2ae8-8617-4145-8887-c8d400de4366","resolution":{"observed_at":"2026-08-14T10:45:06.928069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.933520Z","title":"Matrix analysis , volume 169","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.933520Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:164a3ea7fe76e3635f0c791f0d7294e2fd9b5a20c0a5ce848c3ade9298c507be","observation_id":"34300bad-31b9-432d-b674-58d5754d0b44","resolution":{"observed_at":"2026-08-14T10:45:06.933520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10702","last_updated":"2019-07-01T05:26:18Z","snapshot_observed_at":"2026-08-19T14:20:48.950772Z","submitted_at":"2018-10-25T03:07:58Z","title":"Subgradient Descent Learns Orthogonal Dictionaries","version":2},"cited_work":{"arxiv_id":"1810.10702","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10702","snapshot_observed_at":"2026-08-14T10:45:07.587554Z","title":"Subgradient Descent Learns Orthogonal Dictionaries","venue":"cs.LG","work_id":"cb398fa5-171a-4a94-a524-3f074bcdd9f6","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.938238Z"},"links":{"cited_paper":"/paper/1810.10702","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:3dd4c409a87bf4511a957a8936d671b3acdd3f9ecfcf9e5bc932f9d90a0a910d","observation_id":"029c7f80-6317-498b-a18d-31bbdfdf9365","resolution":{"observed_at":"2026-08-14T10:45:07.593666Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.943336Z","title":"Imaging intracellular fluorescent proteins at nanometer resolution","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.943336Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:91f9640edc0d0eb2328c599180e1d59332fb1f1723e917c829c920ea47d5d3e8","observation_id":"2a0c7742-5cd3-40f3-b52e-a9900280d437","resolution":{"observed_at":"2026-08-14T10:45:06.943336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:06.948124Z","title":"Subgradient methods","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.948124Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:015fe695801178fc9f394ae81095ffd9aa8c8086fbfdc871b3a0660a4119d494","observation_id":"408242c1-0337-484e-966f-59ce7a6ccbaa","resolution":{"observed_at":"2026-08-14T10:45:06.948124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.636830Z","title":"Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization","venue":null,"work_id":"ed0a56a6-5e83-4421-be75-2f88a9ab5eec","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.953257Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:37a1b6887aa1332e67a689ccff998748d06270402e31dcf06205fe9c035c36ff","observation_id":"f54e7459-483c-4259-9b67-de1802ee4e7e","resolution":{"observed_at":"2026-08-14T10:45:08.642136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10020","last_updated":"2019-04-22T18:36:56Z","snapshot_observed_at":"2026-08-19T14:19:44.901559Z","submitted_at":"2019-04-22T18:36:56Z","title":"Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10020","snapshot_observed_at":"2026-08-14T10:45:06.958138Z","title":"Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.958138Z"},"links":{"cited_paper":"/paper/1904.10020","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:bbb07803054c640747907857374f05dcc8df37662aa482b6bf47d225e3a70807","observation_id":"463df19f-2c67-48ca-a555-0f831ab2cdee","resolution":{"observed_at":"2026-08-14T10:45:06.958138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.620820Z","title":"Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval","venue":null,"work_id":"54ddc3f3-274d-4e93-9d3d-650d47c2f8fa","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.963385Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:81e2883233ca0b8978a44ddfde801c202da11291d7dc74920e204dcfba1ca03d","observation_id":"e547a927-898c-4e12-8cd7-47e43e123104","resolution":{"observed_at":"2026-08-14T10:45:08.626282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.605559Z","title":"Convolutional dictionary learning: Acceleration and convergence","venue":null,"work_id":"a22ba46a-b1f5-4bf9-8441-405339bc50e9","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.968188Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:b7976a5a72c57b58cf9f11a41d273f6e453243ae94bc2f54ba42a6d8d1f4ef3e","observation_id":"cfccb3e2-550b-4762-9b8d-a377262751ec","resolution":{"observed_at":"2026-08-14T10:45:08.610414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.589435Z","title":"Guaranteed blind sparse spikes deconvolution via lifting and convex optimization","venue":null,"work_id":"825f4536-b851-434a-baaf-c5f52a2b99f2","year":2016},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.972788Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:68a6c56748c8b85aad5d9369b83f195e72f0372106eaedd2f641362b422b4620","observation_id":"78210bd3-5af0-4bf6-9ed9-6b522e00a714","resolution":{"observed_at":"2026-08-14T10:45:08.594582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09573","last_updated":"2019-09-19T17:00:59Z","snapshot_observed_at":"2026-08-14T18:23:44.330923Z","submitted_at":"2018-09-25T16:21:07Z","title":"Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09573","snapshot_observed_at":"2026-08-14T10:45:06.977540Z","title":"Nonconvex optimization meets low-rank matrix factorization: An overview","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.977540Z"},"links":{"cited_paper":"/paper/1809.09573","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:1c905fa4feae2494220cf4ca8179ecf0c0334d4a7b4b613f663851d582d5cabf","observation_id":"b79fa159-5e84-40c7-9817-99cfd3edb620","resolution":{"observed_at":"2026-08-14T10:45:06.977540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.573168Z","title":"Cand \\`e s, Xiaodong Li, and Mahdi Soltanolkotabi","venue":null,"work_id":"54be2db6-1a64-4221-b971-2d8a5de47e0c","year":1985},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.982558Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:5080a54c64858161a3453821ba8c14ff4d6a8162dec3ae3cbba5761efa0ae620","observation_id":"d3b02acc-560e-4be3-a311-662097cd2692","resolution":{"observed_at":"2026-08-14T10:45:08.578211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.557662Z","title":"A note on the blind deconvolution of multiple sparse signals from unknown subspaces","venue":null,"work_id":"bd9a0097-535f-4f7a-bd77-7347cb597b21","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.987320Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d24de874beb718caeeccf58cbbfa962044c2b571144bce1abc6c6eef23a16eae","observation_id":"99e354bc-c28b-4806-a861-b9527b5ac2ff","resolution":{"observed_at":"2026-08-14T10:45:08.562870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.541127Z","title":"The null space problem i","venue":null,"work_id":"c0988f34-3bec-4169-8a8c-5a9eaf9d7096","year":1986},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.992107Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d94b5e9966e9f2bc41fbde96809a4625fc687f5802cbcba5ebc928d5b8f16c53","observation_id":"c5bc4df5-15ea-4409-b20e-8be5227b069c","resolution":{"observed_at":"2026-08-14T10:45:08.546133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.523842Z","title":"Tail bounds via generic chaining","venue":null,"work_id":"1ce6f6c2-7d6f-40a0-af48-cc2d20a303d5","year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:06.996644Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:250e741f2730fcac9f256acdaeaaa2c3800897bb0d495cf6cf8d2f9e773a19de","observation_id":"9705871b-b7e3-4c1c-ac2f-56805a414ace","resolution":{"observed_at":"2026-08-14T10:45:08.529133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.508266Z","title":"Subgradient methods for sharp weakly convex functions","venue":null,"work_id":"6fb5f705-6d64-4299-a681-bb429693924e","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.002071Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:c776d1d99d50bde38c8622308e6f4796c411f20dfc238029cec938507267785a","observation_id":"5fb25750-2f89-4db6-b870-0ccb25eab247","resolution":{"observed_at":"2026-08-14T10:45:08.513203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.491979Z","title":"Decoupling: from dependence to independence","venue":null,"work_id":"b1ef552e-4ec1-4e3f-8676-f494782e31f5","year":2012},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.006639Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:1a8215587d6342c1efff76e0320de5b22c8fa13df7a3be66d8ac591adb37979e","observation_id":"45257d88-5097-44e2-a53c-b622454ab16f","resolution":{"observed_at":"2026-08-14T10:45:08.497311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.474547Z","title":"Noisy dual principal component pursuit","venue":null,"work_id":"d99174a1-b36a-4551-bb18-2a69b86e0bd6","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.011550Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e050b4e25cb935149b17ccbc4d07eab67c8a411d168527e3bd4ec6e7a91cbcd6","observation_id":"c312043e-1e83-4779-abb9-fd750c8c99a6","resolution":{"observed_at":"2026-08-14T10:45:08.480751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.459125Z","title":"A blind sparse deconvolution method for neural spike identification","venue":null,"work_id":"e1c0834e-5141-4593-b65a-364bd926e118","year":2011},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.016251Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:91e8516ce5f1c9c12c96fdbbb8d96e48e01f1731fd2a2c333b5a2ffef18ba3c5","observation_id":"74f7b6d6-25c4-464b-adb8-f112f616fc12","resolution":{"observed_at":"2026-08-14T10:45:08.464093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.442495Z","title":"A Mathematical Introduction to Compressive Sensing","venue":null,"work_id":"e816fde1-41d2-464c-9d0f-052782e500c8","year":2013},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.021327Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:fb61b9bf49a3e4866ca6fb1936a2fb2959e9a15129d6a4901b8730d53669a835","observation_id":"8b595f5c-662e-45ae-aa57-a8b0a84e8b18","resolution":{"observed_at":"2026-08-14T10:45:08.447797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.426769Z","title":"Fast online deconvolution of calcium imaging data","venue":null,"work_id":"5157a138-f4e1-453f-ba59-295cecbaafc0","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.026023Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:771e9018e8b9657aeb952c96e566770f7c12d79ad66f8d371b30eabcbd925660","observation_id":"a179789f-9c49-4697-b135-d2033d7d8956","resolution":{"observed_at":"2026-08-14T10:45:08.431822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.410882Z","title":"Toeplitz and circulant matrices: A review","venue":null,"work_id":"37383ba3-7170-45e6-a54a-c1c875cf3e99","year":2006},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.031196Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:b9b5565e0830632aa9fb40d01495934f11dcb31c008877a5815dca5f7defce89","observation_id":"84ff6e9e-420a-41b1-8b50-34d807e47fe9","resolution":{"observed_at":"2026-08-14T10:45:08.415836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10313","last_updated":"2018-09-27T02:14:40Z","snapshot_observed_at":"2026-08-14T18:22:59.238533Z","submitted_at":"2018-09-27T02:14:40Z","title":"Efficient Dictionary Learning with Gradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10313","snapshot_observed_at":"2026-08-14T10:45:07.036048Z","title":"Efficient dictionary learning with gradient descent","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.036048Z"},"links":{"cited_paper":"/paper/1809.10313","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:5f1b5fc3a09e2428aa6eace0b7d5dfbb57943321d14dbb39c13cbc8a738d8d4c","observation_id":"3b9087d6-a16e-4524-be2e-907072bd39aa","resolution":{"observed_at":"2026-08-14T10:45:07.036048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.393687Z","title":"Cvx: Matlab software for disciplined convex programming, 2008","venue":null,"work_id":"841a45ca-5fc1-49b8-accc-b086eb9af933","year":2008},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.040979Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e89a617338c0214960894c71676b5b2c1ca5e674da7e1c8541136a6ce9325aca","observation_id":"626c1644-54cf-4220-94f3-067145e404fc","resolution":{"observed_at":"2026-08-14T10:45:08.399282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.376793Z","title":"Convolutional dictionary learning: A comparative review and new algorithms","venue":null,"work_id":"1aeb4af8-cb96-4a40-bbaf-dc5038670547","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.045900Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:2ee3cdbe2fe4261644cf37244c710aa279f2e684ae2e3f67e59641d623bbb35f","observation_id":"695f4c43-4488-486d-b1be-2950b933c7ce","resolution":{"observed_at":"2026-08-14T10:45:08.382002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.360678Z","title":"On convergence rates of subgradient optimization methods","venue":null,"work_id":"7f900565-4beb-4b0a-bcaa-c4940835ffd3","year":1977},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.050464Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:023aefe84df13daa9170371df37fa6857191652884e6b56f34fd9c584b8e883b","observation_id":"6a2a3ab8-e189-4270-9fc7-e526e5bbd7b3","resolution":{"observed_at":"2026-08-14T10:45:08.365994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.344099Z","title":"Modeling regional and psychophysiologic interactions in fmri: the importance of hemodynamic deconvolution","venue":null,"work_id":"34b0e9e1-0af5-46a3-a552-29404c90048a","year":2003},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.055024Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:1108e4f877c1cfe4fba9de2e31e81468351753424c2712e323f976e72e77e5fe","observation_id":"5eec3093-ead6-4823-ae75-b53a748361bc","resolution":{"observed_at":"2026-08-14T10:45:08.349325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.327948Z","title":"Implicit regularization in matrix factorization","venue":null,"work_id":"8d0e7591-2676-4106-97c3-ca74d17c2df9","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.059526Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:45ed4ff5abac219e17ffe2c73e7ca2b9cba2d70041d92924381677f06f82eb1f","observation_id":"1b9e6eb8-8dc8-4686-b8b4-70118e6aef12","resolution":{"observed_at":"2026-08-14T10:45:08.333156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.311022Z","title":"Fir perfect signal reconstruction from multiple convolutions: minimum deconvolver orders","venue":null,"work_id":"1bbf9957-49e0-4e76-9ab4-270891f5fe23","year":1998},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.063953Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:0ad954eda5f228334016c0c76cff66970a29361e9e672c5552f0437d84d731a4","observation_id":"ad9a813f-ce7d-4953-898e-69f573148d8a","resolution":{"observed_at":"2026-08-14T10:45:08.316091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.068830Z","title":"Ultra-high resolution imaging by fluorescence photoactivation localization microscopy","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.068830Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:04d01adabe6204caf4f78a9773100c6ba89e6a56226dce85c8785208fbf03e40","observation_id":"c4d96186-ee9f-4690-bd3c-9ad7f985a392","resolution":{"observed_at":"2026-08-14T10:45:07.068830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.283453Z","title":"Robust estimation of a location parameter","venue":null,"work_id":"d3ea348b-a272-4238-bf95-3418cc64de3e","year":1992},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.073525Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:15c4cb94719035ba3dccca8aacbc34e99e4e4156ed675831522a225ceb605fad","observation_id":"1d900d93-cc61-4b50-bd76-31215cea9732","resolution":{"observed_at":"2026-08-14T10:45:08.289637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.265550Z","title":"Daostorm: an algorithm for high-density super-resolution microscopy","venue":null,"work_id":"eecf1811-cfc1-4238-ba8a-fdc2663031a0","year":2011},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.078382Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:f096a120ce6baf6c57dc2c446cae2b43fe1e0b1e68d26cd61e823a4eaa220cc4","observation_id":"485cef29-48d3-47bc-a7d4-31fd72c03b85","resolution":{"observed_at":"2026-08-14T10:45:08.271701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.249437Z","title":"Non-convex optimization for machine learning","venue":null,"work_id":"66b9e986-1cfd-4b83-96fc-f0e79581d7d9","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.083343Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:adb765ccd2b9a06c11eee0e4a4953c493080075ad6b588b8218d18d9322e66cd","observation_id":"04fc56d8-b4c9-43c1-a268-3ffc41f9cb10","resolution":{"observed_at":"2026-08-14T10:45:08.254479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.088089Z","title":"Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.088089Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:f08618f36eeebb390bf0a9c0c1c98bbb2dcdf74e769105c73ef39c1b50e0b475","observation_id":"f153b11d-14ec-418a-aee0-21dddd27103b","resolution":{"observed_at":"2026-08-14T10:45:07.088089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00256","last_updated":"2019-04-11T18:17:39Z","snapshot_observed_at":"2026-08-14T17:36:06.564750Z","submitted_at":"2019-01-02T03:48:51Z","title":"Geometry and Symmetry in Short-and-Sparse Deconvolution","version":2},"cited_work":{"arxiv_id":"1901.00256","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00256","snapshot_observed_at":"2026-08-14T10:45:07.511936Z","title":"Geometry and Symmetry in Short-and-Sparse Deconvolution","venue":"eess.SP","work_id":"cfd774c3-93aa-41ba-affb-0a879984c138","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.092811Z"},"links":{"cited_paper":"/paper/1901.00256","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:62fe89245a1a9a842191fc8b123860290a10eec9cf491f2c4540fd76c2ee6705","observation_id":"9e0637b2-8482-47c6-bca1-0f50ea9fb98c","resolution":{"observed_at":"2026-08-14T10:45:07.517788Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.221626Z","title":"Suprema of chaos processes and the restricted isometry property","venue":null,"work_id":"c0adc9d5-aa0a-4553-9452-a60a5b3f6167","year":1904},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.098086Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e4c284ee1536d190b591f53e0ac30eff8a0f1abdfb25314a80996c0731d74a43","observation_id":"2251828d-5ee1-4bbc-8b95-06282fc8956a","resolution":{"observed_at":"2026-08-14T10:45:08.226981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.204724Z","title":"Multichannel blind deconvolution of seismic signals","venue":null,"work_id":"83abb803-3f93-4e7f-8c50-fb560e7132fd","year":1998},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.102886Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:f31e0110050ecaed041b45cd745e3f5893f567eb0e6db37864602048d3c2690a","observation_id":"a4c7dad4-bda4-400b-80f3-7cb95874efe5","resolution":{"observed_at":"2026-08-14T10:45:08.210382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10437","last_updated":"2019-03-16T20:59:36Z","snapshot_observed_at":"2026-08-14T19:10:52.106869Z","submitted_at":"2018-05-26T07:04:18Z","title":"Multichannel Sparse Blind Deconvolution on the Sphere","version":2},"cited_work":{"arxiv_id":"1805.10437","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.10437","snapshot_observed_at":"2026-08-14T10:45:07.486909Z","title":"Multichannel Sparse Blind Deconvolution on the Sphere","venue":"cs.IT","work_id":"2087f89f-571b-419b-93f2-afa82a1c728d","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.107994Z"},"links":{"cited_paper":"/paper/1805.10437","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:fbc83f112fd93bb90184097a45278e5c4e4a8342804475ac9bd06838d47ea3f0","observation_id":"aa587287-bacf-4d44-92d2-7823662316ba","resolution":{"observed_at":"2026-08-14T10:45:07.492323Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.186826Z","title":"Blind channel identification for speech dereverberation using l1-norm sparse learning","venue":null,"work_id":"fc9e33f6-7338-4a68-a619-050b7593af96","year":2008},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.113103Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e83463b59d9d42e5bd2332892dd78feb73ca5f0398ad88c54e3f074d33656e16","observation_id":"d9ed8304-2caf-442e-a43d-c6b3df8318bf","resolution":{"observed_at":"2026-08-14T10:45:08.192441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.117829Z","title":"Bilinear inverse problems with sparsity: optimal identifiability conditions and efficient recovery","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.117829Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:10d91ee8c95bbbdcac927aabe5070b71754145609706805562b639bbc9ffe07d","observation_id":"3ff180ed-4669-4469-a448-3f12b14316f3","resolution":{"observed_at":"2026-08-14T10:45:07.117829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.159878Z","title":"Spectral methods for passive imaging: Nonasymptotic performance and robustness","venue":null,"work_id":"953640c0-7392-4154-9a81-0bd1fc5a0f65","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.122466Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e01332a04f76de9880f8bd39646d0fa4bdda94218a5432203ad7a4097a0c4ae1","observation_id":"13fed0f5-a875-4122-ad95-35f3335313f9","resolution":{"observed_at":"2026-08-14T10:45:08.165098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.127051Z","title":"Identifiability in blind deconvolution with subspace or sparsity constraints","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.127051Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:3a8187f42506a8b1d5deb6104fb2c538706689d27fa8275e430d8a706d898795","observation_id":"1fdaa762-eb57-41f3-87c0-95a7db50ca15","resolution":{"observed_at":"2026-08-14T10:45:07.127051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.133072Z","title":"Identifiability in bilinear inverse problems with applications to subspace or sparsity-constrained blind gain and phase calibration","venue":null,"work_id":"a39b9d65-b513-42fc-853f-ec5e9b37c121","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.131596Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:29b2ac379540b05f285bf1074483e27da99983f858212939c9dbb02ea920cb6c","observation_id":"471e1ffc-1113-42ff-bf91-f40c86f88e0e","resolution":{"observed_at":"2026-08-14T10:45:08.139086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.116408Z","title":"Blind gain and phase calibration via sparse spectral methods","venue":null,"work_id":"0d6b0999-e9e8-4bc3-98bd-f12a27373a15","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.136120Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:52f08b92b74f6e4d8d63ff54ce61a4c9f15a772c6f87e8e923c26641f586193b","observation_id":"ec16a7e2-3616-49cd-ab73-950fe29dc55b","resolution":{"observed_at":"2026-08-14T10:45:08.122066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.140861Z","title":"Rapid, robust, and reliable blind deconvolution via nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.140861Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:e8789118f7b008393eda4ae58543a85077d809e5bb272b2841353d0b07f103c4","observation_id":"2fab783d-a598-4da5-b0f2-ef83abcd77c1","resolution":{"observed_at":"2026-08-14T10:45:07.140861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.091345Z","title":"An overview of robust subspace recovery","venue":null,"work_id":"bff4f887-515d-43ba-b7b7-c87301448304","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.146316Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:838f06e764e7c85a4b955dbf314665dfcc6636381c9c869e8b7e9538dec9cd58","observation_id":"3b26a26a-6c5a-4896-b2f7-a0c22113ddd9","resolution":{"observed_at":"2026-08-14T10:45:08.096389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.075234Z","title":"Short-and-sparse deconvolution -- a geometric approach","venue":null,"work_id":"5704897e-813f-43dc-9541-75fe3e975de9","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.151162Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:1be21ed851a2dcd30bdc0808be74cd828b699496bfc630068d623c234069bb96","observation_id":"253bed6e-1082-451b-ad91-335d66fbecef","resolution":{"observed_at":"2026-08-14T10:45:08.080315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.155918Z","title":"Self-calibration and biconvex compressive sensing","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.155918Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:508d9ad524155fa4706217893045a19668ff62e29053afb22f1d9ed7357ee8cf","observation_id":"4ccff87f-32ea-4832-b83f-536dffd6cba1","resolution":{"observed_at":"2026-08-14T10:45:07.155918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.049614Z","title":"Self-calibration and bilinear inverse problems via linear least squares","venue":null,"work_id":"3dabec75-30e7-4ef0-85a5-4886a4d64c1a","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.160738Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ae7045c959167d3e560c1d6d7f05ea255490f17bef3ce54888e1b59abf6a482d","observation_id":"e032bc8f-01b7-42d0-a9bd-fdd5a4c3bf76","resolution":{"observed_at":"2026-08-14T10:45:08.054535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.033808Z","title":"Fast and guaranteed blind multichannel deconvolution under a bilinear system model","venue":null,"work_id":"9b23ff99-807b-4ddc-8da1-cd92be62161c","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.165678Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:56352cf017af34ad3542336b5bafc810b9bd420d4f50d133e807fc23142df466","observation_id":"bb603843-61b5-4cc9-afb4-38993218edc4","resolution":{"observed_at":"2026-08-14T10:45:08.038801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.170367Z","title":"Understanding blind deconvolution algorithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.170367Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:17709877c8e50d3e4dffea1212b003ba419e5b11428cff89412fe4fac44ec400","observation_id":"a62675d6-6514-41b8-90ed-3a01d0e23134","resolution":{"observed_at":"2026-08-14T10:45:07.170367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-14T16:01:52.632423Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-08-14T10:45:07.175028Z","title":"Incremental methods for weakly convex optimization","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.175028Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:abfa5c35a5716ca002c7fb3092a754fedc0fc7fee4b608773c5538dc281eae72","observation_id":"f854c36d-00df-4614-bbe6-50cabc926e89","resolution":{"observed_at":"2026-08-14T10:45:07.175028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09237","last_updated":"2019-07-14T11:28:48Z","snapshot_observed_at":"2026-08-14T18:24:05.811771Z","submitted_at":"2018-09-24T22:07:50Z","title":"Nonconvex Robust Low-rank Matrix Recovery","version":4},"cited_work":{"arxiv_id":"1809.09237","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.09237","snapshot_observed_at":"2026-08-14T10:45:07.446249Z","title":"Nonconvex Robust Low-rank Matrix Recovery","venue":"cs.IT","work_id":"34d7d600-2df6-4510-bf67-4ab1e5c90e6e","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.180103Z"},"links":{"cited_paper":"/paper/1809.09237","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:0bf2b956efe899633ce8f41c74ae1d16d2007de88ac2129caf3d284a79ce474e","observation_id":"73edb1a2-1978-4b6c-af5c-3e963822c0ea","resolution":{"observed_at":"2026-08-14T10:45:07.452058Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:08.007868Z","title":"Subspace methods for the blind identification of multichannel fir filters","venue":null,"work_id":"b1015351-07f5-4669-a189-31375f514c8e","year":1995},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.185532Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ba8ff9b6437b8fda51d4cf3f51cc40e4d914657dbe12dec75323d794f50e12b5","observation_id":"45fc2eb1-6bfa-454f-a8c9-3f3d59ca3637","resolution":{"observed_at":"2026-08-14T10:45:08.013288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.10467","last_updated":"2019-07-30T02:14:54Z","snapshot_observed_at":"2026-08-18T05:28:01.561822Z","submitted_at":"2017-11-28T18:53:38Z","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.10467","snapshot_observed_at":"2026-08-14T10:45:07.190210Z","title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion and blind deconvolution","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.190210Z"},"links":{"cited_paper":"/paper/1711.10467","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:8da5e39deae06ba552764792cf4c17fffc4d6375edf4eba488fe6d7445bdfc4b","observation_id":"e949268b-77fc-4756-aa8e-216a8a75a41b","resolution":{"observed_at":"2026-08-14T10:45:07.190210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.992209Z","title":"Sparse approximate solutions to linear systems","venue":null,"work_id":"a94e2fee-6b06-4e8e-a084-31143451c957","year":1995},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.195182Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:245391ffd91d0f2740a199b37329278713ca82d4739c1703c996f1d5eec5a329","observation_id":"90861a36-fd68-450b-b3f6-89adeb941db5","resolution":{"observed_at":"2026-08-14T10:45:07.997161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.975651Z","title":"A fast algorithm for sparse multichannel blind deconvolution","venue":null,"work_id":"a2c4a55c-2714-408d-84c5-ea1651035ad5","year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.200197Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:4f42173fb881ca5d3dba8adc0f1c9341e5ff8eaaace2797084dd013e87cb794c","observation_id":"481b435b-8c68-4d1a-9a79-d666f6aca219","resolution":{"observed_at":"2026-08-14T10:45:07.981099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.03071","last_updated":"2017-05-08T20:12:08Z","snapshot_observed_at":"2026-08-14T21:02:03.278723Z","submitted_at":"2017-05-08T20:12:08Z","title":"Geometry of Optimization and Implicit Regularization in Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.03071","snapshot_observed_at":"2026-08-14T10:45:07.205209Z","title":"Geometry of optimization and implicit regularization in deep learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.205209Z"},"links":{"cited_paper":"/paper/1705.03071","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:0031a4ba32e98c21207c21f1a1725913124f09694bc0bf6de66348f42c1cd4eb","observation_id":"0ad576a6-d28b-4830-a4ee-50c4d960d0d0","resolution":{"observed_at":"2026-08-14T10:45:07.205209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.210936Z","title":"Simultaneous denoising, deconvolution, and demixing of calcium imaging data","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.210936Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d635b494e94ce8bb10a718e3fb04d29f1b4ab231a088dbe1eadfb98c5649fa13","observation_id":"92588b68-4a1e-4e13-a2c1-366e6c951fd2","resolution":{"observed_at":"2026-08-14T10:45:07.210936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.216822Z","title":"Finding a sparse vector in a subspace: Linear sparsity using alternating directions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.216822Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ea2ca2d6c5678c829b39010f5589bf357aa5ea82498d541b5dfe6f75ae499d89","observation_id":"34fb2c7b-4549-4211-82b2-6d763f39e70f","resolution":{"observed_at":"2026-08-14T10:45:07.216822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.222028Z","title":"Convolutional phase retrieval","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.222028Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:7faa405b841d8732cb3ffa2da033bb59474e65c628fc76aeaaeabc315dfaef20","observation_id":"4fbb9736-53d4-4b34-a000-46aa9f33cad9","resolution":{"observed_at":"2026-08-14T10:45:07.222028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.925114Z","title":"Tsakiris, John Wright, and René Vidal","venue":null,"work_id":"64525361-e319-4e13-bd66-584fedf6baad","year":2020},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.227200Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d3660a1ffe04c97d995d673cdb1cf2c8bc97de5cf91d09c3b6531b08f1872ab1","observation_id":"bf8ea87a-47ca-4284-89c5-261a47b21a2c","resolution":{"observed_at":"2026-08-14T10:45:07.930457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.908766Z","title":"Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (storm)","venue":null,"work_id":"85656676-072c-4a29-85f9-b5e1983adb22","year":2006},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.232023Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:25a608ccda1db068f95d700d504e70fa79aae437c468b5d7a74aaa47dc1fbfc5","observation_id":"342d25f0-d93e-4dcc-b764-451e369b6e62","resolution":{"observed_at":"2026-08-14T10:45:07.913925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.892078Z","title":"Euclid in a taxicab: Sparse blind deconvolution with smoothed _1/ _2 regularization","venue":null,"work_id":"12ddf9bd-4afa-4300-b0ea-44b5accb150e","year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.238414Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:70366d4a67a90c6684aebe743c289aa903c008998052e85c4a51b09fbfb0b724","observation_id":"eaac94bc-41b6-458d-ab45-7a31e85bc6be","resolution":{"observed_at":"2026-08-14T10:45:07.897909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.875578Z","title":"Manifold gradient descent solves multi-channel sparse blind deconvolution provably and efficiently, 2019","venue":null,"work_id":"5284a013-f1a7-4e55-a4c7-907d1b741152","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.244074Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:89fe0b2e41941da4ac11dad8f74df1aaabb04c8c0abc7defc73d287f5ad2cac1","observation_id":"e731537b-4632-4f8c-a671-e3788b013014","resolution":{"observed_at":"2026-08-14T10:45:07.880965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.859518Z","title":"Image reconstruction from phased-array data based on multichannel blind deconvolution","venue":null,"work_id":"01787fe9-2de9-40d0-8181-5186bc46c809","year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.248664Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:c609af67f5bf879753f9784ee31878c0f4e52a9a7978bf18000edc66d5c3c4e5","observation_id":"9bf9e807-dba5-4c53-8388-ed9769c6a6e3","resolution":{"observed_at":"2026-08-14T10:45:07.864757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.253302Z","title":"Robust multichannel blind deconvolution via fast alternating minimization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.253302Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ceda934062c2b6d7ad58a5627c83492058e07f1216bbf0e5864d47a4d113691e","observation_id":"d9f30250-363f-42b2-b365-79100feecbbd","resolution":{"observed_at":"2026-08-14T10:45:07.253302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.257963Z","title":"Deconvolution methods for 3-d fluorescence microscopy images","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.257963Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:54be0e3fdc8eb76d04a52e9f36e46218a6c74413c541a1723515956fc47db6c2","observation_id":"599bd571-79f3-458b-8b6d-013f6f6902be","resolution":{"observed_at":"2026-08-14T10:45:07.257963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.262212Z","title":"Complete dictionary recovery over the sphere i: Overview and the geometric picture","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.262212Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ce3dac3bed4f4ba952a87812cdd2df61be1ceea84ca8ee17bc45943ddcf3e891","observation_id":"1f478647-dce2-458e-9fbe-629e2f7d95be","resolution":{"observed_at":"2026-08-14T10:45:07.262212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.809861Z","title":"Complete dictionary recovery over the sphere ii: Recovery by riemannian trust-region method","venue":null,"work_id":"c4af5939-1481-4984-8c0c-e04b131b15a1","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.267162Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:34a356ff8b523aa829d99dbb0e26b58b2cb010c2c4e784d357eafbcbaee0f058","observation_id":"90f1ef15-7b6a-42b6-bd1e-7c6199406ce2","resolution":{"observed_at":"2026-08-14T10:45:07.815084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.792550Z","title":"Fluorophore localization algorithms for super-resolution microscopy","venue":null,"work_id":"cf167080-b262-4fcd-b6b1-38874878227c","year":2014},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.271693Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:95b5da3f4fa8c8da37ab0d948f61057b7c02dddb0744620ac6ad219e4387a28c","observation_id":"38b3c5b5-2069-4ce2-a3bc-3f1cf5c14034","resolution":{"observed_at":"2026-08-14T10:45:07.797793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.775873Z","title":"Provable nonconvex methods/algorithms","venue":null,"work_id":"7406ced8-9446-4bf4-84c8-d2eb61214c70","year":null},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.276541Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:d0143b77fe4642563d77333c4e1aaad6c1ffaf7a1e82a00a3768cc1a43a7ebeb","observation_id":"179d7515-ef05-429a-bd7b-8c5675f94fe3","resolution":{"observed_at":"2026-08-14T10:45:07.781513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.760320Z","title":"Upper and lower bounds for stochastic processes: modern methods and classical problems , volume 60","venue":null,"work_id":"907f0608-633b-4924-82c7-6bac097a7817","year":2014},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.281602Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:556915a87494bbc98c5d0a0a605c4dd448be82f3ca3e97a56eb013868fe8c49c","observation_id":"650088a3-6812-4b3f-b4b1-b4e87fe3347f","resolution":{"observed_at":"2026-08-14T10:45:07.765492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.744344Z","title":"Multichannel myopic deconvolution in underwater acoustic channels via low-rank recovery","venue":null,"work_id":"ced5816a-3305-4071-ae58-9a5e5833510a","year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.287114Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:4fa08a931330b4aa0a716ebafad169782d9f9d63e7f032a46019928c0980c692","observation_id":"6976a8f3-36ca-42d5-9707-48d04479deb7","resolution":{"observed_at":"2026-08-14T10:45:07.749565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.726290Z","title":"Dual principal component pursuit","venue":null,"work_id":"0fd38181-5d4d-4947-83d4-a95724d9f62b","year":2015},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.291951Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:fc7491736c344d32ac9c61e3f5b5a6672234af526451e5e0d4a6f18d90321b40","observation_id":"53ed45d7-c63f-4049-859f-808d9ab7b3eb","resolution":{"observed_at":"2026-08-14T10:45:07.731475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.296855Z","title":"Blind deconvolution from multiple sparse inputs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.296855Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:8533fb6c2776b26cb991ae1b58c8a8e0a27138765eece04fdbf97b1ce4dfa2c6","observation_id":"d935a2f0-b509-4632-b02f-840276cfc911","resolution":{"observed_at":"2026-08-14T10:45:07.296855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.699209Z","title":"A blind deconvolution approach to recover effective connectivity brain networks from resting state fmri data","venue":null,"work_id":"6c43ec41-6bbc-44f6-a2f0-c77ee6c9912a","year":2013},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.301791Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:77cdf9d61f429b66f6e23459fbdcdc291ea36a149fdb50bc8711b8c600ec8fbf","observation_id":"595409c2-101b-4670-b14e-000f0df9f966","resolution":{"observed_at":"2026-08-14T10:45:07.705067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.682429Z","title":"A least-squares approach to blind channel identification","venue":null,"work_id":"ed5a5298-db01-4a74-afad-545e16d10d17","year":1995},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.306851Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:a31508d678d7f700964bb9355ed4673bdeaeb36b9095e458b152ba0fbc0836cd","observation_id":"be8f279c-3da3-4e87-a524-820ecc3c52c0","resolution":{"observed_at":"2026-08-14T10:45:07.687729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.664771Z","title":"Structured local minima in sparse blind deconvolution","venue":null,"work_id":"1804a97a-4dab-4986-b2e3-63fd4dc9fa6d","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.311826Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:54f25957a9800052df730b6c8da98076c27c59628b1e9bcde74d9dad46a795e1","observation_id":"7d4d58c2-9b8d-4b29-b45c-336690767868","resolution":{"observed_at":"2026-08-14T10:45:07.670935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.316615Z","title":"On the global geometry of sphere-constrained sparse blind deconvolution","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.316615Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:0b2e14a3f752409257cf40590bf967df29a571425fd70da69c69ca2269831200","observation_id":"b0641cae-6919-41fc-a04b-4086779a2b2c","resolution":{"observed_at":"2026-08-14T10:45:07.316615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.637335Z","title":"Dual principal component pursuit: Improved analysis and efficient algorithms","venue":null,"work_id":"8fc9e189-8f89-407c-af2e-2ab0d515a0fc","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.321500Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:679fab34dd028694769c08b0a9e6233b72ca397e86f5b9c3315b2b580df73202","observation_id":"ccb74a96-fff3-46b0-8654-e7c17dc50b6a","resolution":{"observed_at":"2026-08-14T10:45:07.642534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.621113Z","title":"Multi-image blind deblurring using a coupled adaptive sparse prior","venue":null,"work_id":"f4aa3ec5-c6ec-4541-b339-7505cf026cac","year":2013},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.326215Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:97a2747d29cbe613edcbe296470d6e25f455ed7696648ba4d1b2228276f1e651","observation_id":"b74b8176-d1a2-46f5-81c8-e35531ebe50c","resolution":{"observed_at":"2026-08-14T10:45:07.626345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.02435","last_updated":"2021-04-06T17:43:29Z","snapshot_observed_at":"2026-08-14T16:20:01.909170Z","submitted_at":"2019-06-06T06:19:35Z","title":"Complete Dictionary Learning via $\\ell^4$-Norm Maximization over the Orthogonal Group","version":4},"cited_work":{"arxiv_id":"1906.02435","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.02435","snapshot_observed_at":"2026-08-14T10:45:07.382797Z","title":"Complete Dictionary Learning via $\\ell^4$-Norm Maximization over the Orthogonal Group","venue":"cs.LG","work_id":"f22b2f22-bfe3-4c87-83f1-824d5a97476a","year":2019},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.331423Z"},"links":{"cited_paper":"/paper/1906.02435","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:c87a73f56dc5bc502fcda19c0c30cddad0d609f2cbbf650924b113ce8ec3a14d","observation_id":"f41ef4df-3b17-449f-b498-3d2152cecae6","resolution":{"observed_at":"2026-08-14T10:45:07.390881Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:07.605263Z","title":"Faster storm using compressed sensing","venue":null,"work_id":"6452a6f3-5c99-410d-80d1-b69a621734d5","year":2012},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.342390Z"},"links":{"citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:31b720c5a8b1a982d638828b62d0c5c5dfdf6b0da5568ea6a1fc7c9b08dd8d13","observation_id":"58400d21-c059-44c9-8023-c039c5990bd2","resolution":{"observed_at":"2026-08-14T10:45:07.610090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","latest_version":3,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution"},"reference_resolution":{"displayed":89,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":5,"verified_fuzzy":54},"total_outbound_references":89},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 89 of 89 outbound references and 1 inbound Pith citation observation for arXiv:1908.10776."}