{"as_of":"2026-08-10T02:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9959a06abb2401764ed7d10b1e4b35692c190d1b084d72c7ffc82f624db0c1f7","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:42:22.542928Z","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-02T01:36:26.266282Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","year":2024},"citing_paper":{"arxiv_id":"2504.15965","last_updated":"2025-04-23T13:47:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-22T15:05:04Z","title":"From Human Memory to AI Memory: A Survey on Memory Mechanisms in the Era of LLMs","version":2},"reference_index":135,"source":"pdf_text","source_observed_at":"2026-05-17T11:05:09.588491Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2504.15965"},"observation_digest":"sha256:7619575dbba84b2af0f735f4a17362cc6394210cf5a766067ef0661f205a167b","observation_id":"0773a48c-07e3-4efb-8310-2e9b15e8aa42","resolution":{"observed_at":"2026-05-17T11:05:09.878154Z","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":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-08-07T15:42:22.542928Z","title":"Compute or load kv cache? why not both?","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":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.542928Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2505.14085"},"observation_digest":"sha256:e7810316b5703fef6e0629be0acf28697eb45933cc895bee4ba1e609393afea7","observation_id":"a974abcd-187d-46b9-9315-854d348d651f","resolution":{"observed_at":"2026-08-07T15:42:22.542928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-08-07T12:38:38.180039Z","title":"Compute or load kv cache? why not both? arXiv preprint arXiv:2410.03065, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15704","last_updated":"2025-05-30T02:35:59Z","snapshot_observed_at":"2026-08-07T12:30:17.322980Z","submitted_at":"2025-05-30T02:35:59Z","title":"Learn from the Past: Fast Sparse Indexing for Large Language Model Decoding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.180039Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2506.15704"},"observation_digest":"sha256:96d88ebaf2438d53991a582ed632aaf7089ce0840cc78fa7c3c87eb97eb5401e","observation_id":"a34eb7be-896c-4b89-b6ba-31cd8f00ef2a","resolution":{"observed_at":"2026-08-07T12:38:38.180039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-08-06T18:46:57.628851Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08045","last_updated":"2025-08-26T01:55:27Z","snapshot_observed_at":"2026-08-09T21:31:18.338423Z","submitted_at":"2025-07-10T01:51:17Z","title":"Krul: Efficient State Restoration for Multi-turn Conversations with Dynamic Cross-layer KV Sharing","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:46:57.628851Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2507.08045"},"observation_digest":"sha256:de1eeadc4fe7b41182b13b449dd2906e04078aa4ea7728210676f39d727484fd","observation_id":"41843f4d-a06b-4137-95cb-584887bcee05","resolution":{"observed_at":"2026-08-06T18:46:57.628851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","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":25,"source":"pdf_text","source_observed_at":"2026-05-08T14:09:30.821354Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2604.21231"},"observation_digest":"sha256:b1872942d04e93259a3bc7b452e1dbfc7c2d0d3c9294310fc20d3da30a580268","observation_id":"1faccbb3-415a-48b9-beb6-c7686a55f92f","resolution":{"observed_at":"2026-05-11T18:46:07.696919Z","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":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","year":2024},"citing_paper":{"arxiv_id":"2605.23640","last_updated":"2026-05-22T13:54:21Z","snapshot_observed_at":"2026-07-06T23:33:49.013121Z","submitted_at":"2026-05-22T13:54:21Z","title":"CachePrune: Privacy-Aware and Fine-Grained KV Cache Sharing for Efficient LLM Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T04:14:44.387842Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2605.23640"},"observation_digest":"sha256:9d622ee028656011628aab5ad28b0915153a2f07f41b26e4957eea33d235fd19","observation_id":"520a9206-8d88-4a4b-a550-a6029e536c10","resolution":{"observed_at":"2026-05-25T04:15:19.855517Z","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":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","year":2024},"citing_paper":{"arxiv_id":"2606.01065","last_updated":"2026-05-31T07:13:15Z","snapshot_observed_at":"2026-08-07T18:48:40.880591Z","submitted_at":"2026-05-31T07:13:15Z","title":"Leyline: KV Cache Directives for Agentic Inference","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T16:51:08.114092Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2606.01065"},"observation_digest":"sha256:009644ace20ea127bbd74014db37d800895df96bf90c541440f7102690a9ce4a","observation_id":"58bd1c11-4136-41e3-954a-415e369a8051","resolution":{"observed_at":"2026-07-01T21:36:14.557072Z","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":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","year":2024},"citing_paper":{"arxiv_id":"2606.01563","last_updated":"2026-06-01T02:08:40Z","snapshot_observed_at":"2026-08-06T03:26:36.028360Z","submitted_at":"2026-06-01T02:08:40Z","title":"MomentKV: Closing the Directional Gap in KV Cache Eviction for Long-Context Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T16:07:22.196982Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2606.01563"},"observation_digest":"sha256:fa64758b24599c14acb2471025296e14bedc85ec6044fd87d0b830ac30aeceb9","observation_id":"46890d96-4721-4e6b-af7f-8748365ee318","resolution":{"observed_at":"2026-07-01T21:56:15.399276Z","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":"2410.03065","last_updated":"2025-02-20T23:28:01Z","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?","version":2},"cited_work":{"arxiv_id":"2410.03065","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.03065","snapshot_observed_at":"2026-07-02T01:36:26.266282Z","title":"Compute or load kv cache? why not both?","venue":null,"work_id":"6a5491ee-7696-49c3-8f7f-e68805f0095e","year":2024},"citing_paper":{"arxiv_id":"2606.02964","last_updated":"2026-06-01T23:51:37Z","snapshot_observed_at":"2026-08-02T06:03:10.694543Z","submitted_at":"2026-06-01T23:51:37Z","title":"Multi-Segment Attention: Enabling Efficient KV-Cache Management for Faster Large Language Model Serving","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T11:38:05.435505Z"},"links":{"cited_paper":"/paper/2410.03065","citing_paper":"/paper/2606.02964"},"observation_digest":"sha256:4e87cdbbb7b73e82822225b95812d07e6b65a6ff9eede4c39bdb715873e4add4","observation_id":"9a519988-9bd0-4579-942f-4ea34a84875e","resolution":{"observed_at":"2026-07-02T01:36:26.270553Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.03065/citation-record","integrity":"/paper/2410.03065/integrity","json":"/paper/2410.03065/citation-record.json","paper":"/paper/2410.03065"},"outbound":[],"paper":{"arxiv_id":"2410.03065","last_updated":"2025-02-20T23:28:01Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T08:18:44.624754Z","submitted_at":"2024-10-04T01:11:09Z","title":"Compute Or Load KV Cache? Why Not Both?"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2410.03065."}