{"as_of":"2026-08-09T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:004e7a5b6859405dda1bf12d4114214cb4bcb09aea90588077ee4e7ea8318212","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:46:11.419712Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-08T05:29:16.733334Z","title":"SparQ attention: Bandwidth-efficient LLM inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08363","last_updated":"2026-06-16T14:51:28Z","snapshot_observed_at":"2026-08-08T05:20:34.050192Z","submitted_at":"2025-02-12T12:50:15Z","title":"Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T05:29:16.733334Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2502.08363"},"observation_digest":"sha256:001a20ca86764ec01548d4f48b1ab67663d48af4985595f4b078a933384fe0a3","observation_id":"9892386f-9661-4b1d-80ec-97f60e102f1a","resolution":{"observed_at":"2026-08-08T05:29:16.733334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-08T13:46:11.419712Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09647","last_updated":"2025-03-05T16:14:16Z","snapshot_observed_at":"2026-08-09T11:20:27.104492Z","submitted_at":"2025-02-11T00:04:32Z","title":"Unveiling Simplicities of Attention: Adaptive Long-Context Head Identification","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-08T13:46:11.419712Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2502.09647"},"observation_digest":"sha256:1b7b92a3e7454e90e2e45353c3be526676c45540ff954159b250ea8cd36e2551","observation_id":"870ee56a-545b-4041-89b2-ff0acca5654d","resolution":{"observed_at":"2026-08-08T13:46:11.419712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"citing_paper":{"arxiv_id":"2505.05772","last_updated":"2026-05-12T05:15:27Z","snapshot_observed_at":"2026-08-01T02:21:02.338710Z","submitted_at":"2025-05-09T04:17:05Z","title":"Sparse Attention Remapping with Clustering for Efficient LLM Decoding on PIM","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T16:58:11.105511Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2505.05772"},"observation_digest":"sha256:881b113d8ea4c655106de1eee409bfbd36a272cb040d14c73a58b084211c10a8","observation_id":"733b74c5-244a-427c-924e-d71070f9fb19","resolution":{"observed_at":"2026-05-22T17:01:48.528269Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-07T12:39:07.482431Z","title":"Sparq attention: Bandwidth- efficient llm inference,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24179","last_updated":"2025-05-30T03:40:24Z","snapshot_observed_at":"2026-08-09T00:29:42.217756Z","submitted_at":"2025-05-30T03:40:24Z","title":"SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:07.482431Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2505.24179"},"observation_digest":"sha256:befb35decaac9c407084e2b1617e701ddeba114dde6a9014e0af618dcc1866a3","observation_id":"8094898b-a09f-4271-ac6e-1e47a32bf967","resolution":{"observed_at":"2026-08-07T12:39:07.482431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-07T11:26:00.637951Z","title":null,"venue":null,"work_id":null,"year":2023},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-07T11:26:00.637951Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2506.02572"},"observation_digest":"sha256:48a6ddae57d1725ef7e1a0298489cf26f40ed731ca4d72964b09b8a6513f45e5","observation_id":"c9d52bb4-15be-4955-bc9d-3d23740d9950","resolution":{"observed_at":"2026-08-07T11:26:00.637951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-07T06:04:33.981581Z","title":"Sparq attention: Bandwidth-efficient llm inference.arXiv preprint arXiv:2312.04985, 2023","venue":null,"work_id":null,"year":2023},"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":75,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:33.981581Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2506.06266"},"observation_digest":"sha256:54941fbdd57f11044d4394d7fbcc2eb734a5ffdcbf872133f327daae0a9745a2","observation_id":"40aab145-4630-4637-9fd4-00bad92266b0","resolution":{"observed_at":"2026-08-07T06:04:33.981581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-07T12:38:39.247507Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":null,"work_id":null,"year":2023},"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":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.247507Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2506.15704"},"observation_digest":"sha256:1f0bd73a60992dbc6ad647fd8bc42378fb209235752950baecbe01e7f306b37b","observation_id":"1e514596-25c8-486d-96ff-73b94b3258e6","resolution":{"observed_at":"2026-08-07T12:38:39.247507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"citing_paper":{"arxiv_id":"2507.21433","last_updated":"2026-05-14T02:27:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-29T02:05:51Z","title":"ReasonCache: Accelerating Large Reasoning Model Serving through KV Cache Sharing","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-19T03:14:05.109011Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2507.21433"},"observation_digest":"sha256:437c9d3a3849901dea4c87ac35137991e4a0b1bbd299773fc7470c111058f353","observation_id":"cb719406-d1f1-4827-914d-bb50068c3795","resolution":{"observed_at":"2026-05-19T03:17:00.840258Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-04T17:05:55.010618Z","title":"Sparq attention: Bandwidth-efficient llm inference, 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":30,"source":"arxiv_source","source_observed_at":"2026-08-04T17:05:55.010618Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2509.11155"},"observation_digest":"sha256:861aea6d618852ad121ba737078f00bb56a4016251fd4ae85e04605bd537abcf","observation_id":"f0bd9784-91ec-47c6-9db7-33bf7abcd744","resolution":{"observed_at":"2026-08-04T17:05:55.010618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"citing_paper":{"arxiv_id":"2512.16056","last_updated":"2026-05-13T15:33:38Z","snapshot_observed_at":"2026-08-08T20:21:16.368796Z","submitted_at":"2025-12-18T00:45:00Z","title":"MultiPath Memory Access: Breaking Host-GPU Bandwidth Bottlenecks in LLM Services","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-16T21:57:12.142867Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2512.16056"},"observation_digest":"sha256:f1ffe93792ee09724d9d57bceb6aacff7eda739c793f468cf1fa439a643ba3a8","observation_id":"a5967116-cafb-43bb-bcb4-87eacc2ed466","resolution":{"observed_at":"2026-05-16T21:58:35.755161Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"citing_paper":{"arxiv_id":"2604.24820","last_updated":"2026-04-27T14:06:21Z","snapshot_observed_at":"2026-07-31T06:39:38.066325Z","submitted_at":"2026-04-27T14:06:21Z","title":"Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decoding","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-07T17:56:39.124969Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2604.24820"},"observation_digest":"sha256:4dd369ea919a94a79720d582ae3214adbe328cad39fe4c5da7155e7faff791d6","observation_id":"16dac94c-7bab-4c2c-b5a8-46d3266dc0df","resolution":{"observed_at":"2026-05-11T23:11:18.789798Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"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":39,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:35.871863Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2605.06763"},"observation_digest":"sha256:7e96afa827d2b173b54d9a7fb67b3b85669ace1c8b83063cf3ad9ee9f47f0ea2","observation_id":"72938cef-bb62-4e1a-8dbd-1dd05c411287","resolution":{"observed_at":"2026-05-11T01:15:50.537412Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":"2312.04985","doi":"10.48550/arxiv.2312.04985","metadata_source":"arxiv_reference","pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparq attention: Bandwidth-efficient llm inference","venue":"arXiv (Cornell University)","work_id":"1fa58820-f3b9-446e-9b1d-5b9ab21405a2","year":2023},"citing_paper":{"arxiv_id":"2605.07719","last_updated":"2026-05-08T13:24:39Z","snapshot_observed_at":"2026-07-31T02:35:55.019423Z","submitted_at":"2026-05-08T13:24:39Z","title":"An Efficient Hybrid Sparse Attention with CPU-GPU Parallelism for Long-Context Inference","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-11T02:56:28.828593Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2605.07719"},"observation_digest":"sha256:53fd7bb1a4dd192a9fda9ea8902faceb1167a9ffbf180dd0c79f6e6fe43ce271","observation_id":"2cebaacf-f2ed-48c5-9729-2ec4ee0c4f7d","resolution":{"observed_at":"2026-05-11T03:05:54.081442Z","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":"2312.04985","last_updated":"2024-09-04T10:04:52Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04985","snapshot_observed_at":"2026-07-12T09:50:23.266920Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.02574","last_updated":"2026-06-30T16:12:40Z","snapshot_observed_at":"2026-07-12T09:50:22.497230Z","submitted_at":"2026-06-30T16:12:40Z","title":"From Tensor Buffer to Distributed Memory Hierarchy: A Survey of KV Cache Management for LLM Serving","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-07-12T09:50:23.266920Z"},"links":{"cited_paper":"/paper/2312.04985","citing_paper":"/paper/2607.02574"},"observation_digest":"sha256:6f90ef9f967071e3e96a6035f3ed4b61ea4aa1dcc3d667721580f362aa06be5b","observation_id":"5cfa8952-9a26-4efd-85b7-4615c3927039","resolution":{"observed_at":"2026-07-12T09:50:23.266920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2312.04985/citation-record","integrity":"/paper/2312.04985/integrity","json":"/paper/2312.04985/citation-record.json","paper":"/paper/2312.04985"},"outbound":[],"paper":{"arxiv_id":"2312.04985","last_updated":"2024-09-04T10:04:52Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T11:47:35Z","title":"SparQ Attention: Bandwidth-Efficient LLM Inference"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2312.04985."}