{"as_of":"2026-08-09T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c34b1cebd9e10746fbf056dac6faeefc74bd522d35e6dd41660c83a618ec34a5","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T03:04:31.761825Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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/2605.23323/citation-record","integrity":"/paper/2605.23323/integrity","json":"/paper/2605.23323/citation-record.json","paper":"/paper/2605.23323"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Timofte, R","venue":null,"work_id":"55a90204-aabf-4b84-8179-ba0871f94662","year":2017},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:cebd79ea28de9c21130f53500e568e7eac8e77ce9c7fc212e87f10e0bdb4cd1e","observation_id":"ae962dd0-afef-4c96-bc13-47640e5f34a9","resolution":{"observed_at":"2026-05-25T03:05:17.500465Z","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":"2011.03029","last_updated":"2020-11-05T18:40:50Z","snapshot_observed_at":"2026-08-09T03:55:25.994986Z","submitted_at":"2020-11-05T18:40:50Z","title":"CompressAI: a PyTorch library and evaluation platform for end-to-end compression research","version":1},"cited_work":{"arxiv_id":"2011.03029","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.03029","snapshot_observed_at":"2026-07-04T07:29:38.439715Z","title":"CompressAI: a pytorch libra ry and evaluation platform for end -to-end compression research","venue":null,"work_id":"8fda31f2-b319-4214-81c8-a9bd2fcb60c4","year":2011},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"cited_paper":"/paper/2011.03029","citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:99abc9ce9718f7416a774ec92681d191e948bfdb63aff01286ed45fe3b1d79d6","observation_id":"a5712832-bb14-4446-845b-fadb35c3b542","resolution":{"observed_at":"2026-05-25T03:05:16.646586Z","resolver_source":"arxiv_id","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":{"arxiv_id":"1311.2540","last_updated":"2014-01-06T11:35:10Z","snapshot_observed_at":"2026-08-08T01:03:44.466292Z","submitted_at":"2013-11-11T19:21:53Z","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","version":2},"cited_work":{"arxiv_id":"1311.2540","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.2540","snapshot_observed_at":"2026-07-04T10:29:45.534188Z","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","venue":"cs.IT","work_id":"98a5f432-b8a7-4070-b535-be281b7c7a81","year":2013},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"cited_paper":"/paper/1311.2540","citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:6efe2c9166849702b2cf6c0e4bac2f4525f4a58127a880a8180a32781a7f2e11","observation_id":"906017e4-771c-44ae-8993-b5d1e8f0bc1b","resolution":{"observed_at":"2026-05-25T03:05:16.655501Z","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":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":"1312.6114","doi":"10.2139/ssrn.4269703","metadata_source":"pith","pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Auto-Encoding Variational Bayes","venue":"stat.ML","work_id":"97d95295-30e1-42b4-bbf6-85f0fa4edb44","year":2013},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:9047be1d8cffce43d44893d903c40dc6b553230e2e1d67e0fe6694802dfe2743","observation_id":"4eb4b0ed-0e1e-46c2-b412-7570d6279942","resolution":{"observed_at":"2026-05-25T03:05:16.660020Z","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":"2012.22277","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Muckley, M","venue":null,"work_id":"1338a489-6d13-45ce-9f67-6a0ce4e1b815","year":2012},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:28f352e27f2ab58809c74de22b24f6ee085f95342b664ccbfe3df433df2151d1","observation_id":"718b0e4d-643c-44bb-81b5-0275417046cb","resolution":{"observed_at":"2026-05-25T03:05:16.650926Z","resolver_source":"arxiv_id","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":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-07-06T03:53:32.549552Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":"1409.1556","doi":"10.48550/arxiv.1409.1556","metadata_source":"pith","pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","venue":"cs.CV","work_id":"1c4b4409-c14b-488b-a086-c57a5aab8a29","year":2014},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:4c6a759c95112784884d6750bb81a8cf03a02882c7b51f175c591336c4917eff","observation_id":"984dcd67-ed72-43bd-b22b-2050b16d4120","resolution":{"observed_at":"2026-05-25T03:05:16.665414Z","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-07-12T23:51:07.915518+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T23:51:07.915518+00:00","source":"openalex_status_cache"},{"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-06-05T21:23:00.469572Z","title":"Wallace, G","venue":null,"work_id":"b0a461b1-ac32-450e-9b34-f6ccb070d024","year":2025},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:1db5a74ac9d31b8d5b094b1e02aefad37522c72f8cf0b3fef164e32fc0ba56a2","observation_id":"4fe3e7c0-3cdb-445a-97e8-5d9fd66b79a7","resolution":{"observed_at":"2026-05-25T03:05:17.517923Z","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-06-05T21:23:00.469572Z","title":"P., and Bovik, A","venue":null,"work_id":"f927a788-c55b-4109-98b4-c220851f6ad8","year":2003},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:d381a0b5eb5655dc38398792127c04a313ed5b269e91e452715912f66de8d623","observation_id":"f2ea2443-12d9-4e1b-a67d-f152662b7cfd","resolution":{"observed_at":"2026-05-25T03:05:17.521378Z","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-06-05T21:23:00.469572Z","title":"• Section B describes the model implementation and bitstream packing methods","venue":null,"work_id":"487b5842-9d5e-4b45-b728-abbc9308b672","year":2000},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:869cffacddb3d6489195a6a18499aca5cc52ade4bda6fed535106c9f98fc95f1","observation_id":"7402496c-6867-426a-a27e-9251937cd98b","resolution":{"observed_at":"2026-05-25T03:05:17.525382Z","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-06-05T21:23:00.469572Z","title":"To support multiple bitrates, we use a set of independent RVQ modules, where each RVQ uses a different number of codebooks m","venue":null,"work_id":"d9a81774-9d1b-46e9-95f4-5aa766d224fb","year":2023},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:ddb33731efed17ea40d016d19c5cabb04e5c23f10a0b7f231f49b43da6cdb027","observation_id":"903d7a8e-c21c-4cab-9eb2-9f9938b49230","resolution":{"observed_at":"2026-05-25T03:05:17.529225Z","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-06-05T21:23:00.469572Z","title":"The header takes 28 bits for H and W and 4 bits for q, which is negligible compared to the overall bitrate","venue":null,"work_id":"7463a334-4a4f-436c-bdf6-960ed4da2681","year":2025},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:ccf9187899d77441ec5c6d2ed9cc36873d6f070eb943c97261cbfdc56a049efa","observation_id":"f2b3b36a-d0d0-49cf-a867-992862e9be73","resolution":{"observed_at":"2026-05-25T03:05:17.514531Z","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-06-05T21:23:00.469572Z","title":"UQ+EC” and “VQ+EC","venue":null,"work_id":"d17c431c-de80-4594-90bd-fa7d0a6d7f8a","year":2022},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:0bf7807e894e56876cfeab6b0530f6e804e707291f90a232bb191937a03e29d4","observation_id":"f1b89c71-c324-45d6-8ed2-5882b9ceae3c","resolution":{"observed_at":"2026-05-25T03:05:17.507673Z","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-06-05T21:23:00.469572Z","title":"Best results are inbold","venue":null,"work_id":"b3578ce5-9b11-4e6d-aac9-498ce8f2cf67","year":2020},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:e352cd841b3c12acf0ca2fd96ab737cfece206f7bc29036025adeb610eb0a92f","observation_id":"e8d69d4b-6a73-4688-bdbe-818dc13dcb9e","resolution":{"observed_at":"2026-05-25T03:05:17.510842Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enc./Dec","venue":null,"work_id":"4918e877-1817-443b-b73f-db790b93a851","year":1920},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:03435ea3f806010286b1ca7cddfb27b63f69ee8d053466dd201ee93a221b31df","observation_id":"d901ec23-9877-4e65-8a02-81c4424b411d","resolution":{"observed_at":"2026-05-25T03:05:17.493339Z","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-06-05T21:23:00.469572Z","title":"We compare against the stronger entropy coding implementations in DCVC-RT (Jia et al., 2025)","venue":null,"work_id":"df9e33e0-9b33-4068-a9dc-c6fe2ccffb4e","year":2018},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:f0a8b4848dd4a4c97a7d42217cf8cc9c5cb1d2ae69e32345b4356ea5565d8cce","observation_id":"f43fca7f-ba2b-4a89-a9c2-c28e94ab3040","resolution":{"observed_at":"2026-05-25T03:05:17.485860Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4b09cc43-19b9-4a67-b092-a4936124d086","year":2003},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:c27793b6df3b48d950e928db6f0bcffcb3d7505b71f447f061ef5ca30a1eb9f4","observation_id":"205cb539-2e8d-41d3-816b-757e921c1951","resolution":{"observed_at":"2026-05-25T03:05:17.489526Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a59aabc1-04ba-48ac-830d-75d8185e88b5","year":2025},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:d0ee3c4df9aa59d879792ded3fe3f483a8ba687e997f79a999ddb4a858202389","observation_id":"bb088cea-e811-422a-88c7-2ffca8a5bbec","resolution":{"observed_at":"2026-05-25T03:05:17.497005Z","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-06-05T21:23:00.469572Z","title":"This protocol crops images into 256×256 non-overlapping patches to significantly aug- ment the sample size, thereby ensuring a more accurate and robust calculation of both metrics","venue":null,"work_id":"b85a7f62-f3a0-4b14-890f-0234765c87b7","year":2018},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:afc91131ee12689ba38b7a8e24cb95620da472da592aff00228715352962687a","observation_id":"ca7df46c-5524-4c8f-9ec1-617e16b0e2b5","resolution":{"observed_at":"2026-05-25T03:05:17.504305Z","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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7429493f-abfb-4472-ba00-a500bb1f69de","year":2020},"citing_paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T03:04:31.761825Z"},"links":{"citing_paper":"/paper/2605.23323"},"observation_digest":"sha256:a0e2da6dd2d2dd83eb2709646abc686b5146bda618ff09eab7b1cf29177d992b","observation_id":"8a7d9c9e-e812-4cff-927e-a5090a61d6c6","resolution":{"observed_at":"2026-05-25T03:05:17.482325Z","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"}}],"paper":{"arxiv_id":"2605.23323","last_updated":"2026-05-22T07:37:30Z","latest_version":1,"primary_category":"eess.IV","snapshot_observed_at":"2026-07-06T23:33:34.409634Z","submitted_at":"2026-05-22T07:37:30Z","title":"Efficient Learned Image Compression without Entropy Coding"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":10},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2605.23323."}