Paper Citation Record · LEDGER

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers

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

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

pith.paper-citation-record.v1
2607.20594 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T10:14:11.706221Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

13 of 13 outbound references displayed

verified exact0
verified fuzzy0
unresolved13
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e7600503-d615-4bf7-aa86-4448c6393ef9 · outbound

This paper cites Looped Transformers for Length Generalization.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Looped Transformers for Length Generalization

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:10.974064Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 666d89c3-8a28-41cc-9e99-fb96b37bac7e · outbound

This paper cites Why are Sensitive Functions Hard for Transformers?.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Why are Sensitive Functions Hard for Transformers?

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.203822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9461a17-db8d-44c4-ab88-d1b9c784a521 · outbound

This paper cites Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.417991Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 577c702f-9de1-42ae-a6fe-04f62f356bc2 · outbound

This paper cites 12 Preprint Table 10: Frontier-state transplant (A’s prefix states spliced intoB’s run at the frontier, loopt=16): retention vs.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers 12 Preprint Table 10: Frontier-state transplant (A’s prefix states spliced intoB’s run at the frontier, loopt=16): retention vs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.553424Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31049dde-38f4-4cdb-99df-7e1310ce0c10 · outbound

This paper cites The Illusion of State in State-Space Models.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers The Illusion of State in State-Space Models

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.612261Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a4d366e-0137-43fb-9530-013e54924497 · outbound

This paper cites Enhancing Auto-regressive Chain-of-Thought through Loop-Aligned Reasoning.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Enhancing Auto-regressive Chain-of-Thought through Loop-Aligned Reasoning

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.706221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d99a086c-057f-4bfa-9578-2f36102864a4 · outbound

This paper cites A Mechanistic Analysis of Looped Reasoning Language Models.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers A Mechanistic Analysis of Looped Reasoning Language Models

Reference 1989

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:10.628781Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bf8e37b-ca09-4e26-9a1b-b62bca9b77e4 · outbound

This paper cites Diffract: Diffusion feature reconstruction and attribution for circuit tracing.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Diffract: Diffusion feature reconstruction and attribution for circuit tracing

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:10.826370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41107749-7689-400b-b356-323262ca2c0b · outbound

This paper cites Looped Transformers are Better at Learning Learning Algorithms.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Looped Transformers are Better at Learning Learning Algorithms

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.657461Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a54abb9-d80a-4126-b1ae-0c385b55f114 · outbound

This paper cites an unresolved cited work.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Unresolved cited work

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.294692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea2c21d6-b2be-4337-b7f0-58deb37be955 · outbound

This paper cites Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.100379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d79960e7-9586-4f7d-99bc-4118f94ae3d3 · outbound

This paper cites Kevin Meng, David Bau, Alex Andonian, and Yonatan Belinkov.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Kevin Meng, David Bau, Alex Andonian, and Yonatan Belinkov

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:11.488215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc379f04-caa9-4741-88db-007ea00f02d7 · outbound

This paper cites Scaling Latent Reasoning via Looped Language Models.

When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers Scaling Latent Reasoning via Looped Language Models

Reference 2026

Resolution: unresolved; no resolver link, observed 2026-08-01T10:14:10.691369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.