{"as_of":"2026-08-09T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c96292cec7053619494fa779ef51c7961b7fbb44a3ff8cb4b03b86a700808b8c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:42:44.405709Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-09T20:42:44.405709Z","title":"Think: Thinner key cache by query-driven pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-08-09T20:33:01.899324Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-09T20:42:44.405709Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2501.19324"},"observation_digest":"sha256:24bcf928757f4607aa3ebd8ade077ef0aa4b3f80e0096438f0ee748af3a65fb3","observation_id":"259cc8dc-bee7-487a-8a9a-8d6126e9d80b","resolution":{"observed_at":"2026-08-09T20:42:44.405709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-07T15:42:22.978471Z","title":"Think: Thinner key cache by query-driven pruning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14085","last_updated":"2025-05-20T08:46:23Z","snapshot_observed_at":"2026-08-09T15:40:09.680852Z","submitted_at":"2025-05-20T08:46:23Z","title":"CE-LSLM: Efficient Large-Small Language Model Inference and Communication via Cloud-Edge Collaboration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.978471Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2505.14085"},"observation_digest":"sha256:9b81df1e9a6c64829785d4c4e247fcb7cc971c3c62a497ae362687d3c62778c4","observation_id":"2972a50a-33da-4f1c-a58f-be2f92ce2e4c","resolution":{"observed_at":"2026-08-07T15:42:22.978471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-07T14:43:26.032859Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17787","last_updated":"2025-05-23T12:00:09Z","snapshot_observed_at":"2026-08-09T08:05:54.380340Z","submitted_at":"2025-05-23T12:00:09Z","title":"Titanus: Enabling KV Cache Pruning and Quantization On-the-Fly for LLM Acceleration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:26.032859Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2505.17787"},"observation_digest":"sha256:31b75f91c07e48268cc61c2d28c9a9ba23b07860cdfcf6ebb4e3d247782fb554","observation_id":"f7b6bb84-7f31-4437-9796-8233bc028077","resolution":{"observed_at":"2026-08-07T14:43:26.032859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-07T12:09:09.833693Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00479","last_updated":"2025-05-31T09:10:43Z","snapshot_observed_at":"2026-08-09T06:24:07.358275Z","submitted_at":"2025-05-31T09:10:43Z","title":"EffiVLM-BENCH: A Comprehensive Benchmark for Evaluating Training-Free Acceleration in Large Vision-Language Models","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T12:09:09.833693Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2506.00479"},"observation_digest":"sha256:3216a53959bfc1ec6129f3e32b99f4093734d03f2abe6ab1f095161bb3e67e30","observation_id":"4ba0e51a-3a24-43a1-a20c-9cccf4b082c0","resolution":{"observed_at":"2026-08-07T12:09:09.833693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-06T23:00:11.208166Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20187","last_updated":"2025-07-02T05:12:29Z","snapshot_observed_at":"2026-08-07T20:42:38.846597Z","submitted_at":"2025-06-25T07:26:42Z","title":"Breaking the Boundaries of Long-Context LLM Inference: Adaptive KV Management on a Single Commodity GPU","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T23:00:11.208166Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2506.20187"},"observation_digest":"sha256:9efe724c63a8ccd65aa9a9d0259a2276b239e2cb94439b2540795272ea11c6d9","observation_id":"ef238234-d80b-46c7-922d-49b515f2b452","resolution":{"observed_at":"2026-08-06T23:00:11.208166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-06T14:06:38.003459Z","title":"Think: Thinner key cache by query-driven pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19823","last_updated":"2025-07-26T06:43:14Z","snapshot_observed_at":"2026-08-09T07:19:39.733736Z","submitted_at":"2025-07-26T06:43:14Z","title":"HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T14:06:38.003459Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2507.19823"},"observation_digest":"sha256:f2d4a80a56cec19bdf974a74ec1a829aa5fbd652d2ba0b89932610e974808aea","observation_id":"5e20b226-1612-4e36-adc7-a2a165d53f6b","resolution":{"observed_at":"2026-08-06T14:06:38.003459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T17:46:46.903274Z","title":"Think: Thinner key cache by query-driven pruning.arXiv preprint arXiv:2407.21018,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.15717","last_updated":"2025-08-21T16:56:29Z","snapshot_observed_at":"2026-08-09T15:11:23.510316Z","submitted_at":"2025-08-21T16:56:29Z","title":"StreamMem: Query-Agnostic KV Cache Memory for Streaming Video Understanding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T17:46:46.903274Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2508.15717"},"observation_digest":"sha256:db1690684d3ccaa37c24a69621e117ec7f2861b9e76afec800398600b2cc73d1","observation_id":"e854124d-b223-4855-ba5a-d24433b21779","resolution":{"observed_at":"2026-08-05T17:46:46.903274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-03T05:09:31.978370Z","title":"Think: Thinner key cache by query-driven pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.03216","last_updated":"2026-05-29T02:42:46Z","snapshot_observed_at":"2026-08-03T05:09:26.451185Z","submitted_at":"2026-02-03T07:31:14Z","title":"Token Sparse Attention: Efficient Long-Context Inference with Interleaved Token Selection","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-03T05:09:31.978370Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2602.03216"},"observation_digest":"sha256:418a9b07245798640715cdecdb0a0d43e3e318bee366a8ce5641cf6904d36770","observation_id":"dba18e8f-4100-4580-8983-76e9e9f9be50","resolution":{"observed_at":"2026-08-03T05:09:31.978370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2603.22910","last_updated":"2026-05-13T05:25:05Z","snapshot_observed_at":"2026-07-06T22:50:14.856451Z","submitted_at":"2026-03-24T07:58:42Z","title":"EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstruction","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T01:09:07.983785Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2603.22910"},"observation_digest":"sha256:5590a00a5a99128fc982cd747588f689fc301236142808230e415edf56e83bc9","observation_id":"8d708051-880b-471c-a697-9f0ae88a4389","resolution":{"observed_at":"2026-05-15T01:09:36.966728Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2604.16864","last_updated":"2026-04-18T06:28:21Z","snapshot_observed_at":"2026-08-02T05:52:50.560554Z","submitted_at":"2026-04-18T06:28:21Z","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T07:15:19.184970Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2604.16864"},"observation_digest":"sha256:180d3855bf9ea164d82d3d6dacdd0746e1919502a3b935557846b70727cb4649","observation_id":"26fb19ad-10dd-4f93-9f83-babf9f55ba63","resolution":{"observed_at":"2026-05-10T07:16:54.241136Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2604.16983","last_updated":"2026-04-18T12:55:28Z","snapshot_observed_at":"2026-07-06T23:04:10.324443Z","submitted_at":"2026-04-18T12:55:28Z","title":"Graph-Guided Adaptive Channel Elimination for KV Cache Compression","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T07:06:08.786535Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2604.16983"},"observation_digest":"sha256:be7d26eb701f82ea98f7be6c6f78efc0d0d049ebeda46b2431973b4e5e958f4f","observation_id":"5723fde2-d878-49d7-b681-b74db3eeff74","resolution":{"observed_at":"2026-05-10T07:06:52.685712Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2605.08317","last_updated":"2026-05-08T15:15:06Z","snapshot_observed_at":"2026-07-06T23:20:33.816373Z","submitted_at":"2026-05-08T15:15:06Z","title":"RDKV: Rate-Distortion Bit Allocation for Joint Eviction and Quantization of the KV Cache","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T01:16:15.869198Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2605.08317"},"observation_digest":"sha256:1d2f3d6492aa8cc85d851ff596aee39b302bc579bc4ecd779024fa6a3407635d","observation_id":"1160015b-699a-4e9a-920e-ed55aeb93634","resolution":{"observed_at":"2026-05-12T08:06:33.256917Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2605.19218","last_updated":"2026-05-19T00:45:00Z","snapshot_observed_at":"2026-07-06T23:29:57.003383Z","submitted_at":"2026-05-19T00:45:00Z","title":"Rotation-Aligned Key Channel Pruning for Efficient Vision-Language Model Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-20T07:43:18.828740Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2605.19218"},"observation_digest":"sha256:180f286aae8754e6816202780afb874479cdc9d02124144ad616e612baab600e","observation_id":"9134029d-0480-456d-8647-d70cd16db31e","resolution":{"observed_at":"2026-05-20T07:43:23.782224Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":"2407.21018","doi":"10.48550/arxiv.2407.21018","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Think: Thinner key cache by query-driven pruning","venue":"arXiv (Cornell University)","work_id":"591b50c4-01b0-4a4c-9c7d-efc738e51edb","year":2024},"citing_paper":{"arxiv_id":"2606.28831","last_updated":"2026-06-27T09:36:37Z","snapshot_observed_at":"2026-07-07T00:02:52.539331Z","submitted_at":"2026-06-27T09:36:37Z","title":"HARD-KV: Head-Adaptive Regularization for Decoding-time KV Compression","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T10:27:30.344430Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2606.28831"},"observation_digest":"sha256:ea6eb1a9643b4552154a78237e948bef49a8bceb562607dff9bfb165c73a0740","observation_id":"7fc0bda9-428a-4430-b68c-5fab57119343","resolution":{"observed_at":"2026-06-30T10:44:36.817269Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-02T09:50:33.643581Z","title":"arXiv:2407.21018","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16248","last_updated":"2026-06-27T01:22:47Z","snapshot_observed_at":"2026-08-05T04:21:35.447834Z","submitted_at":"2026-06-27T01:22:47Z","title":"High-accuracy Low-Bit KV-Cache Quantization via Local Distribution Restoration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T09:50:33.643581Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2607.16248"},"observation_digest":"sha256:0014752c3cdd779df2b38f28e789eea7b04b85dae810552116afb40db24b7d50","observation_id":"eacde308-75ec-4038-807d-3d39bb8abc6e","resolution":{"observed_at":"2026-08-02T09:50:33.643581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21018","snapshot_observed_at":"2026-08-03T00:43:52.942535Z","title":"ThinK: Thinner key cache by query-driven pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28699","last_updated":"2026-08-06T10:44:15Z","snapshot_observed_at":"2026-08-09T23:10:00.471919Z","submitted_at":"2026-07-30T11:04:45Z","title":"WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T00:43:52.942535Z"},"links":{"cited_paper":"/paper/2407.21018","citing_paper":"/paper/2607.28699"},"observation_digest":"sha256:8220aaf97a0c10ba87b57816b74ffeda5f7618bc136a69887d09995c7fb4afa4","observation_id":"02c7c400-91fa-413d-bb5d-e586ddb51650","resolution":{"observed_at":"2026-08-03T00:43:52.942535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.21018/citation-record","integrity":"/paper/2407.21018/integrity","json":"/paper/2407.21018/citation-record.json","paper":"/paper/2407.21018"},"outbound":[],"paper":{"arxiv_id":"2407.21018","last_updated":"2025-02-27T12:30:43Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T12:45:38.058315Z","submitted_at":"2024-07-30T17:59:08Z","title":"ThinK: Thinner Key Cache by Query-Driven Pruning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2407.21018."}