{"as_of":"2026-08-14T19:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f480458c1a5cfffc7008c1359556da14597c345e235caa2cbf4faf6bb876d95a","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T09:44:04.574801Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.12740/citation-record","integrity":"/paper/2606.12740/integrity","json":"/paper/2606.12740/citation-record.json","paper":"/paper/2606.12740"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:44:04.574801Z","title":"Deep Unfolding for Communications Systems: A Survey and Some New Directions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:4fbb17b83fd0a0ced681da0bb77f9c359b63ba26dc5e091c79c1f1e2ea182e90","observation_id":"f70d4d3f-ec61-4559-acfb-cff8187f8d4c","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Baraniuk, Volkan Cevher, Marco F","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:81e46855bb7ff7e1527f27b9c07968cdd47029576213b82b54720ceb17d85c7e","observation_id":"f3f4b746-8caa-4dd0-83c5-f595d254b12e","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10731","last_updated":"2023-02-21T15:31:04Z","snapshot_observed_at":"2026-08-13T12:40:08.307127Z","submitted_at":"2023-02-21T15:31:04Z","title":"Real roots of real cubics and optimization","version":1},"cited_work":{"arxiv_id":"2302.10731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.10731","snapshot_observed_at":"2026-07-03T10:58:03.423081Z","title":"Bauschke, Manish Krishan Lal, and Xianfu Wang","venue":null,"work_id":"e77d3052-e9ed-47e1-a223-7a490e3af680","year":2023},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"cited_paper":"/paper/2302.10731","citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:ccd289340df6a876df82003704c642b5fd8f60aa33b97e1d49a0a8f2aa2a16e6","observation_id":"c2062826-a4fd-4663-94c1-2f04abee4bf1","resolution":{"observed_at":"2026-07-03T10:58:03.424415Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-27T09:44:04.574801Z","title":"Escaping saddle points without Lipschitz smoothness: The power of nonlinear preconditioning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:87272795421797a03dc92ffed7ce462a2b6e87c5a1a507f2ae83d30d6e793d92","observation_id":"8d561477-539e-4412-b604-c71bfb9d8c0e","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"AMP-Inspired Deep Networks for Sparse Linear Inverse Problems.IEEE Transactions on Signal Processing, 65(16):4293– 4308, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:378e8fa6eb1b48d165dcc762364c19fdc6e1738a84f88af45c1d1664bf95bc1e","observation_id":"078535ad-4040-4704-ac44-5482baef0034","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Carrillo, Kenneth E","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:47c3071e84951ea493a021c95b50907f505a814b3730304af954848c2f5f42d7","observation_id":"a36442f8-2ada-45ea-8e44-0d333bbcd803","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Combettes and Christian L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:68b684f75607908956f49c9302d6242a92b0877cc5430fc4f27e752ca22b9623","observation_id":"3b19daf3-3e2c-4e92-a497-ba179e5ba214","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Eldar, Patrick Kuppinger, and Helmut Bolcskei","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:cff04dc22c5992000e04e43b295b8bf0fcfdf894c65aab03f79bdc815ef683d0","observation_id":"14bb05ca-3b6c-4840-983a-66c16b76c6ed","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Pattern-coupled sparse bayesian learning for recovery of block-sparse signals.IEEE Transactions on Signal Processing, 63(2):360–372, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:ce2e58c823d837ba192c5ae3a46fde270da6b6895ce005674c61e673fee19621","observation_id":"4d0e509b-cbbc-4862-8573-e0ed5b88f8d6","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Deep Unfolding Network for Block-Sparse Signal Recovery","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:d266d21be8e85c475d84955a02fd8ccb784b3035340bce855d3a318ca957c8f0","observation_id":"bcf8a188-2440-4965-92f8-2b69617b2d12","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"WEEP: A Differ- entiable Nonconvex Sparse Regularizer via Weakly-Convex Envelope","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:31d5d59030ee19d8bc4fda5456a9891e0c8ab8cb138dabbfa37b69176a16bf98","observation_id":"9d614dc4-43df-4d8b-8b23-5e99a27ca0ad","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Soriaga, and Arash Behboodi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:f8c5df8233e10bbd2fe624ae92a0febb2ac2463da446e49f78afc3a74f98b9f9","observation_id":"40687d39-686d-4828-92fe-20d3aa9b66e7","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Block-Sparse RPCA for Salient Motion Detection.IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(10):1975– 1987, 2014","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:02c44a6e279f8ca2f49cae50daa7c21731b5a7de0376079ea9863a9d59293084","observation_id":"afc7ce15-ba46-4c47-b365-03441b4b372a","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"What every computer scientist should know about floating-point arith- metic.ACM Comput","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:df3c9db821f69be6ac2553170b87a76872b621ce5b193bf585ee07169fbe0b0c","observation_id":"9e495c00-6edf-44c9-bf42-e53d8d031007","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Learning fast approximations of sparse coding","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:6fe07a01ec802e67ff20db13d42b28a3d55094f9959500b4ff53546a4a4f3d65","observation_id":"ce7c98f2-6881-4c88-9c0a-f8c51fb65b82","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.2574","last_updated":"2014-11-20T01:52:53Z","snapshot_observed_at":"2026-08-03T21:37:00.074227Z","submitted_at":"2014-09-09T02:31:11Z","title":"Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures","version":4},"cited_work":{"arxiv_id":"1409.2574","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.2574","snapshot_observed_at":"2026-07-03T10:58:03.424150Z","title":"Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures","venue":"cs.LG","work_id":"9783361d-f9f0-4955-9bad-4216e6581b19","year":2014},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"cited_paper":"/paper/1409.2574","citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:f7bec67f693d4f697dd2312ac18f8816790b098d82210ca297fbeb29da239106","observation_id":"8cd1380e-fadb-4f18-abec-18d8ea04350f","resolution":{"observed_at":"2026-07-03T10:58:03.425334Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-27T09:44:04.574801Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:5e6d733f27ded77fa90a96e9ddaaf5c510e21b582803a818a9848a0c740d27d8","observation_id":"382e6686-f004-4c8f-831b-9e1b5540a2e5","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Trainable ISTA for Sparse Signal Recovery.IEEE Transactions on Signal Processing, 67(12):3113–3125, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:bd8b02e776dbf7ef5e6070d9bc017233f4bf9ab373a516be7336615acd733b6b","observation_id":"fbbe23da-4d53-4455-95fc-f0eec44ebf8f","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Differentiable Sparsity via D-Gating: Simple and Versatile Structured Penalization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:dad4a4ad80bfb58a0aad75d38191fdbb9474387e7f233bb7b4a725d3bee697e2","observation_id":"6b4d222d-f075-411d-90cb-ba1ea3a08332","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"M¨ uller, Bernd Bischl, and David R¨ ugamer","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:cc6cd553f735bf34f2b837f9939634ff0a28b40275509ffd7c7516ca34041467","observation_id":"7d95a1cd-ebb0-452c-be34-3a826f88f77d","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:1a3e2c1e4fccc97b828555bc9f49a2803f1d30093a7c91af605f208866b3ce0e","observation_id":"71112508-f833-4967-b277-7138def30d43","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"A convex-nonconvex framework for enhancing minimization induced penal- ties.Journal of the Franklin Institute, 362(15):107969, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:24ae8b27e490b34c91dab4b22e7d31c719ac0e35a105fa208e14e9c31f87eeb6","observation_id":"355e54ba-de12-4d67-b387-b78fadecf399","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Theoretical Val- idation of the Latent Optimally Partitioned-L2/L1 Penalty with Application to Angular Power Spectrum Estimation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:1a789be879f3c0f08962e46e2a4e590fa2f6996434b393c5fe8f71c72af8f24c","observation_id":"2a0bfcc7-2030-44dd-b75b-b9e9ba195afd","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Block-sparse recovery with optimal block partition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:74b3d92fc6e3c965ef7b727e7625b176dcc111d1ac17905b668274b147321627","observation_id":"4a774870-7571-477b-81d6-91d50bf866e4","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Structured Sparse Cod- ing With the Group Log-regularizer for Key Frame Extraction.IEEE/CAA Journal of Automatica Sinica, 9(10):1818–1830, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:bbb1e8cce27e61d94b7915896f85e54d64e8c95455c3ccbe19e9a60ef8411a24","observation_id":"1975ad38-129f-495b-b08c-effd7243f9b6","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Background Subtraction Based on Low- Rank and Structured Sparse Decomposition.IEEE Transactions on Image Processing, 24(8):2502–2514, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:3b637a6e0cdb1b485163ca95b2aaf5df024bef5973e1e118abe33b5cff2c2090","observation_id":"4fd5def1-0058-49d6-84be-910894b9b4cb","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"The Group Lasso for Stable Recovery of Block- Sparse Signal Representations.IEEE Transactions on Signal Processing, 59(4):1371–1382, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:8ff1394deefeba575e7103972d16103feeda17621506ffcdcba9db527fd5962b","observation_id":"78db3f96-3f28-4197-9e39-f29f085a010a","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:ec9612d615846f5bb2b4746036c947150cf0824792815b6654f7db0ab84abded","observation_id":"23407b3c-7c22-40e1-a91a-27f6f74c6d26","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:2a2e41a8f907c8103e0a564b077f308d37784b7290f3dff3acf63b6f1a34ded1","observation_id":"b01ffb21-d562-4756-bda5-faff9679ea2f","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:8593aeefaedc2273b63c189a23263ae2ac05b83e61ac8a010acba43a67c06f1c","observation_id":"969fe5b1-1578-4fd3-a20c-e6aa9bb4f7c8","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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":"2512.03768","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T10:58:03.426487Z","title":"Deep unfolding: Recent developments, theory, and design guidelines","venue":null,"work_id":"f67fb403-b24c-46e0-957e-5a7329df9706","year":2025},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:438110cdc3b59bb56c58f32601c50c043755501a3d5afd1ced4d23b9147e49ca","observation_id":"5d98dd51-7525-4d50-a89d-84a06f67bb7a","resolution":{"observed_at":"2026-07-03T10:58:03.427949Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-27T09:44:04.574801Z","title":"On the Reconstruction of Block- Sparse Signals With an Optimal Number of Measurements.IEEE Transactions on Signal Processing, 57(8):3075–3085, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:2f2d94a1c137be88efd796e7c1e82d5e6dcc7e6ad07592b79022aaaaec23642c","observation_id":"cd772589-d43b-4261-bc47-ed62aa5a6dca","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Recovery of sparsely corrupted signals.IEEE Transactions on Information Theory, 58(5):3115–3130, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:d37e9e69c58a6a5459b627a48b8b4d728d070b973a09fcdd1cf81e1a55ec9db4","observation_id":"0ff6d97a-9439-4c39-a9ff-a7ea18d22b5b","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Robust Bayesian compressed sensing with outliers.Signal Processing, 140:104–109, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:a15bee595918f70ea6bbdd7067b6e0370d064f5090919b0d22222fc8e2b584b7","observation_id":"194ef443-c0b9-48ad-8641-b6aa9b3d5a41","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Enhanced ISAR Imaging by Exploiting the Continuity of the Target Scene.IEEE Transactions on Geoscience and Remote Sensing, 52(9):5736–5750, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:45a76d3e0fa916908f4dcf2955c4b7e31294c9fdd7ea895b7aba0bebd70ef9cf","observation_id":"431923d9-8cf6-4464-b567-d394da93cf78","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"RPCANet: Deep Unfolding RPCA Based Infrared Small Target Detection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:bb24c35671e5f5d1f781424efe136e9f257092f4e707ceb71ef4f528fd2836d8","observation_id":"18ae0e71-fd94-40ec-80a5-93cff9ed4f52","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"InIEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 5369–5377, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:e446e82192a40931513b25ebc66f0c2e0ffc374ed12ab65c698dcff1aa13a4d1","observation_id":"3904b17d-e236-4b02-8833-68bc4392d2e8","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Model selection and estimation in regression with grouped variables","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:b7c10a48a69ec30d88a963c8b51abdd372a6620975c8e332b1504028920cef88","observation_id":"c283b7be-ac98-471b-b4bd-d77ba2a7f52b","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Improved analysis of clipping algorithms for non-convex optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:95438cb17e188d985d89d420be324592aa45554d1459d412519283c875d9ec5b","observation_id":"68a3ef2f-a12c-4c01-8418-d8a2bdea078c","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"ISTA-Net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:2adb52759629ea4ec3afdc1e0f0ffe83e3cd923aa9401a15d2fef2bc23fcf276","observation_id":"608c484b-eb2a-4318-91c4-367b66f16f5b","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.13655","last_updated":"2019-10-26T07:09:24Z","snapshot_observed_at":"2026-08-14T16:22:59.266813Z","submitted_at":"2019-05-31T14:54:36Z","title":"Implicit Regularization in Deep Matrix Factorization","version":3},"cited_work":{"arxiv_id":"1905.13655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.13655","snapshot_observed_at":"2026-07-03T10:58:03.420548Z","title":"Implicit Regularization in Deep Matrix Factorization, October 2019","venue":null,"work_id":"6dddc4a8-e62c-4920-b888-e2f930be421c","year":1905},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"cited_paper":"/paper/1905.13655","citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:2e0e65a76aaa41e0e8dacb4e7ddcf8b344219d4d4ef8709beb1fbd13b256ebad","observation_id":"f50f6c53-b365-4765-87ff-3b21d815b6c9","resolution":{"observed_at":"2026-07-03T10:58:03.421984Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06-27T09:44:04.574801Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:b0846c872f9dbc2ec8268673b704d32e1410a28135ffdd2d07b179f42772a32f","observation_id":"192d1b1e-117b-4dfc-848c-11d0cd8b1796","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","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-06-27T09:44:04.574801Z","title":"Hyperspectral Anomaly Detection via Structured Sparsity Plus Enhanced Low-Rankness.IEEE Transac- tions on Geoscience and Remote Sensing, 61:1–15, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T09:44:04.574801Z"},"links":{"citing_paper":"/paper/2606.12740"},"observation_digest":"sha256:b8acda8bef8bea1b622ec4abf59b48ff4eb2182e510f22e18695f1f9eacc3169","observation_id":"497b5ea4-33fb-4213-acf5-5acd7e605303","resolution":{"observed_at":"2026-06-27T09:44:04.574801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12740","last_updated":"2026-06-10T23:06:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T03:13:16.541876Z","submitted_at":"2026-06-10T23:06:30Z","title":"Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":39,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":43},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2606.12740."}