Pith. sign in

Paper Citation Record · LEDGER

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.11892 v1

Coverage vector

measured 100 of 214 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T20:56:34.179657Z

measured 103 of 103 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:10:57.183708Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T09:36:04.771630Z

Reference resolution

100 of 214 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved100
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7e07b8cc-7d0e-4ccc-9a72-1d3826f47112 · outbound

This paper cites Optimal-degree polynomial approximations for exponentials and gaussian kernel density estimation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Optimal-degree polynomial approximations for exponentials and gaussian kernel density estimation

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.750513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.750513Z digest=sha256:02bdb4e932805a8803350b7e612601110d79bdc2290ca432903b0759323616cf

Observation 7be883c7-b37f-4acd-95a5-8042c7e3de85 · outbound

This paper cites GPT-4 Technical Report.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform GPT-4 Technical Report

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.755619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.755619Z digest=sha256:4ebbff3db1fd717bb636e58a7ec2e8ea5229c580c32a2ee6e418a90aa0627fcb

Observation ef4f2f7e-261c-4c9d-9cdc-560bc313ec07 · outbound

This paper cites Computational complexity: a modern approach.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Computational complexity: a modern approach

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.760572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.760572Z digest=sha256:c55bec874b4564ffa9824ca605ea417db7f17d8980c525952bd7c38d93354894

Observation 2292691b-6a06-49a8-af3e-95cec780ad9c · outbound

This paper cites A fast algorithm for aperiodic linear stencil computation using fast fourier transforms.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform A fast algorithm for aperiodic linear stencil computation using fast fourier transforms

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.765517Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.765517Z digest=sha256:f9587c9612e237d3062b7c083da2f6837456261294af7d9e47839a5115915260

Observation d082cdc4-56bc-4040-9edd-9894d1484fdc · outbound

This paper cites Linear attention is (maybe) all you need (to understand transformer optimization).

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Linear attention is (maybe) all you need (to understand transformer optimization)

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.770141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.770141Z digest=sha256:6444176a3632786a0cda0b628b7d3baac6607d1c7907cabdb0c9f65784f95ad3

Observation da0114c3-4b03-4c53-926c-78f6fa2bf6ef · outbound

This paper cites A few remarks on the operator norm of random toeplitz matrices.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform A few remarks on the operator norm of random toeplitz matrices

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.774745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.774745Z digest=sha256:4ca43f807726357b5605079fd8cb6d98e9e48f1a2ed9d457b7d0a13dc0520d04

Observation 4a631dc1-84ec-49b5-862d-a82450cbfa48 · outbound

This paper cites Introducing meta llama 3: The most capable openly available llm to date, 2024.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Introducing meta llama 3: The most capable openly available llm to date, 2024

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.781038Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.781038Z digest=sha256:a743e0b7bd709a72f157b31243c922a853d1e0b7d31ea8ca045d3df1e1ee6cfd

Observation ca339a01-9b73-4965-9255-66e9b744cfc3 · outbound

This paper cites Foundation models defining a new era in vision: a survey and outlook.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Foundation models defining a new era in vision: a survey and outlook

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.785200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.785200Z digest=sha256:69940fdb77e9e3e7528e2fc87c27c9fb31988bc8739aeda540f6db06abb61c41

Observation 36582258-875f-4101-a186-ae0f85a899f7 · outbound

This paper cites The claude 3 model family: Opus, sonnet, haiku, 2024.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform The claude 3 model family: Opus, sonnet, haiku, 2024

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.789585Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.789585Z digest=sha256:f98ff7d1ad6bbc5f67656b39ccf01ccfb7bb5b798d1360beb7b6f380a5ac53b3

Observation e17b51ca-6c65-4d74-977f-67bdbb91eae9 · outbound

This paper cites Faster walsh-hadamard and discrete fourier transforms from matrix non-rigidity.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Faster walsh-hadamard and discrete fourier transforms from matrix non-rigidity

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.793849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.793849Z digest=sha256:86059d07afd643186e312555f980ad43621537e15886a87b3a0d3d643f869a04

Observation d424b01b-cad9-4452-bedb-01779f016e7b · outbound

This paper cites Fast attention requires bounded entries.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Fast attention requires bounded entries

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.798212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.798212Z digest=sha256:b9e31c0873421a7a5678e3d8f02058c5991f25023432ebadbf44e0ce9a7c571f

Observation 8188c51c-2729-4232-9f31-873e3b0d7f98 · outbound

This paper cites The fine-grained complexity of gradient computation for training large language models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform The fine-grained complexity of gradient computation for training large language models

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.801853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.801853Z digest=sha256:2c4d16b7ff63317e70446f6b582007c5d9c575283b81d5fe461500e446343407

Observation b52d3650-e2fb-4c92-862d-f3933cbc08a7 · outbound

This paper cites How to capture higher-order correlations? generalizing matrix softmax attention to kronecker computation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform How to capture higher-order correlations? generalizing matrix softmax attention to kronecker computation

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.805434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.805434Z digest=sha256:fbe72313932e4bbbdd20e0870b18e2fbabd56b25bd4da3ea15b7563951e8f4c0

Observation 8212c565-e211-4b6e-8f58-4574cd4494c3 · outbound

This paper cites Only large weights (and not skip connections) can prevent the perils of rank collapse.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Only large weights (and not skip connections) can prevent the perils of rank collapse

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.809000Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.809000Z digest=sha256:844d1ccf2ca493abb8fa485c789c6ed35853cb10865a05b1b9caaedbfc424060

Observation 1e14fcd3-09c4-43cf-9b46-2b10c83127cb · outbound

This paper cites Normalized iterative hard thresholding: Guaranteed stability and performance.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Normalized iterative hard thresholding: Guaranteed stability and performance

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.812846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.812846Z digest=sha256:74f27d4ae4bb7ca2af04c63097b3d0c8080da7d14db4507a4e7b6b4fcf21d03c

Observation b2a07199-93e1-4f84-aa54-48250f10c2d3 · outbound

This paper cites Stable Video Diffusion: Scaling Latent Video Diffusion Models to Large Datasets.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Stable Video Diffusion: Scaling Latent Video Diffusion Models to Large Datasets

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.816210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.816210Z digest=sha256:c54d0be7439aecab4b6338af0c361eb7ff757f9517dbd06718ced331de645c76

Observation 1dc47fdd-87f9-410f-84a6-57defb67d8b9 · outbound

This paper cites 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.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform 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

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.820679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.820679Z digest=sha256:699d606e0704c050b69a25db51943a7665391788414beecba8fe9d3f7dd01cec

Observation 79b1df9d-20d5-4523-bbd9-0ad553df2e04 · outbound

This paper cites Exploring Alternatives to Softmax Function.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Exploring Alternatives to Softmax Function

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.825004Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.825004Z digest=sha256:d9203a04f1656e9b5650f1333e4ae0c2e44d793c15a5d2ac71ebd71e6b4b3b57

Observation 077cf75a-88fb-4869-9723-948376c61f61 · outbound

This paper cites Language models are few-shot learners.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Language models are few-shot learners

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.829486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.829486Z digest=sha256:d833276832ce36b198445cd00675958d656969235838a0a09c40a2c7c81c26d9

Observation 2929ce32-54b1-4404-b268-519506a66c7b · outbound

This paper cites An improved estimate in the restricted isometry problem.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform An improved estimate in the restricted isometry problem

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.833362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.833362Z digest=sha256:2a190bee3bc8e14fe20b722d3ee73141e49fa3b622f0f81c42b3cd8c0a71da89

Observation bc8bb7e8-0e20-4b06-933e-50c1e309053d · outbound

This paper cites Longformer: The Long-Document Transformer.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Longformer: The Long-Document Transformer

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.837757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.837757Z digest=sha256:9b8b2bc888bc5c8c771fc5d4cb4270d53a84656a17d79a14728357c2ef216db5

Observation ffb583a6-7125-4aba-89a6-f45ade5a483b · outbound

This paper cites Training (overparametrized) neural networks in near-linear time.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Training (overparametrized) neural networks in near-linear time

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.842358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.842358Z digest=sha256:a596dc21ec46030c5a4719bb42aa0bc4ab0b06129adc91a51f83aa40ae4f22e9

Observation ffc4df77-35ad-4074-852d-bbc43e9ddfb5 · outbound

This paper cites Convex optimization: Algorithms and complexity.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Convex optimization: Algorithms and complexity

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.846930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.846930Z digest=sha256:8d24ad36d9174cc43d4ee3066cce1b53e8e4f649c407dadc8ba557117343971b

Observation 12ed17b6-e0b2-4419-ac65-927930d46ba7 · outbound

This paper cites Crawling facebook for social network analysis purposes.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Crawling facebook for social network analysis purposes

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.851153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.851153Z digest=sha256:432e0f6eba3dfa6df269d098283c74e7401e983eae5c075cba86e60d1e49c5de

Observation 69144943-d0d6-4943-ac1d-0af11df1a0e7 · outbound

This paper cites High-Order Matching for One-Step Shortcut Diffusion Models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform High-Order Matching for One-Step Shortcut Diffusion Models

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.855710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.855710Z digest=sha256:f13f66f379901d8d25d3feebcd9302dc36b7a25b196599e834a8db882808f1f8

Observation 25897ce5-c50a-4db5-b125-358a4fb23b0f · outbound

This paper cites Generating Long Sequences with Sparse Transformers.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Generating Long Sequences with Sparse Transformers

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.860332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.860332Z digest=sha256:82c08fda1e0c851e58d23154d5eded11f2a17e29535f31405383677abb872313

Observation 961a0d47-0d4e-4f57-b355-f26f0f4869d1 · outbound

This paper cites Scaling Instruction-Finetuned Language Models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Scaling Instruction-Finetuned Language Models

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.865007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.865007Z digest=sha256:e1272bc2e9685ab281fa12435c485ad3a54e20199dc1bcd40fb01f7c0ac45945

Observation 6992f4e3-809d-45ef-b228-cdff2fb838dd · outbound

This paper cites Dihan: A novel dynamic hierarchical graph attention network for fake news detection.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Dihan: A novel dynamic hierarchical graph attention network for fake news detection

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.869877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.869877Z digest=sha256:d8c556e106b9f8342ef0e3c211da2645974798e3245a128ab01ab7597d48b6fd

Observation cf978dfa-c7f2-41a9-947f-848781cd68a0 · outbound

This paper cites Fast gradient computation for rope attention in almost linear time.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Fast gradient computation for rope attention in almost linear time

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.874404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.874404Z digest=sha256:820f0498d7004548292ee61a419944d697e0a70659015bfa1af9efcbd82544fe

Observation 3783597a-025d-47b5-b9fa-ecff6a9df8ad · outbound

This paper cites Kernel density estimation through density constrained near neighbor search.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Kernel density estimation through density constrained near neighbor search

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.878717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.878717Z digest=sha256:0b4326a4ae50045909494b89736823e4aeb3e9d38d59ab98b4d01ee750806256

Observation b10d37c9-e55c-4992-be8c-a378ef342a4d · outbound

This paper cites Circuit Complexity Bounds for RoPE-based Transformer Architecture.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.883369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.883369Z digest=sha256:7713fab436c6f79e0bbd7ca2b295c0ec037e2bd97752da35676ad391cd8537a3

Observation 4aeb2a27-4b93-4006-98c9-6ff7c2d880be · outbound

This paper cites HSR-Enhanced Sparse Attention Acceleration.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform HSR-Enhanced Sparse Attention Acceleration

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.887996Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.887996Z digest=sha256:d0362aad772fecdc0c7bff6cbd93f675aa108fe90cc23dbf837d28d441b134e4

Observation e50143fb-9224-4462-9a74-63267807f670 · outbound

This paper cites PaLM: Scaling Language Modeling with Pathways.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform PaLM: Scaling Language Modeling with Pathways

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.892708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.892708Z digest=sha256:d6b642c92d8c9c22a39c2f1e108c7ab271a627d41e53814b32c8c31617f1dd14

Observation 9aa7adf5-7617-428f-aa69-87446aeb69a2 · outbound

This paper cites Active regression via linear-sample sparsification.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Active regression via linear-sample sparsification

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.897457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.897457Z digest=sha256:904d21bbdd0b7f2e2e209941cf73eca6e5e40b83ab84e1dc82d2b9083e5e1432

Observation 32a23cf7-42ab-477d-8674-15b5e116dc97 · outbound

This paper cites Estimating the frequency of a clustered signal.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Estimating the frequency of a clustered signal

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.901790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.901790Z digest=sha256:27a83665e0146e13d0503fbca510f2fa5843c2b89413eaeeba161621fb5913ac

Observation c9fe98bc-bae7-4489-8084-08041834bcc1 · outbound

This paper cites Ld-pruner: Efficient pruning of latent diffusion models using task-agnostic insights.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Ld-pruner: Efficient pruning of latent diffusion models using task-agnostic insights

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.905622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.905622Z digest=sha256:91100f71f8290c48c9640bcf6ed4281c3a21e364b44215d87c6609e112e95bc2

Observation ab4b0da9-791e-45aa-9f82-750b19a9090e · outbound

This paper cites Bronstein, and Max Hansmire.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Bronstein, and Max Hansmire

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.909474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.909474Z digest=sha256:d79110c9af268dcaeb3ad711811d43fda465d1023ee3f10340970a0a70b16a59

Observation 2e071d70-a722-4db6-adac-40214bb3392b · outbound

This paper cites An algorithm for the machine calculation of complex fourier series.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform An algorithm for the machine calculation of complex fourier series

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.913062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.913062Z digest=sha256:73d0de25f6667741c9f310c07175de67fc4ac84bb1eb530051b34737348e2b21

Observation f9936814-1c0b-414e-8777-0e88f8de773c · outbound

This paper cites Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE transactions on information theory , 52(12):5406--5425, 2006.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE transactions on information theory , 52(12):5406--5425, 2006

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.917059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.917059Z digest=sha256:1bddbbd281cfcc240fc57e9a710248ac238a451fddcc5fbd4c751aee6208f8f7

Observation e62fc2a3-deb1-40a5-a21c-37faee742930 · outbound

This paper cites FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.920709Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.920709Z digest=sha256:fc131a085c77910cef8c95a14e26ea0221b6a40c7c3c0f984976703d0c9190c8

Observation 55e4ea5a-8770-4f81-9859-1fb53bdeb58b · outbound

This paper cites BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.924521Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.924521Z digest=sha256:6433dff14a57b2bbeb86b7b05fa42937b4679ffb07026f787c1427c6b26eb0b9

Observation 8c05b76d-7430-40d2-9228-70bd05fa8a62 · outbound

This paper cites BERT : Pre-training of deep bidirectional transformers for language understanding.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform BERT : Pre-training of deep bidirectional transformers for language understanding

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.928298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.928298Z digest=sha256:85d53d0202e9f22e1419482120a026ee05a159380fc780800c00c3aeab95158e

Observation d2d1b7f8-d743-4d31-81b9-a246c52d1522 · outbound

This paper cites Flashattention: Fast and memory-efficient exact attention with io-awareness.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Flashattention: Fast and memory-efficient exact attention with io-awareness

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.932025Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.932025Z digest=sha256:bc32f5653633c8a4604f7bb5ee108e0d86a8eaa30f5e934749a51461ea95802f

Observation 32ef5d16-8270-4c66-8b48-f4d75a7c10ec · outbound

This paper cites Attentive walk-aggregating graph neural networks.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Attentive walk-aggregating graph neural networks

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.935862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.935862Z digest=sha256:f7967d5ab74c1d46efc3e2fc7fba05f2ec05f35a488129fb5ab8050655857f2e

Observation 292b0d0c-123e-4c64-8557-c5160a9def55 · outbound

This paper cites Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.940176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.940176Z digest=sha256:809fced530295e38287249443f4edd3bb1655d94b576610ba14be6bfa4f42a3d

Observation f96031d2-ee27-4f3d-8053-5a8d456f7cbb · outbound

This paper cites Swiftbrush v2: Make your one-step diffusion model better than its teacher.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Swiftbrush v2: Make your one-step diffusion model better than its teacher

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.944851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.944851Z digest=sha256:28993c219c32c8d48ea193370027174f8a7484b4f7e79113c8902a6ae679f231

Observation e2653203-4bbf-4356-bbed-0d8d96d93ffd · outbound

This paper cites Sketch-gnn: Scalable graph neural networks with sublinear training complexity.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sketch-gnn: Scalable graph neural networks with sublinear training complexity

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.949359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.949359Z digest=sha256:ae1d2fcb926da0030a5b5d032953bb310c3f5d915ba7105d751b53dab0c29799

Observation 84ec62be-2acc-48db-b123-2de1aaf71eae · outbound

This paper cites Streaming Kernel PCA Algorithm With Small Space.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Streaming Kernel PCA Algorithm With Small Space

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.953546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.953546Z digest=sha256:e780fb9bca5df3306483b4b2f7c0806fe1c9859069e0b8397de6d0d13845e5e8

Observation 8130e859-8df2-4ee7-971e-309fdac05c92 · outbound

This paper cites Superiority of softmax: Unveiling the performance edge over linear attention.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Superiority of softmax: Unveiling the performance edge over linear attention

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.957969Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.957969Z digest=sha256:35f8f826b5bee17f954d9450a3d022a3ce8445ffdea11285b76c137015996cd1

Observation b2af403f-75c6-4fa7-8d0c-1340ff336cf7 · outbound

This paper cites Dynamic spatial-temporal graph convolutional neural networks for traffic forecasting.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Dynamic spatial-temporal graph convolutional neural networks for traffic forecasting

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.962491Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.962491Z digest=sha256:9186bce149f94446b5d97f873eebe009b515654dfb37a215932f511b88f8c606

Observation 4e506189-9e5d-4f10-bb93-880e31e7b78d · outbound

This paper cites Sparsegpt: Massive language models can be accurately pruned in one-shot.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sparsegpt: Massive language models can be accurately pruned in one-shot

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.966905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.966905Z digest=sha256:ae013dff4f9c1da82dcc271801e675a55f1a554acd3a614a52cc82fd6b081a0e

Observation b59621c3-8f7b-4723-af15-85440f8e9b0f · outbound

This paper cites One Step Diffusion via Shortcut Models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform One Step Diffusion via Shortcut Models

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.971176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.971176Z digest=sha256:abccb3cb7930f73f793be616fa5d86fa5d25edf3fe6b3b502a53fd9f474c948f

Observation d028a909-8f17-461e-a08d-2233134e277e · outbound

This paper cites Sagn: semantic adaptive graph network for skeleton-based human action recognition.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sagn: semantic adaptive graph network for skeleton-based human action recognition

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.975854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.975854Z digest=sha256:be24fc90ddc5ed0ac2adb5f18f7dcff60e25b370a5d7cb25ab6cdfaba197710a

Observation 9436b2de-d852-4557-863e-29673efc2690 · outbound

This paper cites Graph neural networks for social recommendation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Graph neural networks for social recommendation

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.980353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.980353Z digest=sha256:414d08ddc813a44f555e96ec270787a0388a201bba486cf0244b0dfb039c7f74

Observation d74dd531-c13a-466c-86bd-e06b3bb64ed6 · outbound

This paper cites Toeplitz and circulant matrices: A review.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Toeplitz and circulant matrices: A review

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.984847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.984847Z digest=sha256:0696cae062e30f863a4f1d32d4d4102e9cf8a3e5726a7f3a477ba84368eb2f48

Observation b0891f45-8314-4dc3-aba6-f31a2d366a91 · outbound

This paper cites Making pre-trained language models better few-shot learners.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Making pre-trained language models better few-shot learners

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.989142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.989142Z digest=sha256:1b2629b1d8a0ef51b00941848804bb86227152fe4b68ac010407edd924d2922a

Observation 6c8ff728-15aa-473e-8b6a-7701a471731b · outbound

This paper cites LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Model

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.993396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.993396Z digest=sha256:46c8336abaee8045dacc24f3c18eeabccbd7d42310b56a7ebfb1751884375f35

Observation b2557c31-b939-485c-a802-a2b4e4186bfd · outbound

This paper cites Garey and David S.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Garey and David S

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:33.997966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:33.997966Z digest=sha256:6dd2eee23c00043da37466e46ae6c9fc8de5d06bf6b54b85adff0de78bb3b03a

Observation 1ecbba88-bf65-4060-9b8e-d9e50ca7e117 · outbound

This paper cites On computational limits of flowar models: Expressivity and efficiency.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On computational limits of flowar models: Expressivity and efficiency

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.002513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.002513Z digest=sha256:845e9004d9c805f43e8cc8ce0f9cbf02f39aba96fd82cccde20b8a425b7d468a

Observation af8f71a5-735d-4d6a-a436-00073fae5a47 · outbound

This paper cites Approximate sparse recovery: optimizing time and measurements.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Approximate sparse recovery: optimizing time and measurements

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.007176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.007176Z digest=sha256:061f7f15030867d1ab798bb8d0a7fdfb2501c5a44575b6cbbdd306e190c614cd

Observation 4a250b88-9e85-4e28-804f-8ba2bd50de12 · outbound

This paper cites An Over-parameterized Exponential Regression.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform An Over-parameterized Exponential Regression

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.011514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.011514Z digest=sha256:693aa03a036f385b1c4b02e2e31e65302b941926f92420a2bba122e837b3ba36

Observation 4ed9989c-8d6a-435f-bca5-6ad289c35951 · outbound

This paper cites Fast quantum algorithm for attention computation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Fast quantum algorithm for attention computation

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.016168Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.016168Z digest=sha256:fb2e2767f8a91375dc2ee497a59d1c04c7bea20a6e01b196ab36c6fb9c893f68

Observation 4e683c66-630b-49c5-8378-8f0eec25decc · outbound

This paper cites Differentially private attention computation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Differentially private attention computation

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.020797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.020797Z digest=sha256:d54692c2219b93e91a9c4e36cbf2896fa344f9d7237192a953a3dd72b00a6f28

Observation e99071a9-e287-4d75-9955-92ba16cf4669 · outbound

This paper cites Image restoration by denoising diffusion models with iteratively preconditioned guidance.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Image restoration by denoising diffusion models with iteratively preconditioned guidance

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.025243Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.025243Z digest=sha256:17a52cd098dce68fccf726d535ff4924124c752b981a00b4e76e2fd9cce8aa99

Observation c483ccc7-0026-4958-bf27-6fc09da25b0d · outbound

This paper cites Parameter-Efficient Fine-Tuning with Discrete Fourier Transform.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Parameter-Efficient Fine-Tuning with Discrete Fourier Transform

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.029549Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.029549Z digest=sha256:76c1f0a720650425629a008d556814991a1f57d2c1d698d3300fb9623423c3b5

Observation 39dd12b2-695b-4a71-a962-b5c70418e43b · outbound

This paper cites Apple intelligence foundation language models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Apple intelligence foundation language models

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.034188Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.034188Z digest=sha256:e2e2fa641fe231e4a3637eaa18024621d034cbfd4559fd589529a221ffa2642d

Observation c99aaa46-34d4-421a-bdd7-b2073955ed4b · outbound

This paper cites Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.038406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.038406Z digest=sha256:2d33dcd14eaadf97070b92f02062f8dbf8a42f0ac2bb36142dc270adaf1414d8

Observation 6c5efb70-deb6-4f1b-8681-7f2ae7b33c30 · outbound

This paper cites Lightgcn: Simplifying and powering graph convolution network for recommendation.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Lightgcn: Simplifying and powering graph convolution network for recommendation

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.042806Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.042806Z digest=sha256:8ab49fca954846b3480d785efdbf48d1204b2a9d4b7830c22d968e3a4ec2afec

Observation c1e0072e-af29-4069-a381-7b63ffd4973e · outbound

This paper cites Nearly optimal sparse fourier transform.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Nearly optimal sparse fourier transform

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.047160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.047160Z digest=sha256:bdf5e3a5eefa4f9e0271ed956ed3776c10ba942325843a811a1513313844fb42

Observation c783fac0-a316-4d3c-a56b-cc3ef7ac1d0e · outbound

This paper cites Simple and practical algorithm for sparse fourier transform.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Simple and practical algorithm for sparse fourier transform

Reference 70

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.051694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.051694Z digest=sha256:aeee9f02d1ef23b3c6c0e0d120f03a5b1e9c6a8b96c4c0bdee868af128a05534

Observation 2ac0508f-1019-4e25-a119-aee0a808ab7e · outbound

This paper cites Denoising diffusion probabilistic models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Denoising diffusion probabilistic models

Reference 71

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.056367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.056367Z digest=sha256:2078396634a311736bd91c58c3d991af078c16598aacaa3bbaa981e5d196c504

Observation bbe37768-0ec0-4ad3-a0d7-4629731431fb · outbound

This paper cites Hyperattention: Long-context attention in near-linear time.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Hyperattention: Long-context attention in near-linear time

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.060817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.060817Z digest=sha256:cdceac3b28f85f20f5f6c1497b9f537128e3e2a2b7c1e5c779748457d4a0c62c

Observation d7e712c3-bfc1-42d0-afb4-1fd9123e8652 · outbound

This paper cites On computational limits of modern hopfield models: A fine-grained complexity analysis.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On computational limits of modern hopfield models: A fine-grained complexity analysis

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.065014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.065014Z digest=sha256:748d7749522a3fd552768e849fe18c07c2e79914f852896b7b2370c9a7c2ebfb

Observation 77a1e996-11c3-46e1-acf6-ca041c267682 · outbound

This paper cites The restricted isometry property of subsampled fourier matrices.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform The restricted isometry property of subsampled fourier matrices

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.069258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.069258Z digest=sha256:392a4ce265d933f7de615deb8929a363e44b5ad2f59a3d0591340a8025405a6b

Observation 59a4fb26-7d6c-4d8b-b2b5-4e9539235a9c · outbound

This paper cites Video diffusion models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Video diffusion models

Reference 75

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.072887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.072887Z digest=sha256:785b01b4afa02a737ca55c4cc588988cf85a7238bf10ef05f76317c00201f9cb

Observation 6ed104f9-4856-4fab-84d8-c9a2588b3734 · outbound

This paper cites Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models

Reference 76

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.076414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.076414Z digest=sha256:e2958dd21c26dfcbcc49a078ae11eca205f16faa5e45e074318a420196447a4c

Observation 705aa863-ff36-4c9d-89c2-5abb2f76d41f · outbound

This paper cites Provably optimal memory capacity for modern hopfield models: Tight analysis for transformer-compatible dense associative memories.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Provably optimal memory capacity for modern hopfield models: Tight analysis for transformer-compatible dense associative memories

Reference 77

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.080405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.080405Z digest=sha256:16c2800c25644ed06fbd868d0ec108cab65ac53b05f60960a55da4c631001bf0

Observation 0b04245f-0e75-4ae7-8dde-6fdc21a4e28a · outbound

This paper cites On statistical rates of conditional diffusion transformers: Approximation, estimation and minimax optimality.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On statistical rates of conditional diffusion transformers: Approximation, estimation and minimax optimality

Reference 78

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.084014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.084014Z digest=sha256:1207ec5bda790b20513ebf7f06c5dfe04871541e90d2c578318ea10a6c2ec1bc

Observation 3e6f0549-3540-4557-a4e6-e430aa09653d · outbound

This paper cites On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs).

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On Statistical Rates and Provably Efficient Criteria of Latent Diffusion Transformers (DiTs)

Reference 79

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.087991Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.087991Z digest=sha256:d0a02b030e1948aab39dbf87da4a9f5e9fd853c36faaab4df588e9137310323b

Observation f7a4865c-1ddc-4b4c-8150-bda2148bd14b · outbound

This paper cites Lo RA : Low-rank adaptation of large language models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Lo RA : Low-rank adaptation of large language models

Reference 80

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.091976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.091976Z digest=sha256:70345629c4ce7ec1492fc75d19800aff4a4a224165a7766935665da95156ac73

Observation f7709e7a-84c7-4ad2-9ca8-7f40e5eb3d67 · outbound

This paper cites On sparse modern hopfield model.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On sparse modern hopfield model

Reference 81

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.095657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.095657Z digest=sha256:feb520dea95d0cc5b18e1e0de554cfc77315f499fecbe021a6148e646772585b

Observation eb708a22-af10-4698-b27b-3a0074748560 · outbound

This paper cites Bigst: Linear complexity spatio-temporal graph neural network for traffic forecasting on large-scale road networks.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Bigst: Linear complexity spatio-temporal graph neural network for traffic forecasting on large-scale road networks

Reference 82

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.099217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.099217Z digest=sha256:2b64510db6fc442445650115eadbf9dd45d719f1cc7a5a1033d9308dcb21fc55

Observation 8c80db83-5c30-4971-b7e1-b8106c83cae7 · outbound

This paper cites Sample-optimal fourier sampling in any constant dimension.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sample-optimal fourier sampling in any constant dimension

Reference 83

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.103659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.103659Z digest=sha256:f38c56494ebc4fc4e41d87fc59d3f8ecf799b3b6e65e3431675eb9922efeb4ed

Observation 86d76f18-e998-4d4e-b042-cce383d26a43 · outbound

This paper cites (nearly) sample-optimal sparse fourier transform.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform (nearly) sample-optimal sparse fourier transform

Reference 84

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.108122Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.108122Z digest=sha256:1ed34ee028802163854d9122147cdbd161c2095266d9ab5868154abb6217b5b4

Observation 3385719c-3f7e-4aab-96d0-65cb6612b66c · outbound

This paper cites On the complexity of k-sat.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On the complexity of k-sat

Reference 85

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.112326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.112326Z digest=sha256:cf7005fb93c40042162c52f333c4ecace8e2286dbe37e386024085da55c41444

Observation e91f2cb5-a697-4b08-aa69-7cd5eb8bf1fb · outbound

This paper cites A robust multi-dimensional sparse fourier transform in the continuous setting.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform A robust multi-dimensional sparse fourier transform in the continuous setting

Reference 86

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.116647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.116647Z digest=sha256:934e8214f696631c9ffd2acc7e32d72f3ba2137ef5a065444bd3d48289238b2a

Observation 19f87664-30b2-45e1-a553-c3cd2473f37b · outbound

This paper cites A faster algorithm for solving general lps.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform A faster algorithm for solving general lps

Reference 87

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.121711Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.121711Z digest=sha256:c2483ccaaeb71a4119eed5b84883380d1ac278db1a120e477e08e8fa2e714e5b

Observation f1e477ee-d654-4878-8c37-34305a456463 · outbound

This paper cites Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time

Reference 88

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.126313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.126313Z digest=sha256:154847b5789ea1da7f7775f170bda5f1d58a988f76bca10a058c7fe9bec6335d

Observation 6bb77777-ffbf-43fa-9aee-6195db17907c · outbound

This paper cites Sample efficient estimation and recovery in sparse FFT via isolation on average.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sample efficient estimation and recovery in sparse FFT via isolation on average

Reference 89

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.130687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.130687Z digest=sha256:9969620024d65f4a5ff871c1fe11b5c78db8a9c6595ad1b28c7ea3295baf8bfb

Observation 6e7741aa-67c3-4bc8-a68f-4290e49168f1 · outbound

This paper cites Sparse Fine-tuning for Inference Acceleration of Large Language Models.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Sparse Fine-tuning for Inference Acceleration of Large Language Models

Reference 90

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.135290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.135290Z digest=sha256:970fda0a4f549497ec14841dae00645854ed36f859372f094e30dfe9067c8b7a

Observation 62950758-e33d-46c2-bbd3-73cd4aa48487 · outbound

This paper cites Reformer: The Efficient Transformer.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Reformer: The Efficient Transformer

Reference 91

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.139840Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.139840Z digest=sha256:9395c3c18a7ec68b241c3e351ec9df93cc8612e6dc5d2d9d03e0a3705dc064a6

Observation 241d9d1f-b119-4560-9f70-9415970f7203 · outbound

This paper cites On the power of preconditioning in sparse linear regression.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On the power of preconditioning in sparse linear regression

Reference 92

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.144489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.144489Z digest=sha256:14e44b47fbef2bbc47fb64e60c23d6cec905bb55639186e4eaaaf7c518e36f6f

Observation 13f55750-006d-43a3-9808-1f01aad49c24 · outbound

This paper cites Suprema of chaos processes and the restricted isometry property.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Suprema of chaos processes and the restricted isometry property

Reference 93

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.149033Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.149033Z digest=sha256:9b5c01035fcfc3c7211f6b5279cc1818e322f9b223ff760039bfaf45213a8d8e

Observation e8ef05fd-7788-45f6-be4c-4eae8bf92971 · outbound

This paper cites Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Demonstrate-Search-Predict: Composing retrieval and language models for knowledge-intensive NLP

Reference 94

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.153293Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.153293Z digest=sha256:372e86938f79e7dfe8f108ff7b6deccc9307248f29b77364a2715314be2e0844

Observation ea624120-02ad-448a-a74e-a9d23a8666d0 · outbound

This paper cites Transformers are rnns: Fast autoregressive transformers with linear attention.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Transformers are rnns: Fast autoregressive transformers with linear attention

Reference 95

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.158184Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.158184Z digest=sha256:62bb29b25fbfdaf412d0cba16aedf2b9f177b4aee69f9eb9e1d966fc7313e688

Observation 7cf38599-650c-4de0-8533-b46ee5146bc7 · outbound

This paper cites Dimension-independent sparse fourier transform.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Dimension-independent sparse fourier transform

Reference 96

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.162442Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.162442Z digest=sha256:1ed3388d28a370742fbaf0bf70ff0fe6e712c039844962e91402b88b42464f62

Observation 813eb169-f9ba-4a81-8c89-ec33a061710b · outbound

This paper cites Semi-supervised classification with graph convolutional networks.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Semi-supervised classification with graph convolutional networks

Reference 97

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.166990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.166990Z digest=sha256:ac2241b7cb38492f54fcec4da1aae5fe486353b6733c6241f5b637a23ea4afe3

Observation 3a4ce5ee-3a40-4388-92d3-7f27476911c0 · outbound

This paper cites On the computational complexity of self-attention.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform On the computational complexity of self-attention

Reference 98

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.171125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.171125Z digest=sha256:ca0999713b754ab464091c3e6245e3b38136fd3ab0791cc36215a73f861f3b7d

Observation ad49a63a-769f-46d1-a6e6-b163a6c7d3cd · outbound

This paper cites The power of scale for parameter-efficient prompt tuning.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform The power of scale for parameter-efficient prompt tuning

Reference 99

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.175331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.175331Z digest=sha256:4a8b497151e4cbb7f116cb51bf386d673b55b6661afcac68cc3bc1d36fad487b

Observation 92e5ae73-38ca-4309-97a6-fc7676341161 · outbound

This paper cites Symbiotic graph neural networks for 3d skeleton-based human action recognition and motion prediction.

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform Symbiotic graph neural networks for 3d skeleton-based human action recognition and motion prediction

Reference 100

Resolution
unresolved
no resolver link, observed 2026-08-15T20:56:34.179657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T20:56:34.179657Z digest=sha256:c43a0c44cce82792cb1555d96e94e10be96343d6b89a9404d15c3ab86f64106d

Pith citing papers

Observation 621ca083-c8d5-43ac-958c-942fd50c1dbb · inbound

Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse cites this paper.

Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-07T15:10:57.183708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T15:10:57.183708Z digest=sha256:eb27f2260b1e3be374cacdc621ba8f9df79e057b6bea635f70d2f6fe777d7fc6

Observation dfeadc09-5c90-4514-a781-34d65330052a · inbound

Minimalist Softmax Attention Provably Learns Constrained Boolean Functions cites this paper.

Minimalist Softmax Attention Provably Learns Constrained Boolean Functions Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-07T14:21:00.129826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:21:00.129826Z digest=sha256:3f393cc25e3f30fa783c3e366bd4ec39b94c7aa0f9b29bef3c97eec824a60e47

Observation 0cf7b32a-984c-4712-ab44-5f26aab50e0f · inbound

Tracking High-order Evolutions via Cascading Low-rank Fitting cites this paper.

Tracking High-order Evolutions via Cascading Low-rank Fitting Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-05-11T09:36:04.777834Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-05-10T15:55:27.722919Z digest=sha256:063be64c8114188e3b03de07d30c5ec31d5fd07b16820b0ca349b49716649c08