{"as_of":"2026-08-20T23:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:27e1147a3128e8908745abb3eeaa75493e01f4fd9878dcc488df6a62f5da45d6","coverage":[{"denominator":214,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:56:34.179657Z","state":"measured"},{"denominator":103,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":103,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:10:57.183708Z","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-11T09:36:04.771630Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-08-07T15:10:57.183708Z","title":"Fast rope attention: Combin ing the polynomial method and fast fourier transform","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16284","last_updated":"2025-05-22T06:26:28Z","snapshot_observed_at":"2026-08-15T08:26:08.362157Z","submitted_at":"2025-05-22T06:26:28Z","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:57.183708Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2505.16284"},"observation_digest":"sha256:eb27f2260b1e3be374cacdc621ba8f9df79e057b6bea635f70d2f6fe777d7fc6","observation_id":"621ca083-c8d5-43ac-958c-942fd50c1dbb","resolution":{"observed_at":"2026-08-07T15:10:57.183708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-08-07T14:21:00.129826Z","title":"Fast rope attention: Combining the polynomial method and fast fourier transform.arXiv preprint arXiv:2505.11892,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19531","last_updated":"2025-05-26T05:33:26Z","snapshot_observed_at":"2026-08-17T17:33:34.940404Z","submitted_at":"2025-05-26T05:33:26Z","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:00.129826Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2505.19531"},"observation_digest":"sha256:3f393cc25e3f30fa783c3e366bd4ec39b94c7aa0f9b29bef3c97eec824a60e47","observation_id":"dfeadc09-5c90-4514-a781-34d65330052a","resolution":{"observed_at":"2026-08-07T14:21:00.129826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":"2505.11892","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast rope attention: Combining the polynomial method and fast fourier transform","venue":null,"work_id":"5b44d542-6d11-4af6-aebe-513e4959baf3","year":2025},"citing_paper":{"arxiv_id":"2604.10980","last_updated":"2026-04-13T04:39:49Z","snapshot_observed_at":"2026-08-17T06:14:43.642666Z","submitted_at":"2026-04-13T04:39:49Z","title":"Tracking High-order Evolutions via Cascading Low-rank Fitting","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T15:55:27.722919Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2604.10980"},"observation_digest":"sha256:063be64c8114188e3b03de07d30c5ec31d5fd07b16820b0ca349b49716649c08","observation_id":"0cf7b32a-984c-4712-ab44-5f26aab50e0f","resolution":{"observed_at":"2026-05-11T09:36:04.777834Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.11892/citation-record","integrity":"/paper/2505.11892/integrity","json":"/paper/2505.11892/citation-record.json","paper":"/paper/2505.11892"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:56:33.750513Z","title":"Optimal-degree polynomial approximations for exponentials and gaussian kernel density estimation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.750513Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:02bdb4e932805a8803350b7e612601110d79bdc2290ca432903b0759323616cf","observation_id":"7e07b8cc-7d0e-4ccc-9a72-1d3826f47112","resolution":{"observed_at":"2026-08-15T20:56:33.750513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:56:33.755619Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.755619Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:4ebbff3db1fd717bb636e58a7ec2e8ea5229c580c32a2ee6e418a90aa0627fcb","observation_id":"7be883c7-b37f-4acd-95a5-8042c7e3de85","resolution":{"observed_at":"2026-08-15T20:56:33.755619Z","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-15T20:56:33.760572Z","title":"Computational complexity: a modern approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.760572Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:c55bec874b4564ffa9824ca605ea417db7f17d8980c525952bd7c38d93354894","observation_id":"ef4f2f7e-261c-4c9d-9cdc-560bc313ec07","resolution":{"observed_at":"2026-08-15T20:56:33.760572Z","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-15T20:56:33.765517Z","title":"A fast algorithm for aperiodic linear stencil computation using fast fourier transforms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.765517Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:f9587c9612e237d3062b7c083da2f6837456261294af7d9e47839a5115915260","observation_id":"2292691b-6a06-49a8-af3e-95cec780ad9c","resolution":{"observed_at":"2026-08-15T20:56:33.765517Z","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-15T20:56:33.770141Z","title":"Linear attention is (maybe) all you need (to understand transformer optimization)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.770141Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:6444176a3632786a0cda0b628b7d3baac6607d1c7907cabdb0c9f65784f95ad3","observation_id":"d082cdc4-56bc-4040-9edd-9894d1484fdc","resolution":{"observed_at":"2026-08-15T20:56:33.770141Z","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-15T20:56:33.774745Z","title":"A few remarks on the operator norm of random toeplitz matrices","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.774745Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:4ca43f807726357b5605079fd8cb6d98e9e48f1a2ed9d457b7d0a13dc0520d04","observation_id":"da0114c3-4b03-4c53-926c-78f6fa2bf6ef","resolution":{"observed_at":"2026-08-15T20:56:33.774745Z","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-15T20:56:33.781038Z","title":"Introducing meta llama 3: The most capable openly available llm to date, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.781038Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:a743e0b7bd709a72f157b31243c922a853d1e0b7d31ea8ca045d3df1e1ee6cfd","observation_id":"4a631dc1-84ec-49b5-862d-a82450cbfa48","resolution":{"observed_at":"2026-08-15T20:56:33.781038Z","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-15T20:56:33.785200Z","title":"Foundation models defining a new era in vision: a survey and outlook","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.785200Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:69940fdb77e9e3e7528e2fc87c27c9fb31988bc8739aeda540f6db06abb61c41","observation_id":"ca339a01-9b73-4965-9255-66e9b744cfc3","resolution":{"observed_at":"2026-08-15T20:56:33.785200Z","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-15T20:56:33.789585Z","title":"The claude 3 model family: Opus, sonnet, haiku, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.789585Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:f98ff7d1ad6bbc5f67656b39ccf01ccfb7bb5b798d1360beb7b6f380a5ac53b3","observation_id":"36582258-875f-4101-a186-ae0f85a899f7","resolution":{"observed_at":"2026-08-15T20:56:33.789585Z","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-15T20:56:33.793849Z","title":"Faster walsh-hadamard and discrete fourier transforms from matrix non-rigidity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.793849Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:86059d07afd643186e312555f980ad43621537e15886a87b3a0d3d643f869a04","observation_id":"e17b51ca-6c65-4d74-977f-67bdbb91eae9","resolution":{"observed_at":"2026-08-15T20:56:33.793849Z","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-15T20:56:33.798212Z","title":"Fast attention requires bounded entries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.798212Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:b9e31c0873421a7a5678e3d8f02058c5991f25023432ebadbf44e0ce9a7c571f","observation_id":"d424b01b-cad9-4452-bedb-01779f016e7b","resolution":{"observed_at":"2026-08-15T20:56:33.798212Z","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-15T20:56:33.801853Z","title":"The fine-grained complexity of gradient computation for training large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.801853Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:2c4d16b7ff63317e70446f6b582007c5d9c575283b81d5fe461500e446343407","observation_id":"8188c51c-2729-4232-9f31-873e3b0d7f98","resolution":{"observed_at":"2026-08-15T20:56:33.801853Z","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-15T20:56:33.805434Z","title":"How to capture higher-order correlations? generalizing matrix softmax attention to kronecker computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.805434Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:fbe72313932e4bbbdd20e0870b18e2fbabd56b25bd4da3ea15b7563951e8f4c0","observation_id":"b52d3650-e2fb-4c92-862d-f3933cbc08a7","resolution":{"observed_at":"2026-08-15T20:56:33.805434Z","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-15T20:56:33.809000Z","title":"Only large weights (and not skip connections) can prevent the perils of rank collapse","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.809000Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:844d1ccf2ca493abb8fa485c789c6ed35853cb10865a05b1b9caaedbfc424060","observation_id":"8212c565-e211-4b6e-8f58-4574cd4494c3","resolution":{"observed_at":"2026-08-15T20:56:33.809000Z","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-15T20:56:33.812846Z","title":"Normalized iterative hard thresholding: Guaranteed stability and performance","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.812846Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:74f27d4ae4bb7ca2af04c63097b3d0c8080da7d14db4507a4e7b6b4fcf21d03c","observation_id":"1e14fcd3-09c4-43cf-9b46-2b10c83127cb","resolution":{"observed_at":"2026-08-15T20:56:33.812846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15127","last_updated":"2023-11-25T22:28:38Z","snapshot_observed_at":"2026-08-20T09:39:07.545813Z","submitted_at":"2023-11-25T22:28:38Z","title":"Stable Video Diffusion: Scaling Latent Video Diffusion Models to Large Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15127","snapshot_observed_at":"2026-08-15T20:56:33.816210Z","title":"Stable video diffusion: Scaling latent video diffusion models to large datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.816210Z"},"links":{"cited_paper":"/paper/2311.15127","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:c54d0be7439aecab4b6338af0c361eb7ff757f9517dbd06718ced331de645c76","observation_id":"b2a07199-93e1-4f84-aa54-48250f10c2d3","resolution":{"observed_at":"2026-08-15T20:56:33.816210Z","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-15T20:56:33.820679Z","title":"On the dangers of stochastic parrots: Can language models be too big? In Proceedings of the 2021 ACM conference on fairness, accountability, and transparency , pages 610--623, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.820679Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:699d606e0704c050b69a25db51943a7665391788414beecba8fe9d3f7dd01cec","observation_id":"1dc47fdd-87f9-410f-84a6-57defb67d8b9","resolution":{"observed_at":"2026-08-15T20:56:33.820679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.11538","last_updated":"2020-11-23T16:50:18Z","snapshot_observed_at":"2026-08-16T19:03:54.762239Z","submitted_at":"2020-11-23T16:50:18Z","title":"Exploring Alternatives to Softmax Function","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.11538","snapshot_observed_at":"2026-08-15T20:56:33.825004Z","title":"Exploring alternatives to softmax function","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.825004Z"},"links":{"cited_paper":"/paper/2011.11538","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d9203a04f1656e9b5650f1333e4ae0c2e44d793c15a5d2ac71ebd71e6b4b3b57","observation_id":"79b1df9d-20d5-4523-bbd9-0ad553df2e04","resolution":{"observed_at":"2026-08-15T20:56:33.825004Z","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-15T20:56:33.829486Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.829486Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d833276832ce36b198445cd00675958d656969235838a0a09c40a2c7c81c26d9","observation_id":"077cf75a-88fb-4869-9723-948376c61f61","resolution":{"observed_at":"2026-08-15T20:56:33.829486Z","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-15T20:56:33.833362Z","title":"An improved estimate in the restricted isometry problem","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.833362Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:2a190bee3bc8e14fe20b722d3ee73141e49fa3b622f0f81c42b3cd8c0a71da89","observation_id":"2929ce32-54b1-4404-b268-519506a66c7b","resolution":{"observed_at":"2026-08-15T20:56:33.833362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-15T20:56:33.837757Z","title":"Longformer: The long-document transformer","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.837757Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:9b8b2bc888bc5c8c771fc5d4cb4270d53a84656a17d79a14728357c2ef216db5","observation_id":"bc8bb7e8-0e20-4b06-933e-50c1e309053d","resolution":{"observed_at":"2026-08-15T20:56:33.837757Z","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-15T20:56:33.842358Z","title":"Training (overparametrized) neural networks in near-linear time","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.842358Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:a596dc21ec46030c5a4719bb42aa0bc4ab0b06129adc91a51f83aa40ae4f22e9","observation_id":"ffb583a6-7125-4aba-89a6-f45ade5a483b","resolution":{"observed_at":"2026-08-15T20:56:33.842358Z","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-15T20:56:33.846930Z","title":"Convex optimization: Algorithms and complexity","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.846930Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:8d24ad36d9174cc43d4ee3066cce1b53e8e4f649c407dadc8ba557117343971b","observation_id":"ffc4df77-35ad-4074-852d-bbc43e9ddfb5","resolution":{"observed_at":"2026-08-15T20:56:33.846930Z","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-15T20:56:33.851153Z","title":"Crawling facebook for social network analysis purposes","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.851153Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:432e0f6eba3dfa6df269d098283c74e7401e983eae5c075cba86e60d1e49c5de","observation_id":"12ed17b6-e0b2-4419-ac65-927930d46ba7","resolution":{"observed_at":"2026-08-15T20:56:33.851153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00688","last_updated":"2025-02-02T06:19:59Z","snapshot_observed_at":"2026-08-15T13:03:01.988904Z","submitted_at":"2025-02-02T06:19:59Z","title":"High-Order Matching for One-Step Shortcut Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00688","snapshot_observed_at":"2026-08-15T20:56:33.855710Z","title":"High-order matching for one-step shortcut diffusion models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.855710Z"},"links":{"cited_paper":"/paper/2502.00688","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:f13f66f379901d8d25d3feebcd9302dc36b7a25b196599e834a8db882808f1f8","observation_id":"69144943-d0d6-4943-ac1d-0af11df1a0e7","resolution":{"observed_at":"2026-08-15T20:56:33.855710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10509","last_updated":"2019-04-23T19:29:47Z","snapshot_observed_at":"2026-08-16T10:03:03.268538Z","submitted_at":"2019-04-23T19:29:47Z","title":"Generating Long Sequences with Sparse Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10509","snapshot_observed_at":"2026-08-15T20:56:33.860332Z","title":"Generating long sequences with sparse transformers","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.860332Z"},"links":{"cited_paper":"/paper/1904.10509","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:82c08fda1e0c851e58d23154d5eded11f2a17e29535f31405383677abb872313","observation_id":"25897ce5-c50a-4db5-b125-358a4fb23b0f","resolution":{"observed_at":"2026-08-15T20:56:33.860332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-08-18T19:51:48.688199Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-08-15T20:56:33.865007Z","title":"Scaling instruction-finetuned language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.865007Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:e1272bc2e9685ab281fa12435c485ad3a54e20199dc1bcd40fb01f7c0ac45945","observation_id":"961a0d47-0d4e-4f57-b355-f26f0f4869d1","resolution":{"observed_at":"2026-08-15T20:56:33.865007Z","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-15T20:56:33.869877Z","title":"Dihan: A novel dynamic hierarchical graph attention network for fake news detection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.869877Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d8c556e106b9f8342ef0e3c211da2645974798e3245a128ab01ab7597d48b6fd","observation_id":"6992f4e3-809d-45ef-b228-cdff2fb838dd","resolution":{"observed_at":"2026-08-15T20:56:33.869877Z","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-15T20:56:33.874404Z","title":"Fast gradient computation for rope attention in almost linear time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.874404Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:820f0498d7004548292ee61a419944d697e0a70659015bfa1af9efcbd82544fe","observation_id":"cf978dfa-c7f2-41a9-947f-848781cd68a0","resolution":{"observed_at":"2026-08-15T20:56:33.874404Z","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-15T20:56:33.878717Z","title":"Kernel density estimation through density constrained near neighbor search","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.878717Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:0b4326a4ae50045909494b89736823e4aeb3e9d38d59ab98b4d01ee750806256","observation_id":"3783597a-025d-47b5-b9fa-ecff6a9df8ad","resolution":{"observed_at":"2026-08-15T20:56:33.878717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07602","last_updated":"2024-12-01T06:39:41Z","snapshot_observed_at":"2026-08-19T18:04:02.969244Z","submitted_at":"2024-11-12T07:24:41Z","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.07602","snapshot_observed_at":"2026-08-15T20:56:33.883369Z","title":"Circuit complexity bounds for rope-based transformer architecture","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.883369Z"},"links":{"cited_paper":"/paper/2411.07602","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:7713fab436c6f79e0bbd7ca2b295c0ec037e2bd97752da35676ad391cd8537a3","observation_id":"b10d37c9-e55c-4992-be8c-a378ef342a4d","resolution":{"observed_at":"2026-08-15T20:56:33.883369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10165","last_updated":"2025-02-24T08:42:25Z","snapshot_observed_at":"2026-08-18T13:01:58.711060Z","submitted_at":"2024-10-14T05:18:02Z","title":"HSR-Enhanced Sparse Attention Acceleration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10165","snapshot_observed_at":"2026-08-15T20:56:33.887996Z","title":"Hsr-enhanced sparse attention acceleration","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.887996Z"},"links":{"cited_paper":"/paper/2410.10165","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d0362aad772fecdc0c7bff6cbd93f675aa108fe90cc23dbf837d28d441b134e4","observation_id":"4aeb2a27-4b93-4006-98c9-6ff7c2d880be","resolution":{"observed_at":"2026-08-15T20:56:33.887996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.02311","last_updated":"2022-10-05T06:02:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-05T16:11:45Z","title":"PaLM: Scaling Language Modeling with Pathways","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.02311","snapshot_observed_at":"2026-08-15T20:56:33.892708Z","title":"Palm: Scaling language modeling with pathways","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.892708Z"},"links":{"cited_paper":"/paper/2204.02311","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d6b642c92d8c9c22a39c2f1e108c7ab271a627d41e53814b32c8c31617f1dd14","observation_id":"e50143fb-9224-4462-9a74-63267807f670","resolution":{"observed_at":"2026-08-15T20:56:33.892708Z","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-15T20:56:33.897457Z","title":"Active regression via linear-sample sparsification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.897457Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:904d21bbdd0b7f2e2e209941cf73eca6e5e40b83ab84e1dc82d2b9083e5e1432","observation_id":"9aa7adf5-7617-428f-aa69-87446aeb69a2","resolution":{"observed_at":"2026-08-15T20:56:33.897457Z","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-15T20:56:33.901790Z","title":"Estimating the frequency of a clustered signal","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.901790Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:27a83665e0146e13d0503fbca510f2fa5843c2b89413eaeeba161621fb5913ac","observation_id":"32a23cf7-42ab-477d-8674-15b5e116dc97","resolution":{"observed_at":"2026-08-15T20:56:33.901790Z","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-15T20:56:33.905622Z","title":"Ld-pruner: Efficient pruning of latent diffusion models using task-agnostic insights","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.905622Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:91100f71f8290c48c9640bcf6ed4281c3a21e364b44215d87c6609e112e95bc2","observation_id":"c9fe98bc-bae7-4489-8084-08041834bcc1","resolution":{"observed_at":"2026-08-15T20:56:33.905622Z","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-15T20:56:33.909474Z","title":"Bronstein, and Max Hansmire","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.909474Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d79110c9af268dcaeb3ad711811d43fda465d1023ee3f10340970a0a70b16a59","observation_id":"ab4b0da9-791e-45aa-9f82-750b19a9090e","resolution":{"observed_at":"2026-08-15T20:56:33.909474Z","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-15T20:56:33.913062Z","title":"An algorithm for the machine calculation of complex fourier series","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.913062Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:73d0de25f6667741c9f310c07175de67fc4ac84bb1eb530051b34737348e2b21","observation_id":"2e071d70-a722-4db6-adac-40214bb3392b","resolution":{"observed_at":"2026-08-15T20:56:33.913062Z","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-15T20:56:33.917059Z","title":"Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE transactions on information theory , 52(12):5406--5425, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.917059Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:1bddbbd281cfcc240fc57e9a710248ac238a451fddcc5fbd4c751aee6208f8f7","observation_id":"f9936814-1c0b-414e-8777-0e88f8de773c","resolution":{"observed_at":"2026-08-15T20:56:33.917059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-15T20:56:33.920709Z","title":"Flashattention-2: Faster attention with better parallelism and work partitioning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.920709Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:fc131a085c77910cef8c95a14e26ea0221b6a40c7c3c0f984976703d0c9190c8","observation_id":"e62fc2a3-deb1-40a5-a21c-37faee742930","resolution":{"observed_at":"2026-08-15T20:56:33.920709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-15T20:56:33.924521Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.924521Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:6433dff14a57b2bbeb86b7b05fa42937b4679ffb07026f787c1427c6b26eb0b9","observation_id":"55e4ea5a-8770-4f81-9859-1fb53bdeb58b","resolution":{"observed_at":"2026-08-15T20:56:33.924521Z","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-15T20:56:33.928298Z","title":"BERT : Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.928298Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:85d53d0202e9f22e1419482120a026ee05a159380fc780800c00c3aeab95158e","observation_id":"8c05b76d-7430-40d2-9228-70bd05fa8a62","resolution":{"observed_at":"2026-08-15T20:56:33.928298Z","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-15T20:56:33.932025Z","title":"Flashattention: Fast and memory-efficient exact attention with io-awareness","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.932025Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:bc32f5653633c8a4604f7bb5ee108e0d86a8eaa30f5e934749a51461ea95802f","observation_id":"d2d1b7f8-d743-4d31-81b9-a246c52d1522","resolution":{"observed_at":"2026-08-15T20:56:33.932025Z","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-15T20:56:33.935862Z","title":"Attentive walk-aggregating graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.935862Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:f7967d5ab74c1d46efc3e2fc7fba05f2ec05f35a488129fb5ab8050655857f2e","observation_id":"32ef5d16-8270-4c66-8b48-f4d75a7c10ec","resolution":{"observed_at":"2026-08-15T20:56:33.935862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04397","last_updated":"2023-04-10T05:52:38Z","snapshot_observed_at":"2026-08-16T15:41:40.150021Z","submitted_at":"2023-04-10T05:52:38Z","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04397","snapshot_observed_at":"2026-08-15T20:56:33.940176Z","title":"Randomized and deterministic attention sparsification algorithms for over-parameterized feature dimension","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.940176Z"},"links":{"cited_paper":"/paper/2304.04397","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:809fced530295e38287249443f4edd3bb1655d94b576610ba14be6bfa4f42a3d","observation_id":"292b0d0c-123e-4c64-8557-c5160a9def55","resolution":{"observed_at":"2026-08-15T20:56:33.940176Z","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-15T20:56:33.944851Z","title":"Swiftbrush v2: Make your one-step diffusion model better than its teacher","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.944851Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:28993c219c32c8d48ea193370027174f8a7484b4f7e79113c8902a6ae679f231","observation_id":"f96031d2-ee27-4f3d-8053-5a8d456f7cbb","resolution":{"observed_at":"2026-08-15T20:56:33.944851Z","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-15T20:56:33.949359Z","title":"Sketch-gnn: Scalable graph neural networks with sublinear training complexity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.949359Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:ae1d2fcb926da0030a5b5d032953bb310c3f5d915ba7105d751b53dab0c29799","observation_id":"e2653203-4bbf-4356-bbed-0d8d96d93ffd","resolution":{"observed_at":"2026-08-15T20:56:33.949359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04555","last_updated":"2023-03-08T13:13:33Z","snapshot_observed_at":"2026-08-16T15:49:50.389413Z","submitted_at":"2023-03-08T13:13:33Z","title":"Streaming Kernel PCA Algorithm With Small Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04555","snapshot_observed_at":"2026-08-15T20:56:33.953546Z","title":"Streaming kernel pca algorithm with small space","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.953546Z"},"links":{"cited_paper":"/paper/2303.04555","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:e780fb9bca5df3306483b4b2f7c0806fe1c9859069e0b8397de6d0d13845e5e8","observation_id":"84ec62be-2acc-48db-b123-2de1aaf71eae","resolution":{"observed_at":"2026-08-15T20:56:33.953546Z","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-15T20:56:33.957969Z","title":"Superiority of softmax: Unveiling the performance edge over linear attention","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.957969Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:35f8f826b5bee17f954d9450a3d022a3ce8445ffdea11285b76c137015996cd1","observation_id":"8130e859-8df2-4ee7-971e-309fdac05c92","resolution":{"observed_at":"2026-08-15T20:56:33.957969Z","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-15T20:56:33.962491Z","title":"Dynamic spatial-temporal graph convolutional neural networks for traffic forecasting","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.962491Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:9186bce149f94446b5d97f873eebe009b515654dfb37a215932f511b88f8c606","observation_id":"b2af403f-75c6-4fa7-8d0c-1340ff336cf7","resolution":{"observed_at":"2026-08-15T20:56:33.962491Z","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-15T20:56:33.966905Z","title":"Sparsegpt: Massive language models can be accurately pruned in one-shot","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.966905Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:ae013dff4f9c1da82dcc271801e675a55f1a554acd3a614a52cc82fd6b081a0e","observation_id":"4e506189-9e5d-4f10-bb93-880e31e7b78d","resolution":{"observed_at":"2026-08-15T20:56:33.966905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12557","last_updated":"2025-06-23T14:26:35Z","snapshot_observed_at":"2026-08-17T08:09:05.115467Z","submitted_at":"2024-10-16T13:34:40Z","title":"One Step Diffusion via Shortcut Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12557","snapshot_observed_at":"2026-08-15T20:56:33.971176Z","title":"One step diffusion via shortcut models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.971176Z"},"links":{"cited_paper":"/paper/2410.12557","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:abccb3cb7930f73f793be616fa5d86fa5d25edf3fe6b3b502a53fd9f474c948f","observation_id":"b59621c3-8f7b-4723-af15-85440f8e9b0f","resolution":{"observed_at":"2026-08-15T20:56:33.971176Z","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-15T20:56:33.975854Z","title":"Sagn: semantic adaptive graph network for skeleton-based human action recognition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.975854Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:be24fc90ddc5ed0ac2adb5f18f7dcff60e25b370a5d7cb25ab6cdfaba197710a","observation_id":"d028a909-8f17-461e-a08d-2233134e277e","resolution":{"observed_at":"2026-08-15T20:56:33.975854Z","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-15T20:56:33.980353Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.980353Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:414d08ddc813a44f555e96ec270787a0388a201bba486cf0244b0dfb039c7f74","observation_id":"9436b2de-d852-4557-863e-29673efc2690","resolution":{"observed_at":"2026-08-15T20:56:33.980353Z","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-15T20:56:33.984847Z","title":"Toeplitz and circulant matrices: A review","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.984847Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:0696cae062e30f863a4f1d32d4d4102e9cf8a3e5726a7f3a477ba84368eb2f48","observation_id":"d74dd531-c13a-466c-86bd-e06b3bb64ed6","resolution":{"observed_at":"2026-08-15T20:56:33.984847Z","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-15T20:56:33.989142Z","title":"Making pre-trained language models better few-shot learners","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.989142Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:1b2629b1d8a0ef51b00941848804bb86227152fe4b68ac010407edd924d2922a","observation_id":"b0891f45-8314-4dc3-aba6-f31a2d366a91","resolution":{"observed_at":"2026-08-15T20:56:33.989142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.15010","last_updated":"2023-04-28T17:59:25Z","snapshot_observed_at":"2026-08-12T23:40:42.885633Z","submitted_at":"2023-04-28T17:59:25Z","title":"LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.15010","snapshot_observed_at":"2026-08-15T20:56:33.993396Z","title":"Llama-adapter v2: Parameter-efficient visual instruction model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.993396Z"},"links":{"cited_paper":"/paper/2304.15010","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:46c8336abaee8045dacc24f3c18eeabccbd7d42310b56a7ebfb1751884375f35","observation_id":"6c8ff728-15aa-473e-8b6a-7701a471731b","resolution":{"observed_at":"2026-08-15T20:56:33.993396Z","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-15T20:56:33.997966Z","title":"Garey and David S","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:33.997966Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:6dd2eee23c00043da37466e46ae6c9fc8de5d06bf6b54b85adff0de78bb3b03a","observation_id":"b2557c31-b939-485c-a802-a2b4e4186bfd","resolution":{"observed_at":"2026-08-15T20:56:33.997966Z","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-15T20:56:34.002513Z","title":"On computational limits of flowar models: Expressivity and efficiency","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.002513Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:845e9004d9c805f43e8cc8ce0f9cbf02f39aba96fd82cccde20b8a425b7d468a","observation_id":"1ecbba88-bf65-4060-9b8e-d9e50ca7e117","resolution":{"observed_at":"2026-08-15T20:56:34.002513Z","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-15T20:56:34.007176Z","title":"Approximate sparse recovery: optimizing time and measurements","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.007176Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:061f7f15030867d1ab798bb8d0a7fdfb2501c5a44575b6cbbdd306e190c614cd","observation_id":"af8f71a5-735d-4d6a-a436-00073fae5a47","resolution":{"observed_at":"2026-08-15T20:56:34.007176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16504","last_updated":"2023-03-29T07:29:07Z","snapshot_observed_at":"2026-08-16T15:44:28.871755Z","submitted_at":"2023-03-29T07:29:07Z","title":"An Over-parameterized Exponential Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16504","snapshot_observed_at":"2026-08-15T20:56:34.011514Z","title":"An over-parameterized exponential regression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.011514Z"},"links":{"cited_paper":"/paper/2303.16504","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:693aa03a036f385b1c4b02e2e31e65302b941926f92420a2bba122e837b3ba36","observation_id":"4a250b88-9e85-4e28-804f-8ba2bd50de12","resolution":{"observed_at":"2026-08-15T20:56:34.011514Z","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-15T20:56:34.016168Z","title":"Fast quantum algorithm for attention computation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.016168Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:fb2e2767f8a91375dc2ee497a59d1c04c7bea20a6e01b196ab36c6fb9c893f68","observation_id":"4ed9989c-8d6a-435f-bca5-6ad289c35951","resolution":{"observed_at":"2026-08-15T20:56:34.016168Z","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-15T20:56:34.020797Z","title":"Differentially private attention computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.020797Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d54692c2219b93e91a9c4e36cbf2896fa344f9d7237192a953a3dd72b00a6f28","observation_id":"4e683c66-630b-49c5-8378-8f0eec25decc","resolution":{"observed_at":"2026-08-15T20:56:34.020797Z","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-15T20:56:34.025243Z","title":"Image restoration by denoising diffusion models with iteratively preconditioned guidance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.025243Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:17a52cd098dce68fccf726d535ff4924124c752b981a00b4e76e2fd9cce8aa99","observation_id":"e99071a9-e287-4d75-9955-92ba16cf4669","resolution":{"observed_at":"2026-08-15T20:56:34.025243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03003","last_updated":"2024-05-05T17:15:24Z","snapshot_observed_at":"2026-08-20T14:39:05.314657Z","submitted_at":"2024-05-05T17:15:24Z","title":"Parameter-Efficient Fine-Tuning with Discrete Fourier Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.03003","snapshot_observed_at":"2026-08-15T20:56:34.029549Z","title":"Parameter-efficient fine-tuning with discrete fourier transform","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.029549Z"},"links":{"cited_paper":"/paper/2405.03003","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:76c1f0a720650425629a008d556814991a1f57d2c1d698d3300fb9623423c3b5","observation_id":"c483ccc7-0026-4958-bf27-6fc09da25b0d","resolution":{"observed_at":"2026-08-15T20:56:34.029549Z","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-15T20:56:34.034188Z","title":"Apple intelligence foundation language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.034188Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:e2e2fa641fe231e4a3637eaa18024621d034cbfd4559fd589529a221ffa2642d","observation_id":"39dd12b2-695b-4a71-a962-b5c70418e43b","resolution":{"observed_at":"2026-08-15T20:56:34.034188Z","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-15T20:56:34.038406Z","title":"Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.038406Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:2d33dcd14eaadf97070b92f02062f8dbf8a42f0ac2bb36142dc270adaf1414d8","observation_id":"c99aaa46-34d4-421a-bdd7-b2073955ed4b","resolution":{"observed_at":"2026-08-15T20:56:34.038406Z","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-15T20:56:34.042806Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.042806Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:8ab49fca954846b3480d785efdbf48d1204b2a9d4b7830c22d968e3a4ec2afec","observation_id":"6c5efb70-deb6-4f1b-8681-7f2ae7b33c30","resolution":{"observed_at":"2026-08-15T20:56:34.042806Z","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-15T20:56:34.047160Z","title":"Nearly optimal sparse fourier transform","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.047160Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:bdf5e3a5eefa4f9e0271ed956ed3776c10ba942325843a811a1513313844fb42","observation_id":"c1e0072e-af29-4069-a381-7b63ffd4973e","resolution":{"observed_at":"2026-08-15T20:56:34.047160Z","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-15T20:56:34.051694Z","title":"Simple and practical algorithm for sparse fourier transform","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.051694Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:aeee9f02d1ef23b3c6c0e0d120f03a5b1e9c6a8b96c4c0bdee868af128a05534","observation_id":"c783fac0-a316-4d3c-a56b-cc3ef7ac1d0e","resolution":{"observed_at":"2026-08-15T20:56:34.051694Z","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-15T20:56:34.056367Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.056367Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:2078396634a311736bd91c58c3d991af078c16598aacaa3bbaa981e5d196c504","observation_id":"2ac0508f-1019-4e25-a119-aee0a808ab7e","resolution":{"observed_at":"2026-08-15T20:56:34.056367Z","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-15T20:56:34.060817Z","title":"Hyperattention: Long-context attention in near-linear time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.060817Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:cdceac3b28f85f20f5f6c1497b9f537128e3e2a2b7c1e5c779748457d4a0c62c","observation_id":"bbe37768-0ec0-4ad3-a0d7-4629731431fb","resolution":{"observed_at":"2026-08-15T20:56:34.060817Z","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-15T20:56:34.065014Z","title":"On computational limits of modern hopfield models: A fine-grained complexity analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.065014Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:748d7749522a3fd552768e849fe18c07c2e79914f852896b7b2370c9a7c2ebfb","observation_id":"d7e712c3-bfc1-42d0-afb4-1fd9123e8652","resolution":{"observed_at":"2026-08-15T20:56:34.065014Z","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-15T20:56:34.069258Z","title":"The restricted isometry property of subsampled fourier matrices","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.069258Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:392a4ce265d933f7de615deb8929a363e44b5ad2f59a3d0591340a8025405a6b","observation_id":"77a1e996-11c3-46e1-acf6-ca041c267682","resolution":{"observed_at":"2026-08-15T20:56:34.069258Z","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-15T20:56:34.072887Z","title":"Video diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.072887Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:785b01b4afa02a737ca55c4cc588988cf85a7238bf10ef05f76317c00201f9cb","observation_id":"59a4fb26-7d6c-4d8b-b2b5-4e9539235a9c","resolution":{"observed_at":"2026-08-15T20:56:34.072887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03136","last_updated":"2025-06-06T05:22:09Z","snapshot_observed_at":"2026-08-17T01:55:52.754471Z","submitted_at":"2024-06-05T10:44:08Z","title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03136","snapshot_observed_at":"2026-08-15T20:56:34.076414Z","title":"Computational limits of low-rank adaptation (lora) for transformer-based models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.076414Z"},"links":{"cited_paper":"/paper/2406.03136","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:e2958dd21c26dfcbcc49a078ae11eca205f16faa5e45e074318a420196447a4c","observation_id":"6ed104f9-4856-4fab-84d8-c9a2588b3734","resolution":{"observed_at":"2026-08-15T20:56:34.076414Z","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-15T20:56:34.080405Z","title":"Provably optimal memory capacity for modern hopfield models: Tight analysis for transformer-compatible dense associative memories","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.080405Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:16c2800c25644ed06fbd868d0ec108cab65ac53b05f60960a55da4c631001bf0","observation_id":"705aa863-ff36-4c9d-89c2-5abb2f76d41f","resolution":{"observed_at":"2026-08-15T20:56:34.080405Z","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-15T20:56:34.084014Z","title":"On statistical rates of conditional diffusion transformers: Approximation, estimation and minimax optimality","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.084014Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:1207ec5bda790b20513ebf7f06c5dfe04871541e90d2c578318ea10a6c2ec1bc","observation_id":"0b04245f-0e75-4ae7-8dde-6fdc21a4e28a","resolution":{"observed_at":"2026-08-15T20:56:34.084014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01079","last_updated":"2024-10-31T16:59:13Z","snapshot_observed_at":"2026-08-16T13:38:12.922498Z","submitted_at":"2024-07-01T08:34:40Z","title":"On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01079","snapshot_observed_at":"2026-08-15T20:56:34.087991Z","title":"On statistical rates and provably efficient criteria of latent diffusion transformers (dits)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.087991Z"},"links":{"cited_paper":"/paper/2407.01079","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:d0a02b030e1948aab39dbf87da4a9f5e9fd853c36faaab4df588e9137310323b","observation_id":"3e6f0549-3540-4557-a4e6-e430aa09653d","resolution":{"observed_at":"2026-08-15T20:56:34.087991Z","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-15T20:56:34.091976Z","title":"Lo RA : Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.091976Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:70345629c4ce7ec1492fc75d19800aff4a4a224165a7766935665da95156ac73","observation_id":"f7a4865c-1ddc-4b4c-8150-bda2148bd14b","resolution":{"observed_at":"2026-08-15T20:56:34.091976Z","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-15T20:56:34.095657Z","title":"On sparse modern hopfield model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.095657Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:feb520dea95d0cc5b18e1e0de554cfc77315f499fecbe021a6148e646772585b","observation_id":"f7709e7a-84c7-4ad2-9ca8-7f40e5eb3d67","resolution":{"observed_at":"2026-08-15T20:56:34.095657Z","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-15T20:56:34.099217Z","title":"Bigst: Linear complexity spatio-temporal graph neural network for traffic forecasting on large-scale road networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.099217Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:2b64510db6fc442445650115eadbf9dd45d719f1cc7a5a1033d9308dcb21fc55","observation_id":"eb708a22-af10-4698-b27b-3a0074748560","resolution":{"observed_at":"2026-08-15T20:56:34.099217Z","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-15T20:56:34.103659Z","title":"Sample-optimal fourier sampling in any constant dimension","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.103659Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:f38c56494ebc4fc4e41d87fc59d3f8ecf799b3b6e65e3431675eb9922efeb4ed","observation_id":"8c80db83-5c30-4971-b7e1-b8106c83cae7","resolution":{"observed_at":"2026-08-15T20:56:34.103659Z","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-15T20:56:34.108122Z","title":"(nearly) sample-optimal sparse fourier transform","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.108122Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:1ed34ee028802163854d9122147cdbd161c2095266d9ab5868154abb6217b5b4","observation_id":"86d76f18-e998-4d4e-b042-cce383d26a43","resolution":{"observed_at":"2026-08-15T20:56:34.108122Z","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-15T20:56:34.112326Z","title":"On the complexity of k-sat","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.112326Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:cf7005fb93c40042162c52f333c4ecace8e2286dbe37e386024085da55c41444","observation_id":"3385719c-3f7e-4aab-96d0-65cb6612b66c","resolution":{"observed_at":"2026-08-15T20:56:34.112326Z","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-15T20:56:34.116647Z","title":"A robust multi-dimensional sparse fourier transform in the continuous setting","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.116647Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:934e8214f696631c9ffd2acc7e32d72f3ba2137ef5a065444bd3d48289238b2a","observation_id":"e91f2cb5-a697-4b08-aa69-7cd5eb8bf1fb","resolution":{"observed_at":"2026-08-15T20:56:34.116647Z","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-15T20:56:34.121711Z","title":"A faster algorithm for solving general lps","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.121711Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:c2483ccaaeb71a4119eed5b84883380d1ac278db1a120e477e08e8fa2e714e5b","observation_id":"19f87664-30b2-45e1-a553-c3cd2473f37b","resolution":{"observed_at":"2026-08-15T20:56:34.121711Z","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-15T20:56:34.126313Z","title":"Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.126313Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:154847b5789ea1da7f7775f170bda5f1d58a988f76bca10a058c7fe9bec6335d","observation_id":"f1e477ee-d654-4878-8c37-34305a456463","resolution":{"observed_at":"2026-08-15T20:56:34.126313Z","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-15T20:56:34.130687Z","title":"Sample efficient estimation and recovery in sparse FFT via isolation on average","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.130687Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:9969620024d65f4a5ff871c1fe11b5c78db8a9c6595ad1b28c7ea3295baf8bfb","observation_id":"6bb77777-ffbf-43fa-9aee-6195db17907c","resolution":{"observed_at":"2026-08-15T20:56:34.130687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06927","last_updated":"2023-10-13T13:47:44Z","snapshot_observed_at":"2026-08-20T12:08:26.059455Z","submitted_at":"2023-10-10T18:28:38Z","title":"Sparse Fine-tuning for Inference Acceleration of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06927","snapshot_observed_at":"2026-08-15T20:56:34.135290Z","title":"Sparse finetuning for inference acceleration of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.135290Z"},"links":{"cited_paper":"/paper/2310.06927","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:970fda0a4f549497ec14841dae00645854ed36f859372f094e30dfe9067c8b7a","observation_id":"6e7741aa-67c3-4bc8-a68f-4290e49168f1","resolution":{"observed_at":"2026-08-15T20:56:34.135290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04451","last_updated":"2020-02-18T16:01:18Z","snapshot_observed_at":"2026-07-06T08:50:12.690900Z","submitted_at":"2020-01-13T18:38:28Z","title":"Reformer: The Efficient Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.04451","snapshot_observed_at":"2026-08-15T20:56:34.139840Z","title":"Reformer: The efficient transformer","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.139840Z"},"links":{"cited_paper":"/paper/2001.04451","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:9395c3c18a7ec68b241c3e351ec9df93cc8612e6dc5d2d9d03e0a3705dc064a6","observation_id":"62950758-e33d-46c2-bbd3-73cd4aa48487","resolution":{"observed_at":"2026-08-15T20:56:34.139840Z","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-15T20:56:34.144489Z","title":"On the power of preconditioning in sparse linear regression","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.144489Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:14e44b47fbef2bbc47fb64e60c23d6cec905bb55639186e4eaaaf7c518e36f6f","observation_id":"241d9d1f-b119-4560-9f70-9415970f7203","resolution":{"observed_at":"2026-08-15T20:56:34.144489Z","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-15T20:56:34.149033Z","title":"Suprema of chaos processes and the restricted isometry property","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.149033Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:9b5c01035fcfc3c7211f6b5279cc1818e322f9b223ff760039bfaf45213a8d8e","observation_id":"13f55750-006d-43a3-9808-1f01aad49c24","resolution":{"observed_at":"2026-08-15T20:56:34.149033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14024","last_updated":"2023-01-23T17:00:01Z","snapshot_observed_at":"2026-08-16T16:05:35.248659Z","submitted_at":"2022-12-28T18:52:44Z","title":"Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.14024","snapshot_observed_at":"2026-08-15T20:56:34.153293Z","title":"Demonstrate-search-predict: Composing retrieval and language models for knowledge-intensive nlp","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.153293Z"},"links":{"cited_paper":"/paper/2212.14024","citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:372e86938f79e7dfe8f108ff7b6deccc9307248f29b77364a2715314be2e0844","observation_id":"e8ef05fd-7788-45f6-be4c-4eae8bf92971","resolution":{"observed_at":"2026-08-15T20:56:34.153293Z","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-15T20:56:34.158184Z","title":"Transformers are rnns: Fast autoregressive transformers with linear attention","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.158184Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:62bb29b25fbfdaf412d0cba16aedf2b9f177b4aee69f9eb9e1d966fc7313e688","observation_id":"ea624120-02ad-448a-a74e-a9d23a8666d0","resolution":{"observed_at":"2026-08-15T20:56:34.158184Z","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-15T20:56:34.162442Z","title":"Dimension-independent sparse fourier transform","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.162442Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:1ed3388d28a370742fbaf0bf70ff0fe6e712c039844962e91402b88b42464f62","observation_id":"7cf38599-650c-4de0-8533-b46ee5146bc7","resolution":{"observed_at":"2026-08-15T20:56:34.162442Z","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-15T20:56:34.166990Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.166990Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:ac2241b7cb38492f54fcec4da1aae5fe486353b6733c6241f5b637a23ea4afe3","observation_id":"813eb169-f9ba-4a81-8c89-ec33a061710b","resolution":{"observed_at":"2026-08-15T20:56:34.166990Z","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-15T20:56:34.171125Z","title":"On the computational complexity of self-attention","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.171125Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:ca0999713b754ab464091c3e6245e3b38136fd3ab0791cc36215a73f861f3b7d","observation_id":"3a4ce5ee-3a40-4388-92d3-7f27476911c0","resolution":{"observed_at":"2026-08-15T20:56:34.171125Z","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-15T20:56:34.175331Z","title":"The power of scale for parameter-efficient prompt tuning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.175331Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:4a8b497151e4cbb7f116cb51bf386d673b55b6661afcac68cc3bc1d36fad487b","observation_id":"ad49a63a-769f-46d1-a6e6-b163a6c7d3cd","resolution":{"observed_at":"2026-08-15T20:56:34.175331Z","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-15T20:56:34.179657Z","title":"Symbiotic graph neural networks for 3d skeleton-based human action recognition and motion prediction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:34.179657Z"},"links":{"citing_paper":"/paper/2505.11892"},"observation_digest":"sha256:c43a0c44cce82792cb1555d96e94e10be96343d6b89a9404d15c3ab86f64106d","observation_id":"92e5ae73-38ca-4309-97a6-fc7676341161","resolution":{"observed_at":"2026-08-15T20:56:34.179657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T02:24:18.882401Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":214},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 214 outbound references and 3 inbound Pith citation observations for arXiv:2505.11892."}