{"as_of":"2026-08-15T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:816b6291179052bc72620836cf72ac761bfa5af36400f5bd61ddd38483a682ff","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-15T06:32:42.880941+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-12T01:14:28.635355Z","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-12T12:29:45.605284Z","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:124e826caab62013c8984d810ddf2995163efd0b986671e8a838dd4c7201f56c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-08-13T19:38:43.488231Z","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:b846a2765815af5c4cb2e18558ad13f5fb744e53dc47f008ade1c71a54a90028","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:bb0d8be2012c28a871f233cd5e9aef4fae67e8968f4b2b1a8557f9571ee7a139","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:ad6a85731ab06dd163161d23ed08b4a78aaeced4097d19e2daaf7c45345ce7e7","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-08-15T10:20:46.725768Z","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:78309a1ef8ce5e79407e832bdfb8aa030f2660a7612e2e821b2072f15947d9d8","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:8e159f784a9691adf3fd0a6bb4a602cc3933ee6ddb5d2a470fda3aae5f034385","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-13T23:05:07.225663Z","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:e8c749f7ab191d4201063d482e78919fe600a92fbd0c45a41880a0003581671f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-15T15:58:52.730152Z","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:053e96bce0f273628a46013c8753ac92c1b066b9ebb55357801005350fe64273","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:a70c31bc9d6da936b900153eb24fd0294b324eaa90b153b44b66f843a31bf61d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:51f3767747f80a268c1ae3882d2d2ebf85fa020a19a8f5fff3c220fb1c4c3f00","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-09T15:51:58.210107Z","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:809db61751b5fe8c0d79abacd23fb8b16fa98c5830955bc8d59be6283b2c18a9","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-12T01:14:28.635355Z","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-14T11:56:00.473962Z","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:f2c4c16ac1f0fd68bece1161b15d6ffcf1597f9198f4f219031e016c739c81e6","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-12T01:14:28.635355Z","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-13T06:13:27.235566Z","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:9686d6d0eadff584faae356ca511f03a02d10bce03b204063f9f5148e97d2de6","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-15T07:10:22.387933Z","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-12T01:14:28.635355Z","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:a8c14e585ced65aeee22f7aa5f8e8211b39d2fc61d20e5b61fe7e48fca153e4f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:20fba9a2885e5cdce1e7ab5f243598910b41a5983043b3f1bf7370e7f186a8c2","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:7ef8074d6483ac7c51ad4cd9e969480f7f2dfccda30c4304c61e15ac2749654c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-12T05:21:39.322905Z","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-12T01:14:28.635355Z","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:782ed9cf364a4c8687045152c8a80cf137f233a16d0a88e9b5f8ebc283819b8d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-10T21:22:34.508560Z","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-12T01:14:28.635355Z","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:0043e1f97a8170dfe4788f62ca49088de203b33f95192e4a7c58c7cf5205c05b","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:6e6924155be16ab900f2d9d5217a3b00d680eeacfc8064c5629894f36d11c07c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-14T09:35:00.453149Z","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-12T01:14:28.635355Z","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:5dfa85ed9f98ed3463db97831285c63f7890dc4a2b861bcbb8e36644ce9bbab7","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T02:43:01.480086Z","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-12T01:14:28.635355Z","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:3646ba5108c6c9444f5edcfef4dabaaef1f7dcfd4fa27c3ad29252593b89744d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:74c1bd28e6318f2d86741dbef50c01ee5d942c6d8f51de44521f52f3752660ea","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-13T07:34:17.550838Z","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-12T01:14:28.635355Z","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:df4bb3f3315ef72115e6b0be0320e178d51abb43653adb48149cf8a34b158336","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-15T00:53:48.099058Z","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-12T01:14:28.635355Z","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:6e1f1367835f85c0c319115a457e4b61f30d3330e578a303cacea53fb60b5578","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-13T17:50:13.821769Z","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-12T01:14:28.635355Z","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:1d2868386c97d5811322cf9d0eb935c4bc05a00c2fff9c2cc867bc6c5a64e528","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:0edfca9b3b01612d6be5b02c8d0d12162f53a5d07cec10d258d364b60324861d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-15T12:33:55.451951Z","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-12T01:14:28.635355Z","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:b8db3fb3752c16bf849346542bda47ee168547d566f7653d0525a26a052a9bbd","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:9cc13004f56488abc95b3e8ac6aeb442de2fdbcdf88ed848eb44b00bfe20f737","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-15T07:24:09.384302Z","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-12T01:14:28.635355Z","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:d68b8f12dbb3018f7a7af703b6bb3cb54c09afb14918b0c0eb80791f190521c4","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+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-15T06:32:39.529945+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-08-12T22:23:04.668393Z","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-12T01:14:28.635355Z","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:27cd43114c2a8b6fbbea86ffda182a42431709ddb6a37fd94fc3efe5e3dd5b17","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:7730d5543627310bbf76c81328e09e4c52817e15db30971b72011bb04c054dbb","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-14T01:45:56.211716Z","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-12T01:14:28.635355Z","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:48521748200a8e54c15fdf9905515c9fb533bba07b01dbb34daeea1b91f3609e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:5c29a25ac25b82fe884143fa807166b05662306e304a07706efb4ca908050e6b","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:0b390b5a60e533a1a9fff0f8ffc98e5c17fc95bd7e153579f53d054d1b1a3130","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:1373ddf7f6f06de050f03b56ea3c832c907918fc5c05c8258a4d676c65c9f65f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:21e0d0b7e095da5973372bbd2e0ffd5d41155007a92e1a40f6a76c29eb8f6c68","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:8d94f3daff11ecb2ab538f5645cf940c6ee01fceab860632445f482895c6347b","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:6fdd8602bf1e9e896438bac7759accc0a2e67fe7e0dcbe47fcafbfd6dbbc11f3","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-12T17:52:51.001662Z","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-12T01:14:28.635355Z","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:f3425bba4b898281c97aae96cbb05f05fe125a69aff3278c833c7b331bac8682","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+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-15T06:32:39.529945+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-08-13T05:52:35.270837Z","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-12T01:14:28.635355Z","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:84006cdaff854178fa8dd2f6a022156604634e59b82199bc9832daab132dc142","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T22:33:01.643046Z","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-12T01:14:28.635355Z","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:1144b61cf46da54c3c6f8c53a9c0313dc59af2e32dd865a38a34ee3c09d28d3f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-13T09:09:47.358626Z","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-12T01:14:28.635355Z","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:b5960392357049283cfc8163d76fb7c15ba8678f284a069afa7a07b09727346c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+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-15T06:32:39.529945+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-08-14T06:01:54.549199Z","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-12T01:14:28.635355Z","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:fdc1dfa3e57eb2c09440d16f25be6941f2ec1c4ac0efcc4cd5ff17262db9b209","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-12T22:32:42.067448Z","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-12T01:14:28.635355Z","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:7e4a1b09d28ce686c09fe7538b02ffd62100f15e3e028d2d90e11aa63dcad910","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-14T18:12:00.252248Z","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-12T01:14:28.635355Z","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:c8a0fe14f0ee62e645a81bb89f9c035a486e5995f6018a536d131a898dafe7a2","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T18:07:28.721991Z","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-08-10T01:13:53.509299Z","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-12T01:14:28.635355Z","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:1c78efa4c77aac674f2da75781b2a01767dff99e9dbd1c905d4ec16994dafb12","observation_id":"7b25e135-81a5-4a00-9d06-5c962785b0d8","resolution":{"observed_at":"2026-08-10T01:13:53.509299Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-13T23:04:32.343355Z","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-12T01:14:28.635355Z","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:6f64763209cbbbfcee2bc45c1a3fab451ef11af2b072016061a395f172a73843","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+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-15T06:32:39.529945+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-12T01:14:28.635355Z","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:0fed218c786dc83d787c659a6e60d14e809fc4ec8640c0bdd23e4bc7f8270a13","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:37680cc55108949413d8352c1ae2807345412e7569d71bd02227dce9e96cae11","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:3bdc345da00195fe4b593f3d6b07eb7aca754faace35c68a8fcccc9db6907721","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:ed243deb559908497d12ea6f721b156ee442a8f28c7ddab9b29ae289c5b12865","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:6ed89b3f69f928952bc8a80a3e1f2cc81691005a7d59416d3301d8db72eed683","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:2bdff4a39ece2828d05946509a0d3a4b1ea665c41cf57046b91cf8e1a063a24f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:b408c369d2554b1a0d43e16db1d18adb49ea49a610671fd24f0e574a382b9fac","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:aac6a84a62df3c05a66ff15583ddd88784011744a5d96551edee24ef27e33d43","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:1e0302727d0446a14013bb52365eff14c9d6d314044dafccf5537b994bafc4d4","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:3f362d68315085e549412cd3447535cce667887819d329797bc2ae8c8f0f1953","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:97b7f5b33f242d527591251a7d5fb27a40b5e35d947082178a627dde5f75d15d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:bd3f85a7dba5f21ace467a17e2026dab2060fffbaa2a6f08eb42c453a8d1acfe","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:fad92c2b7ff9cabe6e45fc2db0d3cba973d4a38a3240b1ace9aaddcdf1ab4723","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:3b665224307d20819f63b832d26e25917123c44c4cd5e10031057264de4bdda1","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:6c439e108edac1f1e64e6c8f6859d7cb21e38f1795cf4879a3c27ab5e6d56473","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:bd615b0cc9c238d4b6ea46c93d7a92bcb2c903534e11e96cbc29d80265bf6608","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:6bc6773d26c987c7ca3cac327936db2196df1702f9780d1cc4cbe9713aa14587","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:b98e8904e32abcf52e1b47ebb8367c1c43a098dacf5fa5260613c8699ee60164","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:aec6b58b9206c2d38603fd345c29b105133413c0bc794538fa7de1daf519c60a","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:47a49712762363f8d34a7b255f9f1193a064991f084ba1817f6ef53811c404f3","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:230689d6cde9be60d4fd2c4c4557e18f185fee3090ad7ff063673539c6b76469","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:a334923d48218dd0f0074d02f5bc0f5a599dc9dc6727f27b98473545e6350c87","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:634853a96b723eaec7a195dc476d7bb5a7ca9c755f79792810922d937d543081","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:8576e21ad66b9d51af054112e10a1c13efdf822fb78be62da4406f33968c1d57","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:a27e0e99dd4e2a63ec8999a22b5379bf719d2d8f630d361817941f114e3ba33c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:d9509756bf838042ff84920cb23edad5cebe6ca64537b8cc17720d07820baaa8","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:24363f08cda6880079893d644c89a4cb8d32cfa234614b6b6a0c255334a17197","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:55040742d913edd717b0653d31815b4494deedadc82f7a0a9b922489abd1b7cb","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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:bfece8124a2e22a43a0f1d31f8d2f1f3df396113c15e9e063a99aaa3a0779e9f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T01:14:28.635355Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 13 inbound Pith citation observations for arXiv:2604.11791."}