{"total":20,"rows":[{"id":"2506.06266","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","created":"2025-06-06","cited_by_count":86,"area":"inference"},{"id":"2410.12388","title":"Prompt Compression for Large Language Models: A Survey","created":"2024-10-16","cited_by_count":67,"area":"inference"},{"id":"2407.01527","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","created":"2024-07-01","cited_by_count":42,"area":"inference"},{"id":"2409.19272","title":"Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarios","created":"2024-09-28","cited_by_count":23,"area":"inference"},{"id":"2503.19114","title":"Understanding and Improving Information Preservation in Prompt Compression for LLMs","created":"2025-03-24","cited_by_count":15,"area":"inference"},{"id":"2410.04139","title":"From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression","created":"2024-10-05","cited_by_count":7,"area":"inference"},{"id":"2410.15252","title":"Lossless KV Cache Compression to 2%","created":"2024-10-20","cited_by_count":7,"area":"inference"},{"id":"2505.15774","title":"Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention","created":"2025-05-21","cited_by_count":7,"area":"inference"},{"id":"2510.20797","title":"No Mean Feat: Simple, Strong Baselines for Context Compression","created":"2025-10-23","cited_by_count":7,"area":"inference"},{"id":"2409.15395","title":"Parse Trees Guided LLM Prompt Compression","created":"2024-09-23","cited_by_count":6,"area":"inference"},{"id":"2508.02053","title":"ProCut: LLM Prompt Compression via Attribution Estimation","created":"2025-08-04","cited_by_count":6,"area":"inference"},{"id":"2506.00307","title":"Lossless Token Sequence Compression via Meta-Tokens","created":"2025-05-30","cited_by_count":4,"area":"inference"},{"id":"2606.09659","title":"End-to-End Context Compression at Scale","created":"2026-06-08","cited_by_count":4,"area":"inference"},{"id":"2601.09703","title":"ShortCoder: Knowledge-Augmented Syntax Optimization for Token-Efficient Code Generation","created":"2026-01-14","cited_by_count":3,"area":"inference"},{"id":"2508.17032","title":"Learned Structure in Cartridges: Keys as Shareable Routers in Self-Studied Representations","created":"2025-08-23","cited_by_count":2,"area":"inference"},{"id":"2511.12281","title":"Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor","created":"2025-11-15","cited_by_count":1,"area":"inference"},{"id":"2512.03643","title":"Optical Context Compression Is Just (Bad) Autoencoding","created":"2025-12-03","cited_by_count":1,"area":"inference"},{"id":"2604.15153","title":"Compressing Sequences in the Latent Embedding Space: $K$-Token Merging for Large Language Models","created":"2026-04-16","cited_by_count":0,"area":"inference"},{"id":"2607.25335","title":"Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors","created":"2026-07-28","cited_by_count":0,"area":"inference"},{"id":"2609.32474","title":"PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization","created":"2026-09-26","cited_by_count":0,"area":"inference"}],"next_cursor":null}