{"as_of":"2026-08-11T05:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:79c600a1c0ea02a055d77cabf6df56234ddcb29dfc30f8375d25011bf71d842c","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:31:41.951838Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2601.06688/citation-record","integrity":"/paper/2601.06688/integrity","json":"/paper/2601.06688/citation-record.json","paper":"/paper/2601.06688"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T11:31:37.718561Z","title":"Acharya, C.L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:37.718561Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:bfbcea056721a2ea70b58b007afaf323a2dc0594d587d9a3637287a48b7def16","observation_id":"a3fc0700-3924-4d75-836c-74764e228feb","resolution":{"observed_at":"2026-08-03T11:31:37.718561Z","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-03T11:31:37.768995Z","title":"Acharya, C.L","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:37.768995Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:33b01ea99c6b4d97dc77496339554d60d8ac8c3c9a6c707dbbe4d0ea8081eb18","observation_id":"796a9fcf-2bd4-4410-9b9b-e5c825735477","resolution":{"observed_at":"2026-08-03T11:31:37.768995Z","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-03T11:31:37.867377Z","title":"Acharya, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:37.867377Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:1cdee73b5a9e18a53e8d074a8c594173a6f62c56c211a370f9925881d5b68952","observation_id":"a5a0568e-5815-4e14-8598-5254f7536f13","resolution":{"observed_at":"2026-08-03T11:31:37.867377Z","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-03T11:31:38.025206Z","title":"Altuğ, A.B","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.025206Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:a0248892b85397982fd6fa58d80332f4852a338875428a9262f6a833e611a909","observation_id":"661c12d6-e214-47cd-b8ec-f68e7bd983ad","resolution":{"observed_at":"2026-08-03T11:31:38.025206Z","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-03T11:31:38.134990Z","title":"Bar-Yossef.The complexity of massive data set computations","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.134990Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:8307a5432e481b5c33e6d92de053d10ad0823b3cab528a566f8e5c7e96982ac7","observation_id":"ed26ca0a-2c29-4106-b45d-89f2b79c4fc2","resolution":{"observed_at":"2026-08-03T11:31:38.134990Z","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-03T11:31:38.245090Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.245090Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:1140ccd772d4d297423a61d62e9a107618f2bd21c1a18109dfe1e44781b5959e","observation_id":"da16cc0b-6d64-405e-a3c9-17a4bdf3834f","resolution":{"observed_at":"2026-08-03T11:31:38.245090Z","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-03T11:31:38.332237Z","title":"Canonne.A survey on distribution testing: Your data is big","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.332237Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:f254f2caef807437a1984f9abb0f40c89bf833df4698db9c65f5209ddb079073","observation_id":"5463cd24-bc8c-44cc-9b13-765b9ccaaa08","resolution":{"observed_at":"2026-08-03T11:31:38.332237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07198","last_updated":"2023-08-02T05:53:36Z","snapshot_observed_at":"2026-08-10T13:36:03.339909Z","submitted_at":"2022-02-15T05:12:43Z","title":"A short note on an inequality between KL and TV","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07198","snapshot_observed_at":"2026-08-03T11:31:38.384608Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.384608Z"},"links":{"cited_paper":"/paper/2202.07198","citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:fe5718aea442fca5e671ec4f7a6321abcbdd7795846b23a0c930a4ded15df620","observation_id":"622cb6a1-7129-49fb-8780-38a39ae74460","resolution":{"observed_at":"2026-08-03T11:31:38.384608Z","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-03T11:31:38.446463Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.446463Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:034e64ae7e3ec5558aef1bef62dbd79b0f4598102aa23a74c9c6671be30df25e","observation_id":"1988cbc4-68c5-4790-b9f4-07f13f9102b8","resolution":{"observed_at":"2026-08-03T11:31:38.446463Z","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-03T11:31:38.503125Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.503125Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:e59e34b96fd38ed20adec00dda520692f6b37d8d2591e2451bb3f0fb77223a51","observation_id":"9765d056-bf99-459f-94fe-d97073cf9e16","resolution":{"observed_at":"2026-08-03T11:31:38.503125Z","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-03T11:31:38.541055Z","title":"Cherapanamjeri and P.L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.541055Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:e56a3b14376363b743a550904bef9a8dd22cae5362f169f8bda42b158c631eb6","observation_id":"a6466cdc-39a8-4027-b4de-f44ae9c2e38d","resolution":{"observed_at":"2026-08-03T11:31:38.541055Z","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-03T11:31:38.620588Z","title":"Cover and J.A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.620588Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:fcf763ea366f0cf14e761de3089e576fde90705e9a024684b33dcff7c8ed4233","observation_id":"501c4f94-92eb-4453-a505-f9b37f64c0db","resolution":{"observed_at":"2026-08-03T11:31:38.620588Z","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-03T11:31:38.658350Z","title":"Csiszár and J","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.658350Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:8e0685dcd3843013b2d7d72d480eeacf55a8fddc0267bdcfcce9d03c24d7653b","observation_id":"65bcda8c-3ae1-4b64-9aed-1a00f2ca0c78","resolution":{"observed_at":"2026-08-03T11:31:38.658350Z","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-03T11:31:38.709362Z","title":"Csiszár and G","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.709362Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:46b63f5ac421a12247d0d669f402788403d8b5e22952332f681f113fd93162ea","observation_id":"941cae90-4b98-48cd-b26c-ec917ce616c4","resolution":{"observed_at":"2026-08-03T11:31:38.709362Z","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-03T11:31:38.765214Z","title":"Csiszár and P","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.765214Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:3018999cce30638ea722cfe9ba8329d3c98485f2378b7eda77f44daf001b342a","observation_id":"7105436e-6a65-41d4-bb97-7ce15d073195","resolution":{"observed_at":"2026-08-03T11:31:38.765214Z","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-03T11:31:38.814751Z","title":"Daskalakis and N","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.814751Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:9bc2197e6b7edf56c603bb4d6ec6b6e1c92769475d1396ad3d5ba08eab42e4ed","observation_id":"6e3c5a3f-3006-4f94-8daf-b6a19905ef5f","resolution":{"observed_at":"2026-08-03T11:31:38.814751Z","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-03T11:31:38.899101Z","title":"Diakonikolas, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:38.899101Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:f0d91fd47b0eda6ed02984b806c4f43a586b87776eaa4bc5b831249ae49c95c8","observation_id":"966878e4-9715-411d-948a-b19026a8d6ea","resolution":{"observed_at":"2026-08-03T11:31:38.899101Z","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-03T11:31:39.116884Z","title":"Diakonikolas, T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.116884Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:5ab7469200de0870e979087104883042cee582c1c584384344305eb983810be6","observation_id":"5780b978-8159-4d70-8aa3-933e42159f56","resolution":{"observed_at":"2026-08-03T11:31:39.116884Z","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-03T11:31:39.195973Z","title":"Diakonikolas, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.195973Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:e362590cea22cb8b1dde2cdcee71db40f0101f7a9cba7ed8ceabb5fedd304ad0","observation_id":"c870d8ca-0009-4b9a-aa37-84f83bf59d65","resolution":{"observed_at":"2026-08-03T11:31:39.195973Z","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-03T11:31:39.244568Z","title":"Diakonikolas, D.M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.244568Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:54478d60d90a835b9422377f2a27a076bf96f770c3042ceaf448fc478b7ae9c9","observation_id":"8d4618de-31e0-42f7-8ca2-c0315bf6f23b","resolution":{"observed_at":"2026-08-03T11:31:39.244568Z","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-03T11:31:39.281116Z","title":"Dobrushin","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.281116Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:7f5483ffba7d8a980edaa649a73dd155cb06018434a8866bfaca3bc67dbdaa81","observation_id":"f26e4df6-52b7-460d-8acf-10bd9e61c086","resolution":{"observed_at":"2026-08-03T11:31:39.281116Z","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-03T11:31:39.363929Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.363929Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:932a2558edde585bb45c1a3686def50c45ec1728bd6691283cad60a5ced35007","observation_id":"a8ba2603-d871-48b1-a639-944605202f84","resolution":{"observed_at":"2026-08-03T11:31:39.363929Z","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-03T11:31:39.393095Z","title":"Goldreich and D","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.393095Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:c878954ea95e106b504dfe6f12c7c2e11701c011bc3786d66b7cb9414ac79ce6","observation_id":"9a350d20-9190-4e74-be1c-733b67eb9ee3","resolution":{"observed_at":"2026-08-03T11:31:39.393095Z","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-03T11:31:39.464739Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.464739Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:7d62a0aff79561ca38181ed8600bf5d6b2df86ff5d0505b56dc4fe2cdfbab92a","observation_id":"5b041ae8-c6fe-4e0f-b657-60149dd7c795","resolution":{"observed_at":"2026-08-03T11:31:39.464739Z","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-03T11:31:39.546906Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.546906Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:9c06ff4bfd49c7cc49162feb395e98297b8d59a08539d910bc91d8291b3bc9a8","observation_id":"4a72d831-7778-4fc5-984c-439a83568d23","resolution":{"observed_at":"2026-08-03T11:31:39.546906Z","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-03T11:31:39.638619Z","title":"Ingster and I.A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.638619Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:350714e18166e722e601335e809e838d238fe775613f31495068c3ce074cf34d","observation_id":"4179daac-e97b-418a-a740-b9d5c7e9c81b","resolution":{"observed_at":"2026-08-03T11:31:39.638619Z","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-03T11:31:39.681848Z","title":"Jelinek.Probabilistic information theory: Discrete and memoryless models","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.681848Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:a3b3b8e93be3f74b5c633c60699683eaa966a28ca3485ac4427e40f6f442ac96","observation_id":"68e9443e-1112-4f1f-ac8d-1bdeff906ad8","resolution":{"observed_at":"2026-08-03T11:31:39.681848Z","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-03T11:31:39.712286Z","title":"Kontoyiannis","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.712286Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:aebcfc2c8e64cc16e8f3faeb5a90bd0b65ced745b2d3b7a8a5daf6f3bbf146a8","observation_id":"7aa8a44e-0980-4814-aabc-34094f2e3762","resolution":{"observed_at":"2026-08-03T11:31:39.712286Z","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-03T11:31:39.805180Z","title":"Kontoyiannis and S","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.805180Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:b78e37d67c3203a454c60cfab26e95f3b146b8c219588fc72f61d9c621ad4862","observation_id":"911b081f-c75f-447c-ada2-c889b49241bf","resolution":{"observed_at":"2026-08-03T11:31:39.805180Z","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-03T11:31:39.840590Z","title":"Kontoyiannis and S","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.840590Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:24311da49414147fe076a26042659e8170160a29ba44c714ab2d6b761409016f","observation_id":"2264e03a-56b6-42d5-a9bc-8c3b2bcb54dd","resolution":{"observed_at":"2026-08-03T11:31:39.840590Z","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-03T11:31:39.926829Z","title":null,"venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.926829Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:43f1cac06b8ebca6c027d6a98e74bd30ddd4c347066a712ed64212903cd323ca","observation_id":"0348a93e-543e-4fd3-bdf2-6fa3ba8e1399","resolution":{"observed_at":"2026-08-03T11:31:39.926829Z","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-03T11:31:39.994820Z","title":null,"venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:39.994820Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:631f8568f9dda3852da5fc80e708fe4f2bc5b8d95cee98e57d91ac6fa8ba84f2","observation_id":"42aa2172-9435-405f-bc0e-271d6cbfafac","resolution":{"observed_at":"2026-08-03T11:31:39.994820Z","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-03T11:31:40.093454Z","title":"Le Cam.Asymptotic methods in statistical decision theory","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.093454Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:47a1b9b6c6575b023a393aa97f2b913f43eaa68d20b8908307a4e57a23f4e840","observation_id":"a571e2b6-e7f0-4c9d-bac7-413ff97dc0f3","resolution":{"observed_at":"2026-08-03T11:31:40.093454Z","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-03T11:31:40.124438Z","title":"McMillan","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.124438Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:c8e60c46f9650a71cdb953c9d2b4b5f1246bcf7cb5ff84f0ff0582d391392de3","observation_id":"70b1dbe6-673b-4ca1-addf-7456bd55acce","resolution":{"observed_at":"2026-08-03T11:31:40.124438Z","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-03T11:31:40.215979Z","title":"Neyman and E.S","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.215979Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:a9f2e08236e4ab7ca9084e936d79de15e28d356dd48efdf8187d5e90b8b67828","observation_id":"08914a0c-a01e-4286-a39c-40f5d4be0f36","resolution":{"observed_at":"2026-08-03T11:31:40.215979Z","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-03T11:31:40.348306Z","title":"Paninski","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.348306Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:51a3caf6a75b29c8edc87acb92ddd571503d464bfda1eacfa7b1b1a0549d2444","observation_id":"763235c3-3361-4601-851c-7c20c4dbd12f","resolution":{"observed_at":"2026-08-03T11:31:40.348306Z","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-03T11:31:40.474430Z","title":"Pensia, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.474430Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:f4ef02a33d3b25f4da87be02b8c7290053587710bbad0c6d3a87f4c65e6b900f","observation_id":"50f8b192-d36a-4771-ab64-17905bbb7179","resolution":{"observed_at":"2026-08-03T11:31:40.474430Z","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-03T11:31:40.624741Z","title":"Rached, F","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.624741Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:dfe061975ed83a8ff6967e6fce69444883b4b41d6e78a1f14715bd72c38728db","observation_id":"6f63f81c-f3d3-4f5f-8374-bf548a2ee1ed","resolution":{"observed_at":"2026-08-03T11:31:40.624741Z","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-03T11:31:40.694744Z","title":"Seneta.Non-negative matrices and Markov chains","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.694744Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:50bb639e9396d24820d21175aa446bad066f1f1924a12992e64b60aeaa7c10ee","observation_id":"b394cf0b-0d88-47d1-961b-d2fc78343aae","resolution":{"observed_at":"2026-08-03T11:31:40.694744Z","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-03T11:31:40.798346Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:40.798346Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:f4e74cbcffd94aa6d8461df7dc5a31e5f4af9d01550d7afe18d4b3d8f85a52e7","observation_id":"57a86252-fca3-4d35-bbaa-1072e07e96e2","resolution":{"observed_at":"2026-08-03T11:31:40.798346Z","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-03T11:31:41.013662Z","title":"Strassen","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.013662Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:cf0e2d9fd00633c9e162bd69e3863ae6fc02ed7f979d741f8b70dd1bb0392a23","observation_id":"0b187b4c-c316-46f3-a18c-6f6b8fd53f72","resolution":{"observed_at":"2026-08-03T11:31:41.013662Z","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-03T11:31:41.095692Z","title":"Theocharous, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.095692Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:8e32e72dfe4e5b086f83743a2fd6584b02e20be0901ffc76e68f7f513f7b9051","observation_id":"f168af96-ea3e-4e07-9baf-c4f7b5d0a322","resolution":{"observed_at":"2026-08-03T11:31:41.095692Z","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-03T11:31:41.184745Z","title":"Valiant and P","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.184745Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:05d61e73fed203e749ab92dae402d3d9df870767516608ef9d2985caf5faeaf9","observation_id":"e943cf8d-4ddb-470f-b3de-32af78d239d6","resolution":{"observed_at":"2026-08-03T11:31:41.184745Z","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-03T11:31:41.364082Z","title":"van Erven and P","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.364082Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:f0c4d4692ed91eb7f4bf422d42cd09ff803521e3ea9ffdda8cfc57bcf735cd9d","observation_id":"8de21cf6-5a2c-441e-be4b-78dad52b05bd","resolution":{"observed_at":"2026-08-03T11:31:41.364082Z","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-03T11:31:41.444572Z","title":null,"venue":null,"work_id":null,"year":1945},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.444572Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:90d697eb841163234780440a63e1cb7e76ba7a27050733b7743d03e076c6fa1e","observation_id":"1c1a5627-14ba-40f2-8eea-8cd0d1dafc94","resolution":{"observed_at":"2026-08-03T11:31:41.444572Z","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-03T11:31:41.514748Z","title":"Wald.Statistical decision functions","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.514748Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:9ef29b410f4777d4004c7129900309341db2135f99f3ca2b67b0d121af97c711","observation_id":"ee59271e-c1af-4d5e-89a1-5450ef1395ef","resolution":{"observed_at":"2026-08-03T11:31:41.514748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04863","last_updated":"2023-12-08T06:38:11Z","snapshot_observed_at":"2026-08-08T16:00:25.597107Z","submitted_at":"2023-12-08T06:38:11Z","title":"Information divergences of Markov chains and their applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04863","snapshot_observed_at":"2026-08-03T11:31:41.616787Z","title":"Wang and M.C.H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.616787Z"},"links":{"cited_paper":"/paper/2312.04863","citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:cb577540fbc6d5d702c6acfecdf7b200e01b7ee0b8f253ceb8f973bc8925bccf","observation_id":"4bb99648-4860-46ed-8508-9363fb28fb8d","resolution":{"observed_at":"2026-08-03T11:31:41.616787Z","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-03T11:31:41.748119Z","title":"Wolfer and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.748119Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:cc4f92afe0f1e13372c3a4a4a63bc01832c0e58412af27d47ed42ce65391a1eb","observation_id":"75fd0e0d-295c-431a-84c9-3297c429e945","resolution":{"observed_at":"2026-08-03T11:31:41.748119Z","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-03T11:31:41.859817Z","title":"Wolfer and A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.859817Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:229832ed1d95d567b3881d0ce152d2794b99f4fd1f00b7d6e399d1658d791fa3","observation_id":"39c864d5-1b8c-41a0-8232-d60a53bbbfe2","resolution":{"observed_at":"2026-08-03T11:31:41.859817Z","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-03T11:31:41.906511Z","title":"Yushkevich","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.906511Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:e79e622ff06982956bf24c599e7fd12659c1f33d5cc2019792e8c34657bd536d","observation_id":"d57bf907-6abf-4724-9c56-d97c4ad195e4","resolution":{"observed_at":"2026-08-03T11:31:41.906511Z","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-03T11:31:41.951838Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression","version":5},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T11:31:41.951838Z"},"links":{"citing_paper":"/paper/2601.06688"},"observation_digest":"sha256:e4e57287546133f6784dff6ca55d046db25e34908ba60ed3dd4f01e7a8ad80de","observation_id":"15378d12-e730-4a05-8a40-af14fb8d4ac8","resolution":{"observed_at":"2026-08-03T11:31:41.951838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.06688","last_updated":"2026-06-09T14:33:11Z","latest_version":5,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T10:28:40.976750Z","submitted_at":"2026-01-10T21:24:43Z","title":"The Sample Complexity of Lossless Data Compression"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":51},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2601.06688."}