{"as_of":"2026-08-16T04:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54eb761e728bb898453289742ce4cc8dc5c5b76e44fcbe215d6b25d26685d621","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:46:05.995238Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T23:17:02.098650Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T14:11:05.471062Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"cited_work":{"arxiv_id":"2501.13736","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13736","snapshot_observed_at":"2026-07-28T03:24:07.136480Z","title":"Discrete layered entropy, conditional compression and a tighter strong functional representation lemma","venue":null,"work_id":"a150e250-9e14-47f1-8a77-29627c02273a","year":2025},"citing_paper":{"arxiv_id":"2604.20369","last_updated":"2026-04-22T09:06:19Z","snapshot_observed_at":"2026-07-06T23:06:49.210284Z","submitted_at":"2026-04-22T09:06:19Z","title":"Rate-Cost Tradeoffs in Nonlinear Control","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-09T23:17:02.098650Z"},"links":{"cited_paper":"/paper/2501.13736","citing_paper":"/paper/2604.20369"},"observation_digest":"sha256:b71745bfb8bcbb85c7b30cd1b2eb7ce84bc617c15ac7af9bd4d363a16f8154b7","observation_id":"184b3f89-baba-4921-a134-7e935ccf4fbc","resolution":{"observed_at":"2026-07-28T03:24:07.136480Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13736/citation-record","integrity":"/paper/2501.13736/integrity","json":"/paper/2501.13736/citation-record.json","paper":"/paper/2501.13736"},"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-10T15:46:07.049548Z","title":"Randomized quantization with exact error distribution,","venue":null,"work_id":"2e2a2e4a-f4a5-4f36-8f1f-19e41c1ed293","year":2022},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.726980Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:170618c2eb9c6fc3e7a990ec002d24541fb0c0a0a0381478ca0b2dd223b88576","observation_id":"965963e4-265f-47c7-ab1c-e32db140e7c5","resolution":{"observed_at":"2026-08-10T15:46:07.054426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:07.033734Z","title":"Rejection-sampled universal quantization for smaller quantization errors,","venue":null,"work_id":"367415b7-7849-4b63-bb27-13c1f75c15c1","year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.732624Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:923b0a40f7167a8e51118b6430b705e454d5ffbd2c53f1991268f3ac088f72eb","observation_id":"5c0d6d58-5b1a-47e9-b0d7-ce91fe6bc0e2","resolution":{"observed_at":"2026-08-10T15:46:07.038810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.737607Z","title":"Strong functional representation lemma and applications to coding theorems,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.737607Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:30f1a0975e81ab1eb86b4f34474352b2b7ab4f0de1b56eda6e5a5509503f66c2","observation_id":"1bafa4cf-ac7d-4ddd-b4b0-717cf463f522","resolution":{"observed_at":"2026-08-10T15:46:05.737607Z","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-10T15:46:07.008505Z","title":"A lower bound on the expected length of one-to-one codes,","venue":null,"work_id":"e6f8850f-4888-4295-91f3-ad3c47348efb","year":1994},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.742409Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:0e202249046740a2d8b571f7c23aee5fedaeaa100d0ae490b10d302fe9665b7d","observation_id":"f4ee076a-bd65-4019-818a-2e8272d8425c","resolution":{"observed_at":"2026-08-10T15:46:07.013214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.992369Z","title":"New bounds on the expected length of one-to-one codes,","venue":null,"work_id":"ba8a3424-5730-4a11-9eba-113f343d4f52","year":1996},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.747364Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:f76a278a7b6ce93a9b2348fc791485871203d42d59157069ade3d2bd96e90d3e","observation_id":"eb1a5cf5-e7b3-4c2d-a49a-d6385bb653f6","resolution":{"observed_at":"2026-08-10T15:46:06.997424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.975961Z","title":"Minimum expected length of fixed-to-variable lossless compression without prefix constraints,","venue":null,"work_id":"9525c340-a172-4575-b75e-5fb11f8c2ca5","year":2011},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.752254Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:4ed380096808b84047b296c2799a241479078baeef6cb435a98be2d9fdfe1102","observation_id":"0f70ec45-1594-4510-ab71-4e5c5c288de7","resolution":{"observed_at":"2026-08-10T15:46:06.981101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.757750Z","title":"Information theory and statistical mechanics,","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.757750Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:3210bc5a00e24f6c680a22a3beb077bd5a8848c0301a30b2dc3dbd1400c1f0d5","observation_id":"78dafee9-f4ad-41fc-89f4-f7d1e7c1548e","resolution":{"observed_at":"2026-08-10T15:46:05.757750Z","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-10T15:46:06.950049Z","title":"A minimum information principle: Theory and practice,","venue":null,"work_id":"2466599e-a4a7-4d6d-9f32-aee093af7cbb","year":1977},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.762446Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:cd559ebc5562134dfe4167c348e49ea96cc42dbcf4a759e47d6ccd30668e08c0","observation_id":"e035b7b3-e77e-4884-8790-22e5d9eab3b0","resolution":{"observed_at":"2026-08-10T15:46:06.955464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.934897Z","title":"Guessing and entropy,","venue":null,"work_id":"faf46fde-3196-480b-8311-e99ea6e17345","year":1994},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.767126Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:2c22f8c00faec9865dfc15d9e6219c9896bed580b7da51fd252dbf3695b6cb04","observation_id":"d1c7e7b4-0892-49f7-8a78-d27e3f44b710","resolution":{"observed_at":"2026-08-10T15:46:06.939733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.919085Z","title":"An inequality on guessing and its application to sequential decoding,","venue":null,"work_id":"076d8a39-6ac6-4f71-8eab-0e574051daec","year":1996},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.771769Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:ea9263209529194075efd0c12beb4ad9f8d2bf5737d23b99bbc81491b8a1ed26","observation_id":"50132c65-f06d-47de-a906-a2e30dcf9ee7","resolution":{"observed_at":"2026-08-10T15:46:06.924095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.902502Z","title":"Asymptotics and non-asymptotics for universal fixed-to-variable source coding,","venue":null,"work_id":"308f7a90-c182-438b-ae43-90d607c3bbfa","year":2017},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.776240Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:9ba566364c73273b5cd7ba587ef746f1c08d0b2f3f266769679937a10a0f614d","observation_id":"218ca263-18da-481c-b5fe-f6963065a60b","resolution":{"observed_at":"2026-08-10T15:46:06.907681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.780906Z","title":"Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.780906Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:d364693956a12eb21c4c1c13c6e82fdce747907851cd36598c3ad01a15b83e47","observation_id":"66015666-ae37-4d11-9e1a-5b4cf855e12a","resolution":{"observed_at":"2026-08-10T15:46:05.780906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:46:05.786856Z","title":"The communication complexity of correlation,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.786856Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:c513894ea0fe0383535922924ffbcf7bca96d075d8eaa29749c2e338aaaabc09","observation_id":"8d54b1ff-31ee-4be1-b6f1-57c9c05ad9ea","resolution":{"observed_at":"2026-08-10T15:46:05.786856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:46:05.791278Z","title":"A unified framework for one-shot achievability via the Poisson matching lemma,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.791278Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:b8397224a1340c74e0ce73609169386a0287100a95bd06a1ce70a6890bc81d6f","observation_id":"a8b8442d-9992-400f-98f5-645aedd5a527","resolution":{"observed_at":"2026-08-10T15:46:05.791278Z","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-10T15:46:06.855331Z","title":"Pointwise redundancy in one-shot lossy compression via Poisson functional representation,","venue":null,"work_id":"0342c437-1674-41c0-8725-2e7ec8be429c","year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.795975Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:3f09e400220634f7a5dabded5eeff7013c853fee5e44ce26a06df4fab83182da","observation_id":"bbb7a138-494f-4c82-9310-96c1309fe86b","resolution":{"observed_at":"2026-08-10T15:46:06.860467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.839217Z","title":"Noiseless coding of correlated information sources,","venue":null,"work_id":"f3cbceb6-57c1-4adc-a3d2-d086abb8f527","year":1973},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.800990Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:fd52609bed836999acbeb6ecf55f09b51f21b983e0d8c7713bc640872943ff58","observation_id":"48d1b352-a880-4e92-903e-1b61d0d8a3ab","resolution":{"observed_at":"2026-08-10T15:46:06.844626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.824438Z","title":"An inequality on entropy,","venue":null,"work_id":"ae72607b-65f2-41b0-b2b8-f3240c0660f6","year":1995},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.805628Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:0e4aad6adebd8bd1d897fd26916503f9df318e9c4c62a4454f5b6ed38ad22a58","observation_id":"c007dd32-399f-46b1-af18-69224356fe1f","resolution":{"observed_at":"2026-08-10T15:46:06.829122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.809084Z","title":"On measures of entropy and information,","venue":null,"work_id":"17b32ce3-87fc-4213-ad15-fd7db5121006","year":1961},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.810743Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:48631485f65d357bedd8db32ef13b4087505847d58df3530f97098dafb74158c","observation_id":"154f05ee-1211-4ecf-930b-6011c335d6ce","resolution":{"observed_at":"2026-08-10T15:46:06.813922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.793203Z","title":"Information measures and capacity of order α for discrete memoryless channels,","venue":null,"work_id":"9b6883ef-4643-46a1-9639-5a8da8c9d5bc","year":1977},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.816269Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:22d5223db4d8e50beb576389c88d778a4e59382b2be8399c873dc691022be17d","observation_id":"2c33ef87-c491-463d-bedf-8356b1a33085","resolution":{"observed_at":"2026-08-10T15:46:06.798023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.778366Z","title":"Encoding tasks and rényi entropy,","venue":null,"work_id":"8cf43943-6acf-409e-b434-0c85617bfae5","year":2014},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.821079Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:5ac65a0375615134563025512f6c05172f5908f1017b7288b33cd77b989e1d71","observation_id":"913eeb35-c98b-4b20-b2eb-eb864f45dbe6","resolution":{"observed_at":"2026-08-10T15:46:06.782965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.763092Z","title":"Distributed task encoding,","venue":null,"work_id":"688d93bf-b5e0-4903-a010-06a7a3de2580","year":2017},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.825930Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:fbc61c30e8692a28c28e52d636610297bfacc17eb059707579cc2e3291b8c927","observation_id":"c9eb8e60-a22a-4aa9-b443-865108d2dbc7","resolution":{"observed_at":"2026-08-10T15:46:06.767831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.747915Z","title":"Public vs private coin in bounded-round information,","venue":null,"work_id":"1f311b79-75cf-412f-83f8-72ee4cbbd5fc","year":2014},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.830668Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:468a378424dd1e37ff311cfe71515e46817901f7090db19eef84145d5e2bb915","observation_id":"1a58dd38-1933-4f60-9463-9e853287605c","resolution":{"observed_at":"2026-08-10T15:46:06.752793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.836209Z","title":"Channel simulation: Theory and applications to lossy compression and differential privacy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.836209Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:d1149ba59ae9241166a386b17aff67bca5af37121f02b6a16d4d1e6bcee30107","observation_id":"9d0c47fc-b592-4127-a61a-aee5b0157ca3","resolution":{"observed_at":"2026-08-10T15:46:05.836209Z","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-10T15:46:06.732791Z","title":"Extended Gray–Wyner system with complementary causal side information,","venue":null,"work_id":"38fbfe93-2976-4607-99f2-ce77cc93f005","year":2017},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.841314Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:833b142881140bdf366ab88adfe8b475d124d375870a428e46c98af892786332","observation_id":"e100e183-3e81-4365-b08b-5a3a438ab301","resolution":{"observed_at":"2026-08-10T15:46:06.737485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.717637Z","title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","venue":null,"work_id":"7d54354d-a3f3-4944-b982-63063023f89d","year":1971},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.846549Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:7c300960f5394cef91845b3da3286c82400c04b92a78192f03c47255ab2ff3cf","observation_id":"253e11d6-242c-40a1-84ef-351633bc878e","resolution":{"observed_at":"2026-08-10T15:46:06.722833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.702995Z","title":"From the information bottleneck to the privacy funnel,","venue":null,"work_id":"a6481226-16f7-4985-b189-fbc984a9367e","year":2014},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.851200Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:d855d684b6563ae5ac37e7a94f114d45404c3fc73973ce03a843eb6e722913fd","observation_id":"f92ee3b9-b8d1-4148-a7ca-8ccbff50e4ed","resolution":{"observed_at":"2026-08-10T15:46:06.707712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.688184Z","title":"A metric between probability distributions on finite sets of different cardinalities and applications to order reduction,","venue":null,"work_id":"6b2c054c-a671-43ec-821c-c8f86a0e167c","year":2012},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.855939Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:30146c98023f5b1779e71b2c1b6a01fd135ab6aac5816ab022b7edb43d60098b","observation_id":"82b13da7-6d84-468d-a870-71ef44ff38bd","resolution":{"observed_at":"2026-08-10T15:46:06.693110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.671456Z","title":"Entropic causal inference,","venue":null,"work_id":"07ffb19e-2ea9-45a1-be36-ea1fca4bb8dd","year":2017},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.860893Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:90e6ca833f8821935025ebea74773ef503c2f84f8557298254b5c1440e4f7aa7","observation_id":"65b5ea1c-732d-42b9-b790-7a4029f6c9e6","resolution":{"observed_at":"2026-08-10T15:46:06.676291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.656318Z","title":"Minimum-entropy couplings and their applications,","venue":null,"work_id":"31b09b1b-9f14-4236-b93d-3f1b2752511d","year":2019},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.865698Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:86e5315fbc1b30b4c471f298365eca51932209555a1b8c8d692da2b37a3dea3d","observation_id":"34d5a9d9-a188-48cd-a9ac-d81edfdf8c06","resolution":{"observed_at":"2026-08-10T15:46:06.661251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.640921Z","title":"Efficient approximate minimum entropy coupling of multiple probability distributions,","venue":null,"work_id":"dce10810-3886-40b5-a5de-ee09afe27f24","year":2021},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.870376Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:591ccf8047edd195cd042310841566a6b5da0ffacd97a61b1ced097810bafea7","observation_id":"0d687d59-eecc-4fff-bc4f-1847241b7586","resolution":{"observed_at":"2026-08-10T15:46:06.645797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.625785Z","title":"A new outlook on Shannon’s information measures,","venue":null,"work_id":"ed892bf5-8e0f-4f41-9bd5-ccbf803b4744","year":1991},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.874990Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:09aa2ce39a4b01665cacbf4b85a5cbf398d8012c8becb8630ac8c68b309ace7b","observation_id":"8441dbcf-0211-4619-9302-17f99b930831","resolution":{"observed_at":"2026-08-10T15:46:06.630518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.611094Z","title":"A logarithmic decomposition for information,","venue":null,"work_id":"d331bede-de52-4c33-ada2-3b1881469408","year":2023},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.879900Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:ef964b1269caabd963cd4ae610097e1403e91c8b1407724e59527ff9047aedd2","observation_id":"6d9385d9-59fe-49c0-b17f-78811ecf4ebc","resolution":{"observed_at":"2026-08-10T15:46:06.615944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.595474Z","title":"A Poisson decomposition for information and the information-event diagram,","venue":null,"work_id":"2c6f38e2-26bb-4b99-bc4c-4f4a9b64012a","year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.884794Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:d97ca341f2633895dfe6b5bd4b739170bd7893a46f37472db6329464e104bc47","observation_id":"2c0aa07c-661e-4196-a007-c5a878c9f4f6","resolution":{"observed_at":"2026-08-10T15:46:06.600477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.579983Z","title":null,"venue":null,"work_id":"4107460b-6337-4e92-931f-90cf82543e4e","year":2011},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.889542Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:16070ef984aa2c37c4a28122315bdcfa11da2795f4f4865f7dd796e3314b058d","observation_id":"4a609d89-76b0-4d8e-88d0-8728cf1224da","resolution":{"observed_at":"2026-08-10T15:46:06.584916Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.563987Z","title":"On channel simulation with causal rejection samplers,","venue":null,"work_id":"68d964e2-837a-4088-be0e-f76164629f8c","year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.894412Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:cec45f5d7d665abc48de2d02193bb52a1ab994befaf3dcd038bc7399cb029116","observation_id":"39930f70-0d81-48f8-a313-aacdf6fd6b0a","resolution":{"observed_at":"2026-08-10T15:46:06.568970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2501.14053","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:46:06.164231Z","title":"The redundancy of non-singular channel simulation,","venue":null,"work_id":"ed7e13c5-0dc5-4230-b352-ab6d0179401a","year":2025},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.898953Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:c9b8f98053b670936a9daef3dc1701348b3493dab82996de3d393454b1abce79","observation_id":"b2bffe90-db97-4060-b757-493a8c4921c1","resolution":{"observed_at":"2026-08-10T15:46:06.174049Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4324/9780203142608","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:46:06.028414Z","title":null,"venue":null,"work_id":"844be8b5-7f4c-415e-9b25-f755421cb1b6","year":1970},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.903685Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:2609a7a34703f29439680d052adfc19af23a603c690af1e8ebcc64b327783cf6","observation_id":"f2407ca9-ad00-40eb-9bd4-52e84cc9a2d4","resolution":{"observed_at":"2026-08-10T15:46:06.034860Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.548176Z","title":"Derivation of nested transport models within a mathematical programming framework,","venue":null,"work_id":"9898afa8-22b6-41a2-a424-8884ae464879","year":1989},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.908525Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:b7ff54a1886516f880ad03fb09cb97bf9d3246256b4921a1a5a7eaf92c234ca8","observation_id":"caf0af5a-ba74-42b6-b68b-466f9c41ec05","resolution":{"observed_at":"2026-08-10T15:46:06.552909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.533140Z","title":"An entropy-based modal split model,","venue":null,"work_id":"2b87bfff-a8cd-449e-9795-a9133d939428","year":1989},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.913221Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:4458f4270822fcb0240363747398f3f03720de4a9ad2bdc3bf6b3928927ca4fe","observation_id":"86476b56-6cc3-4eab-9abb-27e38babcb89","resolution":{"observed_at":"2026-08-10T15:46:06.537862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.516039Z","title":"A note on solution of large sparse maximum entropy problems with linear equality constraints,","venue":null,"work_id":"2b6f6880-a500-4f1e-a494-3d3aab982626","year":1980},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.918080Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:5c27a7e95d82ceedb4b162f68e882a109fba2e1ed84f17d1df0c02eceae56ddb","observation_id":"96f2a6a6-4780-48be-8fcc-1616b5127354","resolution":{"observed_at":"2026-08-10T15:46:06.521527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.498870Z","title":"Linear programming with entropic perturbation,","venue":null,"work_id":"4833c59c-8cae-42ab-9f91-015c8371efbd","year":1993},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.922997Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:c72d57b05516fa78b4fada0d6f2048d7ce54ca124517bcc07351c68378936afe","observation_id":"c87a1861-1262-4f7d-9a1b-c9dac9572741","resolution":{"observed_at":"2026-08-10T15:46:06.503924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.482933Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport,","venue":null,"work_id":"9b550fd9-05e8-4d8b-909d-ebd191b6573d","year":2013},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.927834Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:02bd9498c498d0f55ed44e2e8bffd56d1c743697da7361d13f15eb8bbfcb5ec8","observation_id":"9f0a3f59-0956-4c6d-8114-2cb409ab15fb","resolution":{"observed_at":"2026-08-10T15:46:06.487988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.467743Z","title":"An automated theorem proving framework for information-theoretic results,","venue":null,"work_id":"6d674047-dc5d-47fa-856a-8f7797c327b1","year":2023},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.932854Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:9c268ccac7051f1be1d917cf0814f650ecfb855309917cb9996193db38d320fd","observation_id":"3401f980-36ab-4542-8664-9855e824aca7","resolution":{"observed_at":"2026-08-10T15:46:06.472626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.452132Z","title":"The undecidability of conditional affine information inequalities and conditional independence implication with a binary constraint,","venue":null,"work_id":"bdc302e0-934d-4af8-ab0a-a555b127d542","year":2022},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.937624Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:cc8bb4843f37578280fc3df9bd5c26f93a7256e74b4f9e65876bc6996cad10c3","observation_id":"94c269f0-4f5a-4493-afc4-2328dcf7e8a0","resolution":{"observed_at":"2026-08-10T15:46:06.457294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.436351Z","title":"First-order theory of probabilistic independence and single-letter characterizations of capacity regions,","venue":null,"work_id":"7e8e64fe-4acb-42f5-a435-646945c8e33a","year":2023},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.942929Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:62bc4a4154119e027ab19aa5aa26cfa938b1ffe5edb38f9669d0e401470f9116","observation_id":"c463acbf-b434-4d13-856b-9dd3b80e99b4","resolution":{"observed_at":"2026-08-10T15:46:06.441430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.947464Z","title":"A method for the construction of minimum-redundancy codes,","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.947464Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:8b9361df8ffde13bb6baddc733edc8facc497adbb54489f27b11b629a3e5a778","observation_id":"d8aacbda-b684-4934-a14c-1243c365f3bf","resolution":{"observed_at":"2026-08-10T15:46:05.947464Z","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-10T15:46:06.410722Z","title":"Why the Shannon and Hartley entropies are ‘natural’,","venue":null,"work_id":"5dbf7864-9e10-4dc3-b3d3-ffda4f8780e4","year":1974},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.952062Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:f46ab6c4a737004cbfb834e3e127be33027529f69f04fbe3e848e018b96aa4ca","observation_id":"520155c3-962c-4694-9f1a-5956d0841911","resolution":{"observed_at":"2026-08-10T15:46:06.415715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.956911Z","title":"The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.956911Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:7b8565b3cf461faf2c59cd656f1be95fecaf266a6b4449ebbe71b30f052f5e58","observation_id":"d7083b08-ffd5-49ba-aee1-0ad16b45b6da","resolution":{"observed_at":"2026-08-10T15:46:05.956911Z","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-10T15:46:06.384747Z","title":"Adaptive greedy rejection sampling,","venue":null,"work_id":"d952a4b4-115b-42cd-a770-7de899e8b5c3","year":2023},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.961466Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:6343257318ac36241358de84f175d2e47b5c8c18bea3b57a97964816b61f5d2d","observation_id":"9a73f8f1-86b1-416d-bacc-1131e4f28447","resolution":{"observed_at":"2026-08-10T15:46:06.389815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:05.966268Z","title":"Compression of sources of probability distributions and density operators,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.966268Z"},"links":{"cited_paper":"/paper/quant-ph/0208131","citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:c5d8ee00b02f5a5fb02d839e231ab5b9ad4cbd690107ed8f316ff29e7fea62ec","observation_id":"dc47215f-df79-49d6-906c-6ee203c2a522","resolution":{"observed_at":"2026-08-10T15:46:05.966268Z","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-10T15:46:06.369100Z","title":"Pollard, A user’s guide to measure theoretic probability","venue":null,"work_id":"c77268d8-ae83-418e-a8ce-95d92684b025","year":2002},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.971200Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:d13e3c453e8dee66313351c37c3da52ae166dc497c391b5c1fa3c906bc7ddbea","observation_id":"7d7532df-ff8f-40e1-9ade-c905da7dbbe1","resolution":{"observed_at":"2026-08-10T15:46:06.374133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.352056Z","title":"A mathematical theory of communication,","venue":null,"work_id":"f9c37a2c-4bd9-4829-a94e-efffbc3b920b","year":1948},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.975859Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:a5e5080adbe046ba703ba7b927b78eadd0968cdb27d316faead9725f2e9abeba","observation_id":"09b78aa2-ee3a-4d60-8055-f380067992e2","resolution":{"observed_at":"2026-08-10T15:46:06.357576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.335466Z","title":"The complexity of nonuniform random number generation,","venue":null,"work_id":"6057293a-6c27-4989-9cfe-af31f68c5bbc","year":1976},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.981335Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:ac4502d91d5064a75a2178240e6dbec8b4aff0264acd056cd81be007ee286351","observation_id":"b628d71b-001d-4543-9db9-86fa5b743e12","resolution":{"observed_at":"2026-08-10T15:46:06.340581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.219329Z","title":"Optimal redundancy in exact channel synthesis,","venue":null,"work_id":"42e6f1fb-8a5f-4320-819d-d5967f37f210","year":2024},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.985859Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:73178401c0bfcefc7f9ad9dc2d2dad2b71c8425395c065f25155c1f9d7f69ef5","observation_id":"c23b1bce-b438-4c66-ac6c-f2c7eb3e7ff1","resolution":{"observed_at":"2026-08-10T15:46:06.324056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.203035Z","title":null,"venue":null,"work_id":"562054c6-ff24-4588-a399-e959197ab2ca","year":1963},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.990327Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:742a41952fc9ee6b64d030227a3804df3d9fc338a6a8af5d1aa99c73c2b9c74a","observation_id":"e5c2c73c-67fd-4495-8b90-9daf692e0d0c","resolution":{"observed_at":"2026-08-10T15:46:06.208060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T15:46:06.187113Z","title":"SymPy: symbolic computing in Python,","venue":null,"work_id":"4ce29276-c673-4f21-a9bf-d2dbf95378a7","year":2017},"citing_paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T15:46:05.995238Z"},"links":{"citing_paper":"/paper/2501.13736"},"observation_digest":"sha256:b6af056f87e18955edeecb0e5c845ecd37b553ca1db89956c34d1781216c6a84","observation_id":"b1325216-394c-4df9-86b9-9de7472f3755","resolution":{"observed_at":"2026-08-10T15:46:06.192162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13736","last_updated":"2026-07-27T16:29:59Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T15:36:59.290138Z","submitted_at":"2025-01-23T15:12:11Z","title":"Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":43},"total_outbound_references":56},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2501.13736."}