{"as_of":"2026-08-14T20:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df0d1fa5511645d644a6e8939ead0945fe470f32323de323abb0c258648d2a5d","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-14T06:32:32.682623+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-10T02:41:38.475476Z","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-08-11T00:24:33.433262Z","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:b0aa7d372965370694e377de2d0eb0c08f5e9eb8d1e54af9948f4ba54bb5fbe2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T02:41:38.475476Z","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-13T10:34:20.953214Z","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:fa4a781fd198444e6fb09c0cead9a89f73083542bd2179f4685df914547a7e12","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T02:41:38.475476Z","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-13T10:34:20.953214Z","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:2dbc899288b6469a53144e8b987833806909fd4a010a77c183b2ce46984ba962","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-10T02:41:38.475476Z","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-09T19:27:31.243864Z","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:672b56465f38d8909283907de6fb96f732637868c01241101a54044d8c754bc7","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-14T05:40:31.838922Z","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-10T02:41:38.475476Z","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:05c1328afc6e1f6f6faf4d772a004bf8900d984c0f306b5e8d5cfa7071141e57","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-10T02:41:38.475476Z","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:edb13c2cd44a3208b769452e6e4b06e5e3aad450e425a514baba227d54d585db","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-10T02:41:38.475476Z","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:dd9c5af7eadfc452ba26eb1e53a2d65c46c14c6534e37e5f8f8a8bb19d0c6502","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-10T02:41:38.475476Z","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:109fef0b403f1fa48b6a38596084c09c8f5cb89c6b5dff61b274191cb1c326f2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T22:59:21.199580Z","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-10T02:41:38.475476Z","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:369255d7ac5c6b453c7c79e1f12f534c5d27faa7ea2adaaf1f7cb7a4db5ba09d","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-10T02:41:38.475476Z","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:40da0bebd380a0865a87fbe1ec21bed8ce6701e908bcee998a2b166c3fa49f70","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-10T02:41:38.475476Z","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:42da86eb09a2b1c31052184813d1853159e8a923acaea8f430250d590d34f5e5","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-10T02:41:38.475476Z","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:1944dcfc26f6a3424055b0a1d453bc677e91147b2ef39a7c79b8a9d1ba16f653","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-10T02:41:38.475476Z","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:8775a1029b8062ed3fe2a7c98d05a8b238c571b6375a3f771e65f7eb30e26c4c","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-10T02:41:38.475476Z","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:3bca6e538807bfc15787e3cacb9c2fd536cb97822ee940acf3a8eb79e2515150","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-08-12T08:20:39.042893Z","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-10T02:41:38.475476Z","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:43af723ed1f24c542972f41ca4bd205338afaf0ff192a7f7762c72db75a3e4b6","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-10T02:41:38.475476Z","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:fc721b146b7d1a530341d00cd8897863969d2b90ce0e349ff839f36cdd9d0d9c","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-10T02:41:38.475476Z","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:3dc78cde04ede004ab8c6e476fb5b43fcc3d1684ddbc86b3d5cc22b6c5d6a482","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-10T02:41:38.475476Z","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:5e7b1e8ebce738683c5f04a7efc815921384c839f1a3bcf3592c3572dac2f21b","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-10T02:41:38.475476Z","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:c48abd54d9249c08a6c8ac04ad13107d493ba0f61652d03393d6df5d57b4c7f7","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-08-12T23:46:39.925991Z","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-10T02:41:38.475476Z","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:d362cfbb75db580732dbec07908595e5d92afea6e1df9352220926b555f21a90","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-10T02:41:38.475476Z","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:909dc1e4d41d5e85c7dd93f3634f2ebcdf89a40355e35a6609a121f3d1b649c5","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-10T02:41:38.475476Z","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:a28a147a1bf5a0f70c98bc7274432fb1b7674be8fecdc3824c2efac2fb1b0a32","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-10T02:41:38.475476Z","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:451f0f6e3c0c15c347216aa23b6e5b8e03816faa4251c91fff362131c5d50f65","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-10T02:41:38.475476Z","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:523e8456dcb0142a1b7979d74fbf6ecffa40f91543abfc3a1da449c22955c160","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-10T02:41:38.475476Z","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:c99b719cbb78776bd3c31d030d019296c002377510689ed6e909008aa5e0ea7c","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-10T02:41:38.475476Z","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:1c7e221a0d89116c7b6805dc298e43fe6a82a4dfc40a3095836d8571e0c7a734","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-10T02:41:38.475476Z","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:49d48aed9fa1e2f8eca02350d4cae0f17eef7d9f105c6820008f34a80bb3c7b9","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-10T02:41:38.475476Z","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:e0b476d93df46420da58fa6e3cd86f2af73d87d7f920f89b7d053ad0183b9d1f","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-10T02:41:38.475476Z","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:921d3a2c8587df010fbf612027361ec7b1eb9366e0dec4959bd916402b8265ef","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-08-12T23:39:40.547591Z","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-10T02:41:38.475476Z","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:a2774effe41d7b569ab226973a0993e7370911b2bc071b8e2d8155ab76c72206","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-10T02:41:38.475476Z","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:1be5fb07344a23f5d31babb326079350fdae34b90ca32d2c34db138ec5db8d6c","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-10T02:41:38.475476Z","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:70f3276939b5aa07f10c24c897f3daf49ac24b79f01407b0d2c19228a2948129","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-10T02:41:38.475476Z","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:42ff6517f27493e28b93efdd3d54ded268b5236045ac68b452df9d299470eb66","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-10T02:41:38.475476Z","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:944c30a79a3f6b2c7caaf3b8041763e8040b09f0ba934bd7b2c75539aafea872","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-10T02:41:38.475476Z","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:38e1d5f1be1e2baef735a2bce118eb9a4a7a42e8b65c439535e91903f30c931b","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-10T02:41:38.475476Z","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:914b0e92825bbb47032d3e8da6dbd5ce7b444200df3fc919c8514b5616cf8cee","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-10T02:41:38.475476Z","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:5143131134eb3fa80aa67f4d2d3f7a0b7d99d659486aa2d001edce8527e6f873","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-10T02:41:38.475476Z","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:316fb8d5a92f5d7a5871bc31ac8f9ec670753c90e6b4aa2186732cfcecd72f96","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-10T02:41:38.475476Z","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:0cb8d9337568bf0d2f6b3345992acacd68c34124d0afa93b77bb1ca755e6315e","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-10T02:41:38.475476Z","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:a4211f2afdbcac313634bcc323b06e778dadf7293a86933329365f083dce68da","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-10T02:41:38.475476Z","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:259de5d58b04d36df01981a9590cbd9e999151923dff684773520b5b2a011886","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-10T02:41:38.475476Z","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:4ba657b02e67fe497e5c3bd5cac0912f195e26c45e2e411dfb64bf26555185d0","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-10T02:41:38.475476Z","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:f9f2203e9f8d4c9c184467888b52d71302f58c6fa123e2b31f7bc173030c8d0c","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-10T02:41:38.475476Z","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:dd4b134d15f9b5356cf388d8075ad6cb073d8098c38dc0ea52c7e77be0f069de","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-08-12T22:11:52.055765Z","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-10T02:41:38.475476Z","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:428113f946c806eb095ddc865b84c1ba62c338fbb302034b3a488efad86917ad","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-10T02:41:38.475476Z","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:50d44a13d2897cc72380b97557c1e128ba36e49bb72f46aabb14b40eb76eb5b6","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-10T02:41:38.475476Z","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:db18b5a9a1c56fec4b08c3ade29ca1b2477b4e48dff7def1e5943d6179f6537d","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-10T02:41:38.475476Z","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:2b111eddf1fbb36bb69033785799df342e4004c995ae12a2d4bb11ee0cd03f69","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-07T17:46:47.440455Z","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-10T02:41:38.475476Z","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:3d9ccb9a3686231fef9a6a231117d0db9451bf07c47a0d0d228567b6f6974103","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-10T02:41:38.475476Z","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:0f8940c25bb634a1f801cd006dbc55c99cdb4561b7a488f6e0a887ed8e716e3e","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-10T02:41:38.475476Z","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:2a2055c226cd9cea48514e35c8012bdf017fc90ae3115bd5fb1e24e2a3092e1d","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-10T02:41:38.475476Z","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:a480369b53e0699f2ca113166c2f6a0d1f0c2d435fd034b7c18215b523eb6f3e","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-10T02:41:38.475476Z","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:134980c3026146b32010ee93831a1140df412e205a9e3bf862d7e8a77980bdcb","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-10T02:41:38.475476Z","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:dc0888463a4f1c3b734070bd2d9b2c27112b36b54d7d27782bd2c8c59cf7c8a5","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-10T02:41:38.475476Z","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:1076a7bed8b850863d6e3222292cabdf47cd92066ec6953f1c7ec8b5d07006f7","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-10T02:41:38.475476Z","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:5a54f2168297016480a9d5416d488c280867c382f1d52d6dbe970df4e2be283b","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-10T02:41:38.475476Z","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:a0c05f88c5117753b1754837500e76f326e293fcacc5cb96256db2cd63044b9c","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-10T02:41:38.475476Z","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:801040670d51394ca88892ac7e92ee1c5ce1bcb08f4eddffafa1f561f5d61507","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-10T02:41:38.475476Z","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:5b724efa936aedf266655cbc51112a7076cfe1eda50f8a1280303e8c49548e48","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-10T02:41:38.475476Z","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:f6ce995211b77dd28a6a0b5aacbed00481b2b7508d2992b1d5637a15e3e57c57","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-10T02:41:38.475476Z","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:337c07d74a067ceefa1c398fdcdf07462efd2bfb6971cc518029b2c4484a7249","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-10T02:41:38.475476Z","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:26e15380a448003e89fe8f33355c0bd3e8ffef0c6bf21d0f74996c7068000f81","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-10T02:41:38.475476Z","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:c6960410d225b0a28e929a663ec3eb70e20317d1dc40dfbf8ee3a5976cf8c1a7","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-10T02:41:38.475476Z","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:6484f4e78182adb91608e7ac3b1c236ffad91b2da91035612b255d8bf3949e31","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-10T02:41:38.475476Z","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:d2c111a8a0c7239a009c423f21ee674780eab2c1ca55701e705f05ef304b9254","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T02:41:38.475476Z","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:6b806972eaa02acbb1b149f805eeeb72a54e8c5b441c36778833c7851c668c45","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-10T02:41:38.475476Z","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:07563df64d288359e254a47fdf93670a7c9d84b2cad08335b924ab88719f6a76","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-10T02:41:38.475476Z","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:4dcab4a68c44dbb3cf15db58171a0dbd96573e47512e2849a0f1dbdf72c3a4ec","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-10T02:41:38.475476Z","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:0db8db6d8522561d619c56a4c95d22a25e6336812c824475a0b11857a90ccc1b","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-10T02:41:38.475476Z","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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 4 inbound Pith citation observations for arXiv:2509.19228."}