{"as_of":"2026-08-14T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2063517e81f704b1c44775e93998842828ea108a9dc32fe956acf07a22dd1191","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-03T20:53:44.487336Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-03T00:43:51.470200Z","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":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.01520","snapshot_observed_at":"2026-08-03T00:43:51.470200Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28699","last_updated":"2026-08-06T10:44:15Z","snapshot_observed_at":"2026-08-14T06:51:28.858675Z","submitted_at":"2026-07-30T11:04:45Z","title":"WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T00:43:51.470200Z"},"links":{"cited_paper":"/paper/2607.01520","citing_paper":"/paper/2607.28699"},"observation_digest":"sha256:122b5cba214220c712f2b3aa4b681551404d55d62a1d9a2a1dc4087343391c2a","observation_id":"ffda679e-359e-4a8e-891c-a3ae5763e150","resolution":{"observed_at":"2026-08-03T00:43:51.470200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.01520/citation-record","integrity":"/paper/2607.01520/integrity","json":"/paper/2607.01520/citation-record.json","paper":"/paper/2607.01520"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.820283Z","title":"Keyformer: KV cache reduction through key tokens selection for efficient generative inference.Proceedings of Machine Learning and Systems, 6:114–127, 2024","venue":null,"work_id":"1b0672c1-5f9d-4a6a-9d0f-676aae8175b7","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:2817039d2af9bb762aac1a1e0f291bd946998a8a7ab9b20fe1dfc6cba2e9cb89","observation_id":"578a657a-1bf4-44f9-aaf8-d5402241a5db","resolution":{"observed_at":"2026-07-05T01:40:34.822137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.837862Z","title":"Support basis: Fast attention beyond bounded entries","venue":null,"work_id":"ed3e5ebb-05fa-42cb-b2eb-aba420b76635","year":2026},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:51bb6478a9b08fb4bd6d36f3ee498a75ad14fac8ae2b942fb60121f397a9fb10","observation_id":"51bb7488-6964-4ef3-996b-5b19e5155973","resolution":{"observed_at":"2026-07-05T01:40:34.839910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.846638Z","title":"Fast attention requires bounded entries.Advances in Neural Information Processing Systems, 36:63117–63135, 2023","venue":null,"work_id":"d27ddb3d-f983-4b3a-8e1e-dfa03da9bc15","year":2023},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:a4e4c2b278663e1f5e775a8cb81adb2b5fcc9f384b44dffdcf6bf95e28b136ab","observation_id":"aead27ce-3fdb-4e1a-9145-2ddd2a68d0cf","resolution":{"observed_at":"2026-07-05T01:40:34.848301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.868170Z","title":"Effective gene expression prediction from sequence by integrating long-range interactions","venue":null,"work_id":"32b6a2af-1f87-477d-a71b-c2f8b0e6288d","year":2021},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:630aa514769624ad5dc68f08dcba2b1b3865db1c7475b153d8cbfb3b0bd1d433","observation_id":"d536ce97-039e-4a41-997d-974242cccb7f","resolution":{"observed_at":"2026-07-05T01:40:34.870120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.828415Z","title":"wav2vec 2.0: A frame- work for self-supervised learning of speech representations.Advances in Neural Information Processing Systems, 33:12449–12460, 2020","venue":null,"work_id":"34e88982-4525-4117-8cf3-a7cbe849d0ea","year":2020},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:45876e357501eec45afdef5289b0301c66dffe03ccc4de00c3fc084f1c2cff47","observation_id":"c0f40314-6dca-4961-ad10-c511cb54bd71","resolution":{"observed_at":"2026-07-05T01:40:34.830450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.840572Z","title":"LongBench v2: Towards deeper understanding and reason- ing on realistic long-context multitasks","venue":null,"work_id":"e880e90e-76c1-493d-b3a0-ac939a7c76cb","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:ea92e9f39d600a5e0e5351208f5aace11fa9902e3bb7c3bfc39ff92029134ca1","observation_id":"dd0faa31-a4ff-4e92-abe4-b546675d8cee","resolution":{"observed_at":"2026-07-05T01:40:34.842466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.835643Z","title":"On a generalization of iterated and randomized rounding.Theory of Computing, 20(6):1–23, 2024","venue":null,"work_id":"6c96dc8d-e7e0-4d8c-9a63-a9bbdb02554a","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:bff74fef10add3e60fd45dd7ba9ca368d5869a692d050d8502c09f154849fdb0","observation_id":"5142cba2-91ca-430f-8df8-18cd72207bac","resolution":{"observed_at":"2026-07-05T01:40:34.837235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T12:12:25.932373Z","title":"Language models are few-shot learners.Advances in Neural Information Processing Systems, 33:1877–1901","venue":null,"work_id":"3a9b4b23-f8f5-4ea0-9256-3a44d14be599","year":1901},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:dd10ede0a679eac82c7d9352cd7969d3771d19390a199ecf2af6f3ae3bf8647e","observation_id":"048142dd-0721-42e7-91d5-89333ea03a17","resolution":{"observed_at":"2026-07-05T01:40:34.835008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.818326Z","title":null,"venue":null,"work_id":"34f76352-5c79-47e9-92e0-ab576ad0978a","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:9ebac90b78bb88d0269310af73322104159f8ee95e8059ed4a0446efd9acd414","observation_id":"061afa8e-aa2b-4d4d-8510-8fcd1d72339f","resolution":{"observed_at":"2026-07-05T01:40:34.819641Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2406.02069","last_updated":"2025-05-15T17:18:12Z","snapshot_observed_at":"2026-08-13T04:39:30.300015Z","submitted_at":"2024-06-04T07:51:30Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","version":4},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:031c7d62cb34b93638ea39dda96b8f910bba91234297cd80a3eb26620929467d","observation_id":"dfcc7161-af29-4961-aed2-91c42007df65","resolution":{"observed_at":"2026-07-03T20:58:57.304826Z","resolver_source":"local_arxiv","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-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.831041Z","title":"Low-rank thinning","venue":null,"work_id":"f19bb1d2-76c3-4381-9d58-de7310f2a6b0","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:f81fb389731945df81afde0ef784a805a740f245249cf2236b115398080d3f44","observation_id":"a197b57b-0434-4694-a800-232407301a4e","resolution":{"observed_at":"2026-07-05T01:40:34.832559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.853207Z","title":"Super-samples from kernel herding","venue":null,"work_id":"210fa9cc-dd43-4e4b-912f-a96160f33bb8","year":2010},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:04cfa64d03907b5f49195a23424b9439252859d611e7fb640bec27e4551e7432","observation_id":"f4e70011-78c6-471e-97a0-cbce841802a2","resolution":{"observed_at":"2026-07-05T01:40:34.859496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.833122Z","title":"Transformer-xl: Attentive language models beyond a fixed-length context","venue":null,"work_id":"e60b10c5-3952-40b3-9158-af044608839c","year":2019},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:cc75da6abf1b324d422aab7508be16397d17d62341e083249acb1048110cea22","observation_id":"9c60fcfb-1806-4133-9fec-da92e7f39515","resolution":{"observed_at":"2026-07-05T01:40:34.834764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.843127Z","title":"BERT: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"ca6a1ab3-801f-422d-8395-60a79238bac5","year":2019},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:1a2a663ff86a46e038be390af03e15c6a54b7d345dcd61eb06c4fbd27914dad3","observation_id":"d27bed6d-a67f-4966-8289-4c89b9d4ae2e","resolution":{"observed_at":"2026-07-05T01:40:34.845809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.863772Z","title":"A mathematical perspective on transformers.Bulletin of the American Mathematical Society, 62(3):427–479","venue":null,"work_id":"d9e4528e-bbbe-4ae2-9689-06c01c457d23","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:b28acb4bfea137a4f9b690016b0ae3bc0cdde70f3ba09899b972bc02633e77ca","observation_id":"d17eb2a1-185d-42ec-84cf-2f24e3c3ebf9","resolution":{"observed_at":"2026-07-05T01:40:34.865328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2502.15955","last_updated":"2025-02-21T21:37:52Z","snapshot_observed_at":"2026-08-13T10:32:21.031486Z","submitted_at":"2025-02-21T21:37:52Z","title":"Compression Barriers for Autoregressive Transformers","version":1},"cited_work":{"arxiv_id":"2502.15955","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15955","snapshot_observed_at":"2026-07-10T01:36:43.991910Z","title":"In Proceedings of the 38th Conference on Learning Theory (COLT), volume 291 ofProceedings of Machine Learning Research, pages 2757–2785","venue":"cs.DS","work_id":"bd71a490-6f5a-4b98-9e46-8a8cf63e241c","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"cited_paper":"/paper/2502.15955","citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:0319be505597f5bda728f493b6899273927a27f8785cf90e3017ad63fb412037","observation_id":"ccd80069-5d95-4ada-8a30-80c86ac588f2","resolution":{"observed_at":"2026-07-03T20:58:57.292372Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.865871Z","title":"Revisiting frank-wolfe: Projection-free sparse convex optimization","venue":null,"work_id":"6ad0b714-d674-4f9f-8862-d6ffd0c31ab0","year":2013},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:df80c21f73f4d7e3922a7a624ef33fa09201ae1c7e2717c3eed1f43a7cf2c165","observation_id":"9a87ce7d-41d1-4cb6-9aec-3fbac7ab3b5d","resolution":{"observed_at":"2026-07-05T01:40:34.867446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2502.07861","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T20:58:57.299511Z","title":"Balancekv: Kv cache compression through discrepancy theory","venue":null,"work_id":"e3b6d9e0-bfb9-4563-86be-941a4a34f3e0","year":2025},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:26ad03afb1438fa7ebad4534147d84f0ca217fc0ac15986ae6da4cce83b68f47","observation_id":"3f5d7848-8c90-49d4-a047-2337750db863","resolution":{"observed_at":"2026-07-03T20:58:57.301648Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.861620Z","title":"SnapKV: LLM knows what you are looking for before generation.Advances in Neural Information Processing Systems, 37:22947–22970","venue":null,"work_id":"11273bf6-a9dc-4363-9426-6b375758ddfd","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:a5056c4e53bfedc1ae71a276502be381b49523e25fea73b01a66a5dd13a6d9e2","observation_id":"912cbfd2-6972-4e78-b60e-e1ded5a7707d","resolution":{"observed_at":"2026-07-05T01:40:34.863191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.850963Z","title":"ScissorHands: Exploiting the persistence of importance hypothesis for LLM KV cache compression at test time.Advances in Neural Information Processing Systems, 36:52342–52364, 2023","venue":null,"work_id":"11e160c4-f22a-4e29-88da-f65776c29c85","year":2023},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:d7a801506f124311ba875bf5a2768dad90fcafc51ee7dca1f3a69d64f8ca9708","observation_id":"ad841e48-b221-415e-bf2c-98af9e3db4fc","resolution":{"observed_at":"2026-07-05T01:40:34.852585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.849211Z","title":"YaRN: Efficient context window extension of large language models","venue":null,"work_id":"1e74abcf-8f1b-41e7-a569-1696033e503c","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:5c1dcc2e6b42ef4aac5b93d043f34586ddaf32a0911939ab0cdfd36089d81cf0","observation_id":"d453dfd0-5a11-4164-91ec-6fcd21f190c7","resolution":{"observed_at":"2026-07-05T01:40:34.850958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T06:03:21.722507Z","title":null,"venue":null,"work_id":"d114ce2f-23a7-47de-bb9c-7e272e042486","year":2021},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:669f55c7ca986e9bc07716bd051a2ca46b7aa0d4d674e577b1e75489d1e7236f","observation_id":"1435f0d4-28ed-4752-af92-87cf0c3e6563","resolution":{"observed_at":"2026-07-05T01:40:34.858178Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T15:06:18.874513Z","title":"Attention is all you need.Advances in Neural Information Processing Systems, 30","venue":null,"work_id":"dd7702a3-0779-4f76-b30d-04ee869ea191","year":2017},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:c040edb6de234cf797eac3b7fbcdeef451d4cdc621f36199b5cf28b38dca9ed7","observation_id":"659d8172-708a-4bc4-8576-99f4f4362462","resolution":{"observed_at":"2026-07-05T01:40:34.861005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.871172Z","title":"Efficient streaming language models with attention sinks","venue":null,"work_id":"27760773-a1f6-414b-8857-9a6ee5b59781","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:9322b666b0ced40d0f1da5a70e9733c6afd4e1f874fb2d049be7ea6f4c5e0bcb","observation_id":"9fd9baa8-16c7-4976-9b90-cfd44c6dfe53","resolution":{"observed_at":"2026-07-05T01:40:34.872612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:54d79d30c58baf17a803733cec199d575c452b104f015ac71dc401384edd7501","observation_id":"2ee25660-92da-4d64-8e8c-9adff4e93186","resolution":{"observed_at":"2026-07-03T20:58:57.298418Z","resolver_source":"local_arxiv","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":"2402.06082","last_updated":"2024-02-08T22:17:40Z","snapshot_observed_at":"2026-08-13T04:22:57.706555Z","submitted_at":"2024-02-08T22:17:40Z","title":"SubGen: Token Generation in Sublinear Time and Memory","version":1},"cited_work":{"arxiv_id":"2402.06082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.06082","snapshot_observed_at":"2026-07-04T15:59:57.356631Z","title":"Subgen: Token generation in sublinear time and memory","venue":null,"work_id":"f54056d6-50f4-49ed-97a1-2d2f91ea0c67","year":2024},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"cited_paper":"/paper/2402.06082","citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:0ec2cabe0af0bac6216db7eede10a0c37bb210cac80656ce99740578f5272548","observation_id":"0dd53361-4fe6-4d8c-a761-b94c69ca0f63","resolution":{"observed_at":"2026-07-03T20:58:57.295575Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:40:34.851862Z","title":"alive set","venue":null,"work_id":"06713bc5-cb78-4385-ba82-24047b52b6b6","year":2023},"citing_paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-03T20:53:44.487336Z"},"links":{"citing_paper":"/paper/2607.01520"},"observation_digest":"sha256:274495fd2b8d9a4f2b59cfc7b997a3050fb10089e96bbdd77bde571ef1fb97d9","observation_id":"ced9066c-a915-4e36-b9fb-2c477b504cda","resolution":{"observed_at":"2026-07-05T01:40:34.853400Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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"}}],"paper":{"arxiv_id":"2607.01520","last_updated":"2026-07-01T22:36:21Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T00:23:26.640691Z","submitted_at":"2026-07-01T22:36:21Z","title":"The risk of KV cache compression"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":19},"total_outbound_references":27},"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 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:2607.01520."}