{"as_of":"2026-08-07T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a82d8cb52241ff752b3c972480ef491cb5497cf364321c6c4a6573268f8ebb8c","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:40:54.406568Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:49:37.437977Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T15:08:33.439599Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"cited_work":{"arxiv_id":"2509.19228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.19228","snapshot_observed_at":"2026-07-07T01:15:58.319082Z","title":"Com- pllm: Compression for long context q&a.arXiv preprint arXiv:2509.19228","venue":null,"work_id":"af9442fd-4276-456c-afff-1f0af67f8dbd","year":2025},"citing_paper":{"arxiv_id":"2602.09789","last_updated":"2026-05-11T17:16:12Z","snapshot_observed_at":"2026-07-06T22:45:20.365624Z","submitted_at":"2026-02-10T13:49:08Z","title":"When Less is More: The LLM Scaling Paradox in Context Compression","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T02:28:37.490958Z"},"links":{"cited_paper":"/paper/2509.19228","citing_paper":"/paper/2602.09789"},"observation_digest":"sha256:bc1964ab8bf665cd6fafe52b66c50e09982081c9b2741cae330bc23b22ff0365","observation_id":"7226d5f0-aa0f-47dd-9dec-b14ebd719c7e","resolution":{"observed_at":"2026-07-07T01:15:58.319082Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"cited_work":{"arxiv_id":"2509.19228","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.19228","snapshot_observed_at":"2026-07-07T01:15:58.319082Z","title":"Com- pllm: Compression for long context q&a.arXiv preprint arXiv:2509.19228","venue":null,"work_id":"af9442fd-4276-456c-afff-1f0af67f8dbd","year":2025},"citing_paper":{"arxiv_id":"2606.13316","last_updated":"2026-07-31T08:57:20Z","snapshot_observed_at":"2026-08-05T23:10:47.877661Z","submitted_at":"2026-06-11T13:10:48Z","title":"ReSum: Synergizing LLM Reasoning and Summarization with Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T06:39:34.199607Z"},"links":{"cited_paper":"/paper/2509.19228","citing_paper":"/paper/2606.13316"},"observation_digest":"sha256:c7be8388b49a8f4a64287b22efde245f47b563a765c50086983f8e86a30f1366","observation_id":"2713b3d6-79ed-44b5-b32e-052d98affad4","resolution":{"observed_at":"2026-07-07T01:15:58.319082Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.19228","snapshot_observed_at":"2026-08-03T02:12:16.518796Z","title":"Berton, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.13316","last_updated":"2026-07-31T08:57:20Z","snapshot_observed_at":"2026-08-05T23:10:47.877661Z","submitted_at":"2026-06-11T13:10:48Z","title":"ReSum: Synergizing LLM Reasoning and Summarization with Reinforcement Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T02:12:16.518796Z"},"links":{"cited_paper":"/paper/2509.19228","citing_paper":"/paper/2606.13316"},"observation_digest":"sha256:027c7b80dd0276015af126c949e64c91a5672449785c1e88c79382fc6be0aeef","observation_id":"b794f59a-88f8-4214-ba20-b4ed65967b84","resolution":{"observed_at":"2026-08-03T02:12:16.518796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.19228","snapshot_observed_at":"2026-08-04T00:49:37.437977Z","title":"Zefan Cai, Yichi Zhang, Bofei Gao, Yuliang Liu, Yucheng Li, Tianyu Liu, Keming Lu, Wayne Xiong, Yue Dong, Junjie Hu, and Wen Xiao","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00311","last_updated":"2026-07-31T21:44:03Z","snapshot_observed_at":"2026-08-06T23:12:36.292239Z","submitted_at":"2026-07-31T21:44:03Z","title":"SeDeM: Selective Decompression of Hidden-State Memories for Long-Context Question Answering","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T00:49:37.437977Z"},"links":{"cited_paper":"/paper/2509.19228","citing_paper":"/paper/2608.00311"},"observation_digest":"sha256:5bbe80d25acc95f2992c2d7539d0c36344469b8aff00c3abaa259dd2430193aa","observation_id":"d520dd58-a13d-4610-93a9-846431cba336","resolution":{"observed_at":"2026-08-04T00:49:37.437977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.19228/citation-record","integrity":"/paper/2509.19228/integrity","json":"/paper/2509.19228/citation-record.json","paper":"/paper/2509.19228"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.00489","last_updated":"2024-10-17T15:20:23Z","snapshot_observed_at":"2026-08-05T01:25:23.800398Z","submitted_at":"2024-03-30T23:07:58Z","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00489","snapshot_observed_at":"2026-08-04T15:40:45.417699Z","title":"Prompt-saw: Leveraging relation-aware graphs for textual prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.417699Z"},"links":{"cited_paper":"/paper/2404.00489","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:1918ba9bad4e783bc0af5312dd87d85381fb7382e896974576eedffb96a461a1","observation_id":"86fa3b02-d056-4596-b8d9-fc2d50fb0e72","resolution":{"observed_at":"2026-08-04T15:40:45.417699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:45.537232Z","title":"QAMPARI : A benchmark for open-domain questions with many answers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.537232Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:002c89d3c5e797001ae3a2558237ca70501c7f64141f25c22bbd83766696147c","observation_id":"23db585e-2964-4ef5-9103-89f2ce133897","resolution":{"observed_at":"2026-08-04T15:40:45.537232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:45.669579Z","title":"The claude 3 model family: Opus, sonnet, haiku, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.669579Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:c323cd168f482a72d538a873ea0545ddf7ae1f54b3987098883196a2c805d7d7","observation_id":"46aa21dd-554d-4997-b8a5-4cb042e79abc","resolution":{"observed_at":"2026-08-04T15:40:45.669579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2024.acl-long.685","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retaining key information under high compression ratios: Query-guided compressor for LLM s","venue":null,"work_id":"9a181a39-4f44-4498-bd2a-8129e99cd2c9","year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.756918Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:9023e0eb3dac68ef8f66cc454437dcbc4dc64dcda72a4d3c0fb44c9c923b3560","observation_id":"85384f53-506f-4d65-a0cf-ef2d1997eac3","resolution":{"observed_at":"2026-08-04T15:44:07.218372Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10337","last_updated":"2025-03-13T13:15:28Z","snapshot_observed_at":"2026-08-02T15:03:53.621270Z","submitted_at":"2025-03-13T13:15:28Z","title":"KV-Distill: Nearly Lossless Learnable Context Compression for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.10337","snapshot_observed_at":"2026-08-04T15:40:45.868606Z","title":"Kv-distill: Nearly lossless learnable context compression for llms, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.868606Z"},"links":{"cited_paper":"/paper/2503.10337","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:a3f537b9fd2a5df13081723343a633ba7e5e7391a513a75db11f55b4d8446652","observation_id":"65b16101-76b9-45fe-8a5f-65c172691938","resolution":{"observed_at":"2026-08-04T15:40:45.868606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.037612Z","title":"DAST : Context-aware compression in LLM s via dynamic allocation of soft tokens","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.037612Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:26d89f7494367dc7556ec0bbc667ccaf46ab80087f6e5159fa8cabbffcc42325","observation_id":"bf9bf645-5702-45b2-87f6-99c7840cbf5d","resolution":{"observed_at":"2026-08-04T15:40:46.037612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.159538Z","title":"x RAG : Extreme context compression for retrieval-augmented generation with one token","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.159538Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:e4f581eda3e44f747d447f01ec113cf56e57c3d4be9fe117cdef8d40c954d756","observation_id":"00c27a15-fc1c-4b4b-afd5-d7c29481096f","resolution":{"observed_at":"2026-08-04T15:40:46.159538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.338636Z","title":"Selection-p: Self-supervised task-agnostic prompt compression for faithfulness and transferability","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.338636Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:7c57fcdf97266886adb0b99754a80f5c798e9ebdcfad6a17d2e3484ec8fa7e63","observation_id":"1be73f09-381b-4b5a-9f93-40416e3d9442","resolution":{"observed_at":"2026-08-04T15:40:46.338636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.518998Z","title":"Finch: Prompt-guided key-value cache compression for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.518998Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:a426b1e9d415f9573ca497a37532a22fddfffa432bd88dee727c5444b9f607f4","observation_id":"0a6fcb3f-ce7c-4db2-acf7-04a84cf3fe94","resolution":{"observed_at":"2026-08-04T15:40:46.518998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.684847Z","title":"BERT: pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.684847Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:3f9711cb4b748b6c9e5f0b6aeb04760993f853d9f54d0ce4594d6489b7659a09","observation_id":"5580318d-f5bd-4813-a133-4bd18d8a53f3","resolution":{"observed_at":"2026-08-04T15:40:46.684847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-08-04T15:40:46.821236Z","title":"Efficient prompt compression with evaluator heads for long-context transformer inference, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.821236Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:8143f479c7b42cc47dd9a7b4b0c9d8b917141ea884405dc7cb91594731399a3c","observation_id":"d0262d80-0f86-49d0-8388-69a56ff59abd","resolution":{"observed_at":"2026-08-04T15:40:46.821236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:46.981365Z","title":"Beam search strategies for neural machine translation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.981365Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:0ad5fe20e7a2668b0b0f3ac228ef2e92ff52a56d8af87027ed651b53dfdba190","observation_id":"c3b3cc5a-cebb-403c-8f27-c76bc3a14a73","resolution":{"observed_at":"2026-08-04T15:40:46.981365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.131995Z","title":"In-context autoencoder for context compression in a large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.131995Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:d2cbc922ffe0b4223b5e9ba5aa7ad8f5d4e502dfd1add115c2de2dd37079f5e7","observation_id":"f949de7c-336f-4860-8884-fd2e7690b0e6","resolution":{"observed_at":"2026-08-04T15:40:47.131995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.297237Z","title":"In-context autoencoder for context compression in a large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.297237Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:7a71edeb733d6066b5668b47a96745b8292d167fe20b8158a8aa7c4370942684","observation_id":"e4dd3873-6a3a-4bc1-a47a-7a7a78c4f7ea","resolution":{"observed_at":"2026-08-04T15:40:47.297237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.408934Z","title":"Lo RA : Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.408934Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:5d15d016690dc139c704132ec76752bcfb62e334bdd8002b94531767a157a72c","observation_id":"5da37440-6052-44d5-9b6c-6292a4a0fc61","resolution":{"observed_at":"2026-08-04T15:40:47.408934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06110","last_updated":"2024-06-10T08:50:59Z","snapshot_observed_at":"2026-07-06T18:28:03.461510Z","submitted_at":"2024-06-10T08:50:59Z","title":"Recurrent Context Compression: Efficiently Expanding the Context Window of LLM","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06110","snapshot_observed_at":"2026-08-04T15:40:47.523035Z","title":"Recurrent context compression: Efficiently expanding the context window of llm, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.523035Z"},"links":{"cited_paper":"/paper/2406.06110","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:e0603e348f449c2a12e9a7f45f79de9184ea57a0b18470784553cd2d77689a69","observation_id":"3d1c149e-3591-4555-98f4-5a2088a285cd","resolution":{"observed_at":"2026-08-04T15:40:47.523035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.639451Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.639451Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:142f3d5679e5a54e5e6e3b116274f34d0420779211b300c564f3829441152131","observation_id":"41494c56-a32d-47a0-89d3-90be6c9efaed","resolution":{"observed_at":"2026-08-04T15:40:47.639451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.739557Z","title":"Perceiver: General perception with iterative attention, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.739557Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:5182ff75985b8f8171f9ff6ca31b3f297da7a1aa1a8428f94f667d1c765f39b4","observation_id":"fac9a4b9-ae07-47b3-9af8-be95aa26385d","resolution":{"observed_at":"2026-08-04T15:40:47.739557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.844856Z","title":"LLML ingua: Compressing prompts for accelerated inference of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.844856Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:147cf7e15e7aa2864ab45d1aa2a3e5132338646b2ee683eb5a4ea89de8cff2a9","observation_id":"315a4a2f-7bda-463b-b1d4-83f61b459161","resolution":{"observed_at":"2026-08-04T15:40:47.844856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:47.992056Z","title":"L ong LLML ingua: Accelerating and enhancing LLM s in long context scenarios via prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:47.992056Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:9b05eca4d4ece3c3a80fc29a86cd5009ec5c79560bb551882f80715b6963b549","observation_id":"01239274-3c96-46d7-960d-5f2e38d057e1","resolution":{"observed_at":"2026-08-04T15:40:47.992056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.087694Z","title":"Compressed context memory for online language model interaction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.087694Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:56f53dc9ddaca2dbc53d395ddb75a24a9806df7a00e6bf87bf1d6fb81b3287f4","observation_id":"812bd792-35a7-4c81-aa1c-bb5c32327326","resolution":{"observed_at":"2026-08-04T15:40:48.087694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.175788Z","title":"Unsupervised multilingual sentence boundary detection","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.175788Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:0cbbeed9b128147ae966ae5069943c4e13af3a792c233e62632e0ac7dc862676","observation_id":"b6822640-630a-41f6-95c4-8b4217fc008d","resolution":{"observed_at":"2026-08-04T15:40:48.175788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.304413Z","title":"Dai, Jakob Uszkoreit, Quoc Le, and Slav Petrov","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.304413Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:1c22f581b5dedae55c852850c162e821ff8d2a8807dd1baa5ee6f3ed88d8b540","observation_id":"322e1d58-9704-40de-a1b3-acc706731f33","resolution":{"observed_at":"2026-08-04T15:40:48.304413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.420631Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.420631Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:04de1db851719ccd480596e13aeb6a3a71aacced3997feb374c7fa63148261cc","observation_id":"f0391569-4381-4325-aa5c-104ce63720c3","resolution":{"observed_at":"2026-08-04T15:40:48.420631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.564715Z","title":"RACE : Large-scale R e A ding comprehension dataset from examinations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.564715Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:18b8abb97e46204aaaef701e764e20cc15e3d2000375c3a551c5330905e4cf0e","observation_id":"66387029-0019-43ac-b98c-5bc6af69801c","resolution":{"observed_at":"2026-08-04T15:40:48.564715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13121","last_updated":"2024-06-19T00:28:58Z","snapshot_observed_at":"2026-07-06T18:33:24.206083Z","submitted_at":"2024-06-19T00:28:58Z","title":"Can Long-Context Language Models Subsume Retrieval, RAG, SQL, and More?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13121","snapshot_observed_at":"2026-08-04T15:40:48.710505Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.710505Z"},"links":{"cited_paper":"/paper/2406.13121","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:ac29ae6c36512f0c15ffa6202108599521f27d5a97ad13c39e35fdfc62351073","observation_id":"80b75a24-002e-491b-bdbe-267732a9741e","resolution":{"observed_at":"2026-08-04T15:40:48.710505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.815009Z","title":"u ttler, Mike Lewis, Wen tau Yih, Tim Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.815009Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:a73775683135d6138fe8d027c103e11415ff4fce6f19586e9e9349f9693fe75e","observation_id":"3ff053ce-198a-4295-839a-1acc1cbec0ac","resolution":{"observed_at":"2026-08-04T15:40:48.815009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:48.925608Z","title":"u ttler, Mike Lewis, Wen-tau Yih, Tim Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:48.925608Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:de83f8b29c728681da62ec24e4b5576ddb9097c8f9e5843d913c18eec953fed3","observation_id":"45033572-4739-4465-8cb9-1bb6ff07fe7c","resolution":{"observed_at":"2026-08-04T15:40:48.925608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.043623Z","title":"Prefix-tuning: Optimizing continuous prompts for generation, 2021 a","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.043623Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:8fd6c5a8c7d055a3854d69bc5bcbc5485e93b3d2386069c3d17a1a2b5a8773f7","observation_id":"f401d821-35c1-4202-a263-da744f70f729","resolution":{"observed_at":"2026-08-04T15:40:49.043623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.205776Z","title":"Prefix-tuning: Optimizing continuous prompts for generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.205776Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:00346c6a5dd0a30c188f7e3d077b34fa7d013f4e4eacec1ae6cc7ad757548910","observation_id":"08e3c52a-5f91-4802-9abd-64ca84cb75cc","resolution":{"observed_at":"2026-08-04T15:40:49.205776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.289171Z","title":"500x C ompressor: Generalized prompt compression for large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.289171Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:0f2104676ac2aded476cc494900f3f6c86bbf043e30dac008c12d4b80e3d1294","observation_id":"aa56ae0c-bd97-4228-a08f-b03b03d212ea","resolution":{"observed_at":"2026-08-04T15:40:49.289171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.361725Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.361725Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:3c60603760bca9e805f419b63cac8115e7392a4158fcbf16436748ce848be245","observation_id":"c97183d3-5184-411a-b84e-e1121e694157","resolution":{"observed_at":"2026-08-04T15:40:49.361725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.504037Z","title":"Liu, Kevin Lin, John Hewitt, Ashwin Paranjape, Michele Bevilacqua, Fabio Petroni, and Percy Liang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.504037Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:19dc77c4d46decd5ed2a835bfcca078d74ff293bb65fab935d620bac4d4db835","observation_id":"d2e6c386-e1a5-4a59-9fb1-f03888d881f1","resolution":{"observed_at":"2026-08-04T15:40:49.504037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.696479Z","title":"Cachegen: Kv cache compression and streaming for fast large language model serving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.696479Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:19be6b1c010ea571d5d7d1c5b21e1484a2592a35e4b1ca4067cc732fbc308cfe","observation_id":"124755c6-f307-4b0d-9241-bd2127d026a0","resolution":{"observed_at":"2026-08-04T15:40:49.696479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.841264Z","title":"Quest: A retrieval dataset of entity-seeking queries with implicit set operations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.841264Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:f04f85699bff0fc2dcef2a8b0ec844878eb172c57422d43db1dc8f4e96ea14ae","observation_id":"40167036-acc0-420e-a849-3cdaf14c448d","resolution":{"observed_at":"2026-08-04T15:40:49.841264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:49.918650Z","title":"Learning to compress prompts with gist tokens","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:49.918650Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:403e5390ddeb8ed2c350b7dd1bc75d20cbf77b1185adf84e1518cb4ffef9a683","observation_id":"3023f9e9-ea2f-45da-877d-95fed2e1479b","resolution":{"observed_at":"2026-08-04T15:40:49.918650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.024145Z","title":"Learning to compress prompts with gist tokens","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.024145Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:218d4f9031359d6da9daf4db2e91045bfb3c772715254d1749ae093fc14f20ad","observation_id":"f863954d-50dc-41ca-9017-bda34812473b","resolution":{"observed_at":"2026-08-04T15:40:50.024145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-04T15:40:50.120116Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.120116Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:ce0bb05aea00c0243dbf95a2bf008792a7680e160864c83497acdb0c60c0be0e","observation_id":"b42e16ae-d07c-4e40-9a79-ddd1a37dcb11","resolution":{"observed_at":"2026-08-04T15:40:50.120116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.230286Z","title":"Vicky Zhao, Lili Qiu, and Dongmei Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.230286Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:3873688bbb7bf7d623be0abaad5797c4b9d03d2d82c1ef21a93f3ec71f60130a","observation_id":"c09383a5-5b26-4009-a518-3006910b402f","resolution":{"observed_at":"2026-08-04T15:40:50.230286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.386154Z","title":"PyTorch : An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.386154Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:42c369f2d506f51915dd94ac23b208002fd38d3fb753d30d726972f373f316f5","observation_id":"40adcfdc-a1a3-4a58-aaef-f0597c1e4413","resolution":{"observed_at":"2026-08-04T15:40:50.386154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08934","last_updated":"2025-04-11T19:23:31Z","snapshot_observed_at":"2026-07-06T21:08:10.094049Z","submitted_at":"2025-04-11T19:23:31Z","title":"Long Context In-Context Compression by Getting to the Gist of Gisting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08934","snapshot_observed_at":"2026-08-04T15:40:50.589587Z","title":"Long context in-context compression by getting to the gist of gisting, 2025 b","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.589587Z"},"links":{"cited_paper":"/paper/2504.08934","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:58594aa75fe9f8477e682eca6945a9bed56b5664b69119da1a2a16a917b8c9e9","observation_id":"3547cc4e-95cf-4538-a6c9-3fea23e97c15","resolution":{"observed_at":"2026-08-04T15:40:50.589587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.701563Z","title":"SQ u AD : 100,000+ questions for machine comprehension of text","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.701563Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:60983d9cecd812407981afe631c61f45a307e3f565084f8e39718363a2a5633a","observation_id":"59d16349-3ae5-41bb-815e-8b4558efc813","resolution":{"observed_at":"2026-08-04T15:40:50.701563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.837512Z","title":"Getting closer to AI complete question answering: A set of prerequisite real tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.837512Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:b6f3671725fa33ca526ee35760d1204bf3c382b3f7d8b418ed50a138a115872b","observation_id":"5ca4cb46-e61e-4cbe-9e58-213bdcb50c86","resolution":{"observed_at":"2026-08-04T15:40:50.837512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:50.950299Z","title":"The NarrativeQA reading comprehension challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:50.950299Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:bb7a255a470eb408071294e1b7b764072b229411e057c85487cc8959e6e25461","observation_id":"516caa67-c2b4-4de8-af8a-f88d4c0e7d66","resolution":{"observed_at":"2026-08-04T15:40:50.950299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.21074","last_updated":"2025-09-23T08:16:08Z","snapshot_observed_at":"2026-08-05T14:47:32.040466Z","submitted_at":"2025-02-28T14:07:48Z","title":"CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.21074","snapshot_observed_at":"2026-08-04T15:40:51.137518Z","title":"Codi: Compressing chain-of-thought into continuous space via self-distillation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.137518Z"},"links":{"cited_paper":"/paper/2502.21074","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:e586d4463b861d47f4dded8faa4cd6c1f57d6a171f2920db5d6912eee8809ff5","observation_id":"edf3776b-f497-4fd1-b346-ce804f2862d0","resolution":{"observed_at":"2026-08-04T15:40:51.137518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:51.270082Z","title":"Perception compressor: A training-free prompt compression framework in long context scenarios","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.270082Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:3c335308d67ef5cf4b0f142840f83eb1543f616552200d85032ea379b2c17161","observation_id":"95b144ef-4ce9-4c3a-b1f1-f2c2e3eee3f2","resolution":{"observed_at":"2026-08-04T15:40:51.270082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:51.406932Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.406932Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:6972483d52fd89ef062a5a03f9c4e3095dbc3fe46dd1dfd3864958b682517fda","observation_id":"3ef456c0-5e46-4a16-a900-d8714c2ab1eb","resolution":{"observed_at":"2026-08-04T15:40:51.406932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-04T15:40:51.508482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.508482Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:14c95b7ba9e447d27b9c3c737ffc36c2ee2f4a0d3c3fa33c60ce59474a7c580d","observation_id":"773b1d11-6250-4ead-9ed7-b8ffd3243e5e","resolution":{"observed_at":"2026-08-04T15:40:51.508482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:51.713483Z","title":"BEIR : A heterogeneous benchmark for zero-shot evaluation of information retrieval models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.713483Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:1ff839b24da143e36932d9132f4dd611ca9147349799aab0913fda3a9c37d5dd","observation_id":"846f9589-ad40-49fe-9168-38e0ac7502cd","resolution":{"observed_at":"2026-08-04T15:40:51.713483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:51.912413Z","title":"M u S i Q ue: Multihop questions via single-hop question composition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:51.912413Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:1b6615394e9e554886b98127bc982fc40669d423afb03f01e54a258091098195","observation_id":"d2e6dd4c-2f78-4ed6-b36a-e0095811b123","resolution":{"observed_at":"2026-08-04T15:40:51.912413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:52.067534Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.067534Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:b4272fbb122a0c6be466e2f4b310a1f85bd7a7aaf5e2e0b64edd2a763d6146ae","observation_id":"1b9e41b8-cb9a-4a5c-a3b8-82ab7dd1c457","resolution":{"observed_at":"2026-08-04T15:40:52.067534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:52.218684Z","title":"In-context former: Lightning-fast compressing context for large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.218684Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:09930fdbb2dfab623664cda6427cef29757206ae01c0f71470c122485faff39d","observation_id":"7407b3f5-96d9-4a46-965f-e23deb61f06a","resolution":{"observed_at":"2026-08-04T15:40:52.218684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:52.373463Z","title":"In-context former: Lightning-fast compressing context for large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.373463Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:accdb9d859da586e2d42672e24b04f03763b23d8af327c55ca0b8a5b5da3103b","observation_id":"9d452867-1b77-4351-8543-c8d69393572b","resolution":{"observed_at":"2026-08-04T15:40:52.373463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:52.568891Z","title":"Chi, Quoc V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.568891Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:e37fab7e020ac8a03916f42b2927f5fa987500b5ef8f4663ffe422cefc9e882c","observation_id":"3d78ae07-a880-471f-accc-ab2463995c4f","resolution":{"observed_at":"2026-08-04T15:40:52.568891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:52.735619Z","title":"RECOMP : Improving retrieval-augmented LM s with context compression and selective augmentation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.735619Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:59a6a410e003967dd13bfa5c106cfc0366be3d71b179d705d81b0977cdf1952b","observation_id":"9cd01866-2b8b-4afd-858e-010fa12ea0e6","resolution":{"observed_at":"2026-08-04T15:40:52.735619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-04T15:40:52.914567Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:52.914567Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:ece9d2dbe21a4373d70109f94a08b07b41a17acf2035c37d8a84e819e8f007cc","observation_id":"a079dfd9-6708-4bc2-bd15-2f61c9d5cf33","resolution":{"observed_at":"2026-08-04T15:40:52.914567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:53.022722Z","title":"PRCA : Fitting black-box large language models for retrieval question answering via pluggable reward-driven contextual adapter","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.022722Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:946903f7496d6a9857e7ef5074cd90c46f4155ff8c2c615cb7d714a51a4e6be4","observation_id":"1e5fac86-5f1e-4b00-af97-99cadedd844f","resolution":{"observed_at":"2026-08-04T15:40:53.022722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:53.216584Z","title":"Cohen, Ruslan Salakhutdinov, and Christopher D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.216584Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:d40f86c707fc4d10facec343e52dadedfcedf3ef0470b3bb72be013e7a6074b0","observation_id":"6a0c1f6a-4497-4d9a-872d-c3c79e4def1e","resolution":{"observed_at":"2026-08-04T15:40:53.216584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:53.356291Z","title":"WebVoyager: Building an End-to-End Web Agent that Masters Complex Tasks , 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.356291Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:a8efc70e38795b157e8201ccf5b8ff8da77c3cafd0b9dfdeb2c5757fd215f5a2","observation_id":"83a80df8-a618-453c-bff6-95db0da0b19e","resolution":{"observed_at":"2026-08-04T15:40:53.356291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:53.482852Z","title":"DAC : A dynamic attention-aware approach for task-agnostic prompt compression","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.482852Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:73a1a4f62a0acaa773f8a976d81174d83cb2f4d0ed6249870b324cae7fc0741a","observation_id":"dc1fa1a7-a205-49b8-9f82-87bcc1fcada9","resolution":{"observed_at":"2026-08-04T15:40:53.482852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v39i24.34800","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging attention to effectively compress prompts for long-context llms","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"4fce3a0e-047f-4929-936a-c2a5575b80a6","year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.633149Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:5f6d46df2331f5bebc5fc42c99e25a1c4f91e0e514385d893c93f73b114160a9","observation_id":"8a582282-776d-43b2-8bba-2ab5afce347a","resolution":{"observed_at":"2026-08-04T15:44:06.675319Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:53.842764Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:53.842764Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:ac6a1493e5b04e62c4464b3bc1cf5f634407e70de846cc17efb6bc731b17b89b","observation_id":"50886068-8b40-4e2e-901a-3a27557cecb0","resolution":{"observed_at":"2026-08-04T15:40:53.842764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:54.008384Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:54.008384Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:27a0d79282ebae342e68504cdbb5eb31a1b7db3466effde85dd139011be400a7","observation_id":"486ed240-9164-4568-8945-f8606d3b2276","resolution":{"observed_at":"2026-08-04T15:40:54.008384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:54.234140Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:54.234140Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:401b949937559d1eafcb11cec55f4ad65b4c2ccaae5ca67aab1613620e608528","observation_id":"291f245b-90b1-4ce7-a205-8933f44f48db","resolution":{"observed_at":"2026-08-04T15:40:54.234140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:40:54.406568Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:54.406568Z"},"links":{"citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:bcef1d118f2759d3568b9fd1a181bdcb9487f493b9a4d3d58a8bc38ee7e4ffba","observation_id":"953c4804-90b7-4be3-af3a-cbf3aebbe635","resolution":{"observed_at":"2026-08-04T15:40:54.406568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":65},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 4 inbound Pith citation observations for arXiv:2509.19228."}