{"as_of":"2026-08-08T11:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ddf8cfff651fbd73998a143bc426fd3242aa89c8960e97e2af5eadc5c6a011c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:44:13.233478Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-03T23:09:00.967428Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.08162","last_updated":"2018-11-20T10:12:55Z","snapshot_observed_at":"2026-08-07T19:27:18.739150Z","submitted_at":"2018-11-20T10:12:55Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.08162","snapshot_observed_at":"2026-08-06T16:44:13.233478Z","title":"Deepzip: Lossless data compression using recurrent neural networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12805","last_updated":"2025-07-17T05:46:08Z","snapshot_observed_at":"2026-08-06T16:35:52.142099Z","submitted_at":"2025-07-17T05:46:08Z","title":"PMKLC: Parallel Multi-Knowledge Learning-based Lossless Compression for Large-Scale Genomics Database","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:44:13.233478Z"},"links":{"cited_paper":"/paper/1811.08162","citing_paper":"/paper/2507.12805"},"observation_digest":"sha256:5a7ef5124612c84833a3811b1a383f07fca0a1a994d3b431c5ef7e05d1986830","observation_id":"2b733c4e-0993-415a-8b08-d4a27e062e69","resolution":{"observed_at":"2026-08-06T16:44:13.233478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.08162","last_updated":"2018-11-20T10:12:55Z","snapshot_observed_at":"2026-08-07T19:27:18.739150Z","submitted_at":"2018-11-20T10:12:55Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":"1811.08162","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.08162","snapshot_observed_at":"2026-07-03T23:09:00.967428Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","venue":"cs.CL","work_id":"2b8e8a51-42c4-4661-acf9-6810c6305d3a","year":2018},"citing_paper":{"arxiv_id":"2606.08184","last_updated":"2026-06-06T14:12:54Z","snapshot_observed_at":"2026-07-06T23:47:43.942733Z","submitted_at":"2026-06-06T14:12:54Z","title":"TextEconomizer: Enhancing Lossy Text Compression with Denoising Transformers and Entropy Coding","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T19:54:39.953302Z"},"links":{"cited_paper":"/paper/1811.08162","citing_paper":"/paper/2606.08184"},"observation_digest":"sha256:72186bc9a873fea8d7d2deb0d7eeef29f019cca11313c9397d8cbe9e7a3216b1","observation_id":"487131cc-b438-467e-9805-655de7a49105","resolution":{"observed_at":"2026-07-02T21:07:24.264887Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.08162","last_updated":"2018-11-20T10:12:55Z","snapshot_observed_at":"2026-08-07T19:27:18.739150Z","submitted_at":"2018-11-20T10:12:55Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":"1811.08162","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.08162","snapshot_observed_at":"2026-07-03T23:09:00.967428Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","venue":"cs.CL","work_id":"2b8e8a51-42c4-4661-acf9-6810c6305d3a","year":2018},"citing_paper":{"arxiv_id":"2606.17712","last_updated":"2026-06-16T09:22:39Z","snapshot_observed_at":"2026-08-07T09:16:02.724381Z","submitted_at":"2026-06-16T09:22:39Z","title":"The 2026 Algorithmic Information Theory Data Compression Challenge","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T23:01:58.285759Z"},"links":{"cited_paper":"/paper/1811.08162","citing_paper":"/paper/2606.17712"},"observation_digest":"sha256:da9f67d89e83ba88200344ed8c9e478748417c8638e6236e6fad5b35c29b3e51","observation_id":"e4584c40-4f8a-4df7-854d-f881ddedd5c7","resolution":{"observed_at":"2026-07-03T23:09:00.969231Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.08162","last_updated":"2018-11-20T10:12:55Z","snapshot_observed_at":"2026-08-07T19:27:18.739150Z","submitted_at":"2018-11-20T10:12:55Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.08162","snapshot_observed_at":"2026-07-31T21:25:42.174202Z","title":"arXiv preprint arXiv:1811.08162 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-04T13:24:50.941163Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.174202Z"},"links":{"cited_paper":"/paper/1811.08162","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:e98d6c0ec4e1209399045761567d2fbb45a79d8bb76d3706d7fe273ae483faff","observation_id":"5fbefddc-504c-4e93-8ba8-81c4222e4347","resolution":{"observed_at":"2026-07-31T21:25:42.174202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1811.08162/citation-record","integrity":"/paper/1811.08162/integrity","json":"/paper/1811.08162/citation-record.json","paper":"/paper/1811.08162"},"outbound":[],"paper":{"arxiv_id":"1811.08162","last_updated":"2018-11-20T10:12:55Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T19:27:18.739150Z","submitted_at":"2018-11-20T10:12:55Z","title":"DeepZip: Lossless Data Compression using Recurrent Neural Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1811.08162."}