{"as_of":"2026-08-06T03:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e4ad1afc6e34b58b9519f43707cb66e8a1e6f559be128b09f11f835ad69075d","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T11:40:33.734051Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2607.05417/citation-record","integrity":"/paper/2607.05417/integrity","json":"/paper/2607.05417/citation-record.json","paper":"/paper/2607.05417"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:40:33.734051Z","title":"Coding theorems for a discrete source with a fidelity criterion,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:cc6b534ac835386a97fa2568da47a53e672e1803f8a5397715174dcca5844b33","observation_id":"dff54fd6-57b1-4e01-9457-1ae2fc33dd2a","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"The information bottleneck method,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:194ecbd949b7ca5d92680240fcc3d2e406ae0e1c802cf1781a8c6ca01c0287c7","observation_id":"0ef6ac53-3979-4d69-b790-f5293d9e7e88","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Information transmission with addi- tional noise,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:c735acc6e634109d7e2bf84929f0d0f95122242c7a0ddc93304e3a25d2dbef8d","observation_id":"8687d20e-1572-471a-8dd1-3e4ce16889ad","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"End-to-end optimized image compression,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:f51d1fc8888e9e1cdae07af8a48c8716ed2e6ee1d84871c6a9841e9494d5ba2d","observation_id":"ebb64599-6c56-49ee-94e1-b70663d548c6","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Deep learning and the information bot- tleneck principle,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:779cbb8659387aa7caeae21a47acea7fa1a69acc910a64e7f5515465f7074229","observation_id":"84b8c617-058e-48b2-b68d-f6d00aa52848","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Computation of channel capacity and rate-distortion func- tions,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:8be53d0fb3173fc9111e0417f14ab84aa440c7a22844045b45f0c18f68dbcd99","observation_id":"ce754e52-b212-4442-af0c-1acd4344a5cf","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"An algorithm for computing the capacity of arbitrary dis- crete memoryless channels,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:57fa2814c81224b963cdbfec477dca10daeff1b9c638b6b80c50153748837d25","observation_id":"2ac9e28f-caf2-490b-a0cb-e6282912dc6e","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Bregman divergence based EM algorithm and its applica- tion to classical and quantum rate distortion theory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:fc93791fe90c5935c3189eac3d857c5f2435e4c722b54b0e87f2f0611c66b1bd","observation_id":"ad736afb-2e30-42ae-a397-050639fab312","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"A con- strained BA algorithm for rate-distortion and distortion-rate functions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:aaa19718b6df9028cddc125f30edb0bdb3602e2399392f2ad3502dbdac7630be","observation_id":"b18ba8f1-84f0-4d63-acc5-6de056efc654","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"A communi- cation optimal transport approach to the computation of rate distortion functions,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:9e3a6f2de820e2b1e2a461d2f432c7e43a37787f0a0687f5e715aed5929e3f5b","observation_id":"e8589800-d6df-469e-acca-4b13308075a7","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Towards empirical sandwich bounds on the rate-distortion function,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:03d910af952fd85ef778c0399442b3583932ca00db12d7fa52e3cee5c5206e96","observation_id":"bc8a0fd2-f2a5-4373-addf-04073bb46cae","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Neural estimation of the rate- distortion function with applications to operational source coding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:904ef4638bc35137e7e1003c8db6a12b42a7700e6dbf972e3544836c1ff88bb7","observation_id":"302a2c8c-81b2-42dd-9bbd-bc748ae0e733","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Mutual information neural estimation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:2552e4fcbbd84389fe9c886845fddd684729a9de99175f36ac6fe7a87691f24e","observation_id":"19ff15bb-d86d-4a4e-9b46-0c2267e89ae4","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Auto-encoding variational bayes,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:1c49601dcd31e316fdc6284438e773d37ed74c76c6f4c08242521964a401607f","observation_id":"0fa5bb5e-fc45-4ccd-80d2-0fc987b8819e","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Generative adversarial nets,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:e8563fd2b938b338098042173450eca251374ae69b1c62ea98c4a51ef557a3ad","observation_id":"84051066-d5b9-4c6c-b778-17aa3194bfc9","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Beyond normal: On the evaluation of mutual information estimators,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:8e2056a5a4d6deea5835980e0e2c875410a3384eae03653371f37534a01632d7","observation_id":"84382c55-a4bd-4c83-a327-8624e7f3b0de","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"The information bottleneck problem and its applications in machine learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:a23e922ac9ba3fba79ae1de44358f7b3cccdc0d3808e33fadc6ab7e3e46bb994","observation_id":"903fedba-5aad-426b-8acc-ba9e500f5b53","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"An introduction to neural data compression,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:1997626a833129eaed7bdefec894db81c848f990b4f165ab03fb0e48a5ab9d85","observation_id":"21acdb27-ca96-4e74-8b78-0a23a41e2aeb","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Deep variational information bottleneck,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:1c59ea994ade7859f734f92d61a0af3350a9b5e71b1df098f72dc1b3aab60a9a","observation_id":"b10022cc-b1bc-456c-b5b2-5275d83bcfb3","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Rate distortion via constrained estimated mutual information minimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:5a0bb41c11633722682e64659ffcb6c966abfaa985d9838b71074e4932263b7a","observation_id":"eb8a1b9c-19cc-402e-8573-6c49ecf77222","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Adversarial information bottleneck,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:6b39119b105e36cfeeb9ca606cdae2af8a6f33bebc54401b18467f43df9808fa","observation_id":"95eaea6e-3e37-494a-9476-a9062619c31d","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Neural estimation of the information bottleneck based on a mapping approach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:b53ef5b77152a6631281672f4b8f2327e00baea7419038ec522ea4f31d309738","observation_id":"ee22864f-15f6-4770-9a35-5b1344125747","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Data-driven neural estimation of indirect rate-distortion function,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:24371f22e9cd8fb83dec191cb4e5fa42fef673d4dd4b29c136ea5cb566419483","observation_id":"0e3f74ba-c8fa-481b-be8d-4fb01f5db6de","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Rate-distortion theory,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:0d0fbc656b0dff25bc71930a87cdc0c40fee51d8c5dd1951f5f1aba665b92ba2","observation_id":"b2b81a48-6c24-492f-a570-7fb5cd525b8d","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Indirect rate distortion problems,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:37f0dad2f419b84b01bfa47cbc3c81f5c165b0e33bfea5db1d369041891da24b","observation_id":"1605b392-2d27-4bcb-bcc3-ed36ed191679","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Wasserman,All of nonparametric statistics","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:d9cc7d7915b03d96c6d74200736543152a2adb64ed8ac5e6a1f973c8cdd0a685","observation_id":"4afbe071-4ef0-49c6-a047-22810af421b0","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Stochastic backpropaga- tion and approximate inference in deep generative models,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:d80c71e9c65f73d254f179f7a360c3fc331ea327bd1e69addbf58d95140a5867","observation_id":"c26f73a1-d078-4cad-88d1-9a7be99cab0f","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"beta-V AE: Learning basic visual concepts with a constrained variational framework","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:e00685e41029e12b8116c8c223a54c8e57316a7a10b75c914a4bfafc77c92ddd","observation_id":"05e2a621-4178-4fd2-bc72-beab94240e08","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"U-net: Convolutional networks for biomedical image segmentation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:f6a32d3652d2016f9f9d76a06f0a408ca194b6da3db96d6ee97d21401d961e09","observation_id":"6010abab-4c3d-48eb-a95e-ee6db47ba122","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Variational inference with normalizing flows,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:2299513afff1af6e105e01b7576691140a8ad3e514be49048db1f4406ea40d7b","observation_id":"554716da-057f-49c5-a5d7-6122e68c2357","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Multi-rate V AE: Train once, get the full rate-distortion curve,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:94d565304dc23e7eabc58263af3fdb5f9e1456e2b946d4c9bcec275f28d0a7f7","observation_id":"92957421-d44a-4044-941d-d08907abe869","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Information dropout: Learning optimal rep- resentations through noisy computation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:23a8642a65351546da1aa794de653eac05af6bbd3f093d4c01d9e340e374f890","observation_id":"8b41dd46-bedf-4752-9cca-d88b9876be5e","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Nonlinear information bottleneck,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:8cc588165a496ed517f65abd24b764c6d0f7d1c4835a61254c69b60332e9f02b","observation_id":"793cc835-eb92-4817-9bf9-2854898dc619","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Asymptotic evaluation of certain Markov process expectations for large time, I,","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:58f084963952facff0d1cd6ed4e1909009dfa81ee32a329635b5952e04271c8f","observation_id":"4e08247f-1fa8-43a8-8865-95bfe753690a","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Source coding, large deviations, and approximate pattern matching,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:9ca3f4c5f29de74fc9f05c7aa08412cc8e90fc228e8f118523e22d75bc88866e","observation_id":"7cf7482d-6c8a-4deb-b863-ade07f6ef5fe","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"A mapping approach to rate-distortion computation and analysis,","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:27d924141fe49021cd63daea10cf403829e6e080e31abc1443a396ba4bf4f3ab","observation_id":"26d9d411-9743-4601-8898-8f720b0f4b89","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Rate-distortion theory by and for energy-based models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:c33e336dc6105caee920e9a25807dad7f1755c5b61edec392f6142335f115915","observation_id":"538829d0-b67d-479f-acdb-bb88d991d56f","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Estimating rate-distortion functions using the energy-based model,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:8f105f93da5464ec358e3ba9cef0506b31a296e26471a6d22eb4e2c3eca80d04","observation_id":"2191031d-359c-4dd8-ab11-768f95429e78","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Correlation functions and computer simulations,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:fa15299232e23fac56eb4a261eb833fbfd85f0227534690fa33b99eb21a477e3","observation_id":"4ace6b1c-d45e-45f5-98c6-85ec3620b374","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:7e5195553305dc2c88aa10765b9fb6181c7fdba251cd1a80a12694932fff335a","observation_id":"c5dcc4d1-327e-43cc-838f-912f837c83a4","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Caveats for information bottleneck in deterministic scenarios,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:650d8c234e572202d9f01e9946f8b0a01b55a9e06e2d366d7bb8cd29cb4a6731","observation_id":"fb6bb552-a956-46b9-a0d7-e0a25ee20fdf","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"On variational bounds of mutual information,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:a331be6fe60abc9d1623f2c822f895243fca36e4e39202027e829c037ba473d0","observation_id":"19c85fc8-5c4c-4241-b778-e5e6dd414c69","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Denoising diffusion probabilistic models,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:116d538795bffba007f31f643eb2b743ae14f8dafeaa10d4a401422dbc52e1d4","observation_id":"f6275763-ccc3-407b-8e09-c36468dad79d","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Score-based generative modeling through stochastic differen- tial equations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:6f015e00ee022bda4fe5a6b0a6ff8315fe7679b66ebead23ba9e9f4c3f24f65a","observation_id":"98bed057-bcaf-4fdc-83f3-300a9a3fca8c","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","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-07-12T11:40:33.734051Z","title":"Georgii,Gibbs Measures and Phase Transitions","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-12T11:40:33.734051Z"},"links":{"citing_paper":"/paper/2607.05417"},"observation_digest":"sha256:dd9127ea3e291d68276b238209c0a940508877a0caef85ad65e4f8828caf27e4","observation_id":"62b72fe7-840d-429b-90dc-f9f9737ae1f4","resolution":{"observed_at":"2026-07-12T11:40:33.734051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.05417","last_updated":"2026-06-26T01:49:59Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-12T11:40:33.219982Z","submitted_at":"2026-06-26T01:49:59Z","title":"A Survey of Learn-to-Compute Paradigms for Rate-Distortion-Type Problems"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":45},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2607.05417."}