{"as_of":"2026-08-16T20:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c46f8270c1425e7cb1538e340994d19dd78aaa95f626e9351b1d79634e46da86","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:50:12.414792Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-14T13:28:22.168188Z","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-14T13:28:22.546935Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"cited_work":{"arxiv_id":"1908.10744","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.10744","snapshot_observed_at":"2026-08-14T13:28:22.546935Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","venue":"cs.IT","work_id":"e38fe3c1-d5a4-4bfd-984d-c91c989d4f07","year":2019},"citing_paper":{"arxiv_id":"1908.05368","last_updated":"2020-08-22T06:44:50Z","snapshot_observed_at":"2026-08-16T07:24:04.525012Z","submitted_at":"2019-08-14T22:56:34Z","title":"Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T13:28:22.168188Z"},"links":{"cited_paper":"/paper/1908.10744","citing_paper":"/paper/1908.05368"},"observation_digest":"sha256:278dc6fa90b7806358b9928672b4f82e68eb763dd8e24836778289402cbda9c0","observation_id":"73f2f1d2-bd4d-44bc-b438-8c7b0437f5f8","resolution":{"observed_at":"2026-08-14T13:28:22.579686Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.10744/citation-record","integrity":"/paper/1908.10744/integrity","json":"/paper/1908.10744/citation-record.json","paper":"/paper/1908.10744"},"outbound":[{"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:50:13.018128Z","title":"Foucart and H","venue":null,"work_id":"e6d13cd8-30cd-4826-9e33-033184206adb","year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.225587Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:a085e5f394efefccea8af282a4f5d06132abcab7716c74832003c3c8b75e31b7","observation_id":"354eca61-10e0-4b44-88ec-5e2407ade09c","resolution":{"observed_at":"2026-08-14T10:50:13.023068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.235321Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.235321Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:ebb7c57b3d1f41b36486841561be0ee05e291d303458501f13c130127b3f3039","observation_id":"7847f92a-ab56-4b41-b0d8-6ca781eb3656","resolution":{"observed_at":"2026-08-14T10:50:12.235321Z","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:50:12.991121Z","title":"Just relax: Convex programming methods for identifying sparse signals in noise,","venue":null,"work_id":"959c37e4-97d9-4a2b-a3c8-4f790622bfcd","year":2006},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.242187Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:c077ad22731f7ebd00863cb94078a7cf32de3a60769ba00647bb39cb2b362690","observation_id":"35bf30d6-b0a2-4c74-9742-0b5ab6e5d98f","resolution":{"observed_at":"2026-08-14T10:50:12.996183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.976447Z","title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using 𝓁1-constrained quadratic programming (Lasso),","venue":null,"work_id":"bdd58b52-86fa-439f-9064-c762e1975ffb","year":2009},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.253255Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:8e0bc87a115560529d770f0ca4e2622c02da1cc2ea9da7e05bdee3b317f6a31b","observation_id":"bd01dac6-9a9a-4315-85fa-3a6951c8bcd5","resolution":{"observed_at":"2026-08-14T10:50:12.981523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.960325Z","title":"Greed is good: Algorithmic results for sparse approxi- mation,","venue":null,"work_id":"e9f6cb6b-689d-44ee-8e23-7151401f7fd5","year":2004},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.259752Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:759fe558d9c6aff121010642e29bcdad7ffc8f9626a66d28924c2ba4e5262344","observation_id":"0d9934d6-7e57-4580-a5c6-c0508158b273","resolution":{"observed_at":"2026-08-14T10:50:12.965312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.945531Z","title":"A sharp condition for exact support recovery with orthogonal matching pursuit,","venue":null,"work_id":"62677202-e074-4736-bcfd-6ec5a81c172f","year":2016},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.266587Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:99f122398c786785ba613b6d210172aad46554b6329018847afa7de1f641393a","observation_id":"222d95cf-4793-46b9-9114-1ab2f9ae6c48","resolution":{"observed_at":"2026-08-14T10:50:12.950291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.930270Z","title":"Information- theoretically optimal compressed sensing via spatial coupling and ap- proximate message passing,","venue":null,"work_id":"3f48c40e-c729-4d3b-bed2-e0d45e8e3e55","year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.273950Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:4c5bc37a33c8d1cf8edb0eb5ba53114c87bb49307f7503099a5d39c2a9f7eb79","observation_id":"b2f0e28f-0d4b-467e-8350-d02be8adf000","resolution":{"observed_at":"2026-08-14T10:50:12.935429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.915217Z","title":"Living on the edge: Phase transitions in convex programs with random data,","venue":null,"work_id":"a5ef184c-e1df-4e5d-8230-3dc3e103e1ff","year":2014},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.278962Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:b46bc906d8409cd083bd677c225d4d6e3dec7c758951ff03e19e8517e38e52ea","observation_id":"050a6c85-1882-4084-9cbb-b29435a3dbdb","resolution":{"observed_at":"2026-08-14T10:50:12.920289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.899269Z","title":"Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting,","venue":null,"work_id":"b15ff4f2-b2f8-43d4-aa54-617fe6e0e252","year":2009},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.283811Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:32c47729120c9760d82a7f4345d8db3be63720dae89b4aea11fcdd4db976b749","observation_id":"9d74613d-8066-4b0a-bf7a-d87c43b9efab","resolution":{"observed_at":"2026-08-14T10:50:12.904850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.883387Z","title":"On the fundamen- tal limits of adaptive sensing,","venue":null,"work_id":"09401872-72f8-4e80-83f8-614fc06c6654","year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.288564Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:9739534c0910e977a15e05ab8165a40b7dd179d822d14c41ad1d3267340c56f1","observation_id":"c7b6735a-a46b-4a0f-b48b-acaad5b200a9","resolution":{"observed_at":"2026-08-14T10:50:12.888204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.865993Z","title":"How well can we estimate a sparse vector?","venue":null,"work_id":"33189537-4dac-4615-9357-7d3645852449","year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.293279Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:04eb659d01264351921cfcec2fea43e63d7ceb418ed584525b8bc950a9b96de6","observation_id":"8af7e4a3-fcfe-43c0-bf08-c02be6fdb59a","resolution":{"observed_at":"2026-08-14T10:50:12.872193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.850796Z","title":"Limits on support recovery with probabilistic models: An information-theoretic framework,","venue":null,"work_id":"03d1c370-3e5a-4a89-b592-61d1b375081d","year":2017},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.298436Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:0569636e06e36b1e5e634c3e0b60e84b9699f65a1f4e45b984021c589a1060ff","observation_id":"0fd30918-31fd-433e-b5e9-a94d38382755","resolution":{"observed_at":"2026-08-14T10:50:12.856125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.835572Z","title":"Foster, Generative Deep Learning : Teaching Machines to Paint, Write, Compose and Play","venue":null,"work_id":"4197708d-f2f4-42f7-8235-92ae8c615b6e","year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.303001Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:55d0838246cc16443ecb38fe8999d5f149b0248151dc47f0c57b7a8d8160a3bb","observation_id":"f5960c67-a90a-42cb-a48b-7421da4118d2","resolution":{"observed_at":"2026-08-14T10:50:12.840499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.820130Z","title":"Compressed sensing using generative models,","venue":null,"work_id":"4af05ba1-9d76-49fc-a61c-1b317983efbf","year":2017},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.307562Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:4c2f5134d88c92ac739ae473593d3d1947cd73362f9f1b45bbec638396d87eb9","observation_id":"fd3fd69f-4fbf-4c53-8f49-89f428bdf4b7","resolution":{"observed_at":"2026-08-14T10:50:12.824915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.805015Z","title":"Model-based compressive sensing,","venue":null,"work_id":"a7aec160-7693-436a-a117-fdbf1891f55b","year":1982},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.311986Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:8459910e3204d92bdfb555186ecfbe2e2e0f676cf46fc823206c6071102375ee","observation_id":"4b72c8c2-e6f7-43a5-abb1-4fd724dee8e0","resolution":{"observed_at":"2026-08-14T10:50:12.810115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.790464Z","title":"Solving linear inverse problems using GAN priors: An algorithm with provable guarantees,","venue":null,"work_id":"e73f267c-6b6e-4812-aa08-7d36e94c501a","year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.316473Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:de8fe4654e7dc9cd27affed9a3f19f38f00bb2a171e813c2858ce842362b05d1","observation_id":"46a12b10-7e79-4145-9877-3c8cce4300e6","resolution":{"observed_at":"2026-08-14T10:50:12.795301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.05045","last_updated":"2019-12-17T17:23:51Z","snapshot_observed_at":"2026-08-14T17:30:31.391990Z","submitted_at":"2019-01-15T21:08:22Z","title":"Solving inverse problems via auto-encoders","version":2},"cited_work":{"arxiv_id":"1901.05045","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.05045","snapshot_observed_at":"2026-08-14T10:50:12.567132Z","title":"Solving inverse problems via auto-encoders","venue":"cs.IT","work_id":"7642edba-e110-49bb-a98f-9e3f582b50b6","year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.320971Z"},"links":{"cited_paper":"/paper/1901.05045","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:1083dfb0ee1ba582bcad10fa5f819dc4b4cd9f529c6c5703f4e214eb48f24eda","observation_id":"e35a94a6-f537-4980-bc64-842cbc1fcf5e","resolution":{"observed_at":"2026-08-14T10:50:12.572258Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.775135Z","title":"Modeling sparse deviations for compressed sensing using generative models,","venue":null,"work_id":"752a8f66-0f9a-4789-9930-7cbdf8e61bc1","year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.325766Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:11a492305ebd2e9b6742aa8800a3a229724626f7a2475583718b8965d8a0c5e8","observation_id":"038ccc4b-55dd-481f-b168-6f449eff6372","resolution":{"observed_at":"2026-08-14T10:50:12.780409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.759022Z","title":"Global guarantees for enforcing deep generative priors by empirical risk,","venue":null,"work_id":"ece363cb-b147-4a07-ad39-f233aa289245","year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.330434Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:8f678d30f8a3a67acc1d621afee559872d19dfd99722a5f99f1bc28a179133a2","observation_id":"d50ca8d5-8cf7-4d5d-9824-c799e4262af9","resolution":{"observed_at":"2026-08-14T10:50:12.764147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.743302Z","title":"On the statistical rate of nonlinear recovery in generative models with heavy-tailed data,","venue":null,"work_id":"2162e62c-3152-4ba9-a5fe-ffa4774deb48","year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.334844Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:ecf678442bdd459818e0b8f2d1207c61e2187b4a6edee2961f7c23bc79b8425a","observation_id":"fb89030d-4d18-46b3-a305-5e1ca6c63e48","resolution":{"observed_at":"2026-08-14T10:50:12.748472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06438","last_updated":"2020-10-29T19:55:19Z","snapshot_observed_at":"2026-08-14T19:02:44.314874Z","submitted_at":"2018-06-17T20:11:03Z","title":"Compressed Sensing with Deep Image Prior and Learned Regularization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.06438","snapshot_observed_at":"2026-08-14T10:50:12.339285Z","title":"Compressed sensing with deep image prior and learned regularization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.339285Z"},"links":{"cited_paper":"/paper/1806.06438","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:9cd89b6283ff43f0e28804e0f1486912da199a4169d5016b1c27373a73484bc9","observation_id":"de2db68e-5298-4e1c-a471-60451ad87613","resolution":{"observed_at":"2026-08-14T10:50:12.339285Z","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:50:12.728338Z","title":"Deep decoder: Concise image representations from untrained non-convolutional networks,","venue":null,"work_id":"9c292d4f-fc71-43f1-b445-da9d2a7adebe","year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.344092Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:0f4daecf31e5befac6b04977e477b9d2c5824954bcfb5feb2f53990ec15e17a1","observation_id":"4f060dfe-c8d0-4026-89e8-3945c48bb127","resolution":{"observed_at":"2026-08-14T10:50:12.733149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02938","last_updated":"2019-12-06T00:51:51Z","snapshot_observed_at":"2026-08-16T19:29:59.427793Z","submitted_at":"2019-12-06T00:51:51Z","title":"Lower Bounds for Compressed Sensing with Generative Models","version":1},"cited_work":{"arxiv_id":"1912.02938","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.02938","snapshot_observed_at":"2026-08-14T10:50:12.521323Z","title":"Lower Bounds for Compressed Sensing with Generative Models","venue":"cs.DS","work_id":"144b4046-9664-4ac4-92da-4d793e01d4e5","year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.348567Z"},"links":{"cited_paper":"/paper/1912.02938","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:ea0d2dc651f1fa8fc2f988b17b6051196e141c33fb2df6444a3e7a311c1129f3","observation_id":"496ec104-e718-4fb9-912e-73619374cfb0","resolution":{"observed_at":"2026-08-14T10:50:12.530292Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.2669","last_updated":"2013-12-31T02:48:25Z","snapshot_observed_at":"2026-08-14T23:55:41.138930Z","submitted_at":"2013-11-12T04:38:18Z","title":"Distance-based and continuum Fano inequalities with applications to statistical estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2669","snapshot_observed_at":"2026-08-14T10:50:12.353564Z","title":"Distance-based and continuum Fano inequalities with applications to statistical estimation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.353564Z"},"links":{"cited_paper":"/paper/1311.2669","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:20da545a00b6f75c616a93e31bdd02f1bd7bf298ff521281a887e16be26c21ef","observation_id":"60116c96-3128-4c82-b01a-73de1216e0b4","resolution":{"observed_at":"2026-08-14T10:50:12.353564Z","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:50:12.713027Z","title":"Information theoretic bounds for compressed sensing,","venue":null,"work_id":"1291e405-0829-43d2-847e-c12236d4d2c0","year":2010},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.358993Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:303e46745b5913c64f47a7db5a0d1ae20eef13ababfcc13cccf5bfea1c00b43b","observation_id":"6c036ccf-7a94-45d1-b32f-95aca6d2a61b","resolution":{"observed_at":"2026-08-14T10:50:12.718102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.697050Z","title":"Shannon-theoretic limits on noisy com- pressive sampling,","venue":null,"work_id":"73edeba6-a483-4514-84cc-73310c691f7b","year":2010},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.363412Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:fb9a203d2a30ffa263b0f56b2eb317dfa60502aead724a1df61b521871217edd","observation_id":"e4b9d32f-a0fb-4cda-99ae-9301bd89c7b8","resolution":{"observed_at":"2026-08-14T10:50:12.702151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.681783Z","title":"Approximate sparsity pattern recovery: Information-theoretic lower bounds,","venue":null,"work_id":"adedc078-4c95-49d7-a06d-0462348245a7","year":2013},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.368181Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:d0236448af771684ff87c1daecf229fdafe6787bdd46f59126d3c9a65d95cb10","observation_id":"bc63aad3-c1cc-4e94-a0bf-8f68da75dd38","resolution":{"observed_at":"2026-08-14T10:50:12.686906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.666423Z","title":"Sparse signal processing with linear and nonlinear observations: A unified Shannon-theoretic 12 approach,","venue":null,"work_id":"47743882-8927-4df8-8b90-c9aa2af45ffb","year":2017},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.373533Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:2b0594c2efbcab9f945e3814fa5094b8ce2cb47bc1a47654c0117f2569ebf412","observation_id":"fd75cd40-e966-42f7-b78c-7a2221f87d1c","resolution":{"observed_at":"2026-08-14T10:50:12.671246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.649682Z","title":"A probabilistic and RIPless theory of compressed sensing,","venue":null,"work_id":"dfd205f0-d120-4104-8906-8e5bc49c7d4a","year":2011},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.378754Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:aa2a407a92a90782b2ff16118c8d43b7403786a0964cd246f7ad0ae6982b5ed5","observation_id":"0431afb5-6bcf-4409-85f0-5ad96494c2f6","resolution":{"observed_at":"2026-08-14T10:50:12.655308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.634339Z","title":"Understanding deep neural networks with rectified linear units,","venue":null,"work_id":"230bf213-ba35-4f28-aa91-065e1f8c3cd6","year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.383457Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:9a72df6b39e1bdcf69447431d23da8ef334b7815073848d6d040b4023fcacd47","observation_id":"191babf0-68cc-435b-b897-8e13b7e1f8a9","resolution":{"observed_at":"2026-08-14T10:50:12.639031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.08101","last_updated":"2015-09-29T13:44:37Z","snapshot_observed_at":"2026-08-14T22:30:40.043393Z","submitted_at":"2015-09-27T15:26:58Z","title":"Representation Benefits of Deep Feedforward Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.08101","snapshot_observed_at":"2026-08-14T10:50:12.388369Z","title":"Representation benefits of deep feedforward networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.388369Z"},"links":{"cited_paper":"/paper/1509.08101","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:b588b59daa67f14f20d72a8328627efdd03cd70bf18f457d929d90a4baa6bd92","observation_id":"816081eb-5167-4dc5-b6a5-d430bb2e3465","resolution":{"observed_at":"2026-08-14T10:50:12.388369Z","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:50:12.618404Z","title":"Benefits of depth in neural networks,","venue":null,"work_id":"f51ee752-93f7-43ec-a1c6-8b5f6d4fbe02","year":2016},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.394176Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:f625de91735d389ef01f96a65137520384776e4ef85acf1f2f18e55660ea4d80","observation_id":"ce44426d-1518-40ae-9bca-ad58706274cd","resolution":{"observed_at":"2026-08-14T10:50:12.623675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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:50:12.602300Z","title":null,"venue":null,"work_id":"7dd6d354-a15e-49c9-abe7-dc8f71b15135","year":2006},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.399122Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:145c2226707ca42d90721dc441790042b1103f2cb42311322c2be0e14141774c","observation_id":"2e085731-d709-43d1-8191-1b547184e36f","resolution":{"observed_at":"2026-08-14T10:50:12.607044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00555","last_updated":"2019-11-25T05:34:42Z","snapshot_observed_at":"2026-08-14T17:35:47.270229Z","submitted_at":"2019-01-02T23:56:10Z","title":"An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.00555","snapshot_observed_at":"2026-08-14T10:50:12.404210Z","title":"An introductory guide to Fano’s inequality with applications in statistical estimation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.404210Z"},"links":{"cited_paper":"/paper/1901.00555","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:9ffac8d87b32b665f5a0e68c894cf1737719b56deda0b589387c442f61e2ede3","observation_id":"77ec3b7b-74c5-4e34-930d-f5ef31947efe","resolution":{"observed_at":"2026-08-14T10:50:12.404210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01528","last_updated":"2018-06-05T07:37:59Z","snapshot_observed_at":"2026-08-14T19:07:28.052741Z","submitted_at":"2018-06-05T07:37:59Z","title":"The universal approximation power of finite-width deep ReLU networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01528","snapshot_observed_at":"2026-08-14T10:50:12.409559Z","title":"The universal approximation power of finite-width deep ReLU networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.409559Z"},"links":{"cited_paper":"/paper/1806.01528","citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:44e6f1b25e9c51c551a8841a202af0a0dba955af2b4d63e6e7d7580eec7133c3","observation_id":"2ebc8fea-84c5-4063-a3f3-3b03ed7e76c9","resolution":{"observed_at":"2026-08-14T10:50:12.409559Z","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:50:12.583372Z","title":"Depth- width trade-offs for ReLU networks via Sharkovsky’s theorem,","venue":null,"work_id":"3004745d-d445-4174-9ea9-4ecbdc8de41b","year":2020},"citing_paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T10:50:12.414792Z"},"links":{"citing_paper":"/paper/1908.10744"},"observation_digest":"sha256:fcffc3a472a7b5929248db504b2e2600dd443591cff65dc8644e34aba17a782c","observation_id":"e409b2b9-8d96-40d0-ade0-d36991e83426","resolution":{"observed_at":"2026-08-14T10:50:12.588540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.10744","last_updated":"2020-03-10T06:15:58Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T19:29:58.994229Z","submitted_at":"2019-08-28T14:24:03Z","title":"Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":36},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:1908.10744."}