Paper Citation Record · LEDGER

Circuit Complexity Bounds for RoPE-based Transformer Architecture

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2411.07602.

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

pith.paper-citation-record.v1
2411.07602 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 11 of 11 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T14:21:03.022225Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation bc4095b5-ee5d-4a48-9f5f-520ac7c7ff1e · inbound

Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond cites this paper.

Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-11T20:09:34.675235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07b18c77-012d-43e9-a994-5e408fa9c472 · inbound

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity cites this paper.

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-11T20:02:09.297873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d530ae13-cf75-4a9a-87da-ede2e826a662 · inbound

Numerical Pruning for Efficient Autoregressive Models cites this paper.

Numerical Pruning for Efficient Autoregressive Models Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-11T14:11:26.885071Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec4ceebb-b1d3-4071-aef1-dc19aa45b589 · inbound

LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers cites this paper.

LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-11T14:11:39.315221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 42fe3246-427d-4aec-80ff-022bd1b2cfcc · inbound

Circuit Complexity Bounds for Visual Autoregressive Model cites this paper.

Circuit Complexity Bounds for Visual Autoregressive Model Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-10T21:42:46.236120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e706923-b6e9-41b2-a509-395c8d1185dd · inbound

Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation cites this paper.

Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-09T18:51:12.345981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d50ca951-3574-4f63-9b86-0bb08052c43e · inbound

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

High-Order Matching for One-Step Shortcut Diffusion Models Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-09T18:10:52.976926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 423c9e52-f987-4305-b56b-0571d9908fdc · inbound

Universal Approximation of Visual Autoregressive Transformers cites this paper.

Universal Approximation of Visual Autoregressive Transformers Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-08T16:39:14.114625Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform cites this paper.

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.

Observation b55a5859-5eb5-4dbc-a6fe-bcefce5b82ba · 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 Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 2020

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 048926cc-308b-46de-867a-170a7ef15673 · inbound

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

Minimalist Softmax Attention Provably Learns Constrained Boolean Functions Circuit Complexity Bounds for RoPE-based Transformer Architecture

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-08-07T14:21:03.091343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.