Pith. sign in

Paper Citation Record · LEDGER

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP

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

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

pith.paper-citation-record.v1
2607.11760 v1

Coverage vector

measured 23 of 23 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-14T03:23:31.727605Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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

23 of 23 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9af35948-d31e-4e0c-81b3-44c16424fe67 · outbound

This paper cites Non-Asymptotic Length Generalization.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Non-Asymptotic Length Generalization

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:dac5029d8463c78e71ca845b48c5e361e698a3e4126ecc7378112fb60804cfb1

Observation fcaab861-56c4-44dd-bd7b-d07a5617e58b · outbound

This paper cites Advances in neural information processing systems , volume=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Advances in neural information processing systems , volume=

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:d246463bdabbd5b1eea02f71d8aa32faea75c9970b1ea507bb10b777895030f7

Observation 24211108-9caf-4f93-bfa0-0d4cb80db009 · outbound

This paper cites A Formal Framework for Understanding Length Generalization in Transformers.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP A Formal Framework for Understanding Length Generalization in Transformers

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:a8f8a396349444134b1cefdb973eae516bf5276dcc12ba848e8c46c4864530eb

Observation 26a39aa7-3826-4c2e-95b0-638661fee8ca · outbound

This paper cites What Algorithms can Transformers Learn? A Study in Length Generalization.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP What Algorithms can Transformers Learn? A Study in Length Generalization

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:935c493309dfb30d24f505f8d7bbca60bb73eef869ec3e1f846121ba434a9dea

Observation 4b7569af-f342-4519-8e6f-b59f71bf3efd · outbound

This paper cites The Eleventh International Conference on Learning Representations , year=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP The Eleventh International Conference on Learning Representations , year=

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:2eae937b4de2e860854f2419fe69ed9af6f127ad4a56749bcddbc1f00127e675

Observation fb64339b-be50-44bb-ab2c-5a2db5262321 · outbound

This paper cites International Conference on Machine Learning , pages=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP International Conference on Machine Learning , pages=

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:7741cdfd3f8d5eb6960b2d265e7dae82ea488132d92c3621b954fbde5ae799d6

Observation 54cd3cfb-ae9b-4636-b3aa-c30ede651133 · outbound

This paper cites International Conference on Machine Learning , pages=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP International Conference on Machine Learning , pages=

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:147f7538641c7bfe3df5dae845771687cf11695dd899782ec0d43d506e5b8e38

Observation 1aa61019-e863-4cb3-85ca-df86442cdd78 · outbound

This paper cites International Conference on Artificial Intelligence and Statistics , pages=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP International Conference on Artificial Intelligence and Statistics , pages=

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:70459d86a1b8f67391423d64556f4af43b0057192860eacf098aba63ed061550

Observation 014f4b92-4b27-4075-9a66-0317db946ad9 · outbound

This paper cites Transactions of the Association for Computational Linguistics , volume=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Transactions of the Association for Computational Linguistics , volume=

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:b1d599100529a0e252395134364a8ca03da684714b027f22a463c90e3969c44b

Observation b7e74839-0bee-4587-8fb7-311a386bb513 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Advances in Neural Information Processing Systems , volume=

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:0765d6ec9ceafd6c34abddc231a67c9b8ae4d551435853cdc262d65a3d0dab47

Observation 1463b043-5040-44a4-8ad2-26d961ec089c · outbound

This paper cites Journal of Machine Learning Research , volume=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Journal of Machine Learning Research , volume=

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:02a447d2d4c2340aca51fc1a3fab9862a46755faa0dcd9d3c886a662db669bcc

Observation c958545a-b265-4aa5-840a-fd489240a1bd · outbound

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

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Why are Sensitive Functions Hard for Transformers?

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:afd9adf09eee64bfb9de6ca2c3ab6355f4e5a8d1b1373666034971df5210d15e

Observation 98d685a3-0c45-474a-b6d9-28003b0b6f12 · outbound

This paper cites Transactions of the Association for Computational Linguistics , volume=.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Transactions of the Association for Computational Linguistics , volume=

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:226cd77687af037ce14e6ceeec12c6b633920f8d0595924b98631ac8b1824786

Observation 34100970-d624-4ba6-894c-24396370258f · outbound

This paper cites On the A bility and L imitations of T ransformers to R ecognize F ormal L anguages.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP On the A bility and L imitations of T ransformers to R ecognize F ormal L anguages

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:57b1ad46b66565e35b9a7416e3c35a09e645480347811ab3e6111ba3370db059

Observation 272ca3df-3a19-46d2-8c34-161c4ee5704d · outbound

This paper cites Separations in the representational capabilities of transformers and recurrent architectures.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Separations in the representational capabilities of transformers and recurrent architectures

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:75e24e20dddf43e7bba1c3b2cb2c233a0f3544c169e924c1426d26a7e6a50210

Observation f6cc386f-feea-404d-b79e-27629ed67bd1 · outbound

This paper cites How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teachers.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teachers

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:69aea8b74f05ec20546a0e88ec6799ba512726c238735dbbabb840ba013a52f8

Observation 5dec385a-1699-4807-a08b-a02a9dd9d99e · outbound

This paper cites Loss landscapes are all you need: Neural network generalization can be explained without the implicit bias of gradient descent.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Loss landscapes are all you need: Neural network generalization can be explained without the implicit bias of gradient descent

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:24283c9297d2aba9e377915a36f12bfe72600a9fc72809b299b3e510528a1e01

Observation b2f6dfe9-b704-4e94-a48e-62479cc742d4 · outbound

This paper cites Theoretical limitations of self-attention in neural sequence models.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Theoretical limitations of self-attention in neural sequence models

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:7e1f7d5bf5c3392a8ea7b7fed8e0b679b1a6bd340e163c68f30a2ae3aa9ebc08

Observation 2b4521a3-f913-4636-bc76-9a474ee6c3d2 · outbound

This paper cites Saturated transformers are constant-depth threshold circuits.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Saturated transformers are constant-depth threshold circuits

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:9774292a2a0e7948330163f86f1f224303ba2a12f7998cc8505ae81392fed7a0

Observation 2895447b-d6ff-43e3-a17c-d9568c666b2e · outbound

This paper cites Simulating Weighted Automata over Sequences and Trees with Transformers.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Simulating Weighted Automata over Sequences and Trees with Transformers

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:db7bf4c4b66c1df616aabf7aa8c569691b6d0b9aa77166c8ba67c54fef99f26b

Observation 039b76fd-597d-4f53-895b-7f3b69c67527 · outbound

This paper cites Thinking like transformers.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Thinking like transformers

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:d518c2ad66a9bbc0a3be6ad95a9e44ee1fd2fa1e115e431e70447ead21d52764

Observation e3ad4886-1f4c-439f-85e0-1b2e3c8eeae5 · outbound

This paper cites Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:aa5cd25d0d493ea64d104b8217c36c30fa0a0e452f98b6534fdcd9df025892fd

Observation c46836e9-b320-4231-b876-9b98266476cf · outbound

This paper cites Knee-deep in c-rasp: A transformer depth hierarchy.

From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP Knee-deep in c-rasp: A transformer depth hierarchy

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-14T03:23:31.727605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T03:23:31.727605Z digest=sha256:621b7a67ded0a3c14d0006c7e7a7d1c3f3d04ca7a9ef34e49a3b8d734299d757

Pith citing papers

No inbound Pith citation observations are available.