{"as_of":"2026-08-06T07:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:87ca223e2a1f496bb82a47072a238b81f91d5441231ba8f8f255c7a7ca0bc3c3","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:16:38.813196Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-07-30T15:53:12.039684Z","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.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.17715","snapshot_observed_at":"2026-07-30T15:53:12.039684Z","title":"C 2KV: Compressed and composable KV cache reuse for efficient LLM inference.arXiv preprint arXiv:2607.17715,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23693","last_updated":"2026-07-26T14:37:53Z","snapshot_observed_at":"2026-08-03T11:36:02.243849Z","submitted_at":"2026-07-26T14:37:53Z","title":"Compute Globally, Materialize Locally: The Memory Contract of Sparse Event-KV","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-07-30T15:53:12.039684Z"},"links":{"cited_paper":"/paper/2607.17715","citing_paper":"/paper/2607.23693"},"observation_digest":"sha256:74e09885b38975f87bf2a6353a630269621a837115a2bdf838f5932ca3415afc","observation_id":"8e7b26ab-9a66-4b1c-b6e0-f24d70ea8d9e","resolution":{"observed_at":"2026-07-30T15:53:12.039684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.17715/citation-record","integrity":"/paper/2607.17715/integrity","json":"/paper/2607.17715/citation-record.json","paper":"/paper/2607.17715"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.371022Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.371022Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:3b36f4425f84ddb45f26edbc8a3731c3d5ad3d99de72c9edc3611f6f894da8dc","observation_id":"03bd9b7e-84a3-4d06-b354-d684b15c3807","resolution":{"observed_at":"2026-08-01T17:16:36.371022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14051","last_updated":"2025-08-13T17:55:58Z","snapshot_observed_at":"2026-08-04T06:54:34.624899Z","submitted_at":"2025-02-19T19:12:46Z","title":"RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14051","snapshot_observed_at":"2026-08-01T17:16:36.387937Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.387937Z"},"links":{"cited_paper":"/paper/2502.14051","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:662ba42bf5dfceeadfe1568eddf2fdf609371ca85f8c5ebe66d22d9fc0e4bf5d","observation_id":"850d6ab6-9d22-446b-b58d-9e96577dbdf1","resolution":{"observed_at":"2026-08-01T17:16:36.387937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.401762Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.401762Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:1a4bf9ae85e6e646a84339936728722ec2678c627acb713377ef099f9789757b","observation_id":"7ea92ce5-a4a6-4deb-b43c-2b293fff4bfa","resolution":{"observed_at":"2026-08-01T17:16:36.401762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.420009Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.420009Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:6dfae371aa7a53bc571967819dce564a26537ba9bf9b1b6268d47a4bfade27b1","observation_id":"dc1a7c4f-993d-4ca8-9a66-8af47e79a006","resolution":{"observed_at":"2026-08-01T17:16:36.420009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.436051Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.436051Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:19bbb2f8238647fbc52e0787cde4a7d4c4eca7fb9da5d55fda1010feeadc6187","observation_id":"058534ad-9659-4386-a575-3afd28e1d5e9","resolution":{"observed_at":"2026-08-01T17:16:36.436051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.454650Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.454650Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:07d0eae4c1bc07108b2a125f4217887fa65d5af2f3140ce54b46511225a604ed","observation_id":"a6dd78d9-c693-44ac-b0cc-f598ca397240","resolution":{"observed_at":"2026-08-01T17:16:36.454650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13753","last_updated":"2024-02-21T12:30:33Z","snapshot_observed_at":"2026-08-02T12:47:57.325302Z","submitted_at":"2024-02-21T12:30:33Z","title":"LongRoPE: Extending LLM Context Window Beyond 2 Million Tokens","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13753","snapshot_observed_at":"2026-08-01T17:16:36.476354Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.476354Z"},"links":{"cited_paper":"/paper/2402.13753","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:c158588d30b3b97d1510e9d655c52c4c16c46e208a51861297a81e4c681a1d5f","observation_id":"a0f4ebd0-cef5-4014-b335-65fff106c74d","resolution":{"observed_at":"2026-08-01T17:16:36.476354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.565973Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.565973Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:19e4967b38bca0b65bc4bf5be7edf69fe83048cc4dc8092e90057b94763a3f12","observation_id":"9ec299dc-16ca-416f-a3b9-a976af2f7745","resolution":{"observed_at":"2026-08-01T17:16:36.565973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.733234Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.733234Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:37f3e8957e8fdef6079b49c13398b2e82f062d40490ea738b04cc6124edf3e14","observation_id":"6fe1275c-bafb-4e5c-bd4c-433d9e70be66","resolution":{"observed_at":"2026-08-01T17:16:36.733234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:36.843537Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.843537Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:aca277ed0abc1c1c40ba4223db9652f5e425e0172b92a85d6da8ae7eed5fc097","observation_id":"0c550502-df86-497b-a0c3-bb92e0406f3f","resolution":{"observed_at":"2026-08-01T17:16:36.843537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-01T17:16:36.979067Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:36.979067Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:20a070e1c471cd585d95c5a89aa9cefab1b1bb609a6c6c3b88ff1bb3ead53f79","observation_id":"1cbad145-d6fe-4492-8c4f-4eacca99b29e","resolution":{"observed_at":"2026-08-01T17:16:36.979067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.099990Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.099990Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:e557720396e301701f6b445ab0d01b1273623969b728984fcdda7b30de774686","observation_id":"e9b8a472-de07-4042-a21c-564156b07428","resolution":{"observed_at":"2026-08-01T17:16:37.099990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.207070Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.207070Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:47351b3944df53824c4c2ae10e6af044bbb4213ece77730568676b5e3a560a1c","observation_id":"fd696a7b-e8ce-4159-aebe-ad9c9477d0bc","resolution":{"observed_at":"2026-08-01T17:16:37.207070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.336419Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.336419Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:7aab1e3317a35b61f2cf6a3ccb30377dbfb185fcf470bec5f5c89a4e59e6ee89","observation_id":"8f6f14ee-df97-4b65-8fcb-d2b1f6841448","resolution":{"observed_at":"2026-08-01T17:16:37.336419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.446005Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.446005Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:29a01b4edefbec1970f0724bb4c93a25eca616e22652bfa4d00c67e7b07c36dc","observation_id":"b568b570-4ec6-4c32-979c-8ea9c712a772","resolution":{"observed_at":"2026-08-01T17:16:37.446005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.599762Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.599762Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:47dc556a2f7ac6b472f02bdf9826a16394e9065b28579d4eec651ae25cdad5ac","observation_id":"01e7d6e8-6094-45d9-a1cf-9523868ab8b7","resolution":{"observed_at":"2026-08-01T17:16:37.599762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20878","last_updated":"2024-10-28T09:55:52Z","snapshot_observed_at":"2026-07-06T19:40:39.348570Z","submitted_at":"2024-10-28T09:55:52Z","title":"AutoRAG: Automated Framework for optimization of Retrieval Augmented Generation Pipeline","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20878","snapshot_observed_at":"2026-08-01T17:16:37.727927Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.727927Z"},"links":{"cited_paper":"/paper/2410.20878","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:217818da0082ce511553e23b9757594a3a23f49a6df8324ac7b90a7f9e9b4c59","observation_id":"4399cddb-ea11-42af-b0ef-1b926e8e2b38","resolution":{"observed_at":"2026-08-01T17:16:37.727927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.832624Z","title":"Gonzalez, Hao Zhang, and Ion Stoica","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.832624Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:c634eb17be60f28afde5f0b011435c23a2e74b76cbc15cb17c59b5375bcc9415","observation_id":"cb5089db-5bca-4336-a03f-67fc3bdc3c1a","resolution":{"observed_at":"2026-08-01T17:16:37.832624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:37.987711Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:37.987711Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:8c065267ac0cbe8847f3de3350255dc6b125b289be0aada233c26db15d35cf39","observation_id":"4914cf7f-60b8-4287-8f46-0fa0ca590b70","resolution":{"observed_at":"2026-08-01T17:16:37.987711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.084295Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.084295Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:5a9912b2d2a52b5337dc4afee2c75b1f11b5d61c23f9ac1a538be13c02d6f231","observation_id":"a7fd568e-b420-418e-94b5-1ecc38f9f585","resolution":{"observed_at":"2026-08-01T17:16:38.084295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.320553Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.320553Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:654b11998ec4e29622a32e2b458d69b668a90139d92ac236b3ee72fee57d3d18","observation_id":"ad846b2a-f74e-44b1-ab66-10ca65a8c228","resolution":{"observed_at":"2026-08-01T17:16:38.320553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02669","last_updated":"2024-07-04T15:12:54Z","snapshot_observed_at":"2026-07-06T17:11:55.112404Z","submitted_at":"2024-01-05T06:53:00Z","title":"Infinite-LLM: Efficient LLM Service for Long Context with DistAttention and Distributed KVCache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02669","snapshot_observed_at":"2026-08-01T17:16:38.402742Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.402742Z"},"links":{"cited_paper":"/paper/2401.02669","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:bbbc094a0b0cad1ed40bc30058eca9582e4368f29ab0ebd4f0e624ad10307fc4","observation_id":"e28df95a-227a-46d1-95a5-62f39a064cc7","resolution":{"observed_at":"2026-08-01T17:16:38.402742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.486969Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.486969Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:9710c755b7cd0d27e787af27aa7848ea9e6fa285a39fdbbd96ae1c074168da64","observation_id":"a74bbf8d-153a-4a56-88cb-5f8cb0080a95","resolution":{"observed_at":"2026-08-01T17:16:38.486969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.571108Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.571108Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:6a938297a8def01ae2599626510cdf0ef386132e8387b3bbc261990462e47899","observation_id":"381a3496-8b42-4e7b-84be-a25ca9681400","resolution":{"observed_at":"2026-08-01T17:16:38.571108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.632454Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.632454Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:3207ca38438ea4ef2ac98499a98944703a9f5995d51403b251574bf9c0241c54","observation_id":"bc5f3505-ac40-4f8a-97cd-614424993ce9","resolution":{"observed_at":"2026-08-01T17:16:38.632454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.674571Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.674571Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:b84a6fb1bdefb05c8afb686eeffae3ba0df05569a8e6d130752981423889b83c","observation_id":"e7731d69-c127-4d10-8e54-1469f323f2d2","resolution":{"observed_at":"2026-08-01T17:16:38.674571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.717702Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.717702Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:1862dd49fb3444cc279f9cbc4fd24f9c6d537e92d87f04d7c17e2af085847440","observation_id":"df088d6b-8239-4681-9941-be2381efe081","resolution":{"observed_at":"2026-08-01T17:16:38.717702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16546","last_updated":"2024-10-21T05:06:01Z","snapshot_observed_at":"2026-08-06T04:48:22.899485Z","submitted_at":"2024-09-25T01:39:02Z","title":"AlignedKV: Reducing Memory Access of KV-Cache with Precision-Aligned Quantization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16546","snapshot_observed_at":"2026-08-01T17:16:38.735915Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.735915Z"},"links":{"cited_paper":"/paper/2409.16546","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:a8ec8ef512a628b0e01f09063a19690321955b63a6eb0ea16d5733e30703cfd9","observation_id":"66f8a63c-3a5b-484d-af0a-448ef6b2bd38","resolution":{"observed_at":"2026-08-01T17:16:38.735915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.740278Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.740278Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:b7b8ba0ebe73fa27b170be6a57f6da9e50e7bd60437341a9a5182848095167be","observation_id":"d6bd1eb3-94e2-455f-b457-eb1ecd147c2b","resolution":{"observed_at":"2026-08-01T17:16:38.740278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.744382Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.744382Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:4faf580ef4725dd9786ba41cf653b853e20130e385b127ed89ed8b8c30df0bcf","observation_id":"a2385676-755a-4fb4-a49e-92a098717ef6","resolution":{"observed_at":"2026-08-01T17:16:38.744382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10819","last_updated":"2024-10-14T17:59:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-14T17:59:58Z","title":"DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10819","snapshot_observed_at":"2026-08-01T17:16:38.752894Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.752894Z"},"links":{"cited_paper":"/paper/2410.10819","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:dff508c1372e1b2fe2053cb0ded84af0d1a44d2c9ee9c74931b9dda674d91bdd","observation_id":"69faf540-558c-4893-a0f1-620869d8586e","resolution":{"observed_at":"2026-08-01T17:16:38.752894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.757920Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.757920Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:2632fe0ff4ffc44681a7dfce6e84e17299372d7f0c09d2e6ae0140946a4b98ab","observation_id":"a9e6ce86-4b0a-4d10-9fa7-214e254f19aa","resolution":{"observed_at":"2026-08-01T17:16:38.757920Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-01T17:16:38.762676Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.762676Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:d6854ec5db730f71ea08beab49de8de718249a93ed8def124183ae62fa9972e6","observation_id":"818d68e2-6e0d-4cd7-be25-891498088d70","resolution":{"observed_at":"2026-08-01T17:16:38.762676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15383","last_updated":"2025-01-26T03:47:25Z","snapshot_observed_at":"2026-07-31T01:49:29.562668Z","submitted_at":"2025-01-26T03:47:25Z","title":"Qwen2.5-1M Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15383","snapshot_observed_at":"2026-08-01T17:16:38.767293Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.767293Z"},"links":{"cited_paper":"/paper/2501.15383","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:dd7cca1d5a0e25dac092120900893493b8303464846cbae0767a0db34d99b600","observation_id":"a4fdbbb4-a77e-44f7-9015-d31b1c5635dc","resolution":{"observed_at":"2026-08-01T17:16:38.767293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16525","last_updated":"2025-05-16T12:42:48Z","snapshot_observed_at":"2026-07-06T20:56:18.361337Z","submitted_at":"2025-03-17T16:43:35Z","title":"KVShare: An LLM Service System with Efficient and Effective Multi-Tenant KV Cache Reuse","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16525","snapshot_observed_at":"2026-08-01T17:16:38.771589Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.771589Z"},"links":{"cited_paper":"/paper/2503.16525","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:1b5164c8d195b9d1e7b366cac841c69985090040beca0ddabcb8c8528694e40a","observation_id":"0243812d-6598-4a1e-9702-52ee3067eed4","resolution":{"observed_at":"2026-08-01T17:16:38.771589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.775729Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.775729Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:2bfbe7b54a7f814a741a7be9a08d0f91dc49982fd0325671a272901c9a68ada4","observation_id":"37039ba6-0148-48d5-8864-44965f5ca432","resolution":{"observed_at":"2026-08-01T17:16:38.775729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.779675Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.779675Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:74669e41c727468df7a1f834db19aa95285982b4f1aa621bf0a2a0474c605c3f","observation_id":"366e35e0-93f1-4ec8-8666-c1c14aac71d8","resolution":{"observed_at":"2026-08-01T17:16:38.779675Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.784470Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.784470Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:6b4db5cd7d60daff58182f54048e679c7903d05d8288e7c63c7f235fef32ccc3","observation_id":"146c09bc-d752-4f1f-bc19-46662f492124","resolution":{"observed_at":"2026-08-01T17:16:38.784470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.788410Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.788410Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:a12927afe9e621e0a811687b6619f968ea278444429e1fde1ef7dd367210363b","observation_id":"a2de44c8-2d0d-4021-8b1c-8db76abd0eb4","resolution":{"observed_at":"2026-08-01T17:16:38.788410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.792268Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.792268Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:ce0424f50a3b652518d980b67b06cff0c550bbef8fc6a91c86124aab69a14fce","observation_id":"0563397b-64f0-4f62-848c-3772dadab617","resolution":{"observed_at":"2026-08-01T17:16:38.792268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.796929Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.796929Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:aba7ea5106eeeb69cafb7e61c48297854bb467d310840c707e1991ff8faf85ea","observation_id":"1db396ec-46af-4d6f-8561-952db52f2dbb","resolution":{"observed_at":"2026-08-01T17:16:38.796929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.801268Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.801268Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:80abf799eb2f5f25f9375288e1bbbf697921637f30ed519831e7bead352f4511","observation_id":"b83a9542-6ad1-403e-82e8-01194787c448","resolution":{"observed_at":"2026-08-01T17:16:38.801268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.805431Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.805431Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:e33a788a0654ff4a41e95a31d306afa9231fbad8fcc9353a3503fc0cb6f0f68b","observation_id":"df1e3dec-86e5-4b9b-987a-7e3fef750af6","resolution":{"observed_at":"2026-08-01T17:16:38.805431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.809342Z","title":"Gonzalez, Clark Barrett, and Ying Sheng","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.809342Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:d68eda14b9e6c5bbe346b87c3be2ed81dd1f025cc17f8ac63a4e75028a377760","observation_id":"5883e752-1ebe-46fd-8805-065d447cbd8c","resolution":{"observed_at":"2026-08-01T17:16:38.809342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T17:16:38.813196Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.813196Z"},"links":{"citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:96c0a4e1603f8af27a23a1d399b3374b2a09b1773ac0b7da88b27477b6258e7e","observation_id":"5f141cff-b351-476e-bb7e-3a23d15110e0","resolution":{"observed_at":"2026-08-01T17:16:38.813196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09085","last_updated":"2022-11-16T18:06:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-16T18:06:33Z","title":"Galactica: A Large Language Model for Science","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09085","snapshot_observed_at":"2026-08-01T17:16:38.748537Z","title":"arXiv:2211.09085 [cs.CL] https://arxiv.org/abs/2211.09085","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.748537Z"},"links":{"cited_paper":"/paper/2211.09085","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:481ade1ceabb57b190202628b7a493d3674a3e82891ac2a87b0ffbbe4be8f1e3","observation_id":"debf2c93-f4df-4d16-8bbb-74d213b03491","resolution":{"observed_at":"2026-08-01T17:16:38.748537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18879","last_updated":"2025-06-23T17:50:11Z","snapshot_observed_at":"2026-07-06T21:46:30.250293Z","submitted_at":"2025-06-23T17:50:11Z","title":"CommVQ: Commutative Vector Quantization for KV Cache Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.18879","snapshot_observed_at":"2026-08-01T17:16:38.209120Z","title":"arXiv preprint arXiv:2506.18879(2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T17:16:38.209120Z"},"links":{"cited_paper":"/paper/2506.18879","citing_paper":"/paper/2607.17715"},"observation_digest":"sha256:b28e00eddd964e6c41f3fa439dc4976aa5722e77d3738bd525ed82aefece5793","observation_id":"96fdaf1c-f2fb-4cec-adb7-d8c04a040b56","resolution":{"observed_at":"2026-08-01T17:16:38.209120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17715","last_updated":"2026-07-20T09:09:23Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-01T17:16:35.056705Z","submitted_at":"2026-07-20T09:09:23Z","title":"C$^2$KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 1 inbound Pith citation observation for arXiv:2607.17715."}