Paper Citation Record · LEDGER

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers

As of 21 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:2603.11161.

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

pith.paper-citation-record.v1
2603.11161 v2

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-11T11:50:26.030339Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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-15T15:27:28.143731Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-11T02:57:47.058973Z

Reference resolution

14 of 14 outbound references displayed

verified exact4
verified fuzzy4
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch5

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5fe1624c-4dfc-4d9d-87b0-5f7e3e158efe · outbound

This paper cites cc/paper_files/paper/2022/hash/ f96180a6b7d142d76f827a5d7367c3b2-Abstract-Conference.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers cc/paper_files/paper/2022/hash/ f96180a6b7d142d76f827a5d7367c3b2-Abstract-Conference

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-15T13:10:01.441272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fbcd05cb-3176-46cf-804a-1ffdd812c76e · outbound

This paper cites Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descent.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descent

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-05-15T13:10:00.843927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6dd7de2d-c618-43a7-bafa-e2d217c4527a · outbound

This paper cites URL http://www.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers URL http://www

Reference 3

Resolution: verified exact; doi, observed 2026-05-15T13:10:00.813324Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 09b6dcbb-3b14-48b4-ac2b-b39fc9402f82 · outbound

This paper cites Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networks.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networks

Reference 4

Resolution: metadata mismatch; arxiv_id, observed 2026-05-15T13:10:00.834753Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 61552c39-6bd8-457d-9628-a1f45c0f1a2b · outbound

This paper cites an unresolved cited work.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Unresolved cited work

Reference 5

Resolution: verified exact; doi, observed 2026-05-15T13:10:00.776533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1022e9fd-5986-47a3-b452-f49ca2a649d0 · outbound

This paper cites an unresolved cited work.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-05-15T13:10:01.438407Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4c047220-86ae-45da-a493-65523fb758f4 · outbound

This paper cites pub/2021/framework/index.html.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers pub/2021/framework/index.html

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-05-15T13:10:01.435677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2dd8ba67-4709-433e-a23a-c76522250c30 · outbound

This paper cites Also available as.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Also available as

Reference 8

Resolution: metadata mismatch; arxiv_id, observed 2026-05-15T13:10:00.792331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7ffa1995-ea2d-4752-9c74-70923e24b6c9 · outbound

This paper cites GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models

Reference 9

Resolution: metadata mismatch; local_arxiv, observed 2026-05-15T13:10:00.804640Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation cc7bd056-2c39-488e-adc4-1b4b5f93a416 · outbound

This paper cites Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets

Reference 10

Resolution: metadata mismatch; local_arxiv, observed 2026-05-15T13:10:00.799164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9170bfc3-6605-4121-80fb-73ffe83e3866 · outbound

This paper cites Deep learning generalizes because the parameter-function map is biased towards simple functions.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Deep learning generalizes because the parameter-function map is biased towards simple functions

Reference 11

Resolution: metadata mismatch; local_arxiv, observed 2026-05-15T13:10:00.783480Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f7130ae5-86b2-4af0-bb6c-f7a14a5f00e4 · outbound

This paper cites Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel

Reference 12

Resolution: verified exact; arxiv_id, observed 2026-05-15T13:10:00.838705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5a94d5c5-37b5-413c-b37f-4cc866af8967 · outbound

This paper cites TX c,e=1 Ac(s1)∆Σ′ ceAe(s2) # ≤ ∥∆Σ ′∥∞ E(s1,s2).

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers TX c,e=1 Ac(s1)∆Σ′ ceAe(s2) # ≤ ∥∆Σ ′∥∞ E(s1,s2)

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-15T13:10:01.431519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6d8772f3-7f42-43b3-9d26-a80b4675bcbc · outbound

This paper cites As estab- lished in Eq.

Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers As estab- lished in Eq

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-15T13:10:01.433574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

Observation 1dda7ac2-3187-48fc-9b6f-e38505af4efd · inbound

Width-Robust Learnability in Mean-Field Bayesian Neural Networks cites this paper.

Width-Robust Learnability in Mean-Field Bayesian Neural Networks Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-07-11T02:57:47.089470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5c904b94-a1bc-47d6-b81d-a5fb689638c7 · inbound

Mask-Based Priors Are More Persistent than Query-Key Initializations cites this paper.

Mask-Based Priors Are More Persistent than Query-Key Initializations Algorithmic Task Capture, Computational Complexity, and Inductive Bias of Infinite Transformers

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T15:27:28.143731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.