{"as_of":"2026-08-08T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6486108098648b95271c894cc7fe13172719cd2f056b6459d285bc00fbaecefd","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":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T00:54:42.708127Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T02:26:26.781303Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-07T06:04:35.202302Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy.arXiv preprint arXiv:2410.03111, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06266","last_updated":"2025-06-13T17:58:55Z","snapshot_observed_at":"2026-08-07T05:54:59.580995Z","submitted_at":"2025-06-06T17:48:23Z","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","version":3},"reference_index":110,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:35.202302Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2506.06266"},"observation_digest":"sha256:5a5d0ef92cca5048ce1854adbb205e22ed6ad5aebdf5ca62e757375f16e182f4","observation_id":"9cfcc3eb-5de1-4499-b745-a41eef34cec4","resolution":{"observed_at":"2026-08-07T06:04:35.202302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-07T10:20:44.600328Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15724","last_updated":"2025-06-06T01:51:24Z","snapshot_observed_at":"2026-08-07T10:11:30.411161Z","submitted_at":"2025-06-06T01:51:24Z","title":"MadaKV: Adaptive Modality-Perception KV Cache Eviction for Efficient Multimodal Long-Context Inference","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:20:44.600328Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2506.15724"},"observation_digest":"sha256:ced72e2dce266944581fd0adb68414ca321ec34a0141e63e3c185f1a59723aa2","observation_id":"6b0dfe1c-a602-436d-9986-42fd25d0aecf","resolution":{"observed_at":"2026-08-07T10:20:44.600328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-06T17:20:28.854743Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11273","last_updated":"2025-07-15T12:52:12Z","snapshot_observed_at":"2026-08-06T17:09:41.433446Z","submitted_at":"2025-07-15T12:52:12Z","title":"KV-Latent: Dimensional-level KV Cache Reduction with Frequency-aware Rotary Positional Embedding","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T17:20:28.854743Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2507.11273"},"observation_digest":"sha256:a4370b70ad91ef00397c5be98a6cf95efcd624b9069b3f1838859be1a1ef5119","observation_id":"f95fbcf1-5a28-40e0-aab7-80ddb1e58081","resolution":{"observed_at":"2026-08-06T17:20:28.854743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-05T20:37:15.716757Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10395","last_updated":"2025-08-14T06:52:38Z","snapshot_observed_at":"2026-08-08T07:14:54.239021Z","submitted_at":"2025-08-14T06:52:38Z","title":"XQuant: Breaking the Memory Wall for LLM Inference with KV Cache Rematerialization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T20:37:15.716757Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2508.10395"},"observation_digest":"sha256:64ae3a303ddbf8fc53e06697b83d2225c49a3e143084864e7164a5afd2e7157f","observation_id":"594bfca9-8323-4366-8d46-5c149d425ec0","resolution":{"observed_at":"2026-08-05T20:37:15.716757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-05T17:55:09.743965Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15881","last_updated":"2025-08-25T02:24:20Z","snapshot_observed_at":"2026-08-05T17:55:04.790166Z","submitted_at":"2025-08-21T15:25:40Z","title":"TPLA: Tensor Parallel Latent Attention for Efficient Disaggregated Prefill and Decode Inference","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T17:55:09.743965Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2508.15881"},"observation_digest":"sha256:53bb43c8599f1a495d9740c391e51ca2e5fbcaee5e80c75aaf309233299fcde7","observation_id":"0c0fb4e1-5587-4190-a412-ac69e2e71b3b","resolution":{"observed_at":"2026-08-05T17:55:09.743965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":"2410.03111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-02T02:26:26.781303Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":"784274ec-d781-44a0-ace3-5dec4909dba7","year":2024},"citing_paper":{"arxiv_id":"2604.21231","last_updated":"2026-05-04T22:59:12Z","snapshot_observed_at":"2026-07-06T23:07:51.979267Z","submitted_at":"2026-04-23T02:55:31Z","title":"SparKV: Overhead-Aware KV Cache Loading for Efficient On-Device LLM Inference","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-08T14:09:30.821354Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2604.21231"},"observation_digest":"sha256:4e16cbcc409d83165b4b7a11c51ba9083613781921eebbde3d7723436455e6b9","observation_id":"5438c21a-1fc8-42b0-8a44-1880e24ff189","resolution":{"observed_at":"2026-05-11T18:46:07.734198Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":"2410.03111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-02T02:26:26.781303Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":"784274ec-d781-44a0-ace3-5dec4909dba7","year":2024},"citing_paper":{"arxiv_id":"2605.05819","last_updated":"2026-05-07T07:57:23Z","snapshot_observed_at":"2026-08-02T05:47:51.787768Z","submitted_at":"2026-05-07T07:57:23Z","title":"HCInfer: An Efficient Inference System via Error Compensation for Resource-Constrained Devices","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T14:44:13.936042Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2605.05819"},"observation_digest":"sha256:6e27c8bd347f2576b5d60ef95b2b39c439b7d8246b2180d0235d8891ccd65075","observation_id":"41b14b76-1119-4951-8b58-074296594c27","resolution":{"observed_at":"2026-05-11T18:41:10.701143Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":"2410.03111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-02T02:26:26.781303Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":"784274ec-d781-44a0-ace3-5dec4909dba7","year":2024},"citing_paper":{"arxiv_id":"2605.10875","last_updated":"2026-05-11T17:27:15Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:27:15Z","title":"Compute Where it Counts: Self Optimizing Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-12T04:57:58.649358Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2605.10875"},"observation_digest":"sha256:40a1d701fad081926a941793b973d40d55a2bae92d5927a4d06b8c6ab00e1e1e","observation_id":"26e06fab-4fdf-46a1-9192-05daae26ba42","resolution":{"observed_at":"2026-05-12T05:46:29.305852Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":"2410.03111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-02T02:26:26.781303Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":"784274ec-d781-44a0-ace3-5dec4909dba7","year":2024},"citing_paper":{"arxiv_id":"2605.16439","last_updated":"2026-05-14T23:01:58Z","snapshot_observed_at":"2026-08-01T17:11:05.881460Z","submitted_at":"2026-05-14T23:01:58Z","title":"KVCapsule: Efficient Sequential KV Cache Compression for Vision-Language Models with Asymmetric Redundancy","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T19:55:35.051834Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2605.16439"},"observation_digest":"sha256:01371cac0c720b5ac9d698343afe490554595979979490135a694017c936bf7b","observation_id":"82dfc267-ed58-4ef6-949b-971e09afbe09","resolution":{"observed_at":"2026-05-20T19:58:59.054270Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":"2410.03111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-02T02:26:26.781303Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy","venue":null,"work_id":"784274ec-d781-44a0-ace3-5dec4909dba7","year":2024},"citing_paper":{"arxiv_id":"2606.03979","last_updated":"2026-07-10T17:52:03Z","snapshot_observed_at":"2026-07-15T23:18:25.559225Z","submitted_at":"2026-06-02T17:56:55Z","title":"Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories","version":1},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-06-28T10:56:13.058872Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2606.03979"},"observation_digest":"sha256:b0a11674a42ea31efff743bd8d1ba0d10a798b005fc0a5a8346f105785e3004f","observation_id":"bdfad0a4-fcb0-4fa5-9a96-7cea6953e245","resolution":{"observed_at":"2026-07-02T02:26:26.782782Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-13T07:44:25.325808Z","title":"LoRC: Low- Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03979","last_updated":"2026-07-10T17:52:03Z","snapshot_observed_at":"2026-07-15T23:18:25.559225Z","submitted_at":"2026-06-02T17:56:55Z","title":"Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories","version":2},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-07-13T07:44:25.325808Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2606.03979"},"observation_digest":"sha256:c25a31f7ef9cd182766fb28279bf78dd200deb4eae3378954c314437d1e6b66f","observation_id":"b666410d-d69d-4491-b5d6-60a85d52dade","resolution":{"observed_at":"2026-07-13T07:44:25.325808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-01T23:15:39.708271Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15498","last_updated":"2026-07-16T23:03:14Z","snapshot_observed_at":"2026-08-06T09:14:36.885086Z","submitted_at":"2026-07-16T23:03:14Z","title":"VarRate: Training-Free Variable-Rate KV Cache Compression for Long-Context LLMs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T23:15:39.708271Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2607.15498"},"observation_digest":"sha256:74c2487dbc7c1bb3365101846bfbdc7c41178c7673e69a55bbbc429f7e431b55","observation_id":"862254ba-a843-44bd-bc45-0e75e7de5af6","resolution":{"observed_at":"2026-08-01T23:15:39.708271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-07-31T18:02:37.280696Z","title":"Lorc: Low-rank compression for llms kv cache with a progressive compression strategy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24331","last_updated":"2026-07-27T12:08:56Z","snapshot_observed_at":"2026-08-06T21:44:29.448616Z","submitted_at":"2026-07-27T12:08:56Z","title":"DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T18:02:37.280696Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2607.24331"},"observation_digest":"sha256:31ff3eec3915416b1ee9c5c84b80b7d26d26d3bfdb222487a136493be74c5d4e","observation_id":"054be6c7-2b35-47f5-8d41-56a7475b00d1","resolution":{"observed_at":"2026-07-31T18:02:37.280696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-05T23:10:35.534303Z","title":"LoRC: Low-Rank Compression for LLMs’ KV Cache","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03228","last_updated":"2026-08-05T20:50:42Z","snapshot_observed_at":"2026-08-08T09:14:24.020759Z","submitted_at":"2026-08-04T06:59:29Z","title":"SAKI: Score-Aware Low-Rank Key Indexing with Random-Matrix Noise Correction for KV Retrieval","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T23:10:35.534303Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2608.03228"},"observation_digest":"sha256:28a31c463b4c3550c3d9b35d54478a7193745916a1b865ebe7186c415a3554de","observation_id":"b614c60a-55c1-47dd-bc25-f52f723469d2","resolution":{"observed_at":"2026-08-05T23:10:35.534303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03111","snapshot_observed_at":"2026-08-08T00:54:42.708127Z","title":"LoRC: Low-Rank Compression for LLMs’ KV Cache","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.03228","last_updated":"2026-08-05T20:50:42Z","snapshot_observed_at":"2026-08-08T09:14:24.020759Z","submitted_at":"2026-08-04T06:59:29Z","title":"SAKI: Score-Aware Low-Rank Key Indexing with Random-Matrix Noise Correction for KV Retrieval","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T00:54:42.708127Z"},"links":{"cited_paper":"/paper/2410.03111","citing_paper":"/paper/2608.03228"},"observation_digest":"sha256:63bae326d54b0b197bf4f1a380cdf14d647d38068341c57b48312a1654762531","observation_id":"595a4343-3b54-49d0-9cf4-d17b5d93ca37","resolution":{"observed_at":"2026-08-08T00:54:42.708127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.03111/citation-record","integrity":"/paper/2410.03111/integrity","json":"/paper/2410.03111/citation-record.json","paper":"/paper/2410.03111"},"outbound":[],"paper":{"arxiv_id":"2410.03111","last_updated":"2024-10-04T03:10:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:27:29.609371Z","submitted_at":"2024-10-04T03:10:53Z","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2410.03111."}