{"as_of":"2026-08-09T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9586b745da7563283f9bf26707c4439e8b1265ab4f1ecce07ec8901b8f43f1c0","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T21:25:43.354202Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.24192/citation-record","integrity":"/paper/2607.24192/integrity","json":"/paper/2607.24192/citation-record.json","paper":"/paper/2607.24192"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T21:25:39.922102Z","title":"ACM Transactions on Information Systems (TOIS)37(1), 1–30 (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-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:39.922102Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:24fb8b24574dba5d2ea3090ba98174c644adfa34179a4c9a5b02f638de9273e2","observation_id":"94a45faa-63e4-434b-94d3-a1024ce35109","resolution":{"observed_at":"2026-07-31T21:25:39.922102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02737","last_updated":"2025-02-04T21:43:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-04T21:43:16Z","title":"SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02737","snapshot_observed_at":"2026-07-31T21:25:40.013391Z","title":"arXiv preprint arXiv:2502.02737 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.013391Z"},"links":{"cited_paper":"/paper/2502.02737","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:0f8830f8d7eedcc763e73d879ccda8de5fe0edab32081270809a5a3acb6b2055","observation_id":"cc217af1-58f3-4e2b-897f-9fcc090fe787","resolution":{"observed_at":"2026-07-31T21:25:40.013391Z","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-07-31T21:25:40.206869Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.206869Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:5fffa9b6ec670df38b1eb5f22deef1a5252ed66119d4159190095a0e8bb979de","observation_id":"569c3872-c15e-4c0f-bb3c-b9340462687e","resolution":{"observed_at":"2026-07-31T21:25:40.206869Z","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-07-31T21:25:40.320245Z","title":"Communications of the ACM29(4), 320–330 (1986)","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.320245Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:9ea34bef342d62df56f0c3df66a9da0a5b9b32743a6fb6c6cac202f0e04bdbc4","observation_id":"228f14b1-a8a0-42bd-b118-20dfc99edd86","resolution":{"observed_at":"2026-07-31T21:25:40.320245Z","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-07-31T21:25:40.491722Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.491722Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:abeb2a58cfebaa9c8be655f9fb28350c506808c512613f8144da9c3a3bfbaa50","observation_id":"154730a8-fdcd-4330-bcb1-9e89adc78749","resolution":{"observed_at":"2026-07-31T21:25:40.491722Z","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-07-31T21:25:40.637519Z","title":"Journal of Systems and Software227, 112429 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.637519Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:2a8c0ba15a5325ce99689d1b26b7a649a6ad4c499c3f741f15c56e9f0b15334a","observation_id":"f3a9a0de-20c7-4b26-abe2-9a617e69b094","resolution":{"observed_at":"2026-07-31T21:25:40.637519Z","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-07-31T21:25:40.825551Z","title":"Algorithms for Molecular Biology14(1), 13 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.825551Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:7d7765df24dd21cd6e7e884a0d2826c6e053076b6760abe469181e5437c97b57","observation_id":"ef831cfb-d4c2-45dd-be47-a4b02f7c4675","resolution":{"observed_at":"2026-07-31T21:25:40.825551Z","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-07-31T21:25:40.946710Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:40.946710Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:5256403b0dc1f0ade5d92f53138cb2ead8f163dfb998bfe3fbbbad0d47960e38","observation_id":"594a10f9-b128-43ce-b53d-74a8913873e4","resolution":{"observed_at":"2026-07-31T21:25:40.946710Z","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-07-31T21:25:41.064723Z","title":"The Computer Journal40(2–3), 67–75 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.064723Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:b03b9a62cf4c70683b3a971d9a7f6e61acbcd77dfe434b101fe98546a8e52050","observation_id":"95acecbc-4eb7-45bf-b4da-4416f036cd3e","resolution":{"observed_at":"2026-07-31T21:25:41.064723Z","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-07-31T21:25:41.263645Z","title":"IEEE Transactions on Communications32(4), 396–402 (1984)","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.263645Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:748360148232016173f38e88553c7f09ba559e8832032eb24ab4ad83b1ad3416","observation_id":"9ed84924-606d-404e-a784-a9f708e2092a","resolution":{"observed_at":"2026-07-31T21:25:41.263645Z","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-07-31T21:25:41.394192Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.394192Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:95e4449b85d4f5542e0edbdb9db8a091ea6b07c41b5098029d166fb93dac5b6c","observation_id":"74aa2aba-7de6-4d24-81de-f58e219623f2","resolution":{"observed_at":"2026-07-31T21:25:41.394192Z","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-07-31T21:25:41.577204Z","title":"In: International Conference on Learning Representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.577204Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:62d0ab75ba8e237dbdc2624d89c642ca3c433bc8f2eafdebfde894f10da774fd","observation_id":"e151a30b-31a1-45b9-9f8f-396c67573d6b","resolution":{"observed_at":"2026-07-31T21:25:41.577204Z","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-07-31T21:25:41.672754Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.672754Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:414658172c4b7b3518c5da7eefab137143995565a4475b54b9ff3bbe7073f811","observation_id":"bfae1366-3bba-4029-ac66-39f30c09e72c","resolution":{"observed_at":"2026-07-31T21:25:41.672754Z","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-07-31T21:25:41.820787Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.820787Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:e08ef3b825773f42ec6b536a0d97ea0101cddd94998f907b4e05d6a180675525","observation_id":"6e8b6772-962f-4393-902f-b0eb279c590f","resolution":{"observed_at":"2026-07-31T21:25:41.820787Z","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-07-31T21:25:41.886419Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.886419Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:22fac3c8e2d455764a42e0ba9b6b160d7af52ded9b33bbc8572a7040a935b799","observation_id":"62b537bc-de01-4e17-b33e-900582238452","resolution":{"observed_at":"2026-07-31T21:25:41.886419Z","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-07-31T21:25:41.969748Z","title":"Cambridge University Press (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:41.969748Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:c9f5e728005d383f1428de5b72d8d8a6548cbea5af190da5d6fd65d0c6250e50","observation_id":"537e46ad-6d94-45d0-9e20-d55011e7de9b","resolution":{"observed_at":"2026-07-31T21:25:41.969748Z","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-07-31T21:25:42.030721Z","title":"In: Companion Proceedings of the ACM Web Conference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.030721Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:fc0f4ff197e1c7332a92cf23070287a3550ef10128586ff2b3752a3482b2a4eb","observation_id":"2e574082-7344-49ab-9770-acb0bda3f897","resolution":{"observed_at":"2026-07-31T21:25:42.030721Z","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-07-31T21:25:42.104370Z","title":"Accessed: 2025-10-28","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.104370Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:6a4face2a0cca08997c5a4d7c80e8bc5b0b83d41e74c799ef83b309d27392f24","observation_id":"2846eae7-34aa-42fd-9c78-cf6c3780f9b3","resolution":{"observed_at":"2026-07-31T21:25:42.104370Z","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":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-08T22:36:15.227845Z","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:6e4c1d823c708ab77a902548c3e4a534c4101d58b41e9ab0ed87afda0dbe0b67","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T21:25:42.229233Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.229233Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:788b44696da69d02fc2dd26f01c1cc5f6421f08d71bb65c1b1e189518a887458","observation_id":"068b5c09-117d-4fc7-8431-d4bff3f2a9f5","resolution":{"observed_at":"2026-07-31T21:25:42.229233Z","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-07-06T08:52:12.656082Z","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-07-31T21:25:42.298011Z","title":"arXiv preprint arXiv:2001.08361 (2020)","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.298011Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:8b94754dd00a9df51a949062b2dff25b6f2a3a34d0c24601ec642a7b1c06e44f","observation_id":"680f5b12-0191-4b81-91bb-0ec4ef98c146","resolution":{"observed_at":"2026-07-31T21:25:42.298011Z","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-07-31T21:25:42.358903Z","title":"In: Proceedings of the Data Compression Conference","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.358903Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:c3080681aa2f44c0493fb056e2e1c200d8ed0a6f4c8ef39b718b0673794957d9","observation_id":"dcdd5a01-4954-4675-bb78-ca71bc6f532d","resolution":{"observed_at":"2026-07-31T21:25:42.358903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19173","last_updated":"2024-02-29T13:53:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T13:53:35Z","title":"StarCoder 2 and The Stack v2: The Next Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19173","snapshot_observed_at":"2026-07-31T21:25:42.411366Z","title":"arXiv preprint arXiv:2402.19173 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.411366Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:49d097b8fd5faee650b3e467661236ead0e45597b7e65911d1af69c1482db3f3","observation_id":"18a88d46-28c7-4382-b05f-ff98d138846e","resolution":{"observed_at":"2026-07-31T21:25:42.411366Z","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-07-31T21:25:42.476796Z","title":"In: Proceedings of the 13th International Florida Artificial Intelligence Research Society Conference (FLAIRS)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.476796Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:3cb46d88840ee37b04552d89bce745a60bc6e9f4174c64eb27fafb389b0931be","observation_id":"92fc30f1-e9f2-416e-9d65-f96e7585d4f6","resolution":{"observed_at":"2026-07-31T21:25:42.476796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17141","last_updated":"2024-09-25T17:58:35Z","snapshot_observed_at":"2026-08-06T02:53:01.852804Z","submitted_at":"2024-09-25T17:58:35Z","title":"FineZip : Pushing the Limits of Large Language Models for Practical Lossless Text Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17141","snapshot_observed_at":"2026-07-31T21:25:42.544334Z","title":"arXiv preprint arXiv:2409.17141 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.544334Z"},"links":{"cited_paper":"/paper/2409.17141","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:373359c1f90bdceabad8f54ea12e99092b27a505b5063bb1267ace418ca84b4c","observation_id":"20d71eea-0f81-4592-aa42-1ca84cf0ca48","resolution":{"observed_at":"2026-07-31T21:25:42.544334Z","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-07-31T21:25:42.601101Z","title":"IEEE Transactions on Communications38(11), 1917–1921 (1990)","venue":null,"work_id":null,"year":1917},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.601101Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:c9232f4f901e5956bfcde625652b4f47895d0617d94f97231119e730ceeaf521","observation_id":"53f8cf31-0dfc-418b-9184-a7329d505eac","resolution":{"observed_at":"2026-07-31T21:25:42.601101Z","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-07-31T21:25:42.665983Z","title":"Probability Theory and Related Fields125(2), 259–265 (2003)","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.665983Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:0b9af8c04d7e5873af96f2f685477a8acc1a9bd514cd9512e5008af70559c8ed","observation_id":"209663c0-8544-4b86-96cb-9cef893a2d1d","resolution":{"observed_at":"2026-07-31T21:25:42.665983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15046","last_updated":"2024-09-23T14:21:06Z","snapshot_observed_at":"2026-07-06T19:20:27.927724Z","submitted_at":"2024-09-23T14:21:06Z","title":"AlphaZip: Neural Network-Enhanced Lossless Text Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15046","snapshot_observed_at":"2026-07-31T21:25:42.732073Z","title":"arXiv preprint arXiv:2409.15046 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.732073Z"},"links":{"cited_paper":"/paper/2409.15046","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:0c41a321bbaab2c4fb59f071b0fbb679d81ef7aa87c5b3256ddfe9087ab2bf95","observation_id":"abeb5daf-678d-4798-88a3-e02c189914fb","resolution":{"observed_at":"2026-07-31T21:25:42.732073Z","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-07-31T21:25:42.787245Z","title":"Cambridge University Press (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.787245Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:a2e7665b0b40e58e1fab4da548e3d64997f84011214570951d51cf9dd546ea9a","observation_id":"372a7076-83fa-4f6a-ad58-0a0169fbc80a","resolution":{"observed_at":"2026-07-31T21:25:42.787245Z","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-07-31T21:25:42.858978Z","title":"Request for Comments: 1952 (1996)","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.858978Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:541936dbe5f1b219db7e10fd1413526c8e1033295c2d612120fb76d4ff60e9a6","observation_id":"fd613c21-60ec-422a-9b36-3dffc67fb456","resolution":{"observed_at":"2026-07-31T21:25:42.858978Z","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-07-31T21:25:42.952062Z","title":"IEEE Transactions on Neural Networks7(1), 142–146 (1996)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:42.952062Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:db9cd2f6d118e8119e9f7d06a370af9d119df9133f1bccabc9e190d661b426ee","observation_id":"b02cd693-9c8e-4a91-8ee6-99539ae4cd6e","resolution":{"observed_at":"2026-07-31T21:25:42.952062Z","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-07-31T21:25:43.025233Z","title":"Accessed: 2025- 10-28","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.025233Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:0c79a87c4098fd892295fcc0023e66025dd305bad2f6d3bc18b905d3c19f77c0","observation_id":"5b79d9d1-2a7b-404b-8a9e-b9333284f62a","resolution":{"observed_at":"2026-07-31T21:25:43.025233Z","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-07-31T21:25:43.103041Z","title":"Bell System Technical Journal30(1), 50–64 (1951)","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.103041Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:a180a49d35cdcb3cb6820891c99ddf150a32f7368bb322fd1e39ee143d8aae1b","observation_id":"7b35daaa-189f-4f4b-9d59-808de9e52f32","resolution":{"observed_at":"2026-07-31T21:25:43.103041Z","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-07-31T21:25:43.161794Z","title":"Accessed: 2025-10-28","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.161794Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:01c8b9dc2e0e11fde63e8147c1cd500ce45d04466784133f4220b6950039da09","observation_id":"79689c65-976f-4ab6-b2f1-b0dfad582e9b","resolution":{"observed_at":"2026-07-31T21:25:43.161794Z","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-07-31T06:49:30.094166Z","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-07-31T21:25:43.228417Z","title":"arXiv preprint arXiv:2306.04050 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.228417Z"},"links":{"cited_paper":"/paper/2306.04050","citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:b1c9a018a71e67011694f378b79609066c2b203f733e92448fe3b61584e2d7c7","observation_id":"6e459d05-c719-484c-ba9f-bc6f27a9602b","resolution":{"observed_at":"2026-07-31T21:25:43.228417Z","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-07-31T21:25:43.296676Z","title":"In: Advances in Neural Information Processing Systems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.296676Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:9b6c165cbbe4135898812921a3bde9f28bc568acc827c5855ecc27453ec1ccb3","observation_id":"6133eaa2-37e5-4d33-a94b-6c4a6eea1454","resolution":{"observed_at":"2026-07-31T21:25:43.296676Z","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-07-31T21:25:43.354202Z","title":"Communications of the ACM30(6), 520–540 (1987)","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T21:25:43.354202Z"},"links":{"citing_paper":"/paper/2607.24192"},"observation_digest":"sha256:6470df54d3fb1476cbccc0e55980b2d052c20a52489423117b27c99307df6f3f","observation_id":"839fcac3-ef54-4f60-a2b9-785b49e49e84","resolution":{"observed_at":"2026-07-31T21:25:43.354202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24192","last_updated":"2026-07-29T11:01:57Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-08T22:36:15.227845Z","submitted_at":"2026-07-27T09:12:00Z","title":"LLM-based Source Code Compression via Thresholded Symbol Ranking"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.24192."}