{"as_of":"2026-08-08T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22a3d40a3c5d19b8b032eeccb8b39dbedca5f247526a4e1ae5f1d6b852899033","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T03:23:31.727605Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11760/citation-record","integrity":"/paper/2607.11760/integrity","json":"/paper/2607.11760/citation-record.json","paper":"/paper/2607.11760"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03085","last_updated":"2025-06-06T07:47:10Z","snapshot_observed_at":"2026-08-07T11:06:40.645529Z","submitted_at":"2025-06-03T17:09:34Z","title":"Non-Asymptotic Length Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03085","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"arXiv preprint arXiv:2506.03085 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2506.03085","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:dac5029d8463c78e71ca845b48c5e361e698a3e4126ecc7378112fb60804cfb1","observation_id":"9af35948-d31e-4e0c-81b3-44c16424fe67","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:d246463bdabbd5b1eea02f71d8aa32faea75c9970b1ea507bb10b777895030f7","observation_id":"fcaab861-56c4-44dd-bd7b-d07a5617e58b","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02140","last_updated":"2025-04-30T15:01:01Z","snapshot_observed_at":"2026-07-06T19:26:43.399756Z","submitted_at":"2024-10-03T01:52:01Z","title":"A Formal Framework for Understanding Length Generalization in Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02140","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"arXiv preprint arXiv:2410.02140 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2410.02140","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:a8f8a396349444134b1cefdb973eae516bf5276dcc12ba848e8c46c4864530eb","observation_id":"24211108-9caf-4f93-bfa0-0d4cb80db009","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16028","last_updated":"2023-10-24T17:43:29Z","snapshot_observed_at":"2026-07-06T16:37:58.121261Z","submitted_at":"2023-10-24T17:43:29Z","title":"What Algorithms can Transformers Learn? A Study in Length Generalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16028","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"arXiv preprint arXiv:2310.16028 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2310.16028","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:935c493309dfb30d24f505f8d7bbca60bb73eef869ec3e1f846121ba434a9dea","observation_id":"26a39aa7-3826-4c2e-95b0-638661fee8ca","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"The Eleventh International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:2eae937b4de2e860854f2419fe69ed9af6f127ad4a56749bcddbc1f00127e675","observation_id":"4b7569af-f342-4519-8e6f-b59f71bf3efd","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:7741cdfd3f8d5eb6960b2d265e7dae82ea488132d92c3621b954fbde5ae799d6","observation_id":"fb64339b-be50-44bb-ab2c-5a2db5262321","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:147f7538641c7bfe3df5dae845771687cf11695dd899782ec0d43d506e5b8e38","observation_id":"54cd3cfb-ae9b-4636-b3aa-c30ede651133","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"International Conference on Artificial Intelligence and Statistics , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:70459d86a1b8f67391423d64556f4af43b0057192860eacf098aba63ed061550","observation_id":"1aa61019-e863-4cb3-85ca-df86442cdd78","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Transactions of the Association for Computational Linguistics , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:b1d599100529a0e252395134364a8ca03da684714b027f22a463c90e3969c44b","observation_id":"014f4b92-4b27-4075-9a66-0317db946ad9","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:0765d6ec9ceafd6c34abddc231a67c9b8ae4d551435853cdc262d65a3d0dab47","observation_id":"b7e74839-0bee-4587-8fb7-311a386bb513","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:02a447d2d4c2340aca51fc1a3fab9862a46755faa0dcd9d3c886a662db669bcc","observation_id":"1463b043-5040-44a4-8ad2-26d961ec089c","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-07T22:03:59.611479Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"arXiv preprint arXiv:2402.09963 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:d8f366c99bc061dbb4024c28560916cdc3f4c822fc229652553f1a299384cb6a","observation_id":"c958545a-b265-4aa5-840a-fd489240a1bd","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Transactions of the Association for Computational Linguistics , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:226cd77687af037ce14e6ceeec12c6b633920f8d0595924b98631ac8b1824786","observation_id":"98d685a3-0c45-474a-b6d9-28003b0b6f12","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"On the A bility and L imitations of T ransformers to R ecognize F ormal L anguages","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:57b1ad46b66565e35b9a7416e3c35a09e645480347811ab3e6111ba3370db059","observation_id":"34100970-d624-4ba6-894c-24396370258f","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Separations in the representational capabilities of transformers and recurrent architectures","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:75e24e20dddf43e7bba1c3b2cb2c233a0f3544c169e924c1426d26a7e6a50210","observation_id":"272ca3df-3a19-46d2-8c34-161c4ee5704d","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06323","last_updated":"2025-02-15T15:21:10Z","snapshot_observed_at":"2026-07-06T17:27:54.211733Z","submitted_at":"2024-02-09T11:03:52Z","title":"How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teachers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06323","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"How uniform random weights induce non-uniform bias: Typical interpolating neural networks generalize with narrow teachers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2402.06323","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:69aea8b74f05ec20546a0e88ec6799ba512726c238735dbbabb840ba013a52f8","observation_id":"f6cc386f-feea-404d-b79e-27629ed67bd1","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Loss landscapes are all you need: Neural network generalization can be explained without the implicit bias of gradient descent","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:24283c9297d2aba9e377915a36f12bfe72600a9fc72809b299b3e510528a1e01","observation_id":"5dec385a-1699-4807-a08b-a02a9dd9d99e","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Theoretical limitations of self-attention in neural sequence models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:7e1f7d5bf5c3392a8ea7b7fed8e0b679b1a6bd340e163c68f30a2ae3aa9ebc08","observation_id":"b2f6dfe9-b704-4e94-a48e-62479cc742d4","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Saturated transformers are constant-depth threshold circuits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:9774292a2a0e7948330163f86f1f224303ba2a12f7998cc8505ae81392fed7a0","observation_id":"2b4521a3-f913-4636-bc76-9a474ee6c3d2","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09728","last_updated":"2024-03-12T21:54:34Z","snapshot_observed_at":"2026-07-06T17:44:49.990624Z","submitted_at":"2024-03-12T21:54:34Z","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09728","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Simulating weighted automata over sequences and trees with transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2403.09728","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:db7bf4c4b66c1df616aabf7aa8c569691b6d0b9aa77166c8ba67c54fef99f26b","observation_id":"2895447b-d6ff-43e3-a17c-d9568c666b2e","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Thinking like transformers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:d518c2ad66a9bbc0a3be6ad95a9e44ee1fd2fa1e115e431e70447ead21d52764","observation_id":"039b76fd-597d-4f53-895b-7f3b69c67527","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04393","last_updated":"2024-12-01T20:48:11Z","snapshot_observed_at":"2026-07-06T17:56:18.931340Z","submitted_at":"2024-04-05T20:36:30Z","title":"Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.04393","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Counting like transformers: Compiling temporal counting logic into softmax transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2404.04393","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:aa5cd25d0d493ea64d104b8217c36c30fa0a0e452f98b6534fdcd9df025892fd","observation_id":"e3ad4886-1f4c-439f-85e0-1b2e3c8eeae5","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Knee-deep in c-rasp: A transformer depth hierarchy","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:621b7a67ded0a3c14d0006c7e7a7d1c3f3d04ca7a9ef34e49a3b8d734299d757","observation_id":"c46836e9-b320-4231-b876-9b98266476cf","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T22:36:16.299904Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.11760."}