{"as_of":"2026-08-06T00:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ff8226b7fc69ae517a693d79f740ffa95d0d2f4269aae3a7f18d4d446f04efa","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:45:23.991669Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T01:36:44.313151Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-05T23:32:55.108925Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05282","last_updated":"2026-07-21T08:08:53Z","snapshot_observed_at":"2026-08-05T23:32:54.202480Z","submitted_at":"2025-08-07T11:26:40Z","title":"Not All Errors Are Created Equal: ASCoT Addresses Late-Stage Fragility in Efficient LLM Reasoning","version":6},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T23:32:55.108925Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2508.05282"},"observation_digest":"sha256:7cd6e05f050258c13745033f224b8464303e4b51aae37d61961a4f1d38b07a8b","observation_id":"2e92313e-80ee-4f48-b44d-86c392db01ef","resolution":{"observed_at":"2026-08-05T23:32:55.108925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-04T10:56:59.953094Z","title":"Sanjana Ramprasad, Elisa Ferracane, and Zachary C Lipton","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08647","last_updated":"2026-06-03T05:23:54Z","snapshot_observed_at":"2026-08-04T10:56:57.855953Z","submitted_at":"2025-10-09T06:34:31Z","title":"Can Reasoning Path still be Effective as Input? Bridging Post-Reasoning to Chain-of-Thought Compression","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T10:56:59.953094Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2510.08647"},"observation_digest":"sha256:325b5134a659831929e9966ed45211edc6bfd386609b5aec976d8aeb613c63fc","observation_id":"bdb866a6-6bd4-41c9-9199-da7c783235eb","resolution":{"observed_at":"2026-08-04T10:56:59.953094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-04T08:28:51.479132Z","title":"Vicky Zhao, Lili Qiu, and Dongmei Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.20535","last_updated":"2026-07-29T08:07:09Z","snapshot_observed_at":"2026-08-05T14:03:48.654042Z","submitted_at":"2025-10-23T13:20:57Z","title":"ARC-Encoder: learning compressed text representations for large language models","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T08:28:51.479132Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2510.20535"},"observation_digest":"sha256:1753689a313ddbf78146da2398b2562cd2c64d6060139e8c1d11c83e6ee3a89d","observation_id":"d6b81bd0-a923-4fa5-9354-92f5e1a34ea4","resolution":{"observed_at":"2026-08-04T08:28:51.479132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-04T08:06:13.382693Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.22963","last_updated":"2026-06-19T20:25:06Z","snapshot_observed_at":"2026-08-04T08:06:05.944327Z","submitted_at":"2025-10-27T03:37:41Z","title":"When Compression Becomes an Attack Surface: Black-Box Attacks on Prompt-Compressed LLM Agents","version":4},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T08:06:13.382693Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2510.22963"},"observation_digest":"sha256:78f162eb758f420f0eec06b020f835ef9fb856f4c388008773d2076d7c4174a8","observation_id":"432a6a4a-194f-44ae-9aa8-d78a4b47853a","resolution":{"observed_at":"2026-08-04T08:06:13.382693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T13:43:51.127429Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:7b9f6854a1ab94754ae9a183801711fd4dc4f5ef60b777f11d8e8807b747ba7a","observation_id":"21a3fcdd-9853-4fe8-a855-7aa3109374fc","resolution":{"observed_at":"2026-05-21T13:44:11.429005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-03T03:25:23.085492Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T03:25:23.085492Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2602.08324"},"observation_digest":"sha256:dbff323a0d607b91d9d7fe9fed9aae6f24124803f3d82393dd8459ae76e4d95c","observation_id":"177561b4-6493-4f29-9d35-87c6eb984f55","resolution":{"observed_at":"2026-08-03T03:25:23.085492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2602.13933","last_updated":"2026-05-01T05:12:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-15T00:06:19Z","title":"HyMem: Hybrid Memory Architecture with Dynamic Retrieval Scheduling","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-15T21:58:30.784843Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2602.13933"},"observation_digest":"sha256:55230e117b0823875aecb082415b2d821323515ab3f2c74e07e0a7a5288909c8","observation_id":"ffbf7176-4647-4850-a649-81291c07f1ed","resolution":{"observed_at":"2026-05-15T22:00:21.370606Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.13725","last_updated":"2026-04-15T11:00:17Z","snapshot_observed_at":"2026-08-05T11:32:59.124748Z","submitted_at":"2026-04-15T11:00:17Z","title":"On the Effectiveness of Context Compression for Repository-Level Tasks: An Empirical Investigation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T13:00:56.512868Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.13725"},"observation_digest":"sha256:5e3d10ffe1bc51e422893aac41a98146fc002471694ef74690120868c13f5d80","observation_id":"5e91b903-6dde-45a6-bee9-ce1f4ed19c1e","resolution":{"observed_at":"2026-05-10T13:40:27.550032Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.14156","last_updated":"2026-03-22T14:27:24Z","snapshot_observed_at":"2026-08-02T12:56:00.032907Z","submitted_at":"2026-03-22T14:27:24Z","title":"Compressed-Sensing-Guided, Inference-Aware Structured Reduction for Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T06:52:18.563146Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.14156"},"observation_digest":"sha256:4a1477fa66af3e879d640005ccbbd6c47e1042ade3a5b1d069b5c2016043c8d6","observation_id":"a9b88b44-388d-4eab-9cbb-78f61ccaff25","resolution":{"observed_at":"2026-05-15T06:55:10.703875Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.14889","last_updated":"2026-05-28T09:50:25Z","snapshot_observed_at":"2026-08-03T09:30:26.459081Z","submitted_at":"2026-04-16T11:29:40Z","title":"MemoSight: Unifying Context Compression and Multi Token Prediction for Reasoning Acceleration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T11:27:46.226527Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.14889"},"observation_digest":"sha256:6cbad3e9ad311f5f55a38c4510630629a0e675bf4bd3d3f34e56fc16b9cd1874","observation_id":"f8b0b7ae-33cd-4e33-9738-173ada693d76","resolution":{"observed_at":"2026-05-10T11:30:18.723446Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.15153","last_updated":"2026-04-22T01:59:13Z","snapshot_observed_at":"2026-07-06T23:02:44.990811Z","submitted_at":"2026-04-16T15:32:45Z","title":"Compressing Sequences in the Latent Embedding Space: $K$-Token Merging for Large Language Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T11:27:13.718813Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.15153"},"observation_digest":"sha256:62f9f8edc41c753e5f3437a40af152c34efa5d9c7b07f27d79fd5e43c0a3fa33","observation_id":"b260708b-3f16-40b5-a26a-d49afaf4431b","resolution":{"observed_at":"2026-05-10T11:30:18.902593Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.17297","last_updated":"2026-04-19T07:26:55Z","snapshot_observed_at":"2026-07-06T23:04:28.260463Z","submitted_at":"2026-04-19T07:26:55Z","title":"CRISP: Compressing Redundancy in Chain-of-Thought via Intrinsic Saliency Pruning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T05:37:56.419884Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.17297"},"observation_digest":"sha256:e0ea1a7cd55d2cfb6ff7f76260029d68cad0ba1520cb30c7973c2a9b676014ff","observation_id":"8033894c-d87e-407f-8b63-666c2d8fc9b4","resolution":{"observed_at":"2026-05-10T05:41:02.315060Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2604.17512","last_updated":"2026-04-19T16:05:33Z","snapshot_observed_at":"2026-07-29T17:45:26.538909Z","submitted_at":"2026-04-19T16:05:33Z","title":"ONTO: A Token-Efficient Columnar Notation for LLM Input Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T05:21:56.826488Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2604.17512"},"observation_digest":"sha256:8bbe775647458d6bf3b682bc7e99e0a3401c1c70177995383ef6fcca3e58e09f","observation_id":"2b3aa798-8e11-44d1-8c35-96b165c54f5c","resolution":{"observed_at":"2026-05-10T09:23:37.772862Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2605.09611","last_updated":"2026-05-10T15:48:38Z","snapshot_observed_at":"2026-07-06T23:21:39.966502Z","submitted_at":"2026-05-10T15:48:38Z","title":"Byte-Exact Deduplication in Retrieval-Augmented Generation: A Three-Regime Empirical Analysis Across Public Benchmarks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T04:18:11.836537Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2605.09611"},"observation_digest":"sha256:b372eb97edaf4504a2c728a0cd5ffb1e48b9a94be1b42cdfec146813e54200ec","observation_id":"55ee1889-ec1c-42e7-affe-0b2fb3828c50","resolution":{"observed_at":"2026-05-12T06:26:24.135636Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2605.11317","last_updated":"2026-05-11T23:07:33Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-11T23:07:33Z","title":"SOMA: Efficient Multi-turn LLM Serving via Small Language Model","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-13T01:37:27.361504Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2605.11317"},"observation_digest":"sha256:32148662ff7ac9b1868b7bd302b271c7e65f09b20f26d86f49f190d0855797da","observation_id":"9376042f-6697-43da-9e11-328cac3acd36","resolution":{"observed_at":"2026-05-13T01:42:04.141168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2605.26165","last_updated":"2026-05-24T20:52:54Z","snapshot_observed_at":"2026-08-02T00:37:55.747392Z","submitted_at":"2026-05-24T20:52:54Z","title":"Tool-Schema Compression Enables Agentic RAG Under Constrained Context Budgets","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-29T23:23:49.298204Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2605.26165"},"observation_digest":"sha256:7ee3f98739408575d219030396e89b3ceb9c04f089a75a740a174fd1df0a0e7e","observation_id":"e74ad4b0-1431-4ba4-8d7d-e2db439ba6ce","resolution":{"observed_at":"2026-06-29T23:24:01.261450Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2606.09585","last_updated":"2026-06-08T14:58:59Z","snapshot_observed_at":"2026-08-01T17:09:02.280748Z","submitted_at":"2026-06-08T14:58:59Z","title":"Optical Reasoning: Rethinking Images as an Expressive Reasoning Medium Beyond Text","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T16:45:17.380015Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2606.09585"},"observation_digest":"sha256:70d0396a2b3e8b6864aec303fa41078f6356e5853328c43e7075e87bedd2021f","observation_id":"7be9e403-d430-4e0a-b55a-aa0b31712b53","resolution":{"observed_at":"2026-07-03T01:17:30.496481Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2606.28349","last_updated":"2026-06-03T07:15:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-03T07:15:11Z","title":"HMARS: A Hierarchical Multi-Agent Memory System for Long-Context Reasoning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-30T11:30:52.871762Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2606.28349"},"observation_digest":"sha256:b381c81ff454a36717c1ed52ebd75937c02feabfddf61f6f5a3bbec95138d471","observation_id":"872176f3-7bb5-42b0-98aa-d158a673f289","resolution":{"observed_at":"2026-06-30T11:34:37.875806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-07-07T00:06:49.412663Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:ebe0d0a0861f9b441514e73bbc8bfbb6e10d0833d3155fbf6a85a5c997c630c6","observation_id":"876ee509-ace5-4827-92f2-b35936117c4b","resolution":{"observed_at":"2026-07-04T01:49:21.537057Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-11T23:16:58.545731Z","title":"arXiv preprint arXiv:2403.12968 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03882","last_updated":"2026-07-10T15:01:40Z","snapshot_observed_at":"2026-08-04T13:25:48.327567Z","submitted_at":"2026-07-04T13:57:21Z","title":"Consistent but Miscalibrated: Evaluating LLM Limitations for Risk Communication in Natural Language","version":1},"reference_index":185,"source":"arxiv_source","source_observed_at":"2026-07-11T23:16:58.545731Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.03882"},"observation_digest":"sha256:bb152bfdb543e784382376b4889790a0a2f73f8f6bea2dea295c111aebd3691b","observation_id":"1348a19c-38f4-49d1-a68c-3ab61dca1a57","resolution":{"observed_at":"2026-07-11T23:16:58.545731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-13T07:02:13.140334Z","title":"arXiv preprint arXiv:2403.12968 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03882","last_updated":"2026-07-10T15:01:40Z","snapshot_observed_at":"2026-08-04T13:25:48.327567Z","submitted_at":"2026-07-04T13:57:21Z","title":"Consistent but Miscalibrated: Evaluating LLM Limitations for Risk Communication in Natural Language","version":2},"reference_index":185,"source":"arxiv_source","source_observed_at":"2026-07-13T07:02:13.140334Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.03882"},"observation_digest":"sha256:fb55483fda2de4f98755fe91e10381f051fb28bcbc6ba814e14a323b4f0609b6","observation_id":"2cd86c4a-566f-41e6-96c1-71363b128d70","resolution":{"observed_at":"2026-07-13T07:02:13.140334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":"2403.12968","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-10T01:36:44.313151Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968","venue":"cs.CL","work_id":"d55c1763-27e9-4f9e-98ad-4c732485bb07","year":2024},"citing_paper":{"arxiv_id":"2607.08032","last_updated":"2026-07-09T01:15:03Z","snapshot_observed_at":"2026-08-02T16:38:21.894642Z","submitted_at":"2026-07-09T01:15:03Z","title":"What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-07-10T01:26:59.421158Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.08032"},"observation_digest":"sha256:ea9dd7b19f951fb855645fc8d10f5a7d7b46e48b336e093066ab5746cee26a48","observation_id":"a44aaba4-ac7e-4e0a-841a-4e08e1740801","resolution":{"observed_at":"2026-07-10T01:36:44.314393Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-07-13T03:29:34.486347Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09375","last_updated":"2026-07-10T12:57:08Z","snapshot_observed_at":"2026-07-15T23:18:12.873790Z","submitted_at":"2026-07-10T12:57:08Z","title":"Mach-Mind-4-Flash Technical Report","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T03:29:34.486347Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.09375"},"observation_digest":"sha256:9aacf3d12c24c4d20e019ba3e83112612a4049a519780c4569b90f040e608ba1","observation_id":"9766d172-1b11-4e2b-af13-568746610d34","resolution":{"observed_at":"2026-07-13T03:29:34.486347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-02T11:37:07.776703Z","title":"Llmlingua-2: Data distillation for effi- cient and faithful task-agnostic prompt compression.arXiv preprint arXiv:2403.12968, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19368","last_updated":"2026-06-12T01:11:17Z","snapshot_observed_at":"2026-08-02T16:44:28.630046Z","submitted_at":"2026-06-12T01:11:17Z","title":"Spectral-LSH: Sub-Quadratic Prompt Compression via Krylov-Projected Locality-Sensitive Hashing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T11:37:07.776703Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2607.19368"},"observation_digest":"sha256:46710194b8bab20f2504912bd29c7e66f253f2a853d6569a4e9175c4129318d9","observation_id":"b494edfa-de78-40f7-b727-7bdf014fe5de","resolution":{"observed_at":"2026-08-02T11:37:07.776703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-04T22:38:10.188571Z","title":"Pan et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01704","last_updated":"2026-08-03T05:09:49Z","snapshot_observed_at":"2026-08-06T00:27:03.373947Z","submitted_at":"2026-08-03T05:09:49Z","title":"Floor, Ceiling, and the Fusion Gap: How Much of Crowd Reading Attention Can Machines Predict?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T22:38:10.188571Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2608.01704"},"observation_digest":"sha256:8d5f5a61d87f3dd0b45847f75b910bbe4c1a5707e5b2b7fe73e0e30fed295868","observation_id":"d15fd6a5-32d9-48b5-a2ac-443aad570904","resolution":{"observed_at":"2026-08-04T22:38:10.188571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12968","snapshot_observed_at":"2026-08-06T00:45:23.991669Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03148","last_updated":"2026-08-04T05:26:25Z","snapshot_observed_at":"2026-08-06T00:47:58.612796Z","submitted_at":"2026-08-04T05:26:25Z","title":"Lightweight Chunk Selection for Mobile Retrieval-Augmented Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:45:23.991669Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2608.03148"},"observation_digest":"sha256:5382a08f4795ba9f768af0b42353ab1b2dc39b1b2137ecf9c4ecdd68bea490d8","observation_id":"47e4c23b-3a55-45d2-87e4-57d13081b489","resolution":{"observed_at":"2026-08-06T00:45:23.991669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.12968/citation-record","integrity":"/paper/2403.12968/integrity","json":"/paper/2403.12968/citation-record.json","paper":"/paper/2403.12968"},"outbound":[],"paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T09:53:46.200081Z","submitted_at":"2024-03-19T17:59:56Z","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 26 inbound Pith citation observations for arXiv:2403.12968."}