{"as_of":"2026-08-14T09:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2ecfbf8a4208ab2dd5aebc9dfb3142be1f82e3c75296bcab751853944b8c9bd","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:39:53.752873Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"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/2501.01127/citation-record","integrity":"/paper/2501.01127/integrity","json":"/paper/2501.01127/citation-record.json","paper":"/paper/2501.01127"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.368780Z","title":"Deep image prior,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.368780Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f843049e8cd8a26219f13df4918e4e5972fbe88b7fca25deb34f04f02987cfde","observation_id":"f751824a-47d2-4de6-a782-769f28ea9de4","resolution":{"observed_at":"2026-08-10T22:39:53.368780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.373997Z","title":"Structure-texture image decomposition using deep variational priors,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.373997Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:e84b5dca2cd6aff9deb6c4ce1c7afc7801d1df458e0c011ee5a08a9ac308e801","observation_id":"ab022f4e-3c62-45fe-a97f-6cd6d9518626","resolution":{"observed_at":"2026-08-10T22:39:53.373997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.378658Z","title":"Double-dip: unsu- pervised image decomposition via coupled deep-image-priors,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.378658Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:72941856db79047633e0843db79ab558203775521b061a9a929af2765924ac36","observation_id":"96ac13e6-5a93-42fe-9004-31462a20e162","resolution":{"observed_at":"2026-08-10T22:39:53.378658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.383492Z","title":"A review of image denoising algorithms, with a new one,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.383492Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:cf6db6d4d27b112d64342d056cd966c51497ac08a170f00a25331d9cf2260d84","observation_id":"d8feadec-9869-4f6a-8817-b9b169536005","resolution":{"observed_at":"2026-08-10T22:39:53.383492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.388131Z","title":"Nonlinear total variation based noise removal algorithms,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.388131Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fdcf9baeec40218c831799b48c59bbbda0db23e6b6ad03d064565ff7e8a66ea7","observation_id":"077a7747-6dcc-410e-9ca3-470dc7ea4715","resolution":{"observed_at":"2026-08-10T22:39:53.388131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.393005Z","title":"Robust principal component analysis?","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.393005Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:c7e466e57146505a2f12e4dd4912f8319894fc2530864c0b06ce6fa96eb35c87","observation_id":"87850ef4-7429-40ad-9404-b2250a7bb70a","resolution":{"observed_at":"2026-08-10T22:39:53.393005Z","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-10T22:39:54.848289Z","title":"Ouahabi, Signal and image multiresolution analysis","venue":null,"work_id":"601a3f94-ffb5-4bd1-82c1-0f36710b475f","year":2012},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.398065Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f4ac47259109614d2b99a593d9fbaac0e5e572509a4b2c872413a82edc5dbd43","observation_id":"9637a97f-b9dc-43ac-aa3f-e7a21a48343c","resolution":{"observed_at":"2026-08-10T22:39:54.852681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.833447Z","title":"Sparse Bayesian Methods for Low-Rank Matrix Estimation,","venue":null,"work_id":"3575c2a8-5ed9-456c-8f71-480e38c53f1a","year":2012},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.402469Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:270df08070ea7f7e6e0d8998bdaf4afb7b74b667641c9f7bfefd4ed45b1a95ed","observation_id":"56bc265b-f335-4430-8e33-a079edf784c6","resolution":{"observed_at":"2026-08-10T22:39:54.838230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-10T22:39:53.406937Z","title":"Bilateral filtering for gray and color images,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.406937Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:2357a462aceded2abdf452307199f290c5c7f0acba2486365207fc7f0be1f1b8","observation_id":"de7dd70c-f66f-4950-83bb-ca54d9973a25","resolution":{"observed_at":"2026-08-10T22:39:53.406937Z","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-10T22:39:54.809584Z","title":"Structure extraction from texture via relative total variation,","venue":null,"work_id":"c09ab3b9-802f-46ed-8a5c-a1ca3345bfcb","year":2012},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.411190Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:9819231622ce4b3749eca57e2446116838ee511eff36c559c753e8290ad4150f","observation_id":"746a6d62-22c6-497c-ad96-99a3ce0aa24e","resolution":{"observed_at":"2026-08-10T22:39:54.814731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.793893Z","title":"Image decomposition combining low-rank and deep image prior,","venue":null,"work_id":"4edd3cb7-bc1e-4d76-b1ba-bd8c77a2f79f","year":2024},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.415509Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:5509fc5f93838033d7a7fcdd9ceebfd13ad57a0b0da5d257ed7820203ccfaee1","observation_id":"bb1458e7-6b00-485e-a555-63f3e9266a02","resolution":{"observed_at":"2026-08-10T22:39:54.798870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.779601Z","title":"Internal statistics of a single natural image,","venue":null,"work_id":"19bf58d2-6a8f-488d-b894-75aaa27a1781","year":2011},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.420048Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:054ea72c22f999d26ddefcd34373ae70b511a210fc48f376b07cf91ea1e0bd02","observation_id":"4a1dd332-e624-4998-8798-416846bda4cd","resolution":{"observed_at":"2026-08-10T22:39:54.784259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.765356Z","title":"Didfuse: deep image decomposition for infrared and visible image fusion,","venue":null,"work_id":"de4f2910-6aa3-4fba-9078-7b2439c18f34","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.424435Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:df60e0799065ab78d48ceff91b6b3bb85241a5b189978794e55074d1debe64a5","observation_id":"6d6f2dcc-e681-4859-9f11-c54af3365d7b","resolution":{"observed_at":"2026-08-10T22:39:54.770014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.751494Z","title":"Darn: a deep adversarial residual network for intrinsic image decomposition,","venue":null,"work_id":"702381f7-2032-4354-a4cf-64dbaf981835","year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.428615Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:10e688af4af00d2fed9c24ca1122f9e1b97fb4ff12d68a7195ce25fd2d754e37","observation_id":"2baa920e-e034-46f1-90eb-e6ef1a482a82","resolution":{"observed_at":"2026-08-10T22:39:54.756116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.737641Z","title":"A survey on neural network interpretability,","venue":null,"work_id":"7bdcf608-9af8-46ca-aceb-272932fbf1cd","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.432870Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:1b79749482075cb08684d12fb73bc73c72138398133d5005a19d7ccafe5c16b2","observation_id":"7a160c39-56f5-437d-9c40-643a0d384472","resolution":{"observed_at":"2026-08-10T22:39:54.742360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-10T22:39:53.436993Z","title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.436993Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:66a8c60295de2986c4563c252d7dd06cc0880f0fd917969b85dfd10e7ee06002","observation_id":"9454e97e-175d-4e5c-b179-ef6c16d95521","resolution":{"observed_at":"2026-08-10T22:39:53.436993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.441315Z","title":"Algorithm unrolling: Inter- pretable, efficient deep learning for signal and image processing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.441315Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:a74b45e357db844a48fa7bb49f37b7cca1e058c2506af1be8318f814c81d7a6e","observation_id":"38e5adbe-1725-4b3d-935a-c7ea6180ef84","resolution":{"observed_at":"2026-08-10T22:39:53.441315Z","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-10T22:39:54.706467Z","title":"Deep proximal unrolling: Algorithmic framework, convergence analysis and ap- plications,","venue":null,"work_id":"f056d929-0ee0-4d8f-bd4a-c8a328190955","year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.445473Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fe10803affe58618348af9b9027859a1d5139f0d75b85b76fa2ce634584cf4bb","observation_id":"3abf8f66-20ac-44ce-8868-1ed1fa182c07","resolution":{"observed_at":"2026-08-10T22:39:54.711013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.692762Z","title":"An unsupervised deep unrolling framework for constrained op- timization problems in wireless networks,","venue":null,"work_id":"da6616ef-d59e-47aa-ad1d-1af3af5a3ab8","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.449820Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:b06b2b93bfad628dd638fbd3cc17ac51c7af4955f70cd201f5bc94c6cfde95de","observation_id":"88ce1ad5-73bf-419a-baa2-181a87865f32","resolution":{"observed_at":"2026-08-10T22:39:54.697402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.679722Z","title":"Interpretable convolutional neural networks,","venue":null,"work_id":"9bf638af-d5fd-4c6a-a3c4-71b17bf1de97","year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.454356Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fdc1c8d282335b5304e3c83e267ce224d5da3a6e7a151209ca964d3f3b975a6d","observation_id":"35800966-f0dd-43ca-834e-cc10f2822c45","resolution":{"observed_at":"2026-08-10T22:39:54.684379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.666319Z","title":"Bayeseg: Bayesian modeling for medical image segmentation with interpretable gen- eralizability,","venue":null,"work_id":"f15605fa-d187-4e41-8be5-0b129c121e5e","year":2023},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.458617Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f5d148747b5242e689d34930903cdc90df343fcb4af080ffb2e3beb120bffd79","observation_id":"7ecc778a-0ff7-4d6d-8081-4b4ce44f5ea4","resolution":{"observed_at":"2026-08-10T22:39:54.671272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.653105Z","title":"Simplified pac-bayesian margin bounds,","venue":null,"work_id":"09cfe88c-560b-4922-a1ed-1c214dded88d","year":2003},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.462669Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:4c7b290e88f53907050fc19740b8b7a99cc4690d2d33b3f8e47b582eaaeee45c","observation_id":"bc2d91f3-f9d1-4fcd-b896-c2b678b9d8e6","resolution":{"observed_at":"2026-08-10T22:39:54.657480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.640031Z","title":"Statistical guarantees for variational autoencoders using pac-bayesian theory,","venue":null,"work_id":"a76a9337-52a4-4529-b04c-66dbd7bd57db","year":2023},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.466900Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:441796a123a4bbe19703c116fe502a35b3487be5b0dcbc34dd12e7ccbef0e9c3","observation_id":"bef7e9ee-2e85-4046-9edb-bb604718b03b","resolution":{"observed_at":"2026-08-10T22:39:54.644408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.626475Z","title":"Stable princi- pal component pursuit,","venue":null,"work_id":"4ee482fb-e653-4564-91d6-59ae9c0695e9","year":2010},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.471384Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:a2aa9ce2e1f54abc44ca1ce6134e14cd7ffb30c1f1a058b155eef7d95453e46a","observation_id":"b549754f-a4c3-44b9-b5b3-13a1bd00895f","resolution":{"observed_at":"2026-08-10T22:39:54.631039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.612854Z","title":"Exact matrix completion via convex optimization,","venue":null,"work_id":"f8d01515-7fb2-41f6-9e04-71ad9990d1a0","year":2012},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.475823Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:075d8989bd68b441264a6f5647ec5ff8fd949a05a6e8b501956639130dc80412","observation_id":"90c3ffd4-f1d5-4d71-a542-4ab3e7a91253","resolution":{"observed_at":"2026-08-10T22:39:54.617466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.599437Z","title":"Robust prin- cipal component analysis: A factorization-based approach with linear complexity,","venue":null,"work_id":"7c8588d3-1c39-4826-9b58-5e3ef71a74c3","year":2020},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.480133Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f29350206c89c65e14dc24376b8d4b0fba44d640d41481bd67e096da96df9364","observation_id":"df1f5df3-d67a-40fb-ae02-b9b14dc8f83b","resolution":{"observed_at":"2026-08-10T22:39:54.604273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.586303Z","title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix,","venue":null,"work_id":"1f733132-4b88-4677-9f4e-cd621036eafe","year":2009},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.484353Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:16cdc8b4d081bf84701e5f8bfba4166f561b91b76d4ee3c18792bd318ecfe3ea","observation_id":"759f5cb7-4c28-4b5b-bf1a-b47201f8493f","resolution":{"observed_at":"2026-08-10T22:39:54.590558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1009.5055","last_updated":"2013-10-18T13:42:57Z","snapshot_observed_at":"2026-07-06T02:15:55.338460Z","submitted_at":"2010-09-26T03:42:27Z","title":"The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.5055","snapshot_observed_at":"2026-08-10T22:39:53.488778Z","title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.488778Z"},"links":{"cited_paper":"/paper/1009.5055","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:49287447771305f07f64415a2969b1084b07eb55241d755aa9f882e7f5f4aae0","observation_id":"99cef1f9-bb45-4ec3-8298-cbbe9c0d494e","resolution":{"observed_at":"2026-08-10T22:39:53.488778Z","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-10T22:39:54.572212Z","title":"Nonparametric bayesian matrix completion,","venue":null,"work_id":"8d2cc8f1-c192-480e-bbf6-202b9ba7fa93","year":2010},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.493505Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:7948213d0cb2f6440010a9d3996a8f9670732e915d2b3edefd2be4f56eb178ce","observation_id":"5ac518db-3b89-4d6d-a647-a041d7c5722e","resolution":{"observed_at":"2026-08-10T22:39:54.576832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.558039Z","title":"Rank-One Network: An Effective Frame- work for Image Restoration,","venue":null,"work_id":"0debc2f3-d53c-4bf8-bbdd-d8bb974d5c42","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.497859Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:9d1d73e51d61dea285f6ca7ea4a140605d7f888e2a2d12173528ac643f1d0f8f","observation_id":"699dfe06-5ba6-405a-a8de-79240130b2d1","resolution":{"observed_at":"2026-08-10T22:39:54.563058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.544506Z","title":"A non-local algorithm for image denoising,","venue":null,"work_id":"303720df-3053-4d81-b1a1-82236891051b","year":2005},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.502080Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fb0cc0c18ac7219cb5593ec8c203193cffddf21431619fe79043a2c5ad013c6f","observation_id":"9bb4ec69-4e5a-4544-bce2-4ccd0e58a24a","resolution":{"observed_at":"2026-08-10T22:39:54.548806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.531393Z","title":"Image denoising via sparse and redun- dant representations over learned dictionaries,","venue":null,"work_id":"c0ed69db-5568-4f31-95cd-3d44027a10e1","year":2006},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.506431Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fc4558e22303411a97dcbe85f9d87f1986bbbb3e1395f69fbf241e471f5eeef2","observation_id":"9ad9aa28-da13-44d6-928d-8f985eeb5e73","resolution":{"observed_at":"2026-08-10T22:39:54.535947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.503925Z","title":"Pseudo 3d auto-correlation network for real image denoising,","venue":null,"work_id":"4f75791c-204a-4da6-80eb-d6bec6a00aaf","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.514818Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:6356a89adb14a8c4d3d5299e59ef6cf37defb2ac0a7afeee307a86b2fab05056","observation_id":"4e54924c-f093-41cd-9ae8-432b2eb1f385","resolution":{"observed_at":"2026-08-10T22:39:54.508628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.476851Z","title":"Nbnet: Noise basis learning for image denoising with subspace projec- tion,","venue":null,"work_id":"ab6892ec-e60c-49ce-8c49-77de189ac8b8","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.523805Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f35f031168b05df02719f2fc3f891c24296384b9ac486bae9f9ef8d3701a9b09","observation_id":"491f7739-1043-4854-aa47-8a94d8300abd","resolution":{"observed_at":"2026-08-10T22:39:54.481460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.463724Z","title":"Deep image demosaicking using a cascade of convolutional residual denoising networks,","venue":null,"work_id":"6186e680-35fd-40d8-90c7-d90015e094db","year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.527872Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:948fa65359c70240ccce67f8fafc0499949181412b7fdfc08878feb7b420a8ed","observation_id":"2bc8af68-6145-4739-8386-73082cd48cfc","resolution":{"observed_at":"2026-08-10T22:39:54.468139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.450237Z","title":"Deeply-recursive convolutional network for image super-resolution,","venue":null,"work_id":"92fe14c2-8a45-427d-ad90-3c2119f5d86c","year":2016},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.532347Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:8937ac6c3e1dc218fc656027ac98c8c37d901f7ac643275f4bb4ba3fc4514380","observation_id":"41b06c60-1537-4177-aafe-e418e849cc81","resolution":{"observed_at":"2026-08-10T22:39:54.455040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.436575Z","title":"Blind universal bayesian image denoising with gaussian noise level learning,","venue":null,"work_id":"ef64b45a-f58a-45cd-87c7-9085b5876bc2","year":2020},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.536581Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:9f76f314780707e628cae378779f8456f0e083ea012ef647debd1c1a106838ea","observation_id":"65b04ff0-d4cf-42ec-943c-9da13a8b146b","resolution":{"observed_at":"2026-08-10T22:39:54.441281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.422997Z","title":"A high-quality de- noising dataset for smartphone cameras,","venue":null,"work_id":"4ae67340-4af1-4c2e-ad33-3cd28127cc8c","year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.540936Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:48d97c5cd1b0b0702c6389a000953a9bbc215356a5c3e1f19708c25f3c7170de","observation_id":"a83a19a1-bd13-4cc9-ab2a-8adb72c7344e","resolution":{"observed_at":"2026-08-10T22:39:54.427764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.409192Z","title":"Unrolling of deep graph total variation for image denoising,","venue":null,"work_id":"5f313484-9f47-4fea-b516-e460990d0ce3","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.545479Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:105c115985572400cd1529b0424a45de6d8bb44048ab3f15b739954e19ffd0e7","observation_id":"4f79f9c8-0520-40b1-afca-152667ceb568","resolution":{"observed_at":"2026-08-10T22:39:54.413732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.396055Z","title":"Residual denoising diffusion models,","venue":null,"work_id":"9855c063-e5eb-4aeb-901c-fc5ce0c3a1d5","year":2024},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.549593Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:32bc105e37f354475f2bd1715692cb675ead6ed4b6752d9ae63d2226a61efcf3","observation_id":"e77d8771-f019-4958-9aaf-4aec6f3e085a","resolution":{"observed_at":"2026-08-10T22:39:54.400356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.383096Z","title":"Masked image training for generalizable deep image denoising,","venue":null,"work_id":"f4c811bf-0687-4c72-9185-b6908afd7c1d","year":2023},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.553897Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:25939ea29386024f94e282d8d327a625470a7a42fe5feb89edc4de584a3c863f","observation_id":"cc0b8c9f-cea9-4277-bde4-fedbc53b40da","resolution":{"observed_at":"2026-08-10T22:39:54.387445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.369332Z","title":"DRÆM – A discrim- inatively trained reconstruction embedding for surface anomaly detection,","venue":null,"work_id":"59f73ae0-f78a-44e2-b487-7e8eba5318b7","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.558556Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:4bb255d8041df98970edf92d9a17915dc2d67f99735a7e6192ec58edc7689933","observation_id":"72f9d335-07ce-4e59-8090-a9d2ebe10ee5","resolution":{"observed_at":"2026-08-10T22:39:54.374023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.356180Z","title":"Anomaly detection in video via self-supervised and multi-task learning,","venue":null,"work_id":"0236404d-e820-4968-b39c-fe4045a034ef","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.563172Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:c800f4a1c6ffac556c178b7370443ddc65b9bee86cfeac0832a2f8362846ebbf","observation_id":"6f29091c-7872-4bbe-9e7b-bb4fa187de46","resolution":{"observed_at":"2026-08-10T22:39:54.360516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.342931Z","title":"Anomaly detection with domain adaptation,","venue":null,"work_id":"4e975ea2-141d-44d2-9475-6c28e645e60c","year":2023},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.567771Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:ad4fcf37518a1dc31398ae0c6a680f566ab89bf7661dd770f9996088b8f5f47f","observation_id":"8a6be9be-4b54-4af6-a742-28ce39bf8c90","resolution":{"observed_at":"2026-08-10T22:39:54.347533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.329782Z","title":"A unified model for multi-class anomaly detection,","venue":null,"work_id":"9d4520ac-b451-489b-8158-7aa964b732dd","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.572415Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:c2c5ef0371c5b5aff82f5968332c9c402f3b64fa750056534f03f0ac08ed02e7","observation_id":"42d2bd28-0f7c-4a1f-91d1-9acceb453004","resolution":{"observed_at":"2026-08-10T22:39:54.334368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.316363Z","title":"Self-supervised predictive convolu- tional attentive block for anomaly detection,","venue":null,"work_id":"df897583-ef22-458d-a754-6ea2e5e57127","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.576855Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:65ed9af5b605dfacdf87744cc59939323ded73ecb31b0c7130b28c93c975b7a3","observation_id":"621a3bb5-e770-41a5-9c1c-f70faa747007","resolution":{"observed_at":"2026-08-10T22:39:54.320825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.302961Z","title":"Skip- ganomaly: Skip connected and adversarially trained encoder- decoder anomaly detection,","venue":null,"work_id":"9c8e5926-91ab-41d4-8d62-24f085a9bcf3","year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.581046Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:3454c27ce70f5a4efdeaa5c3ecc4808c6c49d29bd13f56d8d9fe22dd438dd08a","observation_id":"00f2db8c-668a-4014-9718-40d1d1c59961","resolution":{"observed_at":"2026-08-10T22:39:54.307398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.289940Z","title":"Learning temporal regularity in video sequences,","venue":null,"work_id":"cb283004-7a41-4f11-8641-baedcbff03c1","year":2016},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.585441Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:ac3a0bd35c07e7a3d473a4560716004217cb53ab3838597bfa2b024bdd51a3b4","observation_id":"8f34ab4a-8db7-4c98-86cc-1771bcfd5bd6","resolution":{"observed_at":"2026-08-10T22:39:54.294267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2008.05369","last_updated":"2020-08-12T15:09:13Z","snapshot_observed_at":"2026-08-10T19:27:41.141776Z","submitted_at":"2020-08-12T15:09:13Z","title":"Anomaly localization by modeling perceptual features","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.05369","snapshot_observed_at":"2026-08-10T22:39:53.589904Z","title":"Anomaly localization by modeling perceptual features,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.589904Z"},"links":{"cited_paper":"/paper/2008.05369","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:ba6cea1b70d2ee617a92d8526b2376a86ed3456dfdcb61d62504e60786044774","observation_id":"0d053950-b95c-4941-b213-1aa85767736f","resolution":{"observed_at":"2026-08-10T22:39:53.589904Z","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-10T22:39:54.276200Z","title":"A hybrid video anomaly detection framework via memory-augmented flow re- construction and flow-guided frame prediction,","venue":null,"work_id":"49930fd2-5875-40a5-9195-69ffbebb6b94","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.594773Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:07af56d4a6f9e0f20ec8be380e54b141fc9839c066a3a4642443a58f650a0c81","observation_id":"9bd9c79b-702d-4f79-845b-a1289725dcd8","resolution":{"observed_at":"2026-08-10T22:39:54.280865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2111.07677","last_updated":"2021-11-16T06:33:39Z","snapshot_observed_at":"2026-08-13T17:34:01.767269Z","submitted_at":"2021-11-15T11:15:02Z","title":"FastFlow: Unsupervised Anomaly Detection and Localization via 2D Normalizing Flows","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.07677","snapshot_observed_at":"2026-08-10T22:39:53.598882Z","title":"Fastflow: Unsupervised anomaly detection and localization via 2d normalizing flows,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.598882Z"},"links":{"cited_paper":"/paper/2111.07677","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:643dde05b7b2ca5218cbc232bcc139b5bb4e82ae9cdabd4f1b1b230b9f398bcb","observation_id":"2b2c18f6-7d21-4629-be84-46e9ffd4b4d4","resolution":{"observed_at":"2026-08-10T22:39:53.598882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.04552","last_updated":"2017-11-29T14:51:40Z","snapshot_observed_at":"2026-08-13T11:54:46.030796Z","submitted_at":"2017-08-15T15:21:53Z","title":"Improved Regularization of Convolutional Neural Networks with Cutout","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.04552","snapshot_observed_at":"2026-08-10T22:39:53.603450Z","title":"Improved regularization of convolutional neural networks with cutout,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.603450Z"},"links":{"cited_paper":"/paper/1708.04552","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:7a562ebaf1a1555b3048741f7abf12bc7e6a5b2292390c55e6867260cc527bf5","observation_id":"06be7236-6475-4e9d-8011-dc56e3f0d4c9","resolution":{"observed_at":"2026-08-10T22:39:53.603450Z","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-10T22:39:54.263082Z","title":"Cutpaste: Self-supervised learning for anomaly detection and localization,","venue":null,"work_id":"e84f1308-e2b4-4fbe-ad4f-31a105ef2c67","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.607823Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:104fc3b00a3312ec294b05b4f63c031ce97094301765a807b798b29301d72d3f","observation_id":"d18adbf4-074d-495c-8a91-dc086cb54919","resolution":{"observed_at":"2026-08-10T22:39:54.267607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.249798Z","title":"Superpixel masking and inpainting for self-supervised anomaly detection","venue":null,"work_id":"14b0e2df-f5c9-478e-be2e-7fd2ac45cfa7","year":2020},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.611955Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:a87fa63d09d5089d7067712a4ad600a04b7e4a945648d241a2656e93de468b37","observation_id":"fae7e46e-db31-4e71-85b4-d70408e02aea","resolution":{"observed_at":"2026-08-10T22:39:54.254179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.235641Z","title":"Learning semantic context from normal samples for unsupervised anomaly detection,","venue":null,"work_id":"fcd12123-36c5-454a-95bb-1c4c93adcd18","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.616353Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:8b84cc48bf2344eb103684dad5da6e1084d1e1652e5163f8af8755ad505c733e","observation_id":"ed7b8edd-c59d-4dd3-84ba-a4dc3eee204c","resolution":{"observed_at":"2026-08-10T22:39:54.240743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.221604Z","title":"Uninformed students: Student-teacher anomaly detection with discriminative latent embeddings,","venue":null,"work_id":"8416a937-6cde-4e31-8802-a52a4dad9957","year":2020},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.620665Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:b0401d525f205f8c706b67da5aaf935273517632cd0d63d77114b9fd060deac6","observation_id":"0a1c6fce-b8ea-4372-b772-e09accc9cfe5","resolution":{"observed_at":"2026-08-10T22:39:54.226513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.207081Z","title":"Deep learning for anomaly detection: A review,","venue":null,"work_id":"5f506d25-2f2b-47ce-9c9d-cda69fc48fd9","year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.625146Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:77b0210a58f3f16dbd876c5fa2e8413785e612113ec0b89cfbc69e059e2ca75d","observation_id":"877cf30f-69ba-443a-a9e4-0acbba77ae4d","resolution":{"observed_at":"2026-08-10T22:39:54.211506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.192634Z","title":"Hics: High contrast subspaces for density-based outlier ranking,","venue":null,"work_id":"e74a1935-17bf-4473-bd5d-751b9ba486ff","year":2012},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.630367Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:b79ae65f4bbe4e1cf7c686eba92dfd183efc0664b4b45a47c459a18f33ba26b0","observation_id":"2ddbabea-17b1-45db-b1a2-46c30f15516c","resolution":{"observed_at":"2026-08-10T22:39:54.197239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.178532Z","title":"Variational infer- ence: A review for statisticians,","venue":null,"work_id":"d3fb35e9-0d0a-4ee8-a0c8-d8ad1ca71481","year":2017},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.634908Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:5a6c84ea1d95152d32db93f2344d81f01fa2116a435d0f44195f449ce670ea44","observation_id":"e6c8c7ec-bbc1-4e1c-8c84-944424f497dc","resolution":{"observed_at":"2026-08-10T22:39:54.183093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.165186Z","title":"Advances in variational inference,","venue":null,"work_id":"0a44779c-aeff-4e37-81f6-a760bf5887d7","year":2008},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.639102Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:c80264925eb6c6e70ec8a56650b2280fdbd48a9d173c359f8dcf040a8768365d","observation_id":"c05573ad-4755-40d6-bc3e-107ae46ff988","resolution":{"observed_at":"2026-08-10T22:39:54.169538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.150999Z","title":"No free lunch theorems for optimization,","venue":null,"work_id":"8d96b8d3-f88b-4931-bbc8-072f69252482","year":1997},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.643601Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fec143fb1a521cc738dd55074d02259e96d9ff080be16a3a9edc4144c048797c","observation_id":"40bb859c-56f5-4c98-923d-3d4a17eecb35","resolution":{"observed_at":"2026-08-10T22:39:54.155288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-10T22:39:53.648026Z","title":"A model of inductive bias learning,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.648026Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:015a3ec1eac75e48738f6b0c593674d4dbfe1827d852cf73a3319bd492676901","observation_id":"0db98856-e380-4170-ad5c-7f15c9972bcc","resolution":{"observed_at":"2026-08-10T22:39:53.648026Z","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-10T22:39:54.127816Z","title":"Inductive biases for deep learning of higher-level cognition,","venue":null,"work_id":"cb506b7f-885e-4b45-87f0-fbbff44cc624","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.652306Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:2d2c503efe9bc7ee2f9f988b18f5732835f0954e37a23218c3fac6049d499d3e","observation_id":"dcbe5db4-6ad1-4aba-b80a-ef10a3670332","resolution":{"observed_at":"2026-08-10T22:39:54.132869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.112937Z","title":"Bayesian image super-resolution with deep modeling of image statistics,","venue":null,"work_id":"327b4b61-8030-4519-ac38-1cc6b06862f7","year":2023},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.656839Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:13bef5d5526fb51903729f6451601c191109b38217b94a23cd54e4eb205b5ab4","observation_id":"669a2035-7ed5-4459-9d30-11648050aab0","resolution":{"observed_at":"2026-08-10T22:39:54.118462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1606.05908","last_updated":"2021-01-03T16:56:46Z","snapshot_observed_at":"2026-08-10T10:13:44.536180Z","submitted_at":"2016-06-19T21:02:30Z","title":"Tutorial on Variational Autoencoders","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05908","snapshot_observed_at":"2026-08-10T22:39:53.661324Z","title":"Tutorial on variational autoencoders,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.661324Z"},"links":{"cited_paper":"/paper/1606.05908","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:6900fa1f3bedb519a1b8d4bac79be4b34a7e2f4e54c9a451f8de5eff459f807c","observation_id":"0be894c6-b9bd-4975-bf97-929f80909e78","resolution":{"observed_at":"2026-08-10T22:39:53.661324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.666389Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.666389Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:7574b10b52118cfd630f105feea6ed4046e31583a219801325f51ee20b20c7d5","observation_id":"4e555c00-1f5c-44be-a887-7cf17052be86","resolution":{"observed_at":"2026-08-10T22:39:53.666389Z","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-10T22:39:54.090021Z","title":"Pac- bayesian theory meets bayesian inference,","venue":null,"work_id":"efbfdb34-d1be-4e9c-baba-ad03a010d2fe","year":2016},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.670675Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:22472ddbb2cb824bd64023904bd61e3517791fc3e63c1856e83c98a6e07d0d05","observation_id":"0be80319-df29-4697-8c30-1eb3338fcc9a","resolution":{"observed_at":"2026-08-10T22:39:54.094653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.075899Z","title":"Efficient and accurate estimation of lipschitz constants for deep neural networks,","venue":null,"work_id":"c8118d56-8496-4401-9fca-67483451aa64","year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.675129Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:ad515651521b857a8280f19ca79aa7aa7ea1bd69bca6e07afafab3211238f191","observation_id":"32731f1a-7468-43db-a7fb-c877e00b150b","resolution":{"observed_at":"2026-08-10T22:39:54.080454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.062106Z","title":"Optimal adaptation for early stopping in statistical inverse problems,","venue":null,"work_id":"4191cd3d-69f8-48f5-bcd3-67ece5ee986d","year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.679728Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:6134a3caf2eb37f3d75a9018eadc01c1189d96093e58b161f33466c2ab619c7e","observation_id":"1bf9bcdd-cac1-4683-ad46-8ae38fbd43bb","resolution":{"observed_at":"2026-08-10T22:39:54.066616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.048045Z","title":"Ntire 2017 challenge on single image super-resolution: Dataset and study,","venue":null,"work_id":"4dade416-fdb9-4619-8772-78ff9f1f466f","year":2017},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.684300Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:05bd370d52a7e82a44cb4e6a1d1c2d4b0ca2ce4b3c8718192f0167a1e385ed33","observation_id":"70b7424e-836a-4d92-805b-c812992b2445","resolution":{"observed_at":"2026-08-10T22:39:54.052607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.033332Z","title":"Fields of experts: A framework for learning image priors,","venue":null,"work_id":"2ba5bfd3-4426-4362-a3be-1beecd591e19","year":2005},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.688462Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fca9432edfebff656bb19f094ab321496ca2cc76ab261f35060627af79a46b3d","observation_id":"60a0d809-25b9-4bef-bc3b-66507554653f","resolution":{"observed_at":"2026-08-10T22:39:54.038655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.017713Z","title":"Kodak lossless true color image suite,","venue":null,"work_id":"ab652c51-bdb7-48c9-8def-94ec4cd7ad82","year":1999},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.692784Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:fa7f160657010bad837963d4e8d10221eda01ea6502df12c0f029a7153fa4d59","observation_id":"a45d5720-f7bd-4bf0-926e-68fc5b8b0aa6","resolution":{"observed_at":"2026-08-10T22:39:54.022905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.003182Z","title":"Color demosaicking by local directional interpolation and nonlocal adaptive threshold- ing,","venue":null,"work_id":"955757aa-7940-4af5-96af-a003ea6608ef","year":2011},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.697032Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:5acf7f5d91965c78ea94913d4630ed983e117c659d6d7ea31ee11a9c6a64adf2","observation_id":"02a78a25-a36e-4350-a730-ae316cfe39b9","resolution":{"observed_at":"2026-08-10T22:39:54.007968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1804.02603","last_updated":"2018-04-07T23:54:21Z","snapshot_observed_at":"2026-07-06T06:32:15.339930Z","submitted_at":"2018-04-07T23:54:21Z","title":"Real-world Noisy Image Denoising: A New Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.02603","snapshot_observed_at":"2026-08-10T22:39:53.701586Z","title":"Real- world noisy image denoising: A new benchmark,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.701586Z"},"links":{"cited_paper":"/paper/1804.02603","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:8b48add6364b0b71bdb4296364b3d866c6d9bf44788a48cc918b42a7240b7fd5","observation_id":"bcaed63f-8be6-4560-844e-eba883ab7e1e","resolution":{"observed_at":"2026-08-10T22:39:53.701586Z","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-10T22:39:53.989042Z","title":"Mvtec ad– a comprehensive real-world dataset for unsupervised anomaly detection,","venue":null,"work_id":"edba91e4-0e2b-4952-9893-02c9219128b6","year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.706247Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:43d56fc6bf7ddd90c9e627229e3bc0955f26b7ed7a0b3bbcf50585937441807f","observation_id":"a0fb5b59-c4d7-40ed-9f12-e6a654b1aa44","resolution":{"observed_at":"2026-08-10T22:39:53.993844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.974476Z","title":"Steel defect detection,","venue":null,"work_id":"e4d0cc31-7664-4201-a043-7dd19241e03b","year":2019},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.710533Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:43537e86c197c1e7a4d0a1878dc6aa6296bcf916354e23bd381eadc637caa9f6","observation_id":"8460c329-491d-4d30-ac35-f210d5189342","resolution":{"observed_at":"2026-08-10T22:39:53.979056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2007.04250","last_updated":"2020-08-05T02:05:43Z","snapshot_observed_at":"2026-08-14T03:17:59.647549Z","submitted_at":"2020-07-08T16:39:34Z","title":"A Benchmark of Medical Out of Distribution Detection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.04250","snapshot_observed_at":"2026-08-10T22:39:53.714371Z","title":"A bench- mark of medical out of distribution detection,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.714371Z"},"links":{"cited_paper":"/paper/2007.04250","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:dfcbff24ce0ab2b7694b9fc7627f2acded381a18e4c0e5d285dc2a3efc93495e","observation_id":"d23d7aca-0ee3-48f1-b63a-85cdf8b06bed","resolution":{"observed_at":"2026-08-10T22:39:53.714371Z","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-10T22:39:53.960181Z","title":"The relationship between precision- recall and roc curves,","venue":null,"work_id":"16cd3555-8d39-4e9e-8ac8-6df948e91045","year":2006},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.718922Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:1350916828fa58b768e4e2caae136109e628453d4e0bbc5cd16763cd2109a6f9","observation_id":"60021392-1d21-4f10-866a-ab040cb7019f","resolution":{"observed_at":"2026-08-10T22:39:53.964837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-10T22:39:53.722854Z","title":"Adam: A method for stochastic optimiza- tion,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.722854Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:6dc537df2a93a44a431343414bc3d858cf6be13ff377c9ee66187a17883cf88d","observation_id":"08a13444-a534-402e-b930-e91b8ec5be0a","resolution":{"observed_at":"2026-08-10T22:39:53.722854Z","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-10T22:39:54.517694Z","title":"Image denois- ing by sparse 3-d transform-domain collaborative filtering,","venue":null,"work_id":"d1285d4c-e98b-4237-b760-9a203782728b","year":2007},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.726960Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:8ff040c6fb1b7bb58e27e4b0a397c06504c2e36119959b5cee85a1df72611692","observation_id":"82dd13a7-947f-435a-93b9-4b2ec9f80bd8","resolution":{"observed_at":"2026-08-10T22:39:54.522149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:54.490559Z","title":"Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising,","venue":null,"work_id":"cfb0cd5f-4a8b-4154-b9c1-7b16be4629a6","year":2017},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.730940Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:f22e35a719e70f82c0a843b52bcfbe5752139947abbae5bd5e7d8653b7744bfb","observation_id":"2d04093b-b669-4d2d-a8ad-df1b23f10ad7","resolution":{"observed_at":"2026-08-10T22:39:54.494969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-10T22:39:53.735205Z","title":"Ffdnet: Toward a fast and flexible solution for cnn-based image denoising,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.735205Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:45f3c53d212e8258dd8ae0c98ec3bff4e466f39079f966e964930cbd171652d8","observation_id":"3ee87fb0-f8aa-4255-8048-1ffceb02c55c","resolution":{"observed_at":"2026-08-10T22:39:53.735205Z","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-10T22:39:53.936439Z","title":"Rank-one network: An effective frame- work for image restoration,","venue":null,"work_id":"dcc68839-5ddb-451b-9800-5660f8de572e","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.739719Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:acdb4a3e3952794c38cd8112237edb9af2a8260667cb12916432898e416e2e92","observation_id":"d773f380-1795-4bec-a552-3d52322ef5ff","resolution":{"observed_at":"2026-08-10T22:39:53.941061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:39:53.921590Z","title":"Deep variational network toward blind image restoration,","venue":null,"work_id":"43262e66-5750-4b3f-a52a-9021e762937e","year":2024},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.743999Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:b3c4916403dd0b73530124a1bc75ee2e3d79562994642b423d0b532c8238b11b","observation_id":"56c262f0-4527-4829-bf1f-3bc047e55db4","resolution":{"observed_at":"2026-08-10T22:39:53.926230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2103.04257","last_updated":"2021-10-28T09:17:34Z","snapshot_observed_at":"2026-08-14T07:43:24.558982Z","submitted_at":"2021-03-07T04:25:04Z","title":"Student-Teacher Feature Pyramid Matching for Anomaly Detection","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.04257","snapshot_observed_at":"2026-08-10T22:39:53.748386Z","title":"Student-teacher feature pyramid matching for unsupervised anomaly detection,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.748386Z"},"links":{"cited_paper":"/paper/2103.04257","citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:2d3c0fd583008449a24c79c1651802964afdb31d0c7d6873f3f6268481eaf683","observation_id":"91717b5a-5762-4bf5-b8b0-b40fb1d34787","resolution":{"observed_at":"2026-08-10T22:39:53.748386Z","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-10T22:39:53.903584Z","title":"Shangqi Gao is a Research Associate at the University of Cambridge","venue":null,"work_id":"ee13dbd0-1dcb-472c-b9b0-63f2b66e7b53","year":2022},"citing_paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T22:39:53.752873Z"},"links":{"citing_paper":"/paper/2501.01127"},"observation_digest":"sha256:9b16c9fd15dfc3e3150913b9fa6973dad98ef3a52dae49f66c8fd628f86593cb","observation_id":"9fc53c3a-832a-4dec-884a-38bed62da9f8","resolution":{"observed_at":"2026-08-10T22:39:53.910606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2501.01127","last_updated":"2025-01-02T07:58:26Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-11T13:07:03.687382Z","submitted_at":"2025-01-02T07:58:26Z","title":"InDeed: Interpretable image deep decomposition with guaranteed generalizability"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":65},"total_outbound_references":86},"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 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2501.01127."}