{"as_of":"2026-08-07T05:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fbeced66c1e02b52b3115b3401147b0637910d952bfe577a33e79b8093958aa9","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-06T06:34:29.942622+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-06T14:00:29.609119Z","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-03T01:37:13.983372Z","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:8d9f4bcbfd6d4e4ac231d055ad13debacd132ab1683ff1de4d06482a6a57c18c","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T14:00:29.609119Z","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:2c10bdae624d2a57b14714dfbbfad3ffda67def093223b57680f985e6959c907","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-06T14:00:29.609119Z","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:4f1b0f3d8e8d817a3f5fcabd0b01711f025f998c599743ad758d83febad87585","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-02T11:20:36.216220Z","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-06T14:00:29.609119Z","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:1255eef54c3dd58efffa176c426462927fde1b99d4431d1734d09e787fa851de","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-05T07:40:11.727051Z","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-06T14:00:29.609119Z","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:e247942db2daf66aaaf131a312d49ce0b005b30e978415f82929470aa6a8193e","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-07-06T02:11:23.670680Z","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-06T14:00:29.609119Z","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:aef3e6e9bb6017823685b07952884b3b83c171126eba2a88fe3f340aaee70607","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-07-06T17:04:09.326801Z","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-06T14:00:29.609119Z","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:ed850c402708e23bab149cc051217b0233b6b46f22da4efa3caf591de2bd09b3","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T02:11:23.670680Z","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-06T14:00:29.609119Z","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:0a25a45bed8fdeaba53a5029714ddc904ab997772b26ffe41750316fd587cd5b","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-07T02:35:31.570950Z","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-06T14:00:29.609119Z","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:0e135aa195a686ee284a56be704fa69ffb416d683fd87d7122d3decb87483b22","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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:00:43.399944Z","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-06T14:00:29.609119Z","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:dc7a4216e7d5ca154b222255d0e9d35ca453405b174693e559576927f68bb7e0","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T14:00:29.609119Z","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:fa6b410d1ae17a9f9f46df2030cbd05309704a3ead7db524e883c7bee05bf1ce","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-07-06T17:49:32.438290Z","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-06T14:00:29.609119Z","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:7e4f968b66efa9d0372f85d37b59512a611971509b6bd405aa2fcb4ba1bbab54","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T20:35:44.339599Z","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-06T14:00:29.609119Z","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:a56755d000d212130d42207330e8a2d1367239baeb5dde067b6dca6a3669e346","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-03T17:35:52.520891Z","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-06T14:00:29.609119Z","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:4eb6715aa46caafc33a05985eeac708fcd14a390b4210c31c6a9d4e6a95fb911","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-06T14:00:29.609119Z","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:03b9b5d724bb1cdac30cb0ba9c8d92a71c4c2ecf11a0084d2a692ee6b3f519dc","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-02T16:53:33.809297Z","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-06T14:00:29.609119Z","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:987f247eaff2a71fdab28a3705bc741f8e5204fa86504c4a02d7d01eb667900a","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T18:03:55.981890Z","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-06T14:00:29.609119Z","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:0c56ad0811e42c5937b17c7ffd277222272d3b3b148d4282b0b7ef7fc45079b2","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-06T14:00:29.609119Z","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:fcef8addefa110a5de893d885a1088458b3b7a3c538a67cba23bdc8ab2c1e227","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T14:00:29.609119Z","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:326d0be57232b2eb25d62605577ebb0ba1ab3dcf974509773090ee315fc8719e","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-07-06T17:16:59.193820Z","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-06T14:00:29.609119Z","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:c35dedd5abf0ed4eb5248aa6cf7d7d6b9f4801fef9757e9ef2f7a9642b8b1a56","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-07-06T05:12:10.387914Z","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-06T14:00:29.609119Z","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:74f308f1b4b19343ad835db95b95f8d0df656a92a1949742f6e4335341f85511","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-02T11:12:29.253121Z","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-06T14:00:29.609119Z","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:863cd0c3f40262e975a5c09745ff70cd038032e21c8cf8f350bf05f69436c369","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T14:00:29.609119Z","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:d61a3380c8c2f96baa670e3aa5fbdbbecf40d35c32da08da6c4a3cf3a2b48b1d","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T08:36:43.643240Z","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-06T14:00:29.609119Z","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:b282d2ada14fbe7f86501ccb3e877d0bddf25ff71c168cfbb88574fcfee81673","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-07-06T11:01:58.137141Z","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-06T14:00:29.609119Z","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:ca6dc29c1462b936b20a2f42aa044b6678f2e580f090e8de7b5534ca2f8131ec","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-05T13:25:53.135684Z","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-06T14:00:29.609119Z","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:c12fee4729707f1b7f5c5c22b963cd45b129aa27a28b43bc880f7cb35eabb5d2","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-07-06T02:11:23.670680Z","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-06T14:00:29.609119Z","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:43b02a3d6bdce233291d057aa2be22ffefd66664e777581d5a1501a7ec8d783f","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-05T14:53:23.650244Z","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-06T14:00:29.609119Z","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:5e749de734b3825b7f1b526182a94fb5b549fa9de53a7abf56f6a6410f174d61","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-06T14:00:29.609119Z","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:55d773ffd5713e99b6b994934e3aa02c0d59af73044589233993e81a95893d1a","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-07-06T17:49:32.438290Z","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-06T14:00:29.609119Z","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:b782acd8dad9c64d03881dca9e3c399311c09f96493ead3edd68a9fbeff0bae6","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T14:00:29.609119Z","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:1ab8234ba7149485bde286618a85ddbfc8f261e0761d5a7b69a06251b14b6e51","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-06T14:00:29.609119Z","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:2b0ab7e5ba99c75454f6d137983d71be24b1ba32cccc562bb2d0dbe05c666fdd","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-06T14:00:29.609119Z","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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2507.20030."}