{"as_of":"2026-08-09T05:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e2d73e014ebdeb164047bd67cb6f3578fe71e5bea5d55b7e6e01e363d3c29ef","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:29:13.910553Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":"2406.02542","doi":"10.48550/arxiv.2406.02542","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":"arXiv (Cornell University)","work_id":"8b4c5732-1f72-42cb-9f65-b9621beeab74","year":2024},"citing_paper":{"arxiv_id":"2409.10516","last_updated":"2024-12-31T07:11:00Z","snapshot_observed_at":"2026-08-07T09:13:28.333702Z","submitted_at":"2024-09-16T17:59:52Z","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","version":3},"reference_index":108,"source":"arxiv_source","source_observed_at":"2026-05-18T08:12:01.798459Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2409.10516"},"observation_digest":"sha256:b5067a81f12b57f00fb123623ae669cc943de1a2bbbcd897a9f2e7e6aa3a75e8","observation_id":"8ca35de0-fc3f-449f-8684-e8f0c36c06d9","resolution":{"observed_at":"2026-05-18T08:12:01.907754Z","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":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-08T14:29:13.910553Z","title":"Loki: Low-rank keys for efficient sparse attention, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06766","last_updated":"2025-02-12T15:55:37Z","snapshot_observed_at":"2026-08-09T00:35:37.697981Z","submitted_at":"2025-02-10T18:47:04Z","title":"Exploiting Sparsity for Long Context Inference: Million Token Contexts on Commodity GPUs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T14:29:13.910553Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2502.06766"},"observation_digest":"sha256:467d7ad14d460375d6a90a99f7bcc83047733bdb6beeb99cdf18f2608cfdd7da","observation_id":"4930a632-4f1d-42cd-b2d2-53356ebee0ba","resolution":{"observed_at":"2026-08-08T14:29:13.910553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-07T13:32:32.523852Z","title":"Loki: Low-rank keys for efficient sparse attention, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21487","last_updated":"2025-05-27T17:54:07Z","snapshot_observed_at":"2026-08-07T13:24:37.243429Z","submitted_at":"2025-05-27T17:54:07Z","title":"Hardware-Efficient Attention for Fast Decoding","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T13:32:32.523852Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2505.21487"},"observation_digest":"sha256:74022124cc546d11a644759ca41d0fa4b2771f5d77a54d667c1efea86410e045","observation_id":"5adf0400-21db-4fc6-8c8a-0c87a08d3785","resolution":{"observed_at":"2026-08-07T13:32:32.523852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-07T11:26:00.797982Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02572","last_updated":"2025-06-03T07:53:32Z","snapshot_observed_at":"2026-08-08T22:46:21.801125Z","submitted_at":"2025-06-03T07:53:32Z","title":"HATA: Trainable and Hardware-Efficient Hash-Aware Top-k Attention for Scalable Large Model Inference","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T11:26:00.797982Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2506.02572"},"observation_digest":"sha256:4440c4f393017a7fca55f80aa3efb36bb3bd6b14c9a9eac6d04cf9a125d3ca09","observation_id":"db9cac96-1645-4357-b4db-31300544deb0","resolution":{"observed_at":"2026-08-07T11:26:00.797982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-05T13:44:18.504592Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00388","last_updated":"2025-08-30T06:56:28Z","snapshot_observed_at":"2026-08-07T13:56:33.547626Z","submitted_at":"2025-08-30T06:56:28Z","title":"GraphKV: Breaking the Static Selection Paradigm with Graph-Based KV Cache Eviction","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T13:44:18.504592Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2509.00388"},"observation_digest":"sha256:3c22b1b214415941e5d8000c818802f6edbd5029defca33556cd44999d3996f7","observation_id":"fa23b0ac-9a7d-4eeb-9982-bf2e55b301c7","resolution":{"observed_at":"2026-08-05T13:44:18.504592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-04T17:05:55.021776Z","title":"Loki: Low-rank keys for efficient sparse attention, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11155","last_updated":"2025-09-14T08:20:48Z","snapshot_observed_at":"2026-08-04T17:05:50.271239Z","submitted_at":"2025-09-14T08:20:48Z","title":"AQUA: Attention via QUery mAgnitudes for Memory and Compute Efficient Inference in LLMs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T17:05:55.021776Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2509.11155"},"observation_digest":"sha256:f79d59431f53d2177d9a4229ccea10ee07ff9c824fe6f342e7ec1f87ce0eec41","observation_id":"49f7425a-66a5-403d-bdf2-06b232b5d774","resolution":{"observed_at":"2026-08-04T17:05:55.021776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-04T11:21:08.754040Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.05688","last_updated":"2026-05-25T12:53:13Z","snapshot_observed_at":"2026-08-04T11:21:03.843752Z","submitted_at":"2025-10-07T08:46:08Z","title":"vAttention: Verified Sparse Attention","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T11:21:08.754040Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2510.05688"},"observation_digest":"sha256:1d5801a803b3538e9c6cf11e8fa6fa4462499ba621af70f8655d48084e5b6b6c","observation_id":"ca6abd9e-09b2-4c1c-9e38-d7e797e76c40","resolution":{"observed_at":"2026-08-04T11:21:08.754040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":"2406.02542","doi":"10.48550/arxiv.2406.02542","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":"arXiv (Cornell University)","work_id":"8b4c5732-1f72-42cb-9f65-b9621beeab74","year":2024},"citing_paper":{"arxiv_id":"2604.03260","last_updated":"2026-04-29T02:07:19Z","snapshot_observed_at":"2026-08-01T18:14:45.126825Z","submitted_at":"2026-03-12T14:06:04Z","title":"Why Attend to Everything? Focus is the Key","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-15T11:55:36.701888Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2604.03260"},"observation_digest":"sha256:fa6a8527aedae64973438f4765edbc0f1df8283d695d9ab6d486fc67535459e7","observation_id":"3e6c4aed-007c-465a-9860-6dc2b669f48b","resolution":{"observed_at":"2026-05-15T11:59:59.625594Z","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":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":"2406.02542","doi":"10.48550/arxiv.2406.02542","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":"arXiv (Cornell University)","work_id":"8b4c5732-1f72-42cb-9f65-b9621beeab74","year":2024},"citing_paper":{"arxiv_id":"2604.16864","last_updated":"2026-04-18T06:28:21Z","snapshot_observed_at":"2026-08-02T05:52:50.560554Z","submitted_at":"2026-04-18T06:28:21Z","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T07:15:19.184970Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2604.16864"},"observation_digest":"sha256:3e9fb108826ac610d7eda255d7ef699f0c8f3d0429da7fd5c836a9e6eaa0f8ab","observation_id":"84050e28-e812-4a6d-9aeb-ab6d42359d72","resolution":{"observed_at":"2026-05-10T07:16:54.233089Z","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":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":"2406.02542","doi":"10.48550/arxiv.2406.02542","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":"arXiv (Cornell University)","work_id":"8b4c5732-1f72-42cb-9f65-b9621beeab74","year":2024},"citing_paper":{"arxiv_id":"2605.06763","last_updated":"2026-05-11T02:30:41Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-07T17:37:56Z","title":"Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:35.871863Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2605.06763"},"observation_digest":"sha256:154238c16d0399623472af02074f4a81b11c9c4dafb9c0f9de406ceb391bcdf1","observation_id":"c9989967-2c6e-4f3c-9647-7427c7307e77","resolution":{"observed_at":"2026-05-11T01:15:50.565136Z","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":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-07-13T00:42:31.008284Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09052","last_updated":"2026-07-10T02:48:43Z","snapshot_observed_at":"2026-08-06T07:46:31.225296Z","submitted_at":"2026-07-10T02:48:43Z","title":"COBS: Cumulant Order Block Sparse Attention","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T00:42:31.008284Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2607.09052"},"observation_digest":"sha256:8954cf00eedcee2f11022082ca3fc5f20a629e4ed7bb7dc8063032b4c481d742","observation_id":"d7c83128-372f-40bf-9acc-9130da661a36","resolution":{"observed_at":"2026-07-13T00:42:31.008284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-07-31T11:49:11.732389Z","title":"Loki: Low-rank keys for effi- cient sparse attention","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24555","last_updated":"2026-07-27T15:28:52Z","snapshot_observed_at":"2026-08-02T06:50:39.173138Z","submitted_at":"2026-07-27T15:28:52Z","title":"LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T11:49:11.732389Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2607.24555"},"observation_digest":"sha256:1b10394018caba5c7b6d1eca6655cc05409ecd116278609f1b6bc63d8b416d39","observation_id":"5393c3b5-e078-4c43-8730-3640dc0c7287","resolution":{"observed_at":"2026-07-31T11:49:11.732389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.02542/citation-record","integrity":"/paper/2406.02542/integrity","json":"/paper/2406.02542/citation-record.json","paper":"/paper/2406.02542"},"outbound":[],"paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T19:11:01.600257Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2406.02542."}