{"as_of":"2026-08-20T01:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f5c5368d4d5610a7c89fa2cb73654cb08beb872aa52a90c742d9a6e362c3634","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:00:43.347460Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-06-28T17:43:34.429061Z","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-01T20:46:13.998193Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"cited_work":{"arxiv_id":"2507.20030","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.20030","snapshot_observed_at":"2026-07-01T20:46:13.998193Z","title":"Faedkv: Infinite-window fourier transform for unbiased kv cache compression","venue":null,"work_id":"486dd0e4-a0f7-43fe-87ae-75f7d84d6128","year":2025},"citing_paper":{"arxiv_id":"2606.09862","last_updated":"2026-05-31T17:43:06Z","snapshot_observed_at":"2026-08-13T21:25:54.172372Z","submitted_at":"2026-05-31T17:43:06Z","title":"Blurry Window Attention","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T17:43:34.429061Z"},"links":{"cited_paper":"/paper/2507.20030","citing_paper":"/paper/2606.09862"},"observation_digest":"sha256:f4a5919f279cdf5477c067a588933af311594cf4e847c855531436d965c47a45","observation_id":"9effbdfd-c4ec-4fb5-a3ae-349266530b67","resolution":{"observed_at":"2026-07-01T20:46:13.999629Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.20030/citation-record","integrity":"/paper/2507.20030/integrity","json":"/paper/2507.20030/citation-record.json","paper":"/paper/2507.20030"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:00:42.645147Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:42.645147Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:4146c4ade949485ccfcb10240ac6025ac1989ef077fab985d574499c5e571071","observation_id":"d7738202-7526-4bf1-9250-9ab3a762f528","resolution":{"observed_at":"2026-08-06T14:00:42.645147Z","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-06T14:00:42.778371Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:42.778371Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:5f67c3c3eb293114f9ffff8518d3aaa629b16ee5d6ef7e761b24cef5064c0c6a","observation_id":"23a66165-1c1d-48c9-9e3d-838b3e34780d","resolution":{"observed_at":"2026-08-06T14:00:42.778371Z","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-06T14:00:42.863745Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:42.863745Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:35312312c468934fffa52edd55d90d24c285374317a2d2bef090247db360ef3f","observation_id":"f58c7214-ce57-4ac6-b3ed-57c8247c7dce","resolution":{"observed_at":"2026-08-06T14:00:42.863745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05317","last_updated":"2024-10-25T21:09:59Z","snapshot_observed_at":"2026-08-18T11:14:21.905818Z","submitted_at":"2024-06-08T01:35:11Z","title":"LoCoCo: Dropping In Convolutions for Long Context Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05317","snapshot_observed_at":"2026-08-06T14:00:42.890892Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:42.890892Z"},"links":{"cited_paper":"/paper/2406.05317","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:8b357a325c97d55b5f15876035629b8f3342c02482ac91c995d432257c86b189","observation_id":"096969b8-73e4-4bfd-8f4d-7f5d8ce55915","resolution":{"observed_at":"2026-08-06T14:00:42.890892Z","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-06T14:00:43.056432Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.056432Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c3acfcec63890d544c1bb3f96950f564864ccc5f35cb831a4f73f0d1e11a7a92","observation_id":"1d0e505e-5774-42d4-b0d1-a59251e4c9cf","resolution":{"observed_at":"2026-08-06T14:00:43.056432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10546","last_updated":"2024-10-16T17:58:00Z","snapshot_observed_at":"2026-08-18T03:05:31.697659Z","submitted_at":"2023-12-16T22:08:15Z","title":"Locally flat simple spheres in $\\mathbb{C} P^2$","version":2},"cited_work":{"arxiv_id":"2312.10546","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.10546","snapshot_observed_at":"2026-08-06T14:00:43.617898Z","title":"Locally flat simple spheres in $\\mathbb{C} P^2$","venue":"math.GT","work_id":"80dad41f-a222-4497-9b3a-90c887844458","year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.214843Z"},"links":{"cited_paper":"/paper/2312.10546","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:782759cb3d3cb9aface0f692eebb6b9301fb33b8727bb676ed3ef723add5533c","observation_id":"73fd132c-995e-43d5-a870-0c267277bd63","resolution":{"observed_at":"2026-08-06T14:00:43.620504Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01801","last_updated":"2024-10-29T18:26:09Z","snapshot_observed_at":"2026-08-14T11:45:47.400186Z","submitted_at":"2023-10-03T05:17:08Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01801","snapshot_observed_at":"2026-08-06T14:00:43.217756Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.217756Z"},"links":{"cited_paper":"/paper/2310.01801","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:2545c4dfcdb497d0a06eda521b60a53835cb28fe2189d91859247c666ddb40ba","observation_id":"b5fd7d0b-2be5-474b-a83e-13e55d894572","resolution":{"observed_at":"2026-08-06T14:00:43.217756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.16137","last_updated":"2024-06-24T21:22:00Z","snapshot_observed_at":"2026-08-19T14:47:53.412946Z","submitted_at":"2023-08-30T16:47:51Z","title":"LM-Infinite: Zero-Shot Extreme Length Generalization for Large Language Models","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.16137","snapshot_observed_at":"2026-08-06T14:00:43.237147Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.237147Z"},"links":{"cited_paper":"/paper/2308.16137","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c3006296e6e3a77cd413c85202ca67840b03db425f8203d3ce5e0d1ec9007960","observation_id":"bf543205-dd9c-4967-8698-5aedea26e86b","resolution":{"observed_at":"2026-08-06T14:00:43.237147Z","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":"10.18653/v1/2023.findings-acl.570","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"1e5be425-21a5-46dc-8fef-fff9483aaf41","year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.297609Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:365096c8f6692cd73d2793183b68d491327ea5c0a3c235a251caaea8b1073bb4","observation_id":"24c48610-f623-43ef-a77e-68769eb83bad","resolution":{"observed_at":"2026-08-06T14:00:43.402973Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T14:00:43.300199Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.300199Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:170cb039d868262ded5becfcba2cd82f4adb00f40eee2cb61b9ed125780c788f","observation_id":"e9c57fa1-2b9e-4ecc-b35c-02e230b8f497","resolution":{"observed_at":"2026-08-06T14:00:43.300199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15916","last_updated":"2024-03-23T19:13:01Z","snapshot_observed_at":"2026-08-16T14:07:04.240083Z","submitted_at":"2024-03-23T19:13:01Z","title":"Multi-agent transformer-accelerated RL for satisfaction of STL specifications","version":1},"cited_work":{"arxiv_id":"2403.15916","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.15916","snapshot_observed_at":"2026-08-06T14:00:43.509718Z","title":"Multi-agent transformer-accelerated RL for satisfaction of STL specifications","venue":"cs.AI","work_id":"b4504ca7-a1b2-4ac0-9f84-919eb27270eb","year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.302420Z"},"links":{"cited_paper":"/paper/2403.15916","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:e52caac6fb13b3345d0841a93180cd9616ac3db7b73b6501c49187a90726bce9","observation_id":"0e8c7ae6-5635-43db-8474-008d23ce6405","resolution":{"observed_at":"2026-08-06T14:00:43.512064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08910","last_updated":"2025-02-13T02:52:01Z","snapshot_observed_at":"2026-08-17T18:25:45.737890Z","submitted_at":"2025-02-13T02:52:01Z","title":"InfiniteHiP: Extending Language Model Context Up to 3 Million Tokens on a Single GPU","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08910","snapshot_observed_at":"2026-08-06T14:00:43.304573Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.304573Z"},"links":{"cited_paper":"/paper/2502.08910","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:219240132496f133a0b3cfc6338819ac5946b6d0288a81b416bf4ca3802da9e5","observation_id":"ce79bcc8-386d-4afd-af53-3b4a5f0ec7d0","resolution":{"observed_at":"2026-08-06T14:00:43.304573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.03824","last_updated":"2022-05-26T18:50:20Z","snapshot_observed_at":"2026-08-16T18:26:06.248195Z","submitted_at":"2021-05-09T03:32:48Z","title":"FNet: Mixing Tokens with Fourier Transforms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.03824","snapshot_observed_at":"2026-08-06T14:00:43.306753Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.306753Z"},"links":{"cited_paper":"/paper/2105.03824","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:625a6806ef54a0459da579e1cfaf9a1dcaa905a4146132d88b17fe4e7a016542","observation_id":"9ac4e482-d96e-4a3d-9eac-4ba3dc5f562b","resolution":{"observed_at":"2026-08-06T14:00:43.306753Z","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-06T14:00:43.309409Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.309409Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:e1ec980ebfa862d1dada826c0a734c3c3d36194c1c98a74a5ac54ae51f1cbfab","observation_id":"bc95e145-e320-452a-b11f-207c8a3399be","resolution":{"observed_at":"2026-08-06T14:00:43.309409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05088","last_updated":"2024-03-08T06:30:25Z","snapshot_observed_at":"2026-08-16T14:11:43.122767Z","submitted_at":"2024-03-08T06:30:25Z","title":"Semidirect Product Decompositions for Periodic Regular Languages","version":1},"cited_work":{"arxiv_id":"2403.05088","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.05088","snapshot_observed_at":"2026-08-06T14:00:43.489913Z","title":"Semidirect Product Decompositions for Periodic Regular Languages","venue":"cs.FL","work_id":"05bccbfe-0633-49f8-9b19-55c32b8104ab","year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.311425Z"},"links":{"cited_paper":"/paper/2403.05088","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c3359bd7636213e43cab19e91ac36604c0de7791fb31c18e311c7522f12b26eb","observation_id":"d41f5725-ab59-4957-bd0b-9c8cc860e7bb","resolution":{"observed_at":"2026-08-06T14:00:43.492572Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-06T14:00:43.313892Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.313892Z"},"links":{"cited_paper":"/paper/2404.14469","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:506c19601c08a684d24a856d7c569fede532b0603381ca290cc8c3914693afde","observation_id":"508c7fd4-1a15-48d2-ba54-3e5b8ca0c45b","resolution":{"observed_at":"2026-08-06T14:00:43.313892Z","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-06T14:00:43.656562Z","title":null,"venue":null,"work_id":"030445b2-b8c7-49ed-850e-c63cacfc953a","year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.315790Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:ef4b4f20cb771b143f44b997d385d9b3f55141cdcf77d9b8867b736c442042c8","observation_id":"d5941983-0935-481d-a928-05ab6b6aefa4","resolution":{"observed_at":"2026-08-06T14:00:43.658913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03172","last_updated":"2023-11-20T23:09:34Z","snapshot_observed_at":"2026-07-06T15:51:12.179086Z","submitted_at":"2023-07-06T17:54:11Z","title":"Lost in the Middle: How Language Models Use Long Contexts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.03172","snapshot_observed_at":"2026-08-06T14:00:43.317838Z","title":"Liu, Kevin Lin, John Hewitt, Ashwin Paranjape, Michele Bevilacqua, Fabio Petroni, and Percy Liang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.317838Z"},"links":{"cited_paper":"/paper/2307.03172","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:f0a7c7057772e59cb73e5615c38189f1a5909c1dde670f6f5204ab5a644292aa","observation_id":"1081df12-afc4-42f6-8d05-e189bcd728bc","resolution":{"observed_at":"2026-08-06T14:00:43.317838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09486","last_updated":"2024-02-04T03:14:08Z","snapshot_observed_at":"2026-08-16T14:27:12.171745Z","submitted_at":"2024-01-16T09:18:46Z","title":"LoMA: Lossless Compressed Memory Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09486","snapshot_observed_at":"2026-08-06T14:00:43.320151Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.320151Z"},"links":{"cited_paper":"/paper/2401.09486","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c4c8cbf8fd2ba5d67a60b8dd84a4912b271df7f65bb07916bf7fb9d7e1269abf","observation_id":"b72fc353-3e11-4225-8845-5ddbe2a5b604","resolution":{"observed_at":"2026-08-06T14:00:43.320151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-06T14:00:43.322352Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.322352Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c6117dbdcd8163cda813534be7032d73f8c672bdb1bc42e65d27ab79b6d3336d","observation_id":"132cff37-6471-42a2-ab3d-8f385b73393a","resolution":{"observed_at":"2026-08-06T14:00:43.322352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04534","last_updated":"2024-03-07T14:34:00Z","snapshot_observed_at":"2026-08-16T14:11:56.939416Z","submitted_at":"2024-03-07T14:34:00Z","title":"Quandle Coloring Quivers of general Torus links by dihedral quandles","version":1},"cited_work":{"arxiv_id":"2403.04534","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.04534","snapshot_observed_at":"2026-08-06T14:00:43.459464Z","title":"Quandle Coloring Quivers of general Torus links by dihedral quandles","venue":"math.GT","work_id":"b6b8b48e-caf1-4d83-8e42-dfdcbc76fa97","year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.324512Z"},"links":{"cited_paper":"/paper/2403.04534","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:b52482122bf1db1c3dfcb7747ab2297b0884ebe84f64d107401d01fe1f10b691","observation_id":"d152022b-2a1f-41c1-9156-ea1d00bde7ca","resolution":{"observed_at":"2026-08-06T14:00:43.461973Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T14:00:43.650262Z","title":null,"venue":null,"work_id":"cd442825-584a-4b24-ae16-82c92bd96bed","year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.326497Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:fa23e9fcf84d6784571c349626bd7b8f9c65bbbbbf8474f39effc23dc7099cc4","observation_id":"458daae1-247c-49a5-a60b-6d48d01cbc1b","resolution":{"observed_at":"2026-08-06T14:00:43.652481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05507","last_updated":"2019-11-13T14:36:01Z","snapshot_observed_at":"2026-08-10T02:15:37.272323Z","submitted_at":"2019-11-13T14:36:01Z","title":"Compressive Transformers for Long-Range Sequence Modelling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05507","snapshot_observed_at":"2026-08-06T14:00:43.328290Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.328290Z"},"links":{"cited_paper":"/paper/1911.05507","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:5679acad0bc79f97b1ea0dc581733b72b3689c1058e270845a1601b52e79dc21","observation_id":"627c9082-dd89-445b-af5d-92688b7e3a29","resolution":{"observed_at":"2026-08-06T14:00:43.328290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-08-17T06:56:20.644738Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-06T14:00:43.330590Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.330590Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:326f8a3a6eca333115d856e2894e39a7fe971aac8635dd0aca8cbb5bbb06b68a","observation_id":"fd1580c5-0fc0-44c3-907c-09f003b322e1","resolution":{"observed_at":"2026-08-06T14:00:43.330590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07979","last_updated":"2024-10-17T08:54:37Z","snapshot_observed_at":"2026-08-16T14:01:38.468398Z","submitted_at":"2024-04-11T17:57:22Z","title":"LLoCO: Learning Long Contexts Offline","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07979","snapshot_observed_at":"2026-08-06T14:00:43.332790Z","title":"Gonzalez, and Raluca Ada Popa","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.332790Z"},"links":{"cited_paper":"/paper/2404.07979","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:8f1d5f2b200f027e8acbcc208dda1ca03434f4463ee317c84037e4c57e9c505d","observation_id":"7c6e9d25-ed53-4127-a794-a2b2dba44e4d","resolution":{"observed_at":"2026-08-06T14:00:43.332790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-08-19T04:42:40.974785Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-06T14:00:43.334937Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.334937Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:bf47e00088d114337fe6fe2e4827d360f8dbd334c9b1235de190a03bc1c2f788","observation_id":"99f2810d-b587-4c27-9eca-772190e64c98","resolution":{"observed_at":"2026-08-06T14:00:43.334937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03462","last_updated":"2024-10-11T02:18:24Z","snapshot_observed_at":"2026-08-16T14:29:20.388697Z","submitted_at":"2024-01-07T11:57:40Z","title":"Long Context Compression with Activation Beacon","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03462","snapshot_observed_at":"2026-08-06T14:00:43.337415Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.337415Z"},"links":{"cited_paper":"/paper/2401.03462","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c04d3a712fb768964be887a0e0ef0c1a228efba8ff1799d21f37421c5f710bf4","observation_id":"2fa62095-e3f8-4918-b94e-6483a5949a2a","resolution":{"observed_at":"2026-08-06T14:00:43.337415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14048","last_updated":"2023-12-18T19:10:00Z","snapshot_observed_at":"2026-08-06T19:19:02.165567Z","submitted_at":"2023-06-24T20:11:14Z","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14048","snapshot_observed_at":"2026-08-06T14:00:43.341501Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.341501Z"},"links":{"cited_paper":"/paper/2306.14048","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:5274cabcd94e0cbd95d62a817969c1ac88df70563b0ed1ff257376f48d51a388","observation_id":"2cfa41c6-50f7-4e48-bee5-7af85837a260","resolution":{"observed_at":"2026-08-06T14:00:43.341501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15912","last_updated":"2024-03-23T18:55:58Z","snapshot_observed_at":"2026-08-16T14:07:04.376489Z","submitted_at":"2024-03-23T18:55:58Z","title":"Observation of the dual quantum spin Hall insulator by density-tuned correlations in a van der Waals monolayer","version":1},"cited_work":{"arxiv_id":"2403.15912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.15912","snapshot_observed_at":"2026-08-06T14:00:43.416477Z","title":"Observation of the dual quantum spin Hall insulator by density-tuned correlations in a van der Waals monolayer","venue":"cond-mat.mes-hall","work_id":"d29f188c-d812-4b71-bc7d-00e5fe0837e7","year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.343297Z"},"links":{"cited_paper":"/paper/2403.15912","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:3d1424483aabd8fe3104db42746f0f0149a40b7e805b11c89383e84e9b90e122","observation_id":"4083a77f-1383-4e49-b481-61c7045ff6a1","resolution":{"observed_at":"2026-08-06T14:00:43.419896Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T14:00:43.345171Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.345171Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:1951a0b08afd50f3c59357b22f0b0a05b592ac3745bce74ab6cd49256f9652e6","observation_id":"2e0700d2-ec4e-4d91-bd7a-69d03b8b26ad","resolution":{"observed_at":"2026-08-06T14:00:43.345171Z","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-06T14:00:43.347460Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.347460Z"},"links":{"citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:d52e7acd31b58fc06c63dc77cb9579f495de0952325309bc9459bcf4d953db9b","observation_id":"b47216f9-ed92-444e-8c1b-c73649d68545","resolution":{"observed_at":"2026-08-06T14:00:43.347460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":25,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":31},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2507.20030."}