{"as_of":"2026-08-09T13:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec29eeb418cb6ceec055d1be483816958be1ef3e45b500228ae648b9c8ea6bc2","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:37:31.380468Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.15757/citation-record","integrity":"/paper/2507.15757/integrity","json":"/paper/2507.15757/citation-record.json","paper":"/paper/2507.15757"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:37:32.300333Z","title":"Compressing Images by Encoding Their Latent Representations with Relative Entropy Coding,","venue":null,"work_id":"ba8df0ae-02ff-489a-949f-ad314faa821c","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.092081Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:c7ae85c62f930195d2101a3f36c22c1b4e503844ea4936e6c448cd98fd82cedb","observation_id":"45815ad1-d32a-4737-be49-613e32fd5151","resolution":{"observed_at":"2026-08-06T15:37:32.305336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.283503Z","title":"Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,","venue":null,"work_id":"62375ab4-9160-45a9-848c-788a01878441","year":2002},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.101877Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:f3b1aaf9ad9612116f4233a9e04a0269eaf0270096d6c0bd31efdefc3d1101ea","observation_id":"f8e69f82-9837-4801-907f-5ab35b1235d7","resolution":{"observed_at":"2026-08-06T15:37:32.289377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.266478Z","title":"Distributed Channel Synthesis,","venue":null,"work_id":"0641fbfb-4882-4255-b7bf-3be9082a0c7d","year":2013},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.109841Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:ac1a8669b3c245cd2b4b2be87261933eaa217046afd18f33409df728fd98d4ce","observation_id":"6203056e-b0b7-4c32-b60e-be5b572260e9","resolution":{"observed_at":"2026-08-06T15:37:32.272315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.247829Z","title":"The Quantum Reverse Shannon Theorem and Re- source Tradeoffs for Simulating Quantum Channels,","venue":null,"work_id":"10cf8192-7f72-4176-9eeb-89e6f273c53e","year":2014},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.115949Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:425307c75490586428a89efa5e80439b12f05a6b54c1b005319e5ba6eb10888e","observation_id":"ec59da94-6cb9-4c69-88c8-d1c71c523806","resolution":{"observed_at":"2026-08-06T15:37:32.252890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.229340Z","title":"Exact Channel Synthesis,","venue":null,"work_id":"2a4017ce-7bcf-415f-b138-4c0c5f0b864e","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.121270Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:cd56a7e2c38767b8e70088f5889f67d7bc2a994b786190677ff60a4f0146d1d9","observation_id":"3063b154-1fbc-4a08-893b-db38156ed8cc","resolution":{"observed_at":"2026-08-06T15:37:32.235424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.213425Z","title":"Optimal Redundancy in Exact Channel Synthesis,","venue":null,"work_id":"0e56d65e-9d9f-49cb-af07-44603ec6f78c","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.126639Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:e3c3afbc39604c52a613013bddbfe05423edd5ee646b849c68b5bd26f49c7451","observation_id":"2f7dc4bc-0364-4007-abb6-598d1f174551","resolution":{"observed_at":"2026-08-06T15:37:32.218815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.197755Z","title":"The common information of two dependent random vari- ables,","venue":null,"work_id":"14fb4534-0b58-4ac3-abc7-d4d59ce0b616","year":1975},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.132956Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:a40f3e2c89a96c769f28f8f2e01993e02d7e1632db42a04d085099b9f8731853","observation_id":"e50e8ad8-4617-41c4-aef5-e4195ea41430","resolution":{"observed_at":"2026-08-06T15:37:32.202959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0208131","last_updated":"2002-08-21T10:24:47Z","snapshot_observed_at":"2026-08-05T15:15:21.625372Z","submitted_at":"2002-08-21T10:24:47Z","title":"Compression of sources of probability distributions and density operators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0208131","snapshot_observed_at":"2026-08-06T15:37:31.138069Z","title":"Compression of Sources of Probability Distributions and Density Operators,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.138069Z"},"links":{"cited_paper":"/paper/quant-ph/0208131","citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:d24aa514ec404e1b5cc05aa42e8c78e61c4a465148db030e738ab5bec8821416","observation_id":"3014036a-dc2e-4d73-a911-273a9572fc6d","resolution":{"observed_at":"2026-08-06T15:37:31.138069Z","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-06T15:37:32.181200Z","title":"The Communication Complexity of Correlation,","venue":null,"work_id":"85cbcbbf-8f96-421c-989a-93a5a2e8ac78","year":2007},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.145622Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:0cf5900cb44564b6c95af4e7d6b5eb428b357d02344159710a2dfdf220872d10","observation_id":"d7460037-4adb-4bbe-a099-5e7250f7d953","resolution":{"observed_at":"2026-08-06T15:37:32.186172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.164953Z","title":"Strong Functional Representation Lemma and Applications to Coding Theorems,","venue":null,"work_id":"f7f2546a-8a61-432f-baeb-b803ce85b54a","year":2018},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.151264Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:70a04719b42298d8b359648f983538a29b422c583aa5231bde0abbcb5709b16d","observation_id":"86f28e79-fbfc-4be4-90cf-de03bbffd990","resolution":{"observed_at":"2026-08-06T15:37:32.170029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.145373Z","title":"The Quantum Reverse Shannon Theorem and Re- source Tradeoffs for Simulating Quantum Channels,","venue":null,"work_id":"a63396b8-0277-41f0-a0e4-2b7151519eaf","year":2014},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.156763Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:0f08d58da7c9faf3b2c25d515e49dd0f7e846d65b89b99e3c608c9f75812a432","observation_id":"35fc8b85-66e5-47d7-a722-2aefdfa23e28","resolution":{"observed_at":"2026-08-06T15:37:32.151335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.127302Z","title":"Coordination capacity,","venue":null,"work_id":"56c6267c-be77-4661-85f6-14ecb829c677","year":2010},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.161938Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:6b56a4f8860fac8f8ebeeb70940bad38ce7de42817c9908d49e10883bd990049","observation_id":"b97881f1-68ed-4140-8f18-dc8218ea917e","resolution":{"observed_at":"2026-08-06T15:37:32.132698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.110884Z","title":"Fast Relative Entropy Coding with A* Coding,","venue":null,"work_id":"f84d9931-a201-4097-8e6e-441587d1f470","year":2022},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.166439Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:f47b5f78320115abb902cb473e546a8b10062940268b653f62d4af67c55fcefb","observation_id":"76ab2439-dca5-4f17-bc43-3633a55e7ddf","resolution":{"observed_at":"2026-08-06T15:37:32.116555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.092317Z","title":"Greedy Poisson Rejection Sampling,","venue":null,"work_id":"a1090757-64f1-47db-ba79-661141de8b13","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.171370Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:ebe4622ffb347adff9661fb212a60988c899b743ac190fedf74f406afc6a69bc","observation_id":"1bf63490-8ee0-432f-9698-11546d863636","resolution":{"observed_at":"2026-08-06T15:37:32.098877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.073127Z","title":"Faster Relative Entropy Coding with Greedy Rejection Coding,","venue":null,"work_id":"5d7773f2-db64-4865-9bcb-22536c0fb0fd","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.176773Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:861309d7f45e7b5b18bdf250f0eeb1c3e4cd91adcf7dad2119d98417b811e83c","observation_id":"2d80f4e9-090b-4d71-ad3d-2ed7d6f4ba2a","resolution":{"observed_at":"2026-08-06T15:37:32.078645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.056119Z","title":"Adaptive Greedy Rejection Sampling,","venue":null,"work_id":"2ade6a82-7c5d-4bae-8372-d51f09807843","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.181829Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:1ed413f76380ea626addb358282467e951c9226a5646355a88531d6392e5888d","observation_id":"65f57578-cf7d-4f1e-90c2-8a4515ac9b6a","resolution":{"observed_at":"2026-08-06T15:37:32.061405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.040349Z","title":"Accelerating Relative Entropy Coding with Space Partitioning,","venue":null,"work_id":"a5562703-856c-440b-b5e9-011fc56ed05f","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.186775Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:58b1b427cbb2289d950bfc50c69ace9ed9a6a332f697df4d6f8eb9d1da093a35","observation_id":"119f73d7-b9ef-4bea-95d3-afadfc51c8d3","resolution":{"observed_at":"2026-08-06T15:37:32.045387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.023885Z","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters,","venue":null,"work_id":"374d17dd-c3bc-4ac1-821b-110ec1720bac","year":2019},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.191397Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:0a4f6af6b4fd7ca1d267ead6a41d12242527268e1cbd3ceb471c1d064816d008","observation_id":"38090d58-b071-465a-af33-ffe1840c00bb","resolution":{"observed_at":"2026-08-06T15:37:32.028668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:32.007960Z","title":"Compressing Images by Encoding Their Latent Representations with Relative Entropy Coding,","venue":null,"work_id":"c0df8195-3303-41dc-aa23-38eb22b15fca","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.196247Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:a1667c99f340ee9aa58d833a685a95f649357ab1486df4c005af824cf0bed9df","observation_id":"68398826-9e8c-4028-b248-0a42ef8f7107","resolution":{"observed_at":"2026-08-06T15:37:32.013268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.991219Z","title":"Universally Quantized Neural Compres- sion,","venue":null,"work_id":"b2916c46-21a0-49d9-9866-59f416a2d6d8","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.201449Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:852daa31a087dea2ed9ea6b731661b4281aaf5dad1c22d1fb8bf0b55a6fd725a","observation_id":"07dfeb91-aea5-48f0-b85a-4b0fd6e630f3","resolution":{"observed_at":"2026-08-06T15:37:31.996385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08889","last_updated":"2022-12-31T13:56:37Z","snapshot_observed_at":"2026-08-07T05:49:38.652882Z","submitted_at":"2022-06-17T16:46:31Z","title":"Lossy Compression with Gaussian Diffusion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08889","snapshot_observed_at":"2026-08-06T15:37:31.206150Z","title":"Lossy Compression with Gaussian Diffusion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.206150Z"},"links":{"cited_paper":"/paper/2206.08889","citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:1db9c80612d8eeecd95c1bd4e66ba7f670d66970ebd535de9d6ac36b9d8aacdd","observation_id":"2b5c6408-398f-4e6a-8493-c1e65d9d3d93","resolution":{"observed_at":"2026-08-06T15:37:31.206150Z","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-06T15:37:31.975178Z","title":"Sparse Random Networks for Communication-Efficient Federated Learning,","venue":null,"work_id":"bf2098a4-6773-4325-9546-dd17eda590a6","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.212109Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:c89e22233538393ab732fa6bbb0cf0b1d9b1814a1db07929a4ec5472aa672808","observation_id":"8551d435-3a04-4004-9ad7-db5a0d846c69","resolution":{"observed_at":"2026-08-06T15:37:31.980284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.958875Z","title":"Adaptive Compression in Federated Learning via Side Infor- mation,","venue":null,"work_id":"baa909b9-6ea2-4e56-8c0f-d6d9fe6129d0","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.216940Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:1569fcc5efe63f87d701740f366b7b41bf6fe19c2a8cfa554cce1928159b3c2b","observation_id":"070e0549-dce3-42b6-9520-cbed05aa2e51","resolution":{"observed_at":"2026-08-06T15:37:31.964480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.05454","last_updated":"2021-12-07T21:56:09Z","snapshot_observed_at":"2026-07-06T12:07:05.919117Z","submitted_at":"2021-11-09T23:33:11Z","title":"DP-REC: Private & Communication-Efficient Federated Learning","version":2},"cited_work":{"arxiv_id":"2111.05454","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.05454","snapshot_observed_at":"2026-08-06T15:37:31.437063Z","title":"DP-REC: Private & Communication-Efficient Federated Learning","venue":"cs.LG","work_id":"38b548b7-1c3d-4d7e-8337-3b792fd0a34b","year":2021},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.221918Z"},"links":{"cited_paper":"/paper/2111.05454","citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:1c15443afc90bbd55963e89a6ae85c7fc117200892ab2c7df9eb59eb36c614bb","observation_id":"09cbff64-7121-475e-8129-4422b28bf4e9","resolution":{"observed_at":"2026-08-06T15:37:31.445243Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.943018Z","title":"Communication efficient private fed- erated learning using dithering,","venue":null,"work_id":"fbcbb052-d54d-4b08-ac0e-8bde4055d288","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.227074Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:3dca9be09b9133f95906cb82ea1d6f0fec0ced2acf07a2869105209888cc3cd0","observation_id":"9812cea5-8239-4cf8-8c13-6c64eddc55c0","resolution":{"observed_at":"2026-08-06T15:37:31.948281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.927165Z","title":"Compression with Exact Error Distribution for Federated Learning,","venue":null,"work_id":"4a5086ce-ad19-4b8c-8d56-e0b2fd126abc","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.232629Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:880fc0105b32f3466305c48c69e9f9cb3ebc896e2f6baff5fde77554bfd0c1f6","observation_id":"a34121d9-1d04-4a1c-a0a4-523cbd4f40f0","resolution":{"observed_at":"2026-08-06T15:37:31.932512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.910039Z","title":"Communication-Efficient Laplace Mechanism for Differential Privacy via Random Quantization,","venue":null,"work_id":"815bb032-3c08-42e3-bb22-72a64320ae81","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.237440Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:c56cf420abd4643db650fa17b5d8b7e770fecd2adeb20cfbe14df624f6cfbab5","observation_id":"7726003d-2b9d-4e03-88c3-5feb0b9bdf70","resolution":{"observed_at":"2026-08-06T15:37:31.915609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.894295Z","title":"Universal exact com- pression of differentially private mechanisms,","venue":null,"work_id":"580a398a-c55a-46b6-9d30-a7db062077f9","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.242453Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:5920e47b7fc9a3e4af417974e547a640fa5b866b79b9270863c08caca4bd4828","observation_id":"28e6972b-2c47-474b-b1ba-4e3855c06bd2","resolution":{"observed_at":"2026-08-06T15:37:31.899648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.878831Z","title":"Channel simulation: Theory and applications to lossy compression and differential privacy,","venue":null,"work_id":"db4b9ec7-b552-4812-bcd2-4491b0c7b4dd","year":null},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.247834Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:bf182926834d19287345f6e6c7f163ad81aacfb06095e93b8510105b05e6b6f6","observation_id":"46e5a286-805e-416a-a06d-0bb32093506f","resolution":{"observed_at":"2026-08-06T15:37:31.883919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.862458Z","title":"Information Transmission With Addi- tional Noise,","venue":null,"work_id":"bc46a6e6-6929-495a-a509-c4969638ba7f","year":1962},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.258527Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:b24274b7580050484f9d905154eb96b73004ab000bf795344f66b4f9e05a7e48","observation_id":"1fc3e902-e4ed-49d4-a11a-2a4dc500aee2","resolution":{"observed_at":"2026-08-06T15:37:31.868093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.846123Z","title":"Transmission of Noisy Information to a Noisy Receiver With Minimum Distortion,","venue":null,"work_id":"241a06a9-73ea-46de-98d6-b309fbc909a1","year":1970},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.264589Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:78461c4b366b28c5721a8ac4724f002bc3fc2a708edf349975d837112565dcd1","observation_id":"880c330f-cf27-4657-bb0d-2b703be29702","resolution":{"observed_at":"2026-08-06T15:37:31.852084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.829147Z","title":"Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression","venue":null,"work_id":"e771caa8-e4be-492a-8e54-e159077e2917","year":1971},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.270320Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:55c3117653cd78421f3e80fef5d031fa17c67f709112b5adfcc407f568d389d2","observation_id":"34a7dd79-9e86-41c9-a852-e67c33d0c9f2","resolution":{"observed_at":"2026-08-06T15:37:31.834926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.813945Z","title":"Indirect Rate Distortion Problems,","venue":null,"work_id":"10f23890-300b-4de8-84c7-ab303af1fcc7","year":1980},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.275849Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:a3da528c0457de84d70cee28dbf6e44a672ade3c4c095ec66fba377dfd0088d7","observation_id":"c2a7e0fd-982c-4cf6-9711-462a1d558af2","resolution":{"observed_at":"2026-08-06T15:37:31.818646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.798369Z","title":"Approximation theory of output statistics,","venue":null,"work_id":"acb71785-a606-4835-ab40-635fbb04851a","year":1993},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.281531Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:33604601f1d95008591de8b0848b2fbe244320f4f91bcde707f19af6f0c3f926","observation_id":"995490d8-a50f-47db-a0a1-2cb42ca36f12","resolution":{"observed_at":"2026-08-06T15:37:31.803200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.782533Z","title":"Common information is far less than mutual information","venue":null,"work_id":"eae95ce3-3575-4f3d-9926-95ed8726cc4f","year":1973},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.288586Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:08f04a6b9e0d68cfb46ee82704d1bbcb2d0f61969c5aa830512d28da0d0d8c57","observation_id":"33f672eb-b6cd-4cad-986f-eeec216e9b8c","resolution":{"observed_at":"2026-08-06T15:37:31.787527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.767043Z","title":"Generating dependent random variables over networks,","venue":null,"work_id":"473dec9e-fea7-47ff-a9b1-db2f3f757240","year":2011},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.294773Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:08b9abc61886ca8eedb9bbc54b9cf871e7a842bc80e16337fe373385f6a0c979","observation_id":"16c1f07f-b971-4283-8cad-060e2f103bbd","resolution":{"observed_at":"2026-08-06T15:37:31.772221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.750266Z","title":"Channel Simulation via Interactive Communi- cations,","venue":null,"work_id":"93b0dc46-ea89-4324-90f3-eb8d3f7dbce0","year":2015},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.299502Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:d69fa274497104a188d3a80511c53dfd084f09988a3b5c12934b6cd9ff84e13d","observation_id":"8ad3f387-c23a-4748-8829-ae5fbd1abdbd","resolution":{"observed_at":"2026-08-06T15:37:31.756251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.733601Z","title":"Strong Coordination over Noisy Channels with Strictly Causal Encoding,","venue":null,"work_id":"c3c0d9f2-f3fa-469e-9410-1b33d44887ca","year":2018},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.304370Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:1b1f1f58248f504e46146af5e72a385097b5f0f60edd9a20347af357dd069521","observation_id":"46ad985d-a5b2-4061-add1-c28fed6de9e5","resolution":{"observed_at":"2026-08-06T15:37:31.738945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.716335Z","title":"Communication for Generating Correlation: A Unify- ing Survey,","venue":null,"work_id":"371fff1c-cffe-4422-9006-b2e7bb4afa69","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.309480Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:2d91a11e95e5c420993a9659ac8a044f7c0420922662338a7b59b3e983a787f6","observation_id":"52b22d81-1868-4c11-8594-41b1d09b7e22","resolution":{"observed_at":"2026-08-06T15:37:31.722075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.700144Z","title":"Source coding for synthesizing correlated randomness,","venue":null,"work_id":"ec2ce073-6498-42ae-874d-c3f722beb54a","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.314597Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:d632654ca63ae5e85ebb349ae01fe11391d93ed72b2deed85a7b9e105703ed73","observation_id":"27de9b27-722e-4857-9717-9a33593f079d","resolution":{"observed_at":"2026-08-06T15:37:31.705452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.683897Z","title":"One-Shot Coding over General Noisy Networks,","venue":null,"work_id":"90f6d6d3-70b0-4fa4-b264-76ef6de724b4","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.319460Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:6a849b5906c647dc3affd70b48f9cfe6d1dac68f517769bc8ea88f8585116c31","observation_id":"6a985a8e-0260-46f6-85dd-93faccb5b226","resolution":{"observed_at":"2026-08-06T15:37:31.688889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.665985Z","title":"Broadcast Channel Synthesis from Shared Randomness,","venue":null,"work_id":"ebf25189-2eb6-458a-bc03-fa367b605048","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.324287Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:8eef8612ef75924655b27511776d7057a4d15234f26cba23362b013a602ecab1","observation_id":"3ecb1d83-b6a0-4442-ba49-439f8c5bc8e7","resolution":{"observed_at":"2026-08-06T15:37:31.672486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.645745Z","title":"Channel Simulation: Finite Blocklengths and Broad- cast Channels,","venue":null,"work_id":"36611a47-7a96-429c-9cd4-3cc32e22644b","year":2024},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.330412Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:e5e2fda171fff1422f261fd64c496cee0ba4bc11915cd1d5a3c1d6b2d1cfd9ab","observation_id":"4c30a78d-ab5e-4b1e-85ac-90cb48404cd3","resolution":{"observed_at":"2026-08-06T15:37:31.652854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.629191Z","title":"Remote joint strong coordination and reliable communication,","venue":null,"work_id":"d5f1d953-e26e-4fcc-b789-96c16c5bef24","year":2020},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.338434Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:3a06e5c0b76e5e92b8886ca98d1e4c3c3cb7f59baf47f6b38d2fa783b17dba02","observation_id":"3a248554-5e0a-420c-b191-c6442fad3afd","resolution":{"observed_at":"2026-08-06T15:37:31.634495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.610890Z","title":"El Gamal and Y .-H","venue":null,"work_id":"f6314f18-4635-4b9d-8122-d57f4558ed54","year":2011},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.344532Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:8e4906223b0e6eef24b8686026c001ce488d96d469c9704cd6279aa828bfdc3d","observation_id":"a81cbe41-96f8-46e4-94f4-eebc9cea94f2","resolution":{"observed_at":"2026-08-06T15:37:31.617789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.590996Z","title":"On Extracting Common Random Bits From Corre- lated Sources on Large Alphabets,","venue":null,"work_id":"7f2a299c-b046-4c82-ac9b-a32ec8658938","year":2014},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.353343Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:ce246324da24fea9e617553bbd9e524405c3670375c090886708e3efb5e86921","observation_id":"42d86065-53c7-4b11-8dfa-42ea840f6d60","resolution":{"observed_at":"2026-08-06T15:37:31.596464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.570486Z","title":"The likelihood encoder for lossy compression,","venue":null,"work_id":"2ecf3bd6-b089-4635-85c6-8c6e51239bda","year":2016},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.359047Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:8bdf80af609247e2f2c45307078d9f4127f48fffd24c6bf9e3ad7c64ae18ddc5","observation_id":"78fd33e2-4b55-40ab-83f3-e9cb30d562b4","resolution":{"observed_at":"2026-08-06T15:37:31.576713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.551497Z","title":"The Rate-Distortion-Perception Trade-off with Side Information,","venue":null,"work_id":"27fc0206-89c8-4f43-a1e8-691dbd2e9ab5","year":2023},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.364465Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:7a3ff38c251d705d03dffe8cbdab209ebd911240b9fc0115cc6efdc5221817c9","observation_id":"c0fc4402-847f-40a8-899b-ec8d337838a3","resolution":{"observed_at":"2026-08-06T15:37:31.558215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.533590Z","title":null,"venue":null,"work_id":"8fd3f096-dfbb-4006-b9c2-6741b80e8b56","year":null},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.369611Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:b5aa4c905234b05a20a9f81c842df1f3b2d5a971bfd7eccff2be06e38a839c94","observation_id":"8aead854-34fb-40eb-aa1d-a1d2bb7e45ba","resolution":{"observed_at":"2026-08-06T15:37:31.538879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.515979Z","title":"Let R be a non-negative real number and let (kn)n≥1 be a sequence of positive integers satisfying kn/2nR →n→∞1","venue":null,"work_id":"cc7bafd8-f04d-4d11-b411-fbd718c01536","year":null},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.375169Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:f4e84df736fd85cfcd05f3eb35f0111a7f45c8edb176d5d9b042449ef707ac80","observation_id":"a345648c-1758-498b-9ceb-572406a551b1","resolution":{"observed_at":"2026-08-06T15:37:31.521861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.497535Z","title":"Therefore, QZn|C(n),J ≡ QZn|C(n) J ,J","venue":null,"work_id":"cc2f6a08-8263-44f5-b808-408575056e2a","year":null},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.380468Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:b50db4b85c92909cf6c6859f0a9c168dfb72f3bddf1e43c494f67e6ecff7fef7","observation_id":"c83bf010-4458-4c27-a943-c02d1663b007","resolution":{"observed_at":"2026-08-06T15:37:31.502734Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T15:37:31.252688Z","title":"Available: http://dx.doi.org/10.1561/0100000141","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T15:37:31.252688Z"},"links":{"citing_paper":"/paper/2507.15757"},"observation_digest":"sha256:6ba05faf39db3e1716fddd055a93ce3766a89d7e352e7467cd708480c59b0134","observation_id":"834d2db6-e28d-4c63-8960-28cd9e43228c","resolution":{"observed_at":"2026-08-06T15:37:31.252688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.15757","last_updated":"2025-07-21T16:13:13Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-08T18:05:29.436576Z","submitted_at":"2025-07-21T16:13:13Z","title":"Remote Channel Synthesis"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":46},"total_outbound_references":52},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2507.15757."}