{"as_of":"2026-08-13T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1838425ffd9b8ea73e6ae2626138e2d33f174c22fdf577b427b978dda21f257","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T10:14:11.706221Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20594/citation-record","integrity":"/paper/2607.20594/integrity","json":"/paper/2607.20594/citation-record.json","paper":"/paper/2607.20594"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.15647","last_updated":"2025-05-12T03:51:20Z","snapshot_observed_at":"2026-08-12T22:39:05.389967Z","submitted_at":"2024-09-24T01:21:17Z","title":"Looped Transformers for Length Generalization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15647","snapshot_observed_at":"2026-08-01T10:14:10.974064Z","title":"Looped transformers for length generalization.arXiv preprint arXiv:2409.15647,","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":4,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:10.974064Z"},"links":{"cited_paper":"/paper/2409.15647","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:c7c6576d657ad9e2553af86760149df576369129fa09ef9b8f2b8400b88cb6cf","observation_id":"e7600503-d615-4bf7-aa86-4448c6393ef9","resolution":{"observed_at":"2026-08-01T10:14:10.974064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09963","last_updated":"2024-05-27T17:01:29Z","snapshot_observed_at":"2026-08-13T04:18:19.790411Z","submitted_at":"2024-02-15T14:17:51Z","title":"Why are Sensitive Functions Hard for Transformers?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09963","snapshot_observed_at":"2026-08-01T10:14:11.203822Z","title":"Peter Hase, Mohit Bansal, Been Kim, and Asma Ghandeharioun","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":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.203822Z"},"links":{"cited_paper":"/paper/2402.09963","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:835bb7aa223141e887593b3e9c466055a0d48d27b1792d84c3e9a0c91e018b1e","observation_id":"666d89c3-8a28-41cc-9e99-fb96b37bac7e","resolution":{"observed_at":"2026-08-01T10:14:11.203822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.07822","last_updated":"2026-08-11T05:59:57Z","snapshot_observed_at":"2026-08-13T10:19:03.358294Z","submitted_at":"2026-04-09T05:24:32Z","title":"Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.07822","snapshot_observed_at":"2026-08-01T10:14:11.417991Z","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":8,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.417991Z"},"links":{"cited_paper":"/paper/2604.07822","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:818edde7dea4ac51595792b9a5b0d4e5a0103c9172bae5c18265841b8a051c89","observation_id":"d9461a17-db8d-44c4-ab88-d1b9c784a521","resolution":{"observed_at":"2026-08-01T10:14:11.417991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:11.553424Z","title":"12 Preprint Table 10: Frontier-state transplant (A’s prefix states spliced intoB’s run at the frontier, loopt=16): retention vs","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":10,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.553424Z"},"links":{"citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:b40d8aa1ca89e6c95e7aa5c0fc4f3575e82c81f0e0fac9e4cc1e586690b37155","observation_id":"577c702f-9de1-42ae-a6fe-04f62f356bc2","resolution":{"observed_at":"2026-08-01T10:14:11.553424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08819","last_updated":"2025-03-05T23:00:57Z","snapshot_observed_at":"2026-08-13T00:31:00.735224Z","submitted_at":"2024-04-12T21:30:06Z","title":"The Illusion of State in State-Space Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08819","snapshot_observed_at":"2026-08-01T10:14:11.612261Z","title":"Gleb Rodionov and Liudmila Prokhorenkova","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":11,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.612261Z"},"links":{"cited_paper":"/paper/2404.08819","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:990fa1dedaf1cf431652f493256c37d85a0015f48d7b20e2b0758d5cc858dba3","observation_id":"31049dde-38f4-4cdb-99df-7e1310ce0c10","resolution":{"observed_at":"2026-08-01T10:14:11.612261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08482","last_updated":"2025-02-12T15:17:04Z","snapshot_observed_at":"2026-08-10T07:35:41.543441Z","submitted_at":"2025-02-12T15:17:04Z","title":"Enhancing Auto-regressive Chain-of-Thought through Loop-Aligned Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08482","snapshot_observed_at":"2026-08-01T10:14:11.706221Z","title":null,"venue":null,"work_id":null,"year":2022},"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":13,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.706221Z"},"links":{"cited_paper":"/paper/2502.08482","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:2760c324b8d2566f8e600457fb2d90816ea94710aa974d8a5e457cecc3bbd1f2","observation_id":"4a4d366e-0137-43fb-9530-013e54924497","resolution":{"observed_at":"2026-08-01T10:14:11.706221Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:10.826370Z","title":"Diffract: Diffusion feature reconstruction and attribution for circuit tracing","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":2019,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:10.826370Z"},"links":{"citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:e035a83ea18604eed0a9243b5389e8689e3a83bab93c05061fbdc2556fa4fd26","observation_id":"5bf8e37b-ca09-4e26-9a1b-b62bca9b77e4","resolution":{"observed_at":"2026-08-01T10:14:10.826370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12424","last_updated":"2024-03-16T21:10:38Z","snapshot_observed_at":"2026-08-13T05:20:37.970631Z","submitted_at":"2023-11-21T08:32:38Z","title":"Looped Transformers are Better at Learning Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12424","snapshot_observed_at":"2026-08-01T10:14:11.657461Z","title":"Looped transformers are better at learning learning algorithms.arXiv preprint arXiv:2311.12424,","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":2022,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.657461Z"},"links":{"cited_paper":"/paper/2311.12424","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:fb30751515fac4c4e6e986bfd0945db0e4e134279883a6cace3c2be866cc3199","observation_id":"41107749-7689-400b-b356-323262ca2c0b","resolution":{"observed_at":"2026-08-01T10:14:11.657461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:11.294692Z","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":2023,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.294692Z"},"links":{"citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:312b9f68a84844b2262002e66f7ff7c4c7b1c19e593e8047ebe09be90249d78d","observation_id":"5a54abb9-d80a-4126-b1ae-0c385b55f114","resolution":{"observed_at":"2026-08-01T10:14:11.294692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05171","last_updated":"2025-02-17T17:14:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-07T18:55:02Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05171","snapshot_observed_at":"2026-08-01T10:14:11.100379Z","title":"Bartoldson, Bhavya Kailkhura, Abhinav Bhatele, and Tom Goldstein","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":2024,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.100379Z"},"links":{"cited_paper":"/paper/2502.05171","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:39b1ad3bc1a0e4f753ae2533ad8aa00576a8900519d9cff2e546e3cf0245b015","observation_id":"ea2c21d6-b2be-4337-b7f0-58deb37be955","resolution":{"observed_at":"2026-08-01T10:14:11.100379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T10:14:11.488215Z","title":"Kevin Meng, David Bau, Alex Andonian, and Yonatan Belinkov","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":2025,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:11.488215Z"},"links":{"citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:01d288398591c718f389366eca1654728d2ec1eeaa13fb7aa75e88183848691c","observation_id":"d79960e7-9586-4f7d-99bc-4118f94ae3d3","resolution":{"observed_at":"2026-08-01T10:14:11.488215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-04T07:30:51.188041Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.25741","snapshot_observed_at":"2026-08-01T10:14:10.691369Z","title":"Ouro: Looped language models.arXiv preprint arXiv:2510.25741,","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":2026,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:10.691369Z"},"links":{"cited_paper":"/paper/2510.25741","citing_paper":"/paper/2607.20594"},"observation_digest":"sha256:b8d506c280880200ea0b6813f74c56a006578679c1e67b6bdb6a2de1d99c9c23","observation_id":"dc379f04-caa9-4741-88db-007ea00f02d7","resolution":{"observed_at":"2026-08-01T10:14:10.691369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20594","last_updated":"2026-07-22T16:04:31Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.20594."}