Pith. sign in

Paper Citation Record · LEDGER

Circuit Complexity Bounds for RoPE-based Transformer Architecture

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 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 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

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 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.

source=pdf_text observed=2026-08-07T15:10:58.286424Z digest=sha256:8f10d97bd913edeeb2c7d1465c35970d475a2f11b26d331f3f76aa71dd4d8c85

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-08-07T14:21:00.473856Z digest=sha256:015fcf9b3c8c3d712839462e3a1020855aa2f5d6e8c6bcfbbd492e298cc9033d