{"as_of":"2026-08-18T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3dbc2970194465f0207f9d9951e39cb9cdc8c7fdfff28a59b0caf9649a49e7df","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:10:40.475653Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-05-08T03:16:00.868964Z","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-05-11T22:11:14.344298Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"cited_work":{"arxiv_id":"2506.11886","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11886","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beyond homogeneous attention: Memory-efficient LLMs via Fourier-approximated KV cache","venue":null,"work_id":"91d6be8e-a771-4762-aa78-6da1b41592e1","year":2025},"citing_paper":{"arxiv_id":"2605.05699","last_updated":"2026-05-07T05:44:39Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:44:39Z","title":"When Quantization Is Free: An int4 KV Cache That Outruns fp16 on Apple Silicon","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T03:16:00.868964Z"},"links":{"cited_paper":"/paper/2506.11886","citing_paper":"/paper/2605.05699"},"observation_digest":"sha256:a3e8269b78d21a8fc1d9a8debe42f581eaf5da61a321bb344550dccc88e50156","observation_id":"6c197b14-e90d-4b7e-87a7-c398ac0bdf04","resolution":{"observed_at":"2026-05-11T22:11:14.347967Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.11886/citation-record","integrity":"/paper/2506.11886/integrity","json":"/paper/2506.11886/citation-record.json","paper":"/paper/2506.11886"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-08-15T06:28:09.529747Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-07T01:10:37.064168Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.064168Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:eca7219e9d783fd241d2f30e7d089de8db32137850565fb8bf04ef7657c7f621","observation_id":"d32e9be9-ef2c-4430-b9bf-712937b1c710","resolution":{"observed_at":"2026-08-07T01:10:37.064168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14508","last_updated":"2024-06-19T04:00:32Z","snapshot_observed_at":"2026-08-08T03:49:18.086396Z","submitted_at":"2023-08-28T11:53:40Z","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14508","snapshot_observed_at":"2026-08-07T01:10:37.133228Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.133228Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:de8f5eb10bcfe2f48074ad665583d8ea52ea90b01a15c8e8ab1670faeb0c0a72","observation_id":"02d1bb4c-cd57-4c9d-8c14-2494a8bd2552","resolution":{"observed_at":"2026-08-07T01:10:37.133228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02069","last_updated":"2025-05-15T17:18:12Z","snapshot_observed_at":"2026-08-13T04:39:30.300015Z","submitted_at":"2024-06-04T07:51:30Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-07T01:10:37.220840Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.220840Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:41276e2ec23d7b043c1cb89941b4f2ba78200f3cfef5027151fe9eba85ee9720","observation_id":"0fb386be-fb77-4d39-a4b4-f5461bb4da0b","resolution":{"observed_at":"2026-08-07T01:10:37.220840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21118","last_updated":"2024-11-04T02:08:55Z","snapshot_observed_at":"2026-08-16T13:29:46.132956Z","submitted_at":"2024-07-30T18:19:38Z","title":"Palu: Compressing KV-Cache with Low-Rank Projection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21118","snapshot_observed_at":"2026-08-07T01:10:37.292088Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.292088Z"},"links":{"cited_paper":"/paper/2407.21118","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:cac9d1c9d5a43a022d2d5ca8689ac112285183c5ffbf876a2b39ed7a9aede9f7","observation_id":"77689f63-3157-4247-bc97-f1a0c49a8c57","resolution":{"observed_at":"2026-08-07T01:10:37.292088Z","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-07T01:10:37.380494Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.380494Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:a468f511d4ae700e0f7104821aa4e1db83618fd69e609b3b2580bed2ba1a44ec","observation_id":"6253145d-a773-4e12-acdc-ac8697952030","resolution":{"observed_at":"2026-08-07T01:10:37.380494Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.443030Z","title":null,"venue":null,"work_id":"58132aff-707c-405c-a8d2-767164ed7f44","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.492935Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:d50ae7f379e8eeee26ff2ee2261ea7542b7a5aa9853ce6093b6a8d41d4a94491","observation_id":"6da607bf-3b81-4706-8acf-a729cf6e5bbc","resolution":{"observed_at":"2026-08-07T01:10:42.561101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:42.184140Z","title":null,"venue":null,"work_id":"dc0cc113-09d1-4e34-9b14-19d976123114","year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.594154Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:c3b2120d391ddc69c37ae791680f585fb54829d995535a791409374c4dcb876f","observation_id":"b7b21fae-2aca-4a3a-b3b9-908a6c333cce","resolution":{"observed_at":"2026-08-07T01:10:42.280185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.06219","last_updated":"2024-11-12T08:18:45Z","snapshot_observed_at":"2026-08-16T13:53:51.544682Z","submitted_at":"2024-05-10T03:06:24Z","title":"SKVQ: Sliding-window Key and Value Cache Quantization for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.06219","snapshot_observed_at":"2026-08-07T01:10:37.672974Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.672974Z"},"links":{"cited_paper":"/paper/2405.06219","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:a0be0cb6a9bf97ba3056658bc149cb90722ad9ceb533808413e4b0f37b6b2d5c","observation_id":"68e19fd9-cb02-46b3-95a7-b72eb6c75299","resolution":{"observed_at":"2026-08-07T01:10:37.672974Z","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-08-13T17:20:44.002518Z","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-07T01:10:37.796301Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.796301Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:2c7b32706a9d5592fc1ff41f692ce78ee2cbbf94ec1bd3784a311a2b8e5ae2d3","observation_id":"5812b41b-1140-4cc9-be14-481be40d733f","resolution":{"observed_at":"2026-08-07T01:10:37.796301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08944","last_updated":"2024-05-14T20:17:22Z","snapshot_observed_at":"2026-08-16T13:52:41.078933Z","submitted_at":"2024-05-14T20:17:22Z","title":"Challenges in Deploying Long-Context Transformers: A Theoretical Peak Performance Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08944","snapshot_observed_at":"2026-08-07T01:10:37.895512Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.895512Z"},"links":{"cited_paper":"/paper/2405.08944","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:62c60eeb5173aa8cea41cca26bb9c8a0c76647203a6ce8fcd0545c7000a27604","observation_id":"ea84603b-c5ee-4a70-9602-28b9142a0bb8","resolution":{"observed_at":"2026-08-07T01:10:37.895512Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.971653Z","title":null,"venue":null,"work_id":"e3728a91-e27c-4c2a-ab02-11925445416d","year":2020},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:37.985876Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:6b64cf2cfc194590e831844184da622a2affe1ad9188addffc26da284582608e","observation_id":"99434401-507e-4f4f-b858-2bcab6d94012","resolution":{"observed_at":"2026-08-07T01:10:42.064841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T01:10:38.066968Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.066968Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:abbb2bcae7180bd218ab514a6d9b31772541cf2e9353590b42eb543633e2d3c5","observation_id":"c5521ef6-9edd-4b9c-ac07-2dcd278e4c3c","resolution":{"observed_at":"2026-08-07T01:10:38.066968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15099","last_updated":"2025-05-16T12:42:33Z","snapshot_observed_at":"2026-08-16T15:30:10.950966Z","submitted_at":"2023-05-24T12:33:06Z","title":"Fourier Transformer: Fast Long Range Modeling by Removing Sequence Redundancy with FFT Operator","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15099","snapshot_observed_at":"2026-08-07T01:10:38.138609Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.138609Z"},"links":{"cited_paper":"/paper/2305.15099","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:f92ff6a0fe0857547ec05befad9552af0bd28f532c4313ca95f7465e718ae5a4","observation_id":"7240aae5-b597-4d7a-bb9a-2b6eae481e31","resolution":{"observed_at":"2026-08-07T01:10:38.138609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.18079","last_updated":"2025-05-28T18:58:29Z","snapshot_observed_at":"2026-08-17T08:27:45.946180Z","submitted_at":"2024-01-31T18:58:14Z","title":"KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.18079","snapshot_observed_at":"2026-08-07T01:10:38.223015Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.223015Z"},"links":{"cited_paper":"/paper/2401.18079","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:d4d8ff0d967f3d63fd849c062b88c5cc988e169949779e56420ae8e07fcf5895","observation_id":"f8f7e5ad-7493-4c4b-bf6d-c01e6c2334aa","resolution":{"observed_at":"2026-08-07T01:10:38.223015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06654","last_updated":"2024-08-06T21:48:58Z","snapshot_observed_at":"2026-08-15T18:01:46.669862Z","submitted_at":"2024-04-09T23:41:27Z","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06654","snapshot_observed_at":"2026-08-07T01:10:38.303268Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.303268Z"},"links":{"cited_paper":"/paper/2404.06654","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:79e77e484991733c4078b0cf7bc5d7ecd3638234808869b829f67db30602090d","observation_id":"b9fb54cf-ac7a-4c2d-b7a3-31786ecf5f9d","resolution":{"observed_at":"2026-08-07T01:10:38.303268Z","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-07T01:10:38.405115Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.405115Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:4b77e443e5ccd771d0a0da73a6e3747e52fd2bad9b70af44022cfe5a56015c38","observation_id":"46ba7888-c3be-4b12-8c05-e67657da7bb9","resolution":{"observed_at":"2026-08-07T01:10:38.405115Z","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-07T01:10:38.501927Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.501927Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:5e06827cd06b8817944fd24add416f43bfb84f79d41a79d5d3ec9b76b0b1bfc4","observation_id":"967d1b8f-b801-46da-aba6-4b36a56336f4","resolution":{"observed_at":"2026-08-07T01:10:38.501927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14469","last_updated":"2024-06-17T03:01:58Z","snapshot_observed_at":"2026-08-14T12:21:04.886717Z","submitted_at":"2024-04-22T17:42:58Z","title":"SnapKV: LLM Knows What You are Looking for Before Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14469","snapshot_observed_at":"2026-08-07T01:10:38.578991Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.578991Z"},"links":{"cited_paper":"/paper/2404.14469","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:4400e2c2d2c7affe4414ed02676f395f7faa06488cfc4f6b3c694e3743422232","observation_id":"67428f7a-63c7-4a04-9878-4d2b2088ef6b","resolution":{"observed_at":"2026-08-07T01:10:38.578991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-07T01:10:38.661837Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.661837Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:703bee8bd2d8a61f97ab70b2a6baecf9e5a80c5008c6524983bd707826808dce","observation_id":"adf38444-e51f-42c3-8966-7231c91222ec","resolution":{"observed_at":"2026-08-07T01:10:38.661837Z","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-07T01:10:38.782690Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.782690Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:737ec7a6cfd4803d5fcdd7076d83e017199b62fed92c822f3ee8777031e6a75e","observation_id":"ff632d91-d771-47fd-9d85-475ea280ab99","resolution":{"observed_at":"2026-08-07T01:10:38.782690Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.738679Z","title":null,"venue":null,"work_id":"82f668f9-e4b9-41c9-9de6-5c532ebf4a6e","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.889808Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:4e78120046731d8be134237d7c25c2deeaf593560fd1a6244bd98103b997a9a0","observation_id":"983d1a8a-e6be-4680-8311-397d95ee450b","resolution":{"observed_at":"2026-08-07T01:10:41.831696Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02750","last_updated":"2024-07-25T09:16:05Z","snapshot_observed_at":"2026-08-12T17:03:50.984887Z","submitted_at":"2024-02-05T06:06:47Z","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02750","snapshot_observed_at":"2026-08-07T01:10:38.969894Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:38.969894Z"},"links":{"cited_paper":"/paper/2402.02750","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:39ab96d94f22b3b88928449ad6c6fffed9ee44fbcfb3c367cab9e0cc61b6092d","observation_id":"e7937253-4c7a-41ec-a915-1dfb34afc9f8","resolution":{"observed_at":"2026-08-07T01:10:38.969894Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.584494Z","title":null,"venue":null,"work_id":"1d5104be-5787-45a8-97ab-a069065f5021","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.084854Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:71183c39b366fd61d0e2aa6afd54b0c34cbf9876e3662a02affb0009a73ec452","observation_id":"7fe3750d-4734-40d0-9fae-ead55c535cea","resolution":{"observed_at":"2026-08-07T01:10:41.661866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.418581Z","title":null,"venue":null,"work_id":"eaeb741a-0cb4-4d5e-acad-3b11279fef46","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.160072Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:09bc49fc1eb19a2d8f2b7ca82bc67b01311058c4a7cbd0827930981027a42d83","observation_id":"65c08443-1b49-4777-a6b1-5d70180bcccb","resolution":{"observed_at":"2026-08-07T01:10:41.507829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T01:10:39.240473Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.240473Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:3debe324df48a04be7401eee1a391a6e52a1aabe9e466d0be515f21387a16710","observation_id":"e0282b44-b765-4fb5-93e1-2489826ff66e","resolution":{"observed_at":"2026-08-07T01:10:39.240473Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.235070Z","title":null,"venue":null,"work_id":"50796ded-adb7-4126-981b-4dc535dd60ac","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.319866Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:09c1dabe6167f4db47f1afefe9cc75fd6084f2ec1be811d91a4bc43cebff9edc","observation_id":"2ef5c277-ceb2-4d3a-bfd5-2dad65f6b045","resolution":{"observed_at":"2026-08-07T01:10:41.342504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:39.380955Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.380955Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:e568277added0ed993a87bb47f9c3e062edc494d8356cc0b441f23eb71815d2d","observation_id":"b6e55613-4df6-4cc7-995d-c7e0a46085b8","resolution":{"observed_at":"2026-08-07T01:10:39.380955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05646","last_updated":"2024-11-08T16:29:33Z","snapshot_observed_at":"2026-08-16T13:27:13.762383Z","submitted_at":"2024-08-10T22:47:12Z","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05646","snapshot_observed_at":"2026-08-07T01:10:39.489964Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.489964Z"},"links":{"cited_paper":"/paper/2408.05646","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:e18d923635c23e76ee0b85575e12e69f22fa561bed0ae6b96bd95a4bf020a386","observation_id":"95c0db8f-a94d-4cb8-afae-3c29ab962c30","resolution":{"observed_at":"2026-08-07T01:10:39.489964Z","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-07T01:10:39.600677Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.600677Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:8c0f7b838ff91f8c7703fe51e6907e75cbf5c81aa86fcb224495ac9f3a8300f5","observation_id":"97ed5edf-350d-439e-8607-810faf00b50a","resolution":{"observed_at":"2026-08-07T01:10:39.600677Z","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-07T01:10:39.727024Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.727024Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:6ff224467c7081aa1911765f4e71cc336290ba413e894f794736b9a38c51cd61","observation_id":"061adc09-550a-45d4-b832-eb41ae823006","resolution":{"observed_at":"2026-08-07T01:10:39.727024Z","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-07T01:10:39.831267Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.831267Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:8c7a508a2cfccbe6c0a6c0a579d2ca652c446bc3fa1176ade40dc7bfddbaf4a2","observation_id":"dd2bb41e-d2cc-4fd1-b1fc-e96016993a50","resolution":{"observed_at":"2026-08-07T01:10:39.831267Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:10:41.043864Z","title":null,"venue":null,"work_id":"f53247f1-a7f7-4ce1-88d6-4f5afe7798e5","year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:39.927774Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:ba3bc75deda16520f83038f880c1f33f6114a2a96a4e08375f0488a09322de01","observation_id":"4246cb51-bf02-4602-aaf7-32b841f3ddb0","resolution":{"observed_at":"2026-08-07T01:10:41.137032Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17247","last_updated":"2025-02-27T11:16:33Z","snapshot_observed_at":"2026-08-12T14:42:48.682739Z","submitted_at":"2024-10-22T17:59:53Z","title":"PyramidDrop: Accelerating Your Large Vision-Language Models via Pyramid Visual Redundancy Reduction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17247","snapshot_observed_at":"2026-08-07T01:10:40.035816Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:40.035816Z"},"links":{"cited_paper":"/paper/2410.17247","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:b62832a5dd3ef02708e3ea8d39a3e7eb8cd2800c5a49f99f5a6cc8a23f75cb0c","observation_id":"e068253c-41e4-4b36-8de6-4d1079fbc21c","resolution":{"observed_at":"2026-08-07T01:10:40.035816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11089","last_updated":"2025-02-27T09:01:21Z","snapshot_observed_at":"2026-08-16T16:29:35.500686Z","submitted_at":"2025-02-16T11:53:44Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11089","snapshot_observed_at":"2026-08-07T01:10:40.143705Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:40.143705Z"},"links":{"cited_paper":"/paper/2502.11089","citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:8a5a30adc0d1dd883498f15d2c2323b19198acea6f46366455b427641ec5c752","observation_id":"a93da625-3f42-4cc3-8641-7cc93e498190","resolution":{"observed_at":"2026-08-07T01:10:40.143705Z","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-07T01:10:40.236359Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:40.236359Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:f82b5f4fac6cd7650366a92cc18a2a501c4b8c02bb0a1fdae575e6638e31a73a","observation_id":"05e59751-bd21-4913-9283-e5589a22469d","resolution":{"observed_at":"2026-08-07T01:10:40.236359Z","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-07T01:10:40.350849Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:40.350849Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:44f40a257195882e4e10822de93dd19895f97626d0574dcf62ca00bf2e079dd7","observation_id":"9ae29bc8-1ccb-45ae-bb41-224307ebc67d","resolution":{"observed_at":"2026-08-07T01:10:40.350849Z","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-07T01:10:40.475653Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T01:10:40.475653Z"},"links":{"citing_paper":"/paper/2506.11886"},"observation_digest":"sha256:34496adad9e23e15029c1a91ff2024ecdaf47d6d9b97dabfe38dc39a6cd16e8e","observation_id":"aa1ff873-8178-4325-85f1-4dc287ea332c","resolution":{"observed_at":"2026-08-07T01:10:40.475653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.11886","last_updated":"2025-06-13T15:35:54Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T03:15:24.625839Z","submitted_at":"2025-06-13T15:35:54Z","title":"Beyond Homogeneous Attention: Memory-Efficient LLMs via Fourier-Approximated KV Cache"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2506.11886."}