{"as_of":"2026-08-15T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5b1fd8f90130ac1ffac5251b392a2d624c15b35d8993d1b86f508559fbd43eb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":46,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:02:09.520474Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":11,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-11T20:02:09.520474Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06148","last_updated":"2025-02-20T18:38:08Z","snapshot_observed_at":"2026-08-13T08:56:20.412431Z","submitted_at":"2024-12-09T02:01:18Z","title":"The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T20:02:09.520474Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2412.06148"},"observation_digest":"sha256:b37394cf471a6dae0f8316610303e0bbc12b975b7bb6f27e34a2f6121cd90c8a","observation_id":"e5b27847-6b6e-4326-974b-e19842184d96","resolution":{"observed_at":"2026-08-11T20:02:09.520474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-11T18:30:15.551782Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.07942","last_updated":"2024-12-10T22:01:38Z","snapshot_observed_at":"2026-08-13T14:43:20.745414Z","submitted_at":"2024-12-10T22:01:38Z","title":"Neural Scaling Laws Rooted in the Data Distribution","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T18:30:15.551782Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2412.07942"},"observation_digest":"sha256:b5d74ec827648ee27a8f9b5c041910b59a6f1229936723bc357e5c5b74e363ef","observation_id":"60fa9eec-f448-4988-9be7-5d3a5ca47b61","resolution":{"observed_at":"2026-08-11T18:30:15.551782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-10T23:24:01.543001Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.00070","last_updated":"2025-05-02T05:27:38Z","snapshot_observed_at":"2026-08-13T08:40:18.325048Z","submitted_at":"2024-12-29T18:58:09Z","title":"ICLR: In-Context Learning of Representations","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T23:24:01.543001Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2501.00070"},"observation_digest":"sha256:43f5827203f408812fedd981630c4c5e76e9965392678cb4f5100e07693c7639","observation_id":"6d58a7dd-489c-4d65-9e50-19c8cf1607bf","resolution":{"observed_at":"2026-08-10T23:24:01.543001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-10T22:49:44.902337Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.00712","last_updated":"2025-08-21T01:12:10Z","snapshot_observed_at":"2026-08-13T02:28:40.322487Z","submitted_at":"2025-01-01T03:23:00Z","title":"Rethinking Addressing in Language Models via Contexualized Equivariant Positional Encoding","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:44.902337Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2501.00712"},"observation_digest":"sha256:4f4e1aba7578ce17969cf105b0cd165e2537b5a37b024a793510a567106019ea","observation_id":"823d6ef6-561a-42a9-9334-0ecadd2d20aa","resolution":{"observed_at":"2026-08-10T22:49:44.902337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-10T22:36:51.255890Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.01312","last_updated":"2025-01-13T03:53:34Z","snapshot_observed_at":"2026-08-13T13:00:22.824747Z","submitted_at":"2025-01-02T15:53:25Z","title":"Learning Spectral Methods by Transformers","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:51.255890Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2501.01312"},"observation_digest":"sha256:77758905a010d111e68a5fc64846dde2610bdf9fa1bcad55f72e44a92d4ae046","observation_id":"f4c809e4-c01c-4e6a-b896-a020c5cd77aa","resolution":{"observed_at":"2026-08-10T22:36:51.255890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-10T21:42:46.274584Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.04299","last_updated":"2025-01-08T06:07:33Z","snapshot_observed_at":"2026-08-13T12:09:44.937417Z","submitted_at":"2025-01-08T06:07:33Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:42:46.274584Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2501.04299"},"observation_digest":"sha256:4a0946af531891355704a67ae538399437a1dfd35c2f17cd474aa7be5366e208","observation_id":"ca9ab04d-7cf6-481f-9477-c0ffab8f5b9b","resolution":{"observed_at":"2026-08-10T21:42:46.274584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-09T05:28:51.580568Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04375","last_updated":"2025-05-21T09:17:46Z","snapshot_observed_at":"2026-08-14T11:05:56.702365Z","submitted_at":"2025-02-05T15:23:26Z","title":"An Analysis for Reasoning Bias of Language Models with Small Initialization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T05:28:51.580568Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2502.04375"},"observation_digest":"sha256:598700a10faddc9e5a9eded838c762ac0207bb1718355e4348650768415d74e2","observation_id":"276bfca0-e664-4254-95a6-d80ad59018ca","resolution":{"observed_at":"2026-08-09T05:28:51.580568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-08T17:13:25.317497Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06007","last_updated":"2025-02-09T19:51:58Z","snapshot_observed_at":"2026-08-13T22:15:13.755243Z","submitted_at":"2025-02-09T19:51:58Z","title":"Transformers versus the EM Algorithm in Multi-class Clustering","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T17:13:25.317497Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2502.06007"},"observation_digest":"sha256:c9c309e90bff26b30acf35f9b8be5172daf269b63c1b7c711534b288cd524552","observation_id":"700c731c-2051-4cff-83c0-ff51694388c2","resolution":{"observed_at":"2026-08-08T17:13:25.317497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T15:30:46.668688Z","title":"In The Eleventh International Conference on Learning Representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14925","last_updated":"2025-05-20T21:21:09Z","snapshot_observed_at":"2026-08-12T17:09:56.008098Z","submitted_at":"2025-05-20T21:21:09Z","title":"Too Long, Didn't Model: Decomposing LLM Long-Context Understanding With Novels","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:30:46.668688Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2505.14925"},"observation_digest":"sha256:ae7cd983e8f9a23ffd981a9f786fd9449655e992bc3bf621282664c71aa24a4e","observation_id":"e5ba0a7c-78ce-45a7-9480-151d78a5ac5a","resolution":{"observed_at":"2026-08-07T15:30:46.668688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T11:40:57.702995Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.01919","last_updated":"2025-06-02T17:39:31Z","snapshot_observed_at":"2026-08-08T16:13:33.864148Z","submitted_at":"2025-06-02T17:39:31Z","title":"Transformers as Multi-task Learners: Decoupling Features in Hidden Markov Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T11:40:57.702995Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2506.01919"},"observation_digest":"sha256:6aec3ef48a6a22140e25673e5275c2502ab26d85a8726bcc8f3963ad2edf7ef5","observation_id":"5bae81ac-d125-41e9-bf4f-39ce966d6004","resolution":{"observed_at":"2026-08-07T11:40:57.702995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T10:42:40.932026Z","title":"Ash, Surbhi Goel, Akshay Krishnamurthy, and Cyril Zhang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04611","last_updated":"2025-06-05T04:02:17Z","snapshot_observed_at":"2026-08-09T14:45:17.460081Z","submitted_at":"2025-06-05T04:02:17Z","title":"Revisiting Test-Time Scaling: A Survey and a Diversity-Aware Method for Efficient Reasoning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T10:42:40.932026Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2506.04611"},"observation_digest":"sha256:671519ce5dac44519497a3b062b1a5a4bd0d3136e1bfa7e9826d7ae82a09ba45","observation_id":"48788e9f-4700-4a99-b50f-d5541c2ea74e","resolution":{"observed_at":"2026-08-07T10:42:40.932026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T10:33:40.540930Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05200","last_updated":"2025-08-28T16:07:16Z","snapshot_observed_at":"2026-08-14T05:14:17.986448Z","submitted_at":"2025-06-05T16:12:51Z","title":"Transformers Meet In-Context Learning: A Universal Approximation Theory","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:33:40.540930Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2506.05200"},"observation_digest":"sha256:1bfb0756c1e9429b87a4c36c8675a193938f4e801aecdda7e40c5b772d2f294a","observation_id":"5dcb5bf9-8a9d-41b7-b476-5a3842da069c","resolution":{"observed_at":"2026-08-07T10:33:40.540930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T10:35:36.314306Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05295","last_updated":"2025-06-12T16:25:06Z","snapshot_observed_at":"2026-08-14T06:29:20.553603Z","submitted_at":"2025-06-05T17:48:19Z","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T10:35:36.314306Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2506.05295"},"observation_digest":"sha256:d7aa88b4c71dcfc06eee0160a4f53241b2e71a72ec799b223d37a22c9a725b1a","observation_id":"57831585-3380-467f-adc1-c3cd17489a82","resolution":{"observed_at":"2026-08-07T10:35:36.314306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-07T06:10:19.422720Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06179","last_updated":"2025-06-06T15:44:10Z","snapshot_observed_at":"2026-08-12T23:28:20.349441Z","submitted_at":"2025-06-06T15:44:10Z","title":"A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T06:10:19.422720Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2506.06179"},"observation_digest":"sha256:c18f38d617416d2f981ae4d531bbd4e39291e29c048bdfc220520dff87ec62c8","observation_id":"4de1ab7e-9de2-452b-9150-05f154133b75","resolution":{"observed_at":"2026-08-07T06:10:19.422720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-06T20:35:45.748309Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.02550","last_updated":"2025-07-03T11:49:56Z","snapshot_observed_at":"2026-08-06T20:24:01.502537Z","submitted_at":"2025-07-03T11:49:56Z","title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T20:35:45.748309Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2507.02550"},"observation_digest":"sha256:f7c541ee2405de94413ee518661c0edb8ec1e053e0e4789b21bdd301eaca0c92","observation_id":"9a3b1e9c-f6fe-44f1-9d6b-2972aaa0ce8d","resolution":{"observed_at":"2026-08-06T20:35:45.748309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2507.12549","last_updated":"2026-04-28T23:40:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-16T18:01:26Z","title":"The Serial Scaling Hypothesis","version":4},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-19T04:08:11.344622Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2507.12549"},"observation_digest":"sha256:6310d166f0b0c90a151fca61b7529bccbd778b0e0be0866c11235a3191012d7b","observation_id":"442c24ac-807f-4b9b-ad3c-065a2c9fe61d","resolution":{"observed_at":"2026-05-19T04:12:02.449702Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-06T15:54:32.921274Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.14777","last_updated":"2025-07-20T00:33:19Z","snapshot_observed_at":"2026-08-13T11:08:20.925430Z","submitted_at":"2025-07-20T00:33:19Z","title":"Rethinking Memorization Measures and their Implications in Large Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:54:32.921274Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2507.14777"},"observation_digest":"sha256:bd6e100fd7af44a53f27c281aa1e345558a656e53ee4122f36f8482795c62244","observation_id":"3f495db6-6e73-4c31-8b3b-5c85d0f97a6c","resolution":{"observed_at":"2026-08-06T15:54:32.921274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-13T23:04:32.343355Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":4},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-05-15T07:43:11.620446Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2510.25741"},"observation_digest":"sha256:84ee7f705b71d83d7927939d3d2fad8ed9aeaaa04137880ec5bac169abdff983","observation_id":"7fe3a340-0f92-4b32-8efc-207640ecebe6","resolution":{"observed_at":"2026-05-15T07:43:11.757752Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-04T07:31:49.264041Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-13T23:04:32.343355Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":5},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-04T07:31:49.264041Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2510.25741"},"observation_digest":"sha256:d1823545d4ca460149ea3e65833512f9bd763c0d5068188e3dc72ddcb2842529","observation_id":"6f347182-a335-4f9b-b658-b4214a5eb266","resolution":{"observed_at":"2026-08-04T07:31:49.264041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-03T12:57:45.253986Z","title":"1007/BFb0029635","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.01754","last_updated":"2026-05-29T06:13:48Z","snapshot_observed_at":"2026-08-07T06:37:12.140854Z","submitted_at":"2026-01-05T03:14:23Z","title":"Context-Free Recognition with Transformers","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T12:57:45.253986Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2601.01754"},"observation_digest":"sha256:1580a898077cc76e08c4bf52b37353c14e2dc47759deab37c3e9e404e836076f","observation_id":"4f7ecfea-a4f9-41e1-a60d-c1d7d35c80a7","resolution":{"observed_at":"2026-08-03T12:57:45.253986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2602.14814","last_updated":"2026-06-25T13:57:14Z","snapshot_observed_at":"2026-08-03T04:41:03.080168Z","submitted_at":"2026-02-16T15:07:51Z","title":"Learning State-Tracking from Code Using Linear RNNs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T21:46:14.287966Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2602.14814"},"observation_digest":"sha256:a271403acf13600aa6dfc19ebf07c2e3a8cdd894f05f5a90d1c6a6308c59cf89","observation_id":"9099aeb3-cb78-488f-8bc0-4eb1cb01e8bb","resolution":{"observed_at":"2026-05-15T21:46:42.371401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-02T23:07:48.566812Z","title":"Transformers learn shortcuts to automata.arXiv preprint arXiv:2210.10749,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14814","last_updated":"2026-06-25T13:57:14Z","snapshot_observed_at":"2026-08-03T04:41:03.080168Z","submitted_at":"2026-02-16T15:07:51Z","title":"Learning State-Tracking from Code Using Linear RNNs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T23:07:48.566812Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2602.14814"},"observation_digest":"sha256:f2285962e305878a0e50ecd2b9e91a59b9ac452c4de14c61bdf1f247911d12f4","observation_id":"58a2416f-22c8-488e-a97f-6b0a15e7ff13","resolution":{"observed_at":"2026-08-02T23:07:48.566812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-02T23:11:54.933099Z","title":"T., Goel, S., Krishnamurthy, A., and Zhang, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14872","last_updated":"2026-06-29T01:04:09Z","snapshot_observed_at":"2026-08-02T23:11:47.613570Z","submitted_at":"2026-02-16T16:03:08Z","title":"On the Emergence of Implicit Curriculum in RLVR Learning Dynamics","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T23:11:54.933099Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2602.14872"},"observation_digest":"sha256:08d2276465940a28fd332d33581f41195f97a9deda207bc80b0ba690ebc1349d","observation_id":"e1d9394b-eafa-4d0e-98f4-fd890b5ea548","resolution":{"observed_at":"2026-08-02T23:11:54.933099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2604.21215","last_updated":"2026-04-23T02:12:58Z","snapshot_observed_at":"2026-08-13T18:25:58.484752Z","submitted_at":"2026-04-23T02:12:58Z","title":"The Recurrent Transformer: Greater Effective Depth and Efficient Decoding","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-09T22:03:35.260373Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2604.21215"},"observation_digest":"sha256:01d4dbcac40b0ee6ce1fb39b21e0a5e8a10b58a9fc6715852ebede4544ecc340","observation_id":"3e08dc52-cc42-4d32-85cb-c2d2bb4baaef","resolution":{"observed_at":"2026-05-11T14:21:04.612914Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2604.21691","last_updated":"2026-04-23T13:58:12Z","snapshot_observed_at":"2026-08-02T12:48:50.592713Z","submitted_at":"2026-04-23T13:58:12Z","title":"There Will Be a Scientific Theory of Deep Learning","version":1},"reference_index":243,"source":"arxiv_source","source_observed_at":"2026-05-09T20:11:17.616190Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2604.21691"},"observation_digest":"sha256:a82fe679c1b7bc16d592554c414e33c3cd1e7ab3446f9e6ee4011c93333347ae","observation_id":"e081b988-246e-432b-95e6-ca9090bba7eb","resolution":{"observed_at":"2026-05-11T15:21:09.052414Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.05862","last_updated":"2026-05-07T08:31:33Z","snapshot_observed_at":"2026-07-06T23:18:26.864785Z","submitted_at":"2026-05-07T08:31:33Z","title":"Do Neural Operators Forget Geometry? The Forgetting Hypothesis in Deep Operator Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T14:43:03.403254Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.05862"},"observation_digest":"sha256:d588950dca43abba4d35d0d95b0c3803395d128bee2e20e988c418ffa8e22809","observation_id":"1ff35386-6736-469d-9aee-64d91b4d0c21","resolution":{"observed_at":"2026-05-11T18:41:10.875342Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.10019","last_updated":"2026-05-11T05:44:18Z","snapshot_observed_at":"2026-08-11T13:49:15.509208Z","submitted_at":"2026-05-11T05:44:18Z","title":"The two clocks and the innovation window: When and how generative models learn rules","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T03:15:45.257213Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.10019"},"observation_digest":"sha256:fc6e0d2eb4e29054fa052c232230c0089fc1af1a1d0f5c9bfffb05ec302087ce","observation_id":"81112096-4b4e-429a-8627-12c4a469f16f","resolution":{"observed_at":"2026-05-12T03:16:18.663325Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.12809","last_updated":"2026-05-12T23:01:29Z","snapshot_observed_at":"2026-07-06T23:24:27.821980Z","submitted_at":"2026-05-12T23:01:29Z","title":"Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-14T20:17:01.224864Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.12809"},"observation_digest":"sha256:f9bf719548cd40a2764562fc9cc7ca7250432750f2b6ac805545144b7e05b38a","observation_id":"2b1f22dc-b60d-4288-a0f4-7c625c13d22f","resolution":{"observed_at":"2026-05-14T20:17:54.590712Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.20988","last_updated":"2026-05-26T07:29:50Z","snapshot_observed_at":"2026-08-14T16:37:09.474758Z","submitted_at":"2026-05-20T10:23:03Z","title":"A Sharper Picture of Generalization in Transformers","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T06:01:03.524290Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.20988"},"observation_digest":"sha256:857938eba04fac54e7b2d1f4a81a39237d20561e6a22b4c07792db8986373418","observation_id":"a05b1fdf-2fee-4367-899a-225eb7f54f39","resolution":{"observed_at":"2026-05-21T06:03:59.311962Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.20988","last_updated":"2026-05-26T07:29:50Z","snapshot_observed_at":"2026-08-14T16:37:09.474758Z","submitted_at":"2026-05-20T10:23:03Z","title":"A Sharper Picture of Generalization in Transformers","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T17:22:30.861739Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.20988"},"observation_digest":"sha256:f7b4d1239d85a1577ecdb3a65a7cc0f86564e295a8e26ac7a033c248f76b29ad","observation_id":"9ed966bd-98b2-40e6-af23-d6c7b6e06202","resolution":{"observed_at":"2026-06-30T17:24:57.098974Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.22471","last_updated":"2026-05-21T13:32:20Z","snapshot_observed_at":"2026-08-02T11:52:59.155097Z","submitted_at":"2026-05-21T13:32:20Z","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-22T07:03:52.438466Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.22471"},"observation_digest":"sha256:249966c58351f42e013f0c2a33a016c80cd7c8279dc3da3cd91fe6a477b235cd","observation_id":"40218d6f-a608-4412-af61-ff896c6b4655","resolution":{"observed_at":"2026-05-22T07:04:41.429666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.26099","last_updated":"2026-06-05T05:36:49Z","snapshot_observed_at":"2026-07-06T23:36:01.564747Z","submitted_at":"2026-05-25T17:55:39Z","title":"Do Language Models Need Sleep? Offline Recurrence for Improved Online Inference","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T21:37:51.638904Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.26099"},"observation_digest":"sha256:702d0a40eef706fd0038c9d43d2ce4a56a045040113bc759e4ded60ee47ca9e2","observation_id":"12ba1f3d-d77c-4cfc-917e-08c45af40ffa","resolution":{"observed_at":"2026-06-29T21:43:59.505955Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2605.28600","last_updated":"2026-05-27T15:17:06Z","snapshot_observed_at":"2026-08-14T20:14:15.569517Z","submitted_at":"2026-05-27T15:17:06Z","title":"Transformers Provably Learn to Internalize Chain-of-Thought","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-29T14:29:10.010212Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2605.28600"},"observation_digest":"sha256:1fbac4bfe30602f9c2160759dfb21d8dd6c8246376e85fb087008433bfa07b8e","observation_id":"fd42cb4b-53fa-46c5-b0b6-a29b9b8c7dfa","resolution":{"observed_at":"2026-06-29T14:33:30.623410Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.00183","last_updated":"2026-05-29T14:58:03Z","snapshot_observed_at":"2026-08-13T00:33:18.445193Z","submitted_at":"2026-05-29T14:58:03Z","title":"Agentic Transformers Provably Learn to Search via Reinforcement Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T23:26:28.158991Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.00183"},"observation_digest":"sha256:a4e915b9664bfb05a072ba50628d8ee5ffd50c2263252c74c9de7c8ac8fd88df","observation_id":"49fef9f7-1329-402c-8c38-1bb5fc5ac7c3","resolution":{"observed_at":"2026-06-28T23:42:49.952878Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.03685","last_updated":"2026-06-02T14:09:16Z","snapshot_observed_at":"2026-08-07T10:48:20.979251Z","submitted_at":"2026-06-02T14:09:16Z","title":"A Close Look At World Model Recovery In Supervised Fine-Tuned LLM Planners","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T11:36:14.896698Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.03685"},"observation_digest":"sha256:e9b8c3796827a12f1ece76d12479b724a92a5de8eecd210aa217f6167313f1bc","observation_id":"6647f38c-8077-4a2f-b088-2ae9909aa345","resolution":{"observed_at":"2026-07-02T01:46:26.378690Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.06479","last_updated":"2026-07-24T17:49:34Z","snapshot_observed_at":"2026-08-14T18:04:48.986296Z","submitted_at":"2026-06-04T17:57:33Z","title":"Pretraining Recurrent Networks without Recurrence","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-28T02:09:01.018909Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.06479"},"observation_digest":"sha256:0005ef8fa441cf99ed597e0bdd3427b2f81981f3bfc54deebf3643893e54e091","observation_id":"56160b2b-987f-42d5-9049-b5788982be3d","resolution":{"observed_at":"2026-07-02T12:26:56.531884Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-02T12:20:55.718517Z","title":"Transform- ers learn shortcuts to automata","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.06479","last_updated":"2026-07-24T17:49:34Z","snapshot_observed_at":"2026-08-14T18:04:48.986296Z","submitted_at":"2026-06-04T17:57:33Z","title":"Pretraining Recurrent Networks without Recurrence","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-02T12:20:55.718517Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.06479"},"observation_digest":"sha256:58c8fbe1027e9d770d494c116ba1d67066713cbff9f1de52baded243829e9621","observation_id":"a00123fd-aaf9-4bc1-b3c7-0d7721d119c9","resolution":{"observed_at":"2026-08-02T12:20:55.718517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.07568","last_updated":"2026-05-26T02:19:47Z","snapshot_observed_at":"2026-08-13T16:10:49.659022Z","submitted_at":"2026-05-26T02:19:47Z","title":"A Systematic Study of Behavioral Cloning for Scientific Data Annotation","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-29T16:23:08.402194Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.07568"},"observation_digest":"sha256:41bac0e54921af46872e174afe2ffe2a92a217d40eb5d4485cbbbb07dbcf13da","observation_id":"f2a342aa-1bca-4cae-9ab3-ec3e11edd33e","resolution":{"observed_at":"2026-06-29T16:23:39.049076Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.18164","last_updated":"2026-06-16T17:01:57Z","snapshot_observed_at":"2026-07-30T03:30:31.097644Z","submitted_at":"2026-06-16T17:01:57Z","title":"Learning Dynamics of Chain-of-Thought State Tracking in a Solvable Transformer Model","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T21:49:03.896740Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.18164"},"observation_digest":"sha256:564995e65a7363148bba48221baf780dbfe0971280e28cb06ee26442f4044d0b","observation_id":"79f9775e-4088-4922-a345-9a23f911205b","resolution":{"observed_at":"2026-07-03T23:39:05.223791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.20347","last_updated":"2026-06-18T15:15:57Z","snapshot_observed_at":"2026-08-14T03:12:45.990611Z","submitted_at":"2026-06-18T15:15:57Z","title":"Critical Percolation as a Synthetic Data Model for Interpretability","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T17:41:29.317167Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.20347"},"observation_digest":"sha256:e1078576752f029dcef2ce62633c0611d4bf6fd3559294f40f07e71dff3a4d23","observation_id":"657ec5a5-be14-45a7-be74-8e2696e06f9a","resolution":{"observed_at":"2026-07-04T03:49:29.662839Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2606.26749","last_updated":"2026-06-25T08:33:34Z","snapshot_observed_at":"2026-08-01T16:00:20.311664Z","submitted_at":"2026-06-25T08:33:34Z","title":"Structure Before Collapse: Transient semantic geometry in next-token prediction","version":1},"reference_index":147,"source":"arxiv_source","source_observed_at":"2026-06-26T05:14:07.208255Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2606.26749"},"observation_digest":"sha256:2a25c87e0e11b23971c543579995fab1dd4117a5b520f7d62467e7cb43622e01","observation_id":"c4cc34ed-2a9c-4f98-94d3-6f293ebb5b2b","resolution":{"observed_at":"2026-07-04T13:29:51.073513Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":"2210.10749","doi":"10.48550/arxiv.2210.10749","metadata_source":"pith","pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":"cs.LG","work_id":"3ddecc42-e382-4992-8629-bf2da160120c","year":2022},"citing_paper":{"arxiv_id":"2607.08196","last_updated":"2026-07-09T07:54:39Z","snapshot_observed_at":"2026-08-07T00:25:36.849231Z","submitted_at":"2026-07-09T07:54:39Z","title":"A First-Principles Theory of Slow Thinking and Active Perception","version":1},"reference_index":106,"source":"pdf_text","source_observed_at":"2026-07-10T11:32:24.374377Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2607.08196"},"observation_digest":"sha256:42e2ce1007bc73ea52e2a8b4f5e9a50a944c400facd81b6f48e05449fe4292fa","observation_id":"fd43a091-3977-4800-8a3e-e37d8cc561dd","resolution":{"observed_at":"2026-07-10T11:37:03.236616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-02T07:20:39.305688Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11953","last_updated":"2026-08-06T23:25:08Z","snapshot_observed_at":"2026-08-13T20:13:55.942126Z","submitted_at":"2026-07-11T21:33:32Z","title":"When Does Reward Teach State? A Hidden-Automaton Instrument and a Group-Language Warning Signal","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T07:20:39.305688Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2607.11953"},"observation_digest":"sha256:f29af25227386b9eba854cb395ddf9f2ec59888e3ef8722d15039e324376903a","observation_id":"c567fd28-cc10-46ca-9f8f-540a197b882b","resolution":{"observed_at":"2026-08-02T07:20:39.305688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-01T20:54:18.389511Z","title":"arXiv preprint arXiv:2210.10749 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16528","last_updated":"2026-07-17T22:09:01Z","snapshot_observed_at":"2026-08-07T07:19:10.753414Z","submitted_at":"2026-07-17T22:09:01Z","title":"Hierarchical Domain Generalization","version":1},"reference_index":172,"source":"arxiv_source","source_observed_at":"2026-08-01T20:54:18.389511Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2607.16528"},"observation_digest":"sha256:0ede1f39151b3d5dc2a412cd25dac4d6c9519c1af05d51ce3e9468ff21d6b51a","observation_id":"6460473a-1666-4202-bf6e-93dfefaca180","resolution":{"observed_at":"2026-08-01T20:54:18.389511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-01T08:50:28.180150Z","title":"Transformers learn shortcuts to automata","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21000","last_updated":"2026-07-23T07:34:07Z","snapshot_observed_at":"2026-08-11T13:49:54.005517Z","submitted_at":"2026-07-23T07:34:07Z","title":"Naju: A Native Discrete State-Space Model with Independent Retention and Writing for Long-Sequence Memory","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T08:50:28.180150Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2607.21000"},"observation_digest":"sha256:8106932fc3f98d6788f50423c364d2bbd49602630485c1b584e76b62f7a7dc95","observation_id":"643edcf8-3e44-44a7-946f-a011eac12d90","resolution":{"observed_at":"2026-08-01T08:50:28.180150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.10749","snapshot_observed_at":"2026-08-08T00:18:21.309970Z","title":"Ash, Surbhi Goel, Akshay Krishnamurthy, and Cyril Zhang","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.04243","last_updated":"2026-08-04T21:52:04Z","snapshot_observed_at":"2026-08-13T22:48:52.401384Z","submitted_at":"2026-08-04T21:52:04Z","title":"Attention-based representations for multi-task computation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T00:18:21.309970Z"},"links":{"cited_paper":"/paper/2210.10749","citing_paper":"/paper/2608.04243"},"observation_digest":"sha256:2602d6c0427500f5c960cc07d98eb119845b6900d51704255e27d3433c670a28","observation_id":"caefcef9-4e90-4bb7-942e-547adae906e2","resolution":{"observed_at":"2026-08-08T00:18:21.309970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2210.10749/citation-record","integrity":"/paper/2210.10749/integrity","json":"/paper/2210.10749/citation-record.json","paper":"/paper/2210.10749"},"outbound":[],"paper":{"arxiv_id":"2210.10749","last_updated":"2023-05-02T14:16:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T14:01:48.705870Z","submitted_at":"2022-10-19T17:45:48Z","title":"Transformers Learn Shortcuts to Automata"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 46 inbound Pith citation observations for arXiv:2210.10749."}