{"as_of":"2026-08-13T23:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:489617fe993e396fdb83be82233b6ab575a0728f62d820e5f8efd4748092306e","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:27:43.244031Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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-08-11T11:53:40.575460Z","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-08-11T11:53:40.721059Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"cited_work":{"arxiv_id":"2412.16642","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.16642","snapshot_observed_at":"2026-08-11T11:53:40.721059Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","venue":"cs.CL","work_id":"90d4e8f5-f387-4756-8a5d-ee6a18817a37","year":2024},"citing_paper":{"arxiv_id":"2412.14847","last_updated":"2025-01-05T13:54:06Z","snapshot_observed_at":"2026-08-13T15:39:02.834395Z","submitted_at":"2024-12-19T13:39:24Z","title":"A Survey of RWKV","version":2},"reference_index":263,"source":"pdf_text","source_observed_at":"2026-08-11T11:53:40.575460Z"},"links":{"cited_paper":"/paper/2412.16642","citing_paper":"/paper/2412.14847"},"observation_digest":"sha256:bb75e077dcd466a8df9a2354a3ac6e8c3c1ce1a229444382af2ad6ff3241be0b","observation_id":"639576fa-76c9-4b77-abe9-40f11599dda2","resolution":{"observed_at":"2026-08-11T11:53:40.726782Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.16642/citation-record","integrity":"/paper/2412.16642/integrity","json":"/paper/2412.16642/citation-record.json","paper":"/paper/2412.16642"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.09937","last_updated":"2024-08-19T13:55:42Z","snapshot_observed_at":"2026-08-13T00:29:44.000863Z","submitted_at":"2024-04-15T17:03:41Z","title":"Compression Represents Intelligence Linearly","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.09937","snapshot_observed_at":"2026-08-11T10:27:43.188827Z","title":"arXiv:2404.09937","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.188827Z"},"links":{"cited_paper":"/paper/2404.09937","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:966be8502666e2a85b1de889ba0dd2f134f8b0432ac731653c5c03407d46722e","observation_id":"df95277d-80a4-4d91-a0ea-320ca6af8b25","resolution":{"observed_at":"2026-08-11T10:27:43.188827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03626","last_updated":"2024-12-12T23:03:54Z","snapshot_observed_at":"2026-08-13T18:20:06.144481Z","submitted_at":"2024-04-04T17:48:28Z","title":"Training LLMs over Neurally Compressed Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03626","snapshot_observed_at":"2026-08-11T10:27:43.196823Z","title":"arXiv:2404.03626","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.196823Z"},"links":{"cited_paper":"/paper/2404.03626","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:beb913c6acb3b06b56788e0ec388fec226c0d490d449e65740c896cf5b9f35b1","observation_id":"b23d894d-9ad1-4b35-a56e-6f0a8a8fb56d","resolution":{"observed_at":"2026-08-11T10:27:43.196823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-09T20:34:52.923500Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-11T10:27:43.201033Z","title":"arXiv:1711.05101","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.201033Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:9dfdae09946045ebd2b4d2bad1b68529a43d1f9eb30d84454b99fc3871f51ae5","observation_id":"b13ba405-83cd-43e8-98a6-f4b1e15a97b5","resolution":{"observed_at":"2026-08-11T10:27:43.201033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18376","last_updated":"2024-10-07T13:17:03Z","snapshot_observed_at":"2026-08-13T04:08:11.826282Z","submitted_at":"2024-02-28T14:52:15Z","title":"Tokenization Is More Than Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18376","snapshot_observed_at":"2026-08-11T10:27:43.216274Z","title":"arXiv:2402.18376","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.216274Z"},"links":{"cited_paper":"/paper/2402.18376","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:1a61af46b5add3a56f93bebcebfc1731da7187ba4c0dedcb6e95b6d0fcd7817a","observation_id":"c5bdfea5-b1b3-4450-a838-e90c83b15968","resolution":{"observed_at":"2026-08-11T10:27:43.216274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.04050","last_updated":"2023-06-26T18:03:12Z","snapshot_observed_at":"2026-08-13T11:23:02.470085Z","submitted_at":"2023-06-06T22:42:00Z","title":"LLMZip: Lossless Text Compression using Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.04050","snapshot_observed_at":"2026-08-11T10:27:43.228319Z","title":"arXiv:2306.04050","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.228319Z"},"links":{"cited_paper":"/paper/2306.04050","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:5e43018ad48c04a02c2d2e52460d4f69c94c99f650c6380a341481f0f5510b94","observation_id":"b1d11021-7384-424a-980f-341beec7394d","resolution":{"observed_at":"2026-08-11T10:27:43.228319Z","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-11T10:27:43.433189Z","title":"HiRA is configured with a single bypass branch and a rank set to four times the main branch’s dimension, which has been proved as the optimal configuration in the main paper","venue":null,"work_id":"66aabb5e-209d-4234-a57d-a2f92e110fb7","year":2021},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.240309Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:32d063fe4d53a43c9563abe8323317a1b7fe1b1add2afc4451a5147b1c4d880d","observation_id":"af8d2de1-729e-4cc4-913d-2a87bd538d98","resolution":{"observed_at":"2026-08-11T10:27:43.437685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T10:27:43.418392Z","title":"However, these models typically involve excessive computational complex- ity","venue":null,"work_id":"1380a2a0-e13b-4769-a22d-6c7bf4d25352","year":2024},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.244031Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:947e53986311fe8bef6b66fd95a8742716f3f434d4b3551e03ec00ae63e81170","observation_id":"0e8dc3ba-9355-463a-9134-437be4a77efd","resolution":{"observed_at":"2026-08-11T10:27:43.423612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-11T10:27:43.224343Z","title":"Bell Syst","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":1948,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.224343Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:589e58ca2746938d1696bf4c5d6b0af55dfd38c8ab2fac533a4c2aa71217b59a","observation_id":"c30d724f-1152-4c47-984f-6cf9e2cfe3af","resolution":{"observed_at":"2026-08-11T10:27:43.224343Z","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-11T10:27:43.444893Z","title":"https://xiph.org/flac/","venue":null,"work_id":"d2adaf15-3678-468a-b879-db103ea6d554","year":2024},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.235961Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:a876d47837809d0139c90a3ffc305dc1b56b8d76eceab135192180d6accfbe04","observation_id":"6f2435fc-7ee8-4298-b614-07ff5bdb99c2","resolution":{"observed_at":"2026-08-11T10:27:43.448697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T10:27:43.467366Z","title":"Cambridge University Press","venue":null,"work_id":"38175a62-e823-4fba-bbbd-8fb999a9326f","year":2024},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.204815Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:aa1cf24ac9e3fff0dfa489e16e03dfa51ccfa5532f54da20e31b8569c296ae41","observation_id":"88e97eb5-eb70-423f-983b-63a9f0fae2f8","resolution":{"observed_at":"2026-08-11T10:27:43.471081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T10:27:43.479300Z","title":"In 2009 IEEE conference on computer vision and pattern recognition, 248–255","venue":null,"work_id":"659ff6dd-0252-41fa-8f74-e8230fa7a754","year":2009},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.169198Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:0f3448a395297ff4d1eb4f1e779d0778ffe2e47adf355176c29d8d6d8f5c40af","observation_id":"88ad349e-2fdc-4fae-a78f-4f45bdfce480","resolution":{"observed_at":"2026-08-11T10:27:43.483500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2540","snapshot_observed_at":"2026-08-11T10:27:43.172829Z","title":"ArXiv:1311.2540","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.172829Z"},"links":{"cited_paper":"/paper/1311.2540","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:bb6f98f457bac2f8e9ef3d68456fff06585f511e50720f7b336d4ebb85d5634b","observation_id":"9b7ffd01-e992-4901-8236-a3d4abbaef16","resolution":{"observed_at":"2026-08-11T10:27:43.172829Z","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-11T10:27:43.456067Z","title":"In 2015 IEEE international conference on acoustics, speech and signal processing (ICASSP), 5206–5210","venue":null,"work_id":"d3f165d0-ac71-48c7-9d0d-3732fe76c857","year":2015},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.208727Z"},"links":{"citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:06ab8f90417d79ff5edfd3764f133572d5f7ca3d609c5f44372468b65dbe895c","observation_id":"85f99ebc-2ce3-463c-8383-21ca209df313","resolution":{"observed_at":"2026-08-11T10:27:43.459912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.07909","last_updated":"2016-06-10T14:45:08Z","snapshot_observed_at":"2026-08-13T18:41:35.355818Z","submitted_at":"2015-08-31T16:37:31Z","title":"Neural Machine Translation of Rare Words with Subword Units","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.07909","snapshot_observed_at":"2026-08-11T10:27:43.220306Z","title":"arXiv:1508.07909","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.220306Z"},"links":{"cited_paper":"/paper/1508.07909","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:096742fd57956326f4e6284b6ef3c342abd80961db30ac15ca777b6e487be555","observation_id":"5e38163e-5a17-4ebe-84df-1e707a02d8da","resolution":{"observed_at":"2026-08-11T10:27:43.220306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-11T10:27:43.231973Z","title":"arXiv:1706.03762","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.231973Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:0d00b7f4856959cf1628b37b18e805ae6cfc20b169036059e4c8b9d929a7c7bc","observation_id":"af97930e-e8a5-4550-a5d5-63d11dfd9152","resolution":{"observed_at":"2026-08-11T10:27:43.231973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.02860","last_updated":"2019-06-02T21:21:48Z","snapshot_observed_at":"2026-07-06T07:25:48.468658Z","submitted_at":"2019-01-09T18:28:19Z","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.02860","snapshot_observed_at":"2026-08-11T10:27:43.164297Z","title":"arXiv:1901.02860","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.164297Z"},"links":{"cited_paper":"/paper/1901.02860","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:5ffe50879b2ec87c64e9bfb83dcb320cbdc393f82cbd0ba1e154fa7b6ca6624f","observation_id":"b6e7f81b-11fc-4bfa-9e11-d14954e80f45","resolution":{"observed_at":"2026-08-11T10:27:43.164297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-11T10:27:43.192827Z","title":"arXiv preprint arXiv:2001.08361","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.192827Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:9124b0d1668a3e3af579f7c2f1f120576ce97a8b1124553b614d4eaa6e11fdd3","observation_id":"6fdd98e8-8c4b-47c1-8297-3162041e66c3","resolution":{"observed_at":"2026-08-11T10:27:43.192827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-11T08:20:29.798517Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-11T10:27:43.185037Z","title":"arXiv:2106.09685","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.185037Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:e242c5b1e01ea320df3bb053e4ad073f1b3795d9ff09fdf625a9b2d3428d1eeb","observation_id":"7d2ad5bb-5338-4734-977d-386f3cdc1aaf","resolution":{"observed_at":"2026-08-11T10:27:43.185037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-08-09T19:52:33.533277Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-11T10:27:43.181213Z","title":"arXiv preprint arXiv:2203.15556","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.181213Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:4622fe8b2aa4140ccf475be79d1cf294f819a1f4afe80e8347fefcf5fe7129ab","observation_id":"a31ecf3e-7112-4151-8e2b-fae314bb27ca","resolution":{"observed_at":"2026-08-11T10:27:43.181213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13048","last_updated":"2023-12-11T03:58:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-22T13:57:41Z","title":"RWKV: Reinventing RNNs for the Transformer Era","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13048","snapshot_observed_at":"2026-08-11T10:27:43.212408Z","title":"arXiv:2305.13048","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.212408Z"},"links":{"cited_paper":"/paper/2305.13048","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:5a86353b0e8b8e11575364f698e1bc444a6d0061fb3bf287f5159fbda62aee94","observation_id":"ebad80f3-de69-426c-b1b9-ea113b076162","resolution":{"observed_at":"2026-08-11T10:27:43.212408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06265","last_updated":"2024-06-22T16:00:49Z","snapshot_observed_at":"2026-08-13T00:58:07.969991Z","submitted_at":"2024-03-10T17:02:53Z","title":"Unpacking Tokenization: Evaluating Text Compression and its Correlation with Model Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06265","snapshot_observed_at":"2026-08-11T10:27:43.177121Z","title":"arXiv:2403.06265","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T10:27:43.177121Z"},"links":{"cited_paper":"/paper/2403.06265","citing_paper":"/paper/2412.16642"},"observation_digest":"sha256:8a4c15865e0eb4f48f49ab0025a17dbf648b20ba684283cad0ee084c8733a274","observation_id":"bf385d6d-6b11-48ed-b578-cfeab89f0e9c","resolution":{"observed_at":"2026-08-11T10:27:43.177121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.16642","last_updated":"2024-12-24T04:20:18Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T18:20:19.174487Z","submitted_at":"2024-12-21T14:24:32Z","title":"L3TC: Leveraging RWKV for Learned Lossless Low-Complexity Text Compression"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":21},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2412.16642."}