{"as_of":"2026-08-07T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aec885e71054cfcbbf47dc74a1bea2c96b0dcc395f7dbcb3c1fabe7fef0d7e28","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T15:53:19.680424Z","state":"measured"},{"denominator":76,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":76,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:22:30.480923Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2604.21254","last_updated":"2026-07-02T01:19:03Z","snapshot_observed_at":"2026-08-06T10:48:44.855597Z","submitted_at":"2026-04-23T03:46:14Z","title":"Hyperloop Transformers","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T23:09:35.640412Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2604.21254"},"observation_digest":"sha256:a43fe70c1259dfea3935cd0f66a5ad37e9407e89a27332408700f3a7313bfcef","observation_id":"7b52531a-c3bf-4142-bb0e-0bdfd560d7c8","resolution":{"observed_at":"2026-05-11T14:16:04.583346Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.06322","last_updated":"2026-05-27T19:46:02Z","snapshot_observed_at":"2026-07-06T23:18:46.145104Z","submitted_at":"2026-05-07T14:21:26Z","title":"SMolLM: Small Language Models Learn Small Molecular Grammar","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-08T12:57:47.721361Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.06322"},"observation_digest":"sha256:a17e2fa92f03802b3df48884906f7361514df0ad79096f1710c82fdc9866d303","observation_id":"33ac2e81-d297-4505-9a53-f10cf490f5cb","resolution":{"observed_at":"2026-05-11T19:01:17.195623Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.07721","last_updated":"2026-05-19T08:08:32Z","snapshot_observed_at":"2026-08-02T23:35:32.635346Z","submitted_at":"2026-05-08T13:25:27Z","title":"Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-11T02:44:36.697450Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.07721"},"observation_digest":"sha256:b1e79be71637aee8f7a695afaa445c4c8bc66227a5bce0e64adae0438fbbb3f0","observation_id":"5d62573f-86fd-4b26-8092-321d1a1b9050","resolution":{"observed_at":"2026-05-11T02:45:57.763917Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.07721","last_updated":"2026-05-19T08:08:32Z","snapshot_observed_at":"2026-08-02T23:35:32.635346Z","submitted_at":"2026-05-08T13:25:27Z","title":"Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-20T23:01:17.957634Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.07721"},"observation_digest":"sha256:86d4197c7fd1661afd51a4deb1f31034264514a67f3b2360fbd0a42e3a8e76a1","observation_id":"5aad310a-faa1-444c-a08e-d523bc603188","resolution":{"observed_at":"2026-05-20T23:03:50.576675Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.16048","last_updated":"2026-05-15T15:18:12Z","snapshot_observed_at":"2026-07-06T23:27:15.745896Z","submitted_at":"2026-05-15T15:18:12Z","title":"Looped SSMs: Depth-Recurrence and Input Reshaping for Time Series Classification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T21:00:08.834902Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.16048"},"observation_digest":"sha256:d7bec25bd71e6a2a3d2d1e7fbe449d88bbd47d12a0ba0a8e296dcadc756a3752","observation_id":"3607a9d9-eb34-4926-819b-1cf7b7ead405","resolution":{"observed_at":"2026-05-20T21:03:46.812477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.18797","last_updated":"2026-05-25T04:21:17Z","snapshot_observed_at":"2026-08-02T05:53:57.809613Z","submitted_at":"2026-05-11T07:21:53Z","title":"Simply Stabilizing the Loop via Fully Looped Transformer","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-20T23:19:28.027625Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.18797"},"observation_digest":"sha256:b4753a7f7e13e64f583cfafc6d53bfc3ef6e2c4ba08bea8362ad6c26c6098232","observation_id":"a15dbdce-d234-409b-a0ab-19e6b0632884","resolution":{"observed_at":"2026-05-20T23:23:51.725324Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2605.30757","last_updated":"2026-05-29T02:38:49Z","snapshot_observed_at":"2026-08-02T17:50:24.929681Z","submitted_at":"2026-05-29T02:38:49Z","title":"Chain-of-Thought and Compressed Looped Transformers: A Memory-Budget Separation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T23:17:12.797287Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2605.30757"},"observation_digest":"sha256:e1ebd862a3729e2a213cfef339818112833c53d27a8cd0ffa818aadccc429c99","observation_id":"5cbadd38-9bf3-4ebf-b10e-52ace2e609b4","resolution":{"observed_at":"2026-06-28T23:22:47.382110Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2606.04438","last_updated":"2026-06-03T04:38:12Z","snapshot_observed_at":"2026-08-01T12:51:21.205713Z","submitted_at":"2026-06-03T04:38:12Z","title":"LoopMoE: Unifying Iterative Computation with Mixture-of-Experts for Language Modeling","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T07:19:31.075298Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2606.04438"},"observation_digest":"sha256:fe4a5d5411babd895c68b0eefcdaf5b8069557132d539072b65f95856a0b42d5","observation_id":"df30531a-35d4-40b6-bfcd-1bd4c0310d9b","resolution":{"observed_at":"2026-07-02T06:36:44.173841Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2606.18206","last_updated":"2026-06-16T17:36:33Z","snapshot_observed_at":"2026-08-02T16:48:27.851712Z","submitted_at":"2026-06-16T17:36:33Z","title":"Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-06-27T00:38:47.350106Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2606.18206"},"observation_digest":"sha256:b4030cf1248732fee1a9eaeb19e662652e133e16183aba5eeb5112f158d83d21","observation_id":"8905cecb-f669-4a74-be1e-2a2e71e1ed7c","resolution":{"observed_at":"2026-06-27T00:40:17.905781Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":"2604.11791","doi":"10.48550/arxiv.2604.11791","metadata_source":"pith","pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","venue":"cs.LG","work_id":"2cdbf5cc-3a10-4a8e-b19a-1f9f1f5286ed","year":2026},"citing_paper":{"arxiv_id":"2606.24898","last_updated":"2026-06-12T13:23:18Z","snapshot_observed_at":"2026-07-06T23:59:23.407216Z","submitted_at":"2026-06-12T13:23:18Z","title":"Dense Supervision Is Not Enough: The Readout Blind Spot in Looped Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T04:27:48.590008Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2606.24898"},"observation_digest":"sha256:8fce0d3b1585d62a72ef4f8a8a07782ee85ae15b224afe4ed9d256788c264626","observation_id":"d8dcceb3-c59e-4bfd-adb0-55e845c8e8de","resolution":{"observed_at":"2026-07-03T17:08:44.022428Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-01T23:22:30.480923Z","title":"William Brandon et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15456","last_updated":"2026-07-24T02:15:23Z","snapshot_observed_at":"2026-08-02T19:24:36.291795Z","submitted_at":"2026-07-16T20:58:16Z","title":"Looped Latent Attention: Cross-Loop KV Compression for Looped Transformers","version":2},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T23:22:30.480923Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2607.15456"},"observation_digest":"sha256:9d2d8c0ef1408e6efa8530b99a93daad6953c0d397ea08be880ae958f076ba66","observation_id":"6a53af8d-45c1-48bc-aad2-09f2e4f742d3","resolution":{"observed_at":"2026-08-01T23:22:30.480923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-01T15:05:00.270825Z","title":"Blayney, ´A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18584","last_updated":"2026-07-20T23:43:26Z","snapshot_observed_at":"2026-08-03T06:07:39.238885Z","submitted_at":"2026-07-20T23:43:26Z","title":"On the Diverse Dynamical Behaviors Arising in Deep Linear Transformers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:05:00.270825Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2607.18584"},"observation_digest":"sha256:9e5be50e4b45cfaec8198a5aafb1630d0f26900ae2d4a20be6db95a15f594da2","observation_id":"7a498d77-a08a-43bd-8358-826a1646e612","resolution":{"observed_at":"2026-08-01T15:05:00.270825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.11791","snapshot_observed_at":"2026-08-01T10:14:10.628781Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20594","last_updated":"2026-07-22T16:04:31Z","snapshot_observed_at":"2026-08-07T01:30:36.940347Z","submitted_at":"2026-07-22T16:04:31Z","title":"When Does Recurrence Become an Algorithm? Convergence Selection in Weight-Tied Looped Transformers","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:10.628781Z"},"links":{"cited_paper":"/paper/2604.11791","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:8b1d4ad62228e4dd34d1bd2cb84018c084302ff4923d0e4a0358433b2e9bef76","observation_id":"d99a086c-057f-4bfa-9578-2f36102864a4","resolution":{"observed_at":"2026-08-01T10:14:10.628781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.11791/citation-record","integrity":"/paper/2604.11791/integrity","json":"/paper/2604.11791/citation-record.json","paper":"/paper/2604.11791"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-06T10:13:00.684351Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":"2006.05205","doi":"10.48550/arxiv.2006.05205","metadata_source":"pith","pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the bottleneck of graph neural networks and its practical implications","venue":"cs.LG","work_id":"4dc88c40-c0d4-4c5d-a0f9-5c863c1fabdc","year":2020},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:a5791fa7a59fafad227100887e7d7d25e350a123901a11cd0096446549c1c0cb","observation_id":"844656d0-1f9e-4ede-a625-7559aab441fb","resolution":{"observed_at":"2026-05-11T09:41:03.008614Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.10818","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:56:28.813019Z","title":"On vanishing gradients, over- smoothing, and over-squashing in gnns: Bridging recurrent and graph learning.arXiv preprint arXiv:2502.10818","venue":null,"work_id":"ca2fef83-4d9d-47d7-8c77-8c4ad5e264c8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:041ee3362c85faa51165c348e1106111c8cab8ca45ddc030dd99c594ff03cc34","observation_id":"6a64318a-b480-4d33-8eeb-1209eae0e8c7","resolution":{"observed_at":"2026-05-11T09:41:02.642182Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.10524","doi":"10.48550/arxiv.2507.10524","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mixture-of-recursions: Learning dynamic recur- sive depths for adaptive token-level computation.arXiv preprint arXiv:2507.10524","venue":"arXiv (Cornell University)","work_id":"ed1d0e33-93b9-4552-99a2-207324938ead","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:1e4ded5f3e32059a3239a9d8d05efcc41c67d5f90f963b5f44dd6b9547e3e77f","observation_id":"b1698357-8025-453a-84c7-0d128ff633a4","resolution":{"observed_at":"2026-05-11T09:41:02.922847Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.05407","last_updated":"2021-09-02T08:48:41Z","snapshot_observed_at":"2026-07-06T11:28:17.810519Z","submitted_at":"2021-07-12T13:24:03Z","title":"PonderNet: Learning to Ponder","version":2},"cited_work":{"arxiv_id":"2107.05407","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.05407","snapshot_observed_at":"2026-07-04T13:29:51.946645Z","title":"Pondernet: Learning to ponder.CoRR, abs/2107.05407","venue":null,"work_id":"dbab54b9-3aa6-4f4d-8117-aa3c5ff6a0fd","year":2021},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2107.05407","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:1ae3d60c068a310f1be917059d33a361c95f98d434224cfeef39c7b2710f79b1","observation_id":"25990763-3324-4904-ad94-e6ef127ac48e","resolution":{"observed_at":"2026-05-11T09:41:02.964220Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.02732","last_updated":"2025-08-05T16:43:21Z","snapshot_observed_at":"2026-07-06T21:03:45.452337Z","submitted_at":"2025-04-03T16:17:55Z","title":"Why do LLMs attend to the first token?","version":4},"cited_work":{"arxiv_id":"2504.02732","doi":"10.48550/arxiv.2504.02732","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.02732","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Why do llms attend to the first token?","venue":"arXiv (Cornell University)","work_id":"298dab4e-c69c-4720-af0e-c20f50c58b39","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2504.02732","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:72eec26207c53d1a147edc24104e8c127d24c1922553b28340ee9a381fc3afd4","observation_id":"0843e282-60df-4218-81b2-4550d2e86ffa","resolution":{"observed_at":"2026-05-11T09:41:02.668349Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.08450","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T19:37:19.105131Z","title":null,"venue":null,"work_id":"063acdb6-b563-4682-a1b8-996110bb0113","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:cad2db3234c2b09c1c2b51c4bd837b908ece067d6173d384a45ede995f1ca8a7","observation_id":"7bdc3169-e0fa-4cd6-87c2-a4e2065a2b4f","resolution":{"observed_at":"2026-05-11T09:41:02.939804Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2006.13318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-07-04T08:49:42.010484Z","title":"A Note on Over-Smoothing for Graph Neural Networks, June 2020","venue":null,"work_id":"357166af-f327-48bd-8c0f-de9fc925688c","year":2006},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:5800f838d07bf8f2f5dd70b5c271473621fd03b0d46c9b483f600149353c6d89","observation_id":"42219ca9-eb8d-4fdd-be3b-a3fd83f865d7","resolution":{"observed_at":"2026-05-11T09:41:03.018771Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:9973aa70196bebbda06e79186337f6f1bdf4df83b2233d027537a5bbc5f9124a","observation_id":"7e55f518-98d0-4106-a696-fe08960aae4a","resolution":{"observed_at":"2026-05-11T09:41:03.034516Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.05522","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T14:44:45.291468Z","title":"Continuous thought machines","venue":null,"work_id":"7824ca73-1ddf-4663-97e9-a4b78a498383","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:7daec950f3f54f48292a57d16deb9717b26790a3b1266f6f0393164f68cc0b89","observation_id":"9896484e-73bf-4218-a79a-2195854c1e72","resolution":{"observed_at":"2026-05-11T09:41:03.003669Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03819","last_updated":"2019-03-05T16:46:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-07-10T18:39:15Z","title":"Universal Transformers","version":3},"cited_work":{"arxiv_id":"1807.03819","doi":"10.48550/arxiv.1807.03819","metadata_source":"pith","pith_arxiv_id":"1807.03819","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Universal Transformers","venue":"cs.CL","work_id":"8e5baefe-d209-411c-aefc-5acaa9275c8a","year":2018},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/1807.03819","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:ac80d9b8560f04a362e83945214f37c89ef0b1fec60fd50048665fa4b6709912","observation_id":"6edce7df-1359-4879-8b1f-84837ce51d02","resolution":{"observed_at":"2026-05-13T08:04:31.534239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05171","last_updated":"2025-02-17T17:14:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-07T18:55:02Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","version":2},"cited_work":{"arxiv_id":"2502.05171","doi":"10.1016/0041-5553(81)90075-6","metadata_source":"pith","pith_arxiv_id":"2502.05171","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","venue":"cs.LG","work_id":"1ee7474f-a930-486e-897c-207b8755f2c9","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2502.05171","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:fd4375dd53812f465219d95a05e14937db57ff22659b8d8a8a0c09386d632e41","observation_id":"c067143a-498c-41c7-9d87-e2e49b0b1421","resolution":{"observed_at":"2026-05-12T15:39:41.804715Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08983","last_updated":"2017-02-21T16:21:21Z","snapshot_observed_at":"2026-08-04T14:24:45.814840Z","submitted_at":"2016-03-29T22:09:00Z","title":"Adaptive Computation Time for Recurrent Neural Networks","version":6},"cited_work":{"arxiv_id":"1603.08983","doi":"10.48550/arxiv.1603.08983","metadata_source":"pith","pith_arxiv_id":"1603.08983","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Adaptive Computation Time for Recurrent Neural Networks","venue":"cs.NE","work_id":"75565443-173e-479c-b0e7-d2464e7630be","year":2016},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/1603.08983","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:e329636da78703dc6b88844221d90f00f47ac71d4d344a1ec94f0688f264e246","observation_id":"7186fe55-a4fe-4fc0-8b3f-47763c133da3","resolution":{"observed_at":"2026-05-12T11:53:22.734695Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10781","last_updated":"2025-03-02T14:37:53Z","snapshot_observed_at":"2026-08-02T20:46:05.666977Z","submitted_at":"2024-10-14T17:50:28Z","title":"When Attention Sink Emerges in Language Models: An Empirical View","version":2},"cited_work":{"arxiv_id":"2410.10781","doi":"10.48550/arxiv.2410.10781","metadata_source":"pith","pith_arxiv_id":"2410.10781","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"When Attention Sink Emerges in Language Models: An Empirical View","venue":"cs.CL","work_id":"ab480e70-3517-4875-81ef-6cc6fa6db46d","year":2024},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2410.10781","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:c1dc696f231b518d6c6d015e62fda3dcd61a455925e0bd0a3ee76186787befa6","observation_id":"96b2f2a4-e3f0-4649-a485-cdbbfdea2a10","resolution":{"observed_at":"2026-05-16T17:41:03.919229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:e2f003b81698773ca5878a1efe0b3db7579563a04709d918e460745e3d11a13b","observation_id":"2fbe47ba-18ee-41bb-a588-efbbec0a4aec","resolution":{"observed_at":"2026-05-11T09:41:02.881107Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.07624","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Return of chebnet: Understanding and improving an overlooked gnn on long range tasks.arXiv preprint arXiv:2506.07624","venue":null,"work_id":"b5c62d96-7dfe-44a4-a194-2944cd8aa0a7","year":null},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:1de7adb4d8c16265bd0efa36e6e11fa1d48e6e9467f77135097735e04a10fa76","observation_id":"7d73d706-ef5b-4a43-ae6b-97824193e1a0","resolution":{"observed_at":"2026-05-11T09:41:02.732352Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.04871","last_updated":"2025-10-06T14:58:08Z","snapshot_observed_at":"2026-07-06T22:31:49.574184Z","submitted_at":"2025-10-06T14:58:08Z","title":"Less is More: Recursive Reasoning with Tiny Networks","version":1},"cited_work":{"arxiv_id":"2510.04871","doi":"10.48550/arxiv.2510.04871","metadata_source":"pith","pith_arxiv_id":"2510.04871","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Less is More: Recursive Reasoning with Tiny Networks","venue":"cs.LG","work_id":"749dbba1-fbff-4b07-a1a7-9ccf98494da2","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2510.04871","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:6c96f075d93298067f936743ffa7983c581771f9bd5e570e392012f0d88d1606","observation_id":"14b3ee3b-2ffa-4dd2-8848-7af06d2db886","resolution":{"observed_at":"2026-05-15T04:53:09.592494Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-14T04:50:12.755816+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T04:50:12.755816+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11279","last_updated":"2024-10-15T04:57:02Z","snapshot_observed_at":"2026-07-06T19:33:39.134036Z","submitted_at":"2024-10-15T04:57:02Z","title":"Advancing the Understanding of Fixed Point Iterations in Deep Neural Networks: A Detailed Analytical Study","version":1},"cited_work":{"arxiv_id":"2410.11279","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.11279","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ke, Y ., Li, X., Liang, Y ., Shi, Z., and Song, Z","venue":null,"work_id":"c87305c9-50c2-4ec9-ab9b-b955cc790356","year":null},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2410.11279","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:cf9066bf63cde5450067cb666b21cb2294e2287342b90511e0ac794d5661e372","observation_id":"e9a0eee5-bd97-4f42-a0e2-140289182212","resolution":{"observed_at":"2026-05-11T09:41:02.617928Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.07358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T13:15:45.633826Z","title":"Encode, think, decode: Scaling test-time reasoning with recursive latent thoughts.CoRR, abs/2510.07358","venue":null,"work_id":"427ccd8e-7f71-4731-a046-a1b724d158d8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:b9a6d2a8effbcc377249acd5607ae423903c2f342183c37914184652009e0f6e","observation_id":"d2a6aba4-a961-4cf2-9eb6-439cb4b5f152","resolution":{"observed_at":"2026-05-11T09:41:02.603746Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19384","last_updated":"2025-06-16T10:21:00Z","snapshot_observed_at":"2026-07-06T18:38:05.229292Z","submitted_at":"2024-06-27T17:57:03Z","title":"The Remarkable Robustness of LLMs: Stages of Inference?","version":3},"cited_work":{"arxiv_id":"2406.19384","doi":"10.48550/arxiv.2406.19384","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.19384","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2406.19384 , year=","venue":"arXiv (Cornell University)","work_id":"0693ff02-dd9d-4b9b-b17d-a09c0c5f9c52","year":2024},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2406.19384","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:333b9cf5642c722c41c711c54d6572f37e846901bf799f0361866d551dca9451","observation_id":"fa14fa85-8bc7-469a-8d3a-ea358e909a99","resolution":{"observed_at":"2026-05-11T09:41:02.710861Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.02199","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T23:22:47.376851Z","title":"Latent chain-of-thought? decoding the depth-recurrent transformer.CoRR, abs/2507.02199","venue":null,"work_id":"5da2918e-7757-41da-b7b8-0e1da7f711e5","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:92b28fe7c154d68dd7f171c407065b64c649c59aa3b9e4094a2bcd6104fe4b23","observation_id":"c636a9cc-f240-4ac7-92ae-4ddbac729e24","resolution":{"observed_at":"2026-05-11T09:41:02.701399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.07384","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T06:36:44.173284Z","title":"Bartoldson, Bhavya Kailkhura, Avi Schwarzschild, Jonas Geiping, Tom Goldstein, and Micah Goldblum","venue":null,"work_id":"9157a551-e862-4655-a5f4-7f4d6ca01c36","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:37d88fb6a7103862f2ea468cf70060736973a435f5fde73fc1f87cdbaf06fead","observation_id":"013fbafb-933f-4d60-b9f7-165685c749bb","resolution":{"observed_at":"2026-05-11T09:41:02.896029Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.23012","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T21:16:13.454500Z","title":"Softmax is1 /2-Lipschitz: A tight bound across all ℓ𝑝 norms","venue":null,"work_id":"deaf466f-bc3b-45c1-9b73-08822a3ae97a","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:3b9706a10fa55bbd734afc94c47fe5caaa255d9e3f1a3371f5fd7a8ca820633c","observation_id":"ccd409e9-1ebf-4ebf-b3eb-29961993d53d","resolution":{"observed_at":"2026-05-11T09:41:02.780353Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.23314","doi":"10.48550/arxiv.2509.23314","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two-scale latent dynamics for recurrent-depth transformers.CoRR, abs/2509.23314","venue":"ArXiv.org","work_id":"d99cf72c-6f8e-4f72-bc2f-791aab956f91","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:6c904b24155426cbc8a0bd8d7d398431c7965f994d23afd9405e76f37653697d","observation_id":"ba28b729-f7fe-44d2-8873-ed9492de677f","resolution":{"observed_at":"2026-05-11T09:41:02.684769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.06477","doi":"10.48550/arxiv.2510.06477","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2510.06477 , year=","venue":"ArXiv.org","work_id":"96bbe6e4-8e47-4301-a6e2-72c0606a8004","year":2026},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:a63d62a106b60026120106887fa71475faade50615cd4a42e063de45719432eb","observation_id":"f1de073b-72e2-4381-9554-58b00e32116b","resolution":{"observed_at":"2026-05-11T09:41:03.044416Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2504.03889","doi":"10.48550/arxiv.2504.03889","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Using attention sinks to identify and evaluate dormant heads in pretrained llms","venue":"Open MIND","work_id":"3a443f30-3621-4015-8cb5-5aca389e52cd","year":null},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:d33fab909ddbe0c805d9e0ae19f2e02b59a83870167ba3c3589765d9e8713ed2","observation_id":"1206c2c8-2a80-4297-8041-60a9750b04ff","resolution":{"observed_at":"2026-05-11T09:41:02.955625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17416","last_updated":"2025-02-24T18:49:05Z","snapshot_observed_at":"2026-07-06T20:41:51.646955Z","submitted_at":"2025-02-24T18:49:05Z","title":"Reasoning with Latent Thoughts: On the Power of Looped Transformers","version":1},"cited_work":{"arxiv_id":"2502.17416","doi":"10.48550/arxiv.2502.17416","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.17416","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2502.17416 (2025)","venue":"ArXiv.org","work_id":"76f16ec7-dba4-4c60-be1b-d9036142c3b7","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2502.17416","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:076ccd42a8f989bdbe8b3d9778433669769aead4c10c554a3853dc643c21f92c","observation_id":"8238998c-ea2c-49cb-84a9-081882e34dc2","resolution":{"observed_at":"2026-05-11T09:41:02.869528Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-01T13:38:11.849962+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T13:38:11.849962+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07096","last_updated":"2023-10-11T00:38:57Z","snapshot_observed_at":"2026-07-06T16:30:50.253688Z","submitted_at":"2023-10-11T00:38:57Z","title":"Sparse Universal Transformer","version":1},"cited_work":{"arxiv_id":"2310.07096","doi":"10.48550/arxiv.2310.07096","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07096","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse universal transformer","venue":"arXiv (Cornell University)","work_id":"e0c6b78a-a691-4684-8ebd-f8f3939313ca","year":2023},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2310.07096","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:d47f14cbf709dfc38a57b2f5c284d060b5521fd65a50dfb363748de8cac53426","observation_id":"35dbbb7e-74bb-490c-bb38-c6a64843d132","resolution":{"observed_at":"2026-05-11T09:41:02.824241Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01104","last_updated":"2025-05-30T23:46:05Z","snapshot_observed_at":"2026-08-04T01:13:18.607682Z","submitted_at":"2024-10-01T22:22:35Z","title":"Softmax is not Enough (for Sharp Size Generalisation)","version":3},"cited_work":{"arxiv_id":"2410.01104","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01104","snapshot_observed_at":"2026-07-03T20:48:55.231700Z","title":"Softmax is not enough (for sharp size generali- sation)","venue":null,"work_id":"5ad2cac1-e51c-49b3-a6d6-61d3c1762a5a","year":2024},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2410.01104","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:5decdf7ccc5bc59a593e035e52956ab77d99f78243a84b48eaec24e77432907b","observation_id":"eb6ff732-7a80-4786-ac25-2aa8942f7a93","resolution":{"observed_at":"2026-05-11T09:41:02.845350Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.21734","last_updated":"2025-08-04T08:45:08Z","snapshot_observed_at":"2026-08-06T13:55:12.607273Z","submitted_at":"2025-06-26T19:39:54Z","title":"Hierarchical Reasoning Model","version":3},"cited_work":{"arxiv_id":"2506.21734","doi":"10.48550/arxiv.2506.21734","metadata_source":"pith","pith_arxiv_id":"2506.21734","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hierarchical Reasoning Model","venue":"cs.AI","work_id":"81fb438f-27d0-4a73-8fa3-5e65f127ca94","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2506.21734","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:cf761b336c3d728b01193c45f51645e09dbb4825bf5659f9eba68802cdd35bd4","observation_id":"bb7fa5b4-082e-465f-99fd-7b0eba6fe762","resolution":{"observed_at":"2026-05-15T04:58:03.874482Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-25T17:53:21.543618+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T17:53:21.543618+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":"2309.17453","doi":"10.48550/arxiv.2309.17453","metadata_source":"pith","pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Streaming Language Models with Attention Sinks","venue":"cs.CL","work_id":"a8d25452-c237-48c9-88a4-682717c3979a","year":2023},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:6e2e1e5302338d0fe1934c40c345017c3b8caa3a18ea9adf45837a40dca250c3","observation_id":"320ecbd1-b016-4748-be28-f5d7dc25916a","resolution":{"observed_at":"2026-05-11T09:41:02.852598Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01405","last_updated":"2025-06-05T13:30:23Z","snapshot_observed_at":"2026-07-06T19:25:56.114976Z","submitted_at":"2024-10-02T10:31:17Z","title":"On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encoding","version":7},"cited_work":{"arxiv_id":"2410.01405","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01405","snapshot_observed_at":"2026-06-29T08:53:16.101915Z","title":"arXiv preprint arXiv:2410.01405 , year=","venue":null,"work_id":"e956dd7e-c885-4039-ab9c-c01607af7e4d","year":null},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2410.01405","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:51ce93a07ba07a9a5232f25957108eeab74edbeafaf5485f29b7c064b811b1e2","observation_id":"0c8f329f-25da-4a7e-817c-b2c0a7016367","resolution":{"observed_at":"2026-05-11T09:41:02.994569Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12424","last_updated":"2024-03-16T21:10:38Z","snapshot_observed_at":"2026-07-06T16:50:26.807430Z","submitted_at":"2023-11-21T08:32:38Z","title":"Looped Transformers are Better at Learning Learning Algorithms","version":3},"cited_work":{"arxiv_id":"2311.12424","doi":"10.48550/arxiv.2311.12424","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.12424","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Looped transformers are better at learning learning algorithms.arXiv preprint arXiv:2311.12424","venue":"arXiv (Cornell University)","work_id":"106dc53d-89b5-4d70-922b-1c41185d4328","year":2023},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2311.12424","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:5956237454614916bdc34185a5fa29ded6d0afb337035071638f0a92d3a636ab","observation_id":"31921472-32b9-46a1-bc72-4cf406615250","resolution":{"observed_at":"2026-05-11T09:41:02.876059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.07814","last_updated":"2025-07-10T14:45:31Z","snapshot_observed_at":"2026-08-07T06:16:34.904956Z","submitted_at":"2025-07-10T14:45:31Z","title":"Pay Attention to Attention Distribution: A New Local Lipschitz Bound for Transformers","version":1},"cited_work":{"arxiv_id":"2507.07814","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.07814","snapshot_observed_at":"2026-07-02T16:27:09.092002Z","title":"Pay attention to attention distribution: A new lo- cal lipschitz bound for transformers","venue":null,"work_id":"bb846013-c7a8-4008-8b5f-1849e8605ba0","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2507.07814","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:ac0a1603a3e9a36a9f767b6458b8fc3efe2f77a0f96d9acc5cb732ed4b8c50bc","observation_id":"7b25e135-81a5-4a00-9d06-5c962785b0d8","resolution":{"observed_at":"2026-05-11T09:41:02.760958Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-04T07:30:51.188041Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":5},"cited_work":{"arxiv_id":"2510.25741","doi":"10.48550/arxiv.2510.25741","metadata_source":"pith","pith_arxiv_id":"2510.25741","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling Latent Reasoning via Looped Language Models","venue":"cs.CL","work_id":"0c087b6b-1850-498b-9197-a0a85ed89937","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"cited_paper":"/paper/2510.25741","citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:476b5a5b268ab0706728586c8f09928abd445a9e0058c6b42c31575032d6b8dd","observation_id":"6eb5610e-c7a4-4b21-b665-46a9a9ef9cc1","resolution":{"observed_at":"2026-05-15T07:43:12.191103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:19:22.789498+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:19:22.789498+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"B 𝑓 𝑗+1 (0) (Y )","venue":null,"work_id":"df7c749b-8f06-4897-8bf0-25ef6c93d7c4","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:62086aedd1e8e77786a83248729b3830b47357bcf039cb4fb3d15516abb1e2fe","observation_id":"e246ef75-be83-474b-94a1-a6bce069b6e6","resolution":{"observed_at":"2026-05-17T18:10:04.551633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hello! I’ve been well. I hope that you’re doing well","venue":null,"work_id":"4996fea7-a767-4246-8d63-097e1e0e7cef","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:ae6f809a1857d0e424edd65dc823417a70b623761915c8390a4f904711c2d954","observation_id":"d1bb449b-5ea7-4146-bd7e-5bbba18beade","resolution":{"observed_at":"2026-05-17T18:10:04.548414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Our small training runs in Sec","venue":null,"work_id":"5b4cb400-10a5-4ba5-bbb5-fe4fd07ebdd9","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:b7052e8fc1b68e5a8b7b4141dc107f7b5be98ec48ac50d346435b5ecf0385df7","observation_id":"a5faf73e-1254-4c25-9364-8dc92b3a5354","resolution":{"observed_at":"2026-05-17T18:10:04.514856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"60197d9b-fa39-43ed-b287-1978af0f07fb","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:1c0f080b610d6edf0bb0a5081716795fcb128e0e1f113ea2a87862ec7c9b31ef","observation_id":"d587d914-a24c-4ff9-908f-9a63a131fd56","resolution":{"observed_at":"2026-05-17T18:10:04.554708Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"orbits” and “sliders","venue":null,"work_id":"b7b196d1-cbde-408c-8174-706dd46b92d8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:4873efb680d6ba335818930e13cee621844de33238ac3e6143d6df01ad95f11f","observation_id":"783a6352-764c-4eed-9f95-61faae778746","resolution":{"observed_at":"2026-05-17T18:10:04.521730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Using this algorithm, we classify the limiting behavior over all tokens in the GSM8k test set for the Huginn-0125 and Retrofitted Llama models","venue":null,"work_id":"359f1c85-3b10-4617-8d10-75e90ad12de8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:6e492f83eddd2e1659b71b77eea87f65305b1aa4aa7382b4ed1bc4d416fed346","observation_id":"8ca6f6f1-6d87-43b8-8042-a2ca6b359c42","resolution":{"observed_at":"2026-05-17T18:10:04.507990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"This percentage can be significantly increased with the longer system prompt, but these behaviors remain rare at 0.14%","venue":null,"work_id":"d8a2b3f7-2cbd-4cea-993b-d6766e7a25f5","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:54a0fdf4c0228f88c60404ac916eeb9223e2880633bb5684e22ef851dec9ea8b","observation_id":"3e56b1dc-b54d-4cb1-abd2-aaa0a2b74f77","resolution":{"observed_at":"2026-05-17T18:10:04.531978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Long Persona","venue":null,"work_id":"5be64858-3cb8-4f8f-a420-bf2adbc14fc3","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:d4fff0e7a9339a51bb16ea40eb2b9b5812b3889f445b4777d708947218d513b4","observation_id":"35e5fe1e-4d1d-4782-bac9-1d6bf3895c03","resolution":{"observed_at":"2026-05-17T18:10:04.497458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"worst case","venue":null,"work_id":"c379415b-d78e-4438-9159-6ca006a9b048","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:149fae16af147fbdab5ea11eace01a823cf7dc5e74c1d154931bd40e86149e6f","observation_id":"4bfdecd0-d5be-4119-b69a-a8c38c07cf9a","resolution":{"observed_at":"2026-05-17T18:10:04.504238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Left: Ouro 1.4B (Zhu et al., 2025)","venue":null,"work_id":"f1a3e778-d0bf-4d11-ab69-e5fcab0aef53","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:15cf367d50a8e25c32ae39542d726cc1ab8ca3e870b4115e52bf5ae808b77785","observation_id":"91c9441b-9850-46f4-9927-38713f4febcc","resolution":{"observed_at":"2026-05-17T18:10:04.511358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Left: Huginn-0125 (Geiping et al., 2025)","venue":null,"work_id":"576be328-5a45-4668-8cf3-a17aff2ee7f8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:8b485c4286a01acb3d8952fc76eb6dac59f4f6110efe890ec321cdb80b60e466","observation_id":"dc1338a8-76fe-4cf4-8ec3-f4e00d55fb48","resolution":{"observed_at":"2026-05-17T18:10:04.544983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Left: Huginn-0125 (Geiping et al., 2025)","venue":null,"work_id":"5fab2b0e-e93f-4f45-8ba1-012ac09e93fa","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:d9821220ebc3efc85e7e95329afcb56c7774c47c884dd478a0e011dd9e0f0afb","observation_id":"88854ab3-7562-49e1-8398-34d60a470f18","resolution":{"observed_at":"2026-05-17T18:10:04.518414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"approximate fixed point","venue":null,"work_id":"62b6cfce-81b8-45c3-be80-43b8954264e6","year":2024},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:f38247f96c64143ddf49562368794e52a92d7e4dc13b80f58e3bea244610394f","observation_id":"065c0192-02a2-4142-8189-87e2d818c008","resolution":{"observed_at":"2026-05-17T18:10:04.535134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"58cd8c0f-2c16-423d-bb79-a245cfb754ca","year":2023},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:0759d4d9cfb6b4d8304455f95949387a78e81ec51f0592ecaee68e3228b1e8ff","observation_id":"e02899f9-19fa-4a70-a613-e6234a1b18a6","resolution":{"observed_at":"2026-05-17T18:10:04.473492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ed1f5b61-493d-44a5-ac01-d5e7f6f05d3f","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:feb940bff46382f527f1d823165d2c508df987a1c32ff481833e1a3149bb4697","observation_id":"497e0033-da9f-4e9d-9b4e-0398e0e5f0e1","resolution":{"observed_at":"2026-05-17T18:10:04.476760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Note Huginn-0125 and Retrofitted Llama have prelude and coda layers too: each 2 layers in Huginn-0125 and each 4 in Retrofitted Llama","venue":null,"work_id":"137277fa-b143-4d63-b4b7-1ee36860129e","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:53dff9dff870bf743f0e6605beed5f33f908e9718cce04d2e36d29b140446602","observation_id":"af2f5f06-8296-4b20-9b92-b03206788d18","resolution":{"observed_at":"2026-05-17T18:10:04.490775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"upcycles","venue":null,"work_id":"e4e2fb80-c27d-44e8-8b12-b76f19b4509f","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:bcb3cd4471b3fad3eaac6cd17efdaee188904ab4f326c5026bdccfb09bbbca5a","observation_id":"7be4dedf-dd9f-4cf3-94dd-37993787cbd1","resolution":{"observed_at":"2026-05-17T18:10:04.500686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8e15a3e3-5ed9-4df2-9289-8d36250c56b6","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:d601de080cbea180c5581a7f132a51bd6c5bffcbfd3c1f38182fe8a0f7a6b5eb","observation_id":"d82a42d3-6d10-4ffe-a640-5ff1382b49da","resolution":{"observed_at":"2026-05-17T18:10:04.494262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Similarly, each block demonstrates very similar stages of inference to OLMo, the base model from which pretrained layers are taken","venue":null,"work_id":"28920ea8-cbb7-46ec-9d70-16e01beca189","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:4014d18a9d4a4b5c54c0ad91c7d204f78a3cd5734bb920df45753d3c651258bc","observation_id":"7b9da5a2-34f3-4a33-a04b-c491a462fe1e","resolution":{"observed_at":"2026-05-17T18:10:04.470683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f9874e9d-aa9a-4169-abc0-aec83c559294","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:53904610c04bf473f1af5356ed2bc1133ecbfa95a45d6c5489860922cee0c5fd","observation_id":"8fca1d18-5933-4dcc-8759-07a9a69350cb","resolution":{"observed_at":"2026-05-17T18:10:04.528572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"upcycles","venue":null,"work_id":"d01db255-5651-4299-9d10-409a0ee47293","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:cc7d5846cc751bf625d289edf9aa2fa75a5b49e06595cdfd0691a3fc2e909162","observation_id":"3a29f7ea-ca9f-478f-a2da-09d802fd4753","resolution":{"observed_at":"2026-05-17T18:10:04.557766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"31 A Mechanistic Analysis of Looped Language Models E.4","venue":null,"work_id":"899d6a31-d1f4-42ee-bbfb-f4af25a18804","year":2019},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:32f5029163fc9b7fa697537de58529a9b37e1809de738c130dd10f6ec84eea2d","observation_id":"752b169c-d193-4245-9b65-dcd503f8082a","resolution":{"observed_at":"2026-05-17T18:10:04.480239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c4308eea-0070-46f8-996a-ae8f5ad3a34d","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:3891134a89358480e118fe8c8eab695409a3b888a43057667ffe1b6b16cd87b9","observation_id":"c1022d78-27fd-4c63-b0bc-337221237439","resolution":{"observed_at":"2026-05-17T18:10:04.483175Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ColSum concentration deviates slightly from its GSM8k counterpart here, but still broadly follows the same stages of inference as the feedforward OLMo model","venue":null,"work_id":"d8a34515-42bb-4efe-8f76-c7345939c6d8","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:8e9060a3fcbebfe1c17c857a957dfd5103fe981e3e0cb0cc6f893a7c1f8c4f3b","observation_id":"c3dc4e0b-a1a9-4907-b99d-53923b90ee31","resolution":{"observed_at":"2026-05-17T18:10:04.486755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"33 A Mechanistic Analysis of Looped Language Models E.5","venue":null,"work_id":"c787ad24-0730-450d-9a80-b8c93e5ec3bb","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:601c2aa3a9672d40ab6d469dd174f70b1c8a24087dd1795fd754eefa289c5d8e","observation_id":"9cae6123-4cc8-41af-8977-3fc63e2d71c1","resolution":{"observed_at":"2026-05-17T18:10:04.538605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6d460f3e-7ac7-4c97-a5f0-23d112ef115f","year":2000},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:8103adbdb332c0356e4f230c7ace359be8fffcf54ab114cd8b2087e090e0f59e","observation_id":"6366f201-0779-459b-8884-3decc81780cd","resolution":{"observed_at":"2026-05-17T18:10:04.467679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"These consistently change throughout the realized depth of the model, reaching no clear fixed point","venue":null,"work_id":"bf09a365-a278-49ff-ae84-0839d30a725e","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:ed3ef0432b63440b35d87f45b8f31773d602c7674571ca0afa7dc561bf9777e8","observation_id":"64dfc0bf-e8cf-45b4-b94f-0254eabc2abd","resolution":{"observed_at":"2026-05-17T18:10:04.465093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"These converge to constant behavior","venue":null,"work_id":"1070db8c-38fc-4655-a281-427caa34a979","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:bb4118556c237d5347fbe40f871c8f9dec7a90ca4e797dca34780bf8c96d364a","observation_id":"91e50898-e382-4c5a-9072-08edbe3d7b5a","resolution":{"observed_at":"2026-05-17T18:10:04.541895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"These converge to constant behavior","venue":null,"work_id":"0be30542-def7-4ae2-bc09-893b11dae654","year":2025},"citing_paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-10T15:53:19.680424Z"},"links":{"citing_paper":"/paper/2604.11791"},"observation_digest":"sha256:3881d33b1af9250be5d249f5b2f956bf53236e1621c2edb1919ff35a1c923157","observation_id":"dd9be5a0-08a2-4f70-8a77-7ef43d80fa35","resolution":{"observed_at":"2026-05-17T18:10:04.525139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.11791","last_updated":"2026-04-13T17:55:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T14:25:36.633868Z","submitted_at":"2026-04-13T17:55:36Z","title":"A Mechanistic Analysis of Looped Reasoning Language Models"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":7,"verified_exact":29,"verified_fuzzy":22},"total_outbound_references":63},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 13 inbound Pith citation observations for arXiv:2604.11791."}