{"as_of":"2026-08-08T19:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d0ccf682cde27a2dcbaa41e5f72cd8ee42bfcfd6408fdabb0df8fd2fcef0797","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-07-31T18:02:37.532725Z","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-08T06:32:00.761636+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/2607.24331/citation-record","integrity":"/paper/2607.24331/integrity","json":"/paper/2607.24331/citation-record.json","paper":"/paper/2607.24331"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T18:02:36.430332Z","title":"Recalkv: Low-rank kv cache compression via head reordering and offline calibration,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.430332Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:1c1661c154663993e9a3c2ea07c5e5157a8a146d72ae25baef16a6bac36567a9","observation_id":"862eb8cc-cc02-4e6a-85a1-c7d7af83602c","resolution":{"observed_at":"2026-07-31T18:02:36.430332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02750","last_updated":"2024-07-25T09:16:05Z","snapshot_observed_at":"2026-07-06T17:25:18.238343Z","submitted_at":"2024-02-05T06:06:47Z","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02750","snapshot_observed_at":"2026-07-31T18:02:36.506503Z","title":"Kivi: A tuning-free asymmetric 2bit quantization for kv cache,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.506503Z"},"links":{"cited_paper":"/paper/2402.02750","citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:0d182a269abe5afe40ba6d35eec9bfed78735e319c285dcaa12a49b9bee95a4a","observation_id":"69b70bc8-703e-4a6e-baaa-4adb28ec024b","resolution":{"observed_at":"2026-07-31T18:02:36.506503Z","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-07-31T18:02:36.565598Z","title":"Kvquant: Towards 10 million context length llm inference with kv cache quantization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.565598Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:560698b944b873aa2fd5899c038765e56f2a783e76d04ff983d56c2e8a65e3d1","observation_id":"f3d06d8d-2096-4ed3-99a9-0caa284ef331","resolution":{"observed_at":"2026-07-31T18:02:36.565598Z","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-07-31T18:02:36.592194Z","title":"H2o: Heavy-hitter oracle for efficient generative inference of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.592194Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:95f2dfdf3d68f8a1266f373cf7e8fa441db775bb4fae1df3278b8a461b3188a9","observation_id":"8e0ee1b1-edb5-4ecd-8b21-b804d99e0809","resolution":{"observed_at":"2026-07-31T18:02:36.592194Z","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-07-31T18:02:36.707382Z","title":"Snapkv: Llm knows what you are looking for before generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.707382Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:2b6a7f71ba8131cb957818e768b0c575b0539280b7f0dd90397b23068d501fda","observation_id":"b1338ee3-e4a4-4c20-afad-95d119212cd9","resolution":{"observed_at":"2026-07-31T18:02:36.707382Z","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-07-31T18:02:36.859670Z","title":"Cake: Cascading and adaptive kv cache eviction with layer preferences,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.859670Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:1a2fac7ec90e147bb79baa22e23fa71ed697c828953f655cf88a81dbbb0558b6","observation_id":"81bab65e-19c4-4b63-b249-8f343cfcbc4b","resolution":{"observed_at":"2026-07-31T18:02:36.859670Z","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-07-31T18:02:36.994581Z","title":"Matryoshkakv: Adaptive kv compression via trainable orthogonal projection,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:36.994581Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:0bdb52f1a6d4c8a9a7bcde8c38ba68274bfba944d0cecfedd4133848ba56278a","observation_id":"c407f3ab-f285-4e53-b232-cc543716a4c6","resolution":{"observed_at":"2026-07-31T18:02:36.994581Z","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-07-31T18:02:37.117240Z","title":"Eigen attention: Attention in low-rank space for kv cache compression,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.117240Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:098f0d4f26ba9220839451b734ede1965601ee81757e0627fd0d81ac53a08ccc","observation_id":"c7295243-13f2-47d7-8b20-fe34abb6ce16","resolution":{"observed_at":"2026-07-31T18:02:37.117240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-31T18:02:37.280696Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.280696Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:31ff3eec3915416b1ee9c5c84b80b7d26d26d3bfdb222487a136493be74c5d4e","observation_id":"054be6c7-2b35-47f5-8d41-56a7475b00d1","resolution":{"observed_at":"2026-07-31T18:02:37.280696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21118","last_updated":"2024-11-04T02:08:55Z","snapshot_observed_at":"2026-07-06T18:54:41.705593Z","submitted_at":"2024-07-30T18:19:38Z","title":"Palu: Compressing KV-Cache with Low-Rank Projection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21118","snapshot_observed_at":"2026-07-31T18:02:37.410810Z","title":"Palu: Compressing kv-cache with low-rank projection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.410810Z"},"links":{"cited_paper":"/paper/2407.21118","citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:8e000f4184f24d2a4ef9992c643027df34d060ab170b2e2641535383593d66eb","observation_id":"d4431f5f-d32c-4e5f-9a5b-6ed319e2395e","resolution":{"observed_at":"2026-07-31T18:02:37.410810Z","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-07-31T18:02:37.473336Z","title":"Homogeneous keys, heterogeneous values: Exploit- ing local kv cache asymmetry for long-context llms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.473336Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:8cbaace319884f3bcc1dd0a626f9d2106033fd73b367eda256f111a1e1fe0c4d","observation_id":"0b374495-a81e-4bcd-8bf0-f0cf29084f14","resolution":{"observed_at":"2026-07-31T18:02:37.473336Z","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-07-31T18:02:37.532725Z","title":"Thin keys, full values: Reducing kv cache via low-dimensional attention selection,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.532725Z"},"links":{"citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:5682eb8e108196a96cafd32349f567fb457ccdf5e2a585fd4dcffbcd027b47b5","observation_id":"568f2806-1cf1-4d97-99d3-a265a814c17e","resolution":{"observed_at":"2026-07-31T18:02:37.532725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2607.24331."}