{"as_of":"2026-08-09T10:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e988ca94eb3fec83cad676a90e3119fc1b01091a9fcae1356e40e8e8400c68a1","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":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":36,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:28:43.581431Z","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-08T18:14:49.192773Z","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-08T19:28:43.581431Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05431","last_updated":"2025-02-12T13:54:01Z","snapshot_observed_at":"2026-08-08T19:19:35.161573Z","submitted_at":"2025-02-08T03:41:16Z","title":"APE: Faster and Longer Context-Augmented Generation via Adaptive Parallel Encoding","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T19:28:43.581431Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2502.05431"},"observation_digest":"sha256:f9c14fcfc03aed2c04ea8f471717056ce15c0c2c7a04002793de51406c6fe362","observation_id":"39a663c5-0200-42f1-856a-ae6d7ff071d7","resolution":{"observed_at":"2026-08-08T19:28:43.581431Z","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-08T18:14:49.192773Z","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-08T18:46:28.123214Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05589","last_updated":"2025-03-03T16:49:18Z","snapshot_observed_at":"2026-08-08T18:40:28.575625Z","submitted_at":"2025-02-08T14:28:36Z","title":"On Memory Construction and Retrieval for Personalized Conversational Agents","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T18:46:28.123214Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2502.05589"},"observation_digest":"sha256:b7c6370fe7ceb74f58447f42283cb7f93a188a95ab5e382f61afbf82904d0e6a","observation_id":"b02d16ea-81c7-4edd-b095-22e915bac0b1","resolution":{"observed_at":"2026-08-08T18:46:28.123214Z","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-08T18:14:49.192773Z","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-07T15:15:58.091882Z","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":"2505.15774","last_updated":"2025-05-21T17:26:11Z","snapshot_observed_at":"2026-08-07T15:09:42.504814Z","submitted_at":"2025-05-21T17:26:11Z","title":"Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:58.091882Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2505.15774"},"observation_digest":"sha256:0aeae60a46e5dccf1e9ae42871a4bb0bf470db84380e4975d580037d14aca81d","observation_id":"3142ecc6-0433-4587-91e7-a8e8b15b0f06","resolution":{"observed_at":"2026-08-07T15:15:58.091882Z","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-08T18:14:49.192773Z","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-07T14:40:54.196360Z","title":"Vicky Zhao, Lili Qiu, and Dongmei Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18092","last_updated":"2025-05-27T09:42:25Z","snapshot_observed_at":"2026-08-07T14:33:20.156940Z","submitted_at":"2025-05-23T16:47:00Z","title":"QwenLong-CPRS: Towards $\\infty$-LLMs with Dynamic Context Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:54.196360Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2505.18092"},"observation_digest":"sha256:19bb5970b028f3b25c1ea4c43e2ce21a7b36f8cbaa4967b1097143f19732bf1c","observation_id":"91af50d8-c748-4a84-b7eb-2de52c9b2252","resolution":{"observed_at":"2026-08-07T14:40:54.196360Z","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-08T18:14:49.192773Z","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-07T14:33:13.556578Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18458","last_updated":"2025-06-01T16:00:34Z","snapshot_observed_at":"2026-08-07T20:59:19.597449Z","submitted_at":"2025-05-24T01:57:12Z","title":"A Survey of LLM $\\times$ DATA","version":3},"reference_index":303,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:13.556578Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2505.18458"},"observation_digest":"sha256:c79606980d709b6ca0056b2a6a3131e420ff83e8b932fc53be0ba0a506da0c52","observation_id":"7f8883e8-3d0d-4123-bd8e-e429ca5f5517","resolution":{"observed_at":"2026-08-07T14:33:13.556578Z","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-08T18:14:49.192773Z","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-07T14:12:23.078185Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19716","last_updated":"2025-05-26T09:04:44Z","snapshot_observed_at":"2026-08-09T02:14:56.474379Z","submitted_at":"2025-05-26T09:04:44Z","title":"Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Prompting","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:12:23.078185Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2505.19716"},"observation_digest":"sha256:e60fcdbd730188436cb363cf3364a4e23440a8e697fdf989c014e7675e69eeff","observation_id":"68c2a5b1-9cd9-4e65-8b2e-a291a8194b5f","resolution":{"observed_at":"2026-08-07T14:12:23.078185Z","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-08T18:14:49.192773Z","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-07T12:14:28.276503Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00307","last_updated":"2025-08-20T23:19:57Z","snapshot_observed_at":"2026-08-07T16:06:15.633861Z","submitted_at":"2025-05-30T23:32:57Z","title":"Lossless Token Sequence Compression via Meta-Tokens","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:14:28.276503Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2506.00307"},"observation_digest":"sha256:09dfc34eacb88a19dbce8f392d514a85a14e730c1acb814e4240bb5ac2602dad","observation_id":"7834589b-7ae5-42c2-9a10-b13825ec2e6b","resolution":{"observed_at":"2026-08-07T12:14:28.276503Z","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-08T18:14:49.192773Z","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-07T10:52:49.739784Z","title":"Llmlingua-2: Data distillation for efficient and faithful task-agnostic prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04205","last_updated":"2025-06-04T17:49:10Z","snapshot_observed_at":"2026-08-07T10:43:17.329577Z","submitted_at":"2025-06-04T17:49:10Z","title":"EPiC: Towards Lossless Speedup for Reasoning Training through Edge-Preserving CoT Condensation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:49.739784Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2506.04205"},"observation_digest":"sha256:00f99e4e762548ad3275e81a51934952241043396240f81d7423af867a385968","observation_id":"f6d45ce7-ba34-4679-bd80-49b8aa172fb1","resolution":{"observed_at":"2026-08-07T10:52:49.739784Z","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-08T18:14:49.192773Z","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-07T06:04:33.533062Z","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":"2506.06266","last_updated":"2025-06-13T17:58:55Z","snapshot_observed_at":"2026-08-07T05:54:59.580995Z","submitted_at":"2025-06-06T17:48:23Z","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:33.533062Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2506.06266"},"observation_digest":"sha256:503d8b42b41ad7e3381c4e3113aa09e397e12c344466aec051b1942c5a345c1a","observation_id":"c725764d-15c9-4436-86f3-71b3122f0f4b","resolution":{"observed_at":"2026-08-07T06:04:33.533062Z","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-08T18:14:49.192773Z","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-09T02:32:54.804573Z","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:f9275a866826fcc3b61b39fd0ad3e2411b90eb7dbf13ce52fb8df527d260d346","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-08T18:14:49.192773Z","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:525d19cd78e45b8c79bf5353ca4f1806b5b151b87937181ba81e85d88dfdb4a5","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-08T18:14:49.192773Z","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-08T02:58:34.657399Z","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:533a948b5a04cc3f97f5c56940343bd740fc150df19ae8f60237a850c2128c52","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-08T18:14:49.192773Z","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:354ae57804aba1d8d9a6b0073e49cb0d8bee7a048a8e2d585fdfc83cde54faa4","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-08T18:14:49.192773Z","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:e23253e1e36c39bf25f56ece6776e89f57566448c047fd91f430b1f630844e78","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:4030075f26225b980ec9aa1ca7ef4f35a60a0bccf74331e4fc1b021dbf42bb65","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-08T18:14:49.192773Z","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:1704c9723bb7e5bcd235c9198966d86a58d6bdf5a134d4d8f9d53f56d846682c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:44b2a72cea07593d17c50affb6ad262c5f255275972a67cb47ab4f031631b749","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:cc8c5f1f22fb77869aeff13a19910b03ac0d161416632d5dfbe6b9d1a9e664fe","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:8fb2a1b990cfafebb127d9a14152978a2cd96490b2884817e73b9a868518a85d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:5511123da243ae391f0c540cbac72f2d9ccaf2f136d3f7c14a2135e67a337bfc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:6eb4f56e4f73d972aac82838bf3575abd04f5a92550ab5467bb8372e4239c70f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:9db80b732626c5e38ca48b30ee56e9399df951685059198bc694d7a705815072","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:a586fc9d82d1280c7bd39321f3d73bea026dbd0bd6c93e3246be636162a73357","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:49a8140106bac8fc483da54045dfad5ca8f333ceaa87431cadb7a7e2ce9d1628","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:f7ec0ec23074b473c02fb83ae01f8aef296e0c2050f1ac434433e112538c6f37","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:0a7ca3dd52f2e9e6c7c90b74190ed0c67b318f7b6ac9dc322e481a9c9ae75243","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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:a21e0e1ef290bb3228d6aba8d64d63f8c4b9e954f2b38b4548643714a20244fc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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-08-08T17:02:41.853193Z","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:9d3c93b077dbbf0706d5de39e9b447e7c81b94bdfc28ff49d479f32cd10d8d21","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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-08T07:11:34.297905Z","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:06611fd14ea4e395e2ad15d57f4128f3904f4b65ea786c23b992e612bbe5022b","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-08T18:14:49.192773Z","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-08T07:11:34.297905Z","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:7c68de72746f347b22d6e6979c8366082ff20f2276f4530608d3ec163567f7fc","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-08T18:14:49.192773Z","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:5fe9b99167f8f67d0008e2ffae355bbcec3f8ba999e189a0b1fb13cf4b4a80f7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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-08-07T07:07:24.560093Z","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:7e46a998431f008e3da817ef992b27150e7c3974d8f1b86af7240bbb0344979b","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-08T18:14:49.192773Z","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-09T02:12:00.549509Z","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:572c6bd9fbda11ab66ee08f6fe8e50e7cb52a85dacff4cd39985591858c805eb","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-08T18:14:49.192773Z","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-08T02:28:04.716439Z","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:dcb3681d152d81dcdaaf1e320320a6220cfdb5241a5325cf4b19dc3c620af08f","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-08T18:14:49.192773Z","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-07T23:10:39.123298Z","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:968cef531fa4118687d0f3d61664e3f5500b435d048d411a965fc0fcc60825eb","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12968","last_updated":"2024-08-12T04:48:11Z","snapshot_observed_at":"2026-08-08T18:14:49.192773Z","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-08T05:45:36.152929Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05604","last_updated":"2026-08-06T05:03:31Z","snapshot_observed_at":"2026-08-09T10:10:57.818403Z","submitted_at":"2026-08-06T05:03:31Z","title":"SkillZip: Contract-Preserving Graph Compression for Scalable Agent Skill Libraries","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T05:45:36.152929Z"},"links":{"cited_paper":"/paper/2403.12968","citing_paper":"/paper/2608.05604"},"observation_digest":"sha256:d690c20fa8874c30424856fe409c92f517e9826970ef8144fe7d424200ccecb1","observation_id":"83425617-64bf-477f-8aa1-5da4aeccd405","resolution":{"observed_at":"2026-08-08T05:45:36.152929Z","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-08T18:14:49.192773Z","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-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 0 of 0 outbound references and 36 inbound Pith citation observations for arXiv:2403.12968."}