{"as_of":"2026-08-11T04:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c7c1560565005025c7ce9f62eee888aabfc7afe27db4e0ae5ca06e733bde7d2","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:48:34.721671Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.00902/citation-record","integrity":"/paper/2608.00902/integrity","json":"/paper/2608.00902/citation-record.json","paper":"/paper/2608.00902"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:36.445176Z","title":"You already have all the clues you need; your job is to use the tools to find the answer","venue":null,"work_id":"eea82f73-6f99-4d43-98fa-6c1c32ce2b93","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.036950Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:ecccb55ffd40cd4b370b309c9d9ff963b8dc2664e7e6a96e6313b21326b543ee","observation_id":"0293747b-a807-40fe-ab9e-f5e54720ab84","resolution":{"observed_at":"2026-08-06T00:48:36.573924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:36.245807Z","title":"This is a HARD floor -- the investigation is INCOMPLETE until you reach 20","venue":null,"work_id":"28e705ad-087c-462f-ab18-20561f08543d","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.132844Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:6654ebf6e6952368cef6682ff61dab0746f0f5fc160a1c705e9d47d57922c6b6","observation_id":"8dc79790-0004-4b8e-bfff-fb425fb45f57","resolution":{"observed_at":"2026-08-06T00:48:36.334696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05527","last_updated":"2024-09-30T22:44:58Z","snapshot_observed_at":"2026-08-07T12:20:18.370756Z","submitted_at":"2024-03-08T18:48:30Z","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05527","snapshot_observed_at":"2026-08-06T00:48:33.732453Z","title":"Preprint, arXiv:2403.05527","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:33.732453Z"},"links":{"cited_paper":"/paper/2403.05527","citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:f7ee821f649b8aa189881e5a7a1e9edcaae451dbf2934bf258af996d876f7387","observation_id":"b22813b0-b0d5-4967-9874-23a3fff43484","resolution":{"observed_at":"2026-08-06T00:48:33.732453Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:35.846408Z","title":"I cannot determine","venue":null,"work_id":"4090a004-0661-49d2-9baa-86394dfa1364","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.429204Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:3d3951ee7b58962021048e3a62b9a5730fe80f94bb54c9b4c3fd9af1704a9833","observation_id":"217fd4c8-91b9-440c-a615-61154ecfa4cd","resolution":{"observed_at":"2026-08-06T00:48:35.888590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.16284","last_updated":"2026-05-26T20:24:41Z","snapshot_observed_at":"2026-08-04T23:57:41.065078Z","submitted_at":"2026-02-18T09:06:53Z","title":"Fast KV Compaction via Attention Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.16284","snapshot_observed_at":"2026-08-06T00:48:33.949007Z","title":"Preprint, arXiv:2602.16284","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:33.949007Z"},"links":{"cited_paper":"/paper/2602.16284","citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:a0b63d6c0c9a1a90a91d00916728a1220db3c23926e6550867849097468a55b4","observation_id":"3f5d45c6-49f3-40c7-b406-2b9d0d333b7b","resolution":{"observed_at":"2026-08-06T00:48:33.949007Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:35.185543Z","title":"Once you have a top candidate, you MUST issue additional verification searches from new angles to confirm the candidate satisfies EVERY criterion","venue":null,"work_id":"51f749ee-a4de-4d66-957b-44bb70ed8ef6","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.634815Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:b6bcfa3501e194edb365758c42eaf08f17e4844b4e1f15d9d198b0c5e31f3e65","observation_id":"8d49fe04-4393-4429-bf85-2afc6b54f092","resolution":{"observed_at":"2026-08-06T00:48:35.339161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:35.031126Z","title":"Start by decomposing the question into all its individual criteria","venue":null,"work_id":"dc65213a-364f-4d0a-b5fc-051122a28f2d","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.721671Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:e500a5fe393941b4b168d59be329311f9ad975ace2cf88c6d3fbfd9007f84528","observation_id":"bb43e182-fd55-4722-af22-f48bdfd11aff","resolution":{"observed_at":"2026-08-06T00:48:35.073156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:35.969177Z","title":"You MUST call` get_document`AT LEAST 5 times across the investigation to read full document content (snippets are truncated at ~512 tokens and the answer often sits past them)","venue":null,"work_id":"d4b0c240-c20d-4096-9af8-cb37fd1f3cd1","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.280367Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:126c7dbf578b47eb2dc5e2695f80c9dca1b2019d949bcfe474119a4aa9523d78","observation_id":"eb89ede5-9326-40f7-92b4-d51dd5193b02","resolution":{"observed_at":"2026-08-06T00:48:36.143581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:48:35.563355Z","title":"Never repeat a search that already failed","venue":null,"work_id":"f742a8e4-9c32-4527-820b-0e0272e3279f","year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:34.531361Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:7c37b1517f2aed402d34d14aa1485851bb50b9f6de1eaee76321481eeef8ef98","observation_id":"990033d1-9fbd-4351-9696-16f0e5941eaa","resolution":{"observed_at":"2026-08-06T00:48:35.701474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-06T00:48:33.454281Z","title":"Alessio Devoto, Maximilian Jeblick, and Simon Jégou","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:33.454281Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:92b7314668b258afad2f82b15452acbed52f46c0710be0e45daf3cbc5c5b0df7","observation_id":"c1e7ff5d-8e8e-4b48-8fca-50a6cc8b8ef3","resolution":{"observed_at":"2026-08-06T00:48:33.454281Z","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-06T00:48:33.565936Z","title":"Preprint, arXiv:2510.00636","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:33.565936Z"},"links":{"citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:9d262cdeebbe325e47a13be5308b186af542b0548c98cdcb6dedd2a8728444c7","observation_id":"72930e78-df81-4447-ad0e-ffbac1dc6801","resolution":{"observed_at":"2026-08-06T00:48:33.565936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02230","last_updated":"2026-05-25T23:34:23Z","snapshot_observed_at":"2026-08-04T00:19:14.332924Z","submitted_at":"2025-11-04T03:43:05Z","title":"Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.02230","snapshot_observed_at":"2026-08-06T00:48:33.827598Z","title":"Preprint, arXiv:2511.02230","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-06T00:48:33.827598Z"},"links":{"cited_paper":"/paper/2511.02230","citing_paper":"/paper/2608.00902"},"observation_digest":"sha256:1ad24ce793d6352cbd61c3e2aa9870fbf249a3e86491803c7f7fae5c52f7036f","observation_id":"668bb1c5-c593-4f8d-a58a-3735a852338f","resolution":{"observed_at":"2026-08-06T00:48:33.827598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00902","last_updated":"2026-08-02T00:08:44Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T16:29:08.600847Z","submitted_at":"2026-08-02T00:08:44Z","title":"Practical Online KV Cache Compaction for LLM Agents: An Empirical Study"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":12},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2608.00902."}