{"as_of":"2026-08-23T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56e9bcec69f561fa4f5cde6763646023d95f4eb09c18d4dda65f4dfd5ba13c26","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T18:12:12.360965Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T02:23:37.367317Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.26678","snapshot_observed_at":"2026-08-01T02:23:37.367317Z","title":"arXiv preprint arXiv:2605.26678 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25467","last_updated":"2026-07-28T08:59:57Z","snapshot_observed_at":"2026-08-18T18:02:58.651469Z","submitted_at":"2026-07-28T08:59:57Z","title":"Seen, Said, or Forgotten? A Causal Audit of Visual KV Memory Across Dialog Turns","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T02:23:37.367317Z"},"links":{"cited_paper":"/paper/2605.26678","citing_paper":"/paper/2607.25467"},"observation_digest":"sha256:dc249f6edc3c1c9d0c674282387bd1c11490dcb7788ca79f29f2ad7ffdcacc8a","observation_id":"990b7ee3-b278-44a9-acbe-ed4aac4204c9","resolution":{"observed_at":"2026-08-01T02:23:37.367317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.26678/citation-record","integrity":"/paper/2605.26678/integrity","json":"/paper/2605.26678/citation-record.json","paper":"/paper/2605.26678"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.21927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T18:13:48.420250Z","title":"SONIC: Segmented optimized nexus for information compression in key-value caching","venue":null,"work_id":"ae9f2892-f765-4bd9-8acd-d1cc1696bfb1","year":2021},"citing_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T18:12:12.360965Z"},"links":{"citing_paper":"/paper/2605.26678"},"observation_digest":"sha256:b8702c0e79a02bdc2261ab039aa7e84bebb8a7f81853ee68ac21d1379726558c","observation_id":"6feea8de-90d6-4f35-8a67-59e6d52e0b74","resolution":{"observed_at":"2026-06-29T18:13:48.421700Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.00636","doi":"10.48550/arxiv.2510.00636","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Expected attention: KV cache compression by estimating attention from future queries distribution","venue":"arXiv (Cornell University)","work_id":"06043450-dbd9-4e7f-92b5-07811314b835","year":2025},"citing_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T18:12:12.360965Z"},"links":{"citing_paper":"/paper/2605.26678"},"observation_digest":"sha256:119b99cd9e015f8603cb584284534044d15c3bce77f224b0520d253d0d76c257","observation_id":"7dc9b1ae-aede-4e91-ba41-bb5591cef449","resolution":{"observed_at":"2026-06-29T18:13:48.416481Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:29.197878+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:29.197878+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.15347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T18:13:48.417577Z","title":"FlowKV: Enhancing multi-turn conversational coherence in LLMs via isolated key-value cache management","venue":null,"work_id":"52fb9034-d14f-4aba-aefd-62381449489c","year":2026},"citing_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T18:12:12.360965Z"},"links":{"citing_paper":"/paper/2605.26678"},"observation_digest":"sha256:0cd73679906cdfa1ed2be1d3a091831cbd68683ec632f47097176ee493afc699","observation_id":"636f4bd3-3ee3-4c3b-99f5-907b59c52cac","resolution":{"observed_at":"2026-06-29T18:13:48.419167Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-29T18:12:12.360965Z","title":"Guangxuan Xiao, Yuandong Tian, Beidi Chen, Song Han, and Mike Lewis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T18:12:12.360965Z"},"links":{"citing_paper":"/paper/2605.26678"},"observation_digest":"sha256:f10071d540767387ecde70d037a357ea3773cc71c16fd1d8853b022385665efb","observation_id":"2c9d19b4-f665-4ef9-8aa8-8adc5a0d3e30","resolution":{"observed_at":"2026-06-29T18:12:12.360965Z","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":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T18:12:12.360965Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2605.26678"},"observation_digest":"sha256:95153e59a3bb08774809864fb3252eedf4cc44b96ea38ab1713fb4c90d986e6a","observation_id":"5e445344-70d0-4efa-9749-7da86b6fbbc1","resolution":{"observed_at":"2026-06-29T18:13:48.415959Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.26678","last_updated":"2026-05-26T08:14:39Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T08:25:11.893946Z","submitted_at":"2026-05-26T08:14:39Z","title":"NestedKV: Nested Memory Routing for Long-Context KV Cache Compression"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 1 inbound Pith citation observation for arXiv:2605.26678."}