{"as_of":"2026-08-19T13:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a885509b9f051340fe67c5a55ba827bab132ea59bcfa5b458e41faa8ce021737","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T05:39:38.909349Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:11:26.307804Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T00:11:27.738186Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.19943","snapshot_observed_at":"2026-07-14T14:06:00.410527Z","title":"Probabilistic tiny recursive model.arXiv preprint arXiv:2605.19943, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10128","last_updated":"2026-07-17T09:09:49Z","snapshot_observed_at":"2026-08-17T13:09:05.806186Z","submitted_at":"2026-07-11T05:39:29Z","title":"Energy-guided Recursive Model","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T14:06:00.410527Z"},"links":{"cited_paper":"/paper/2605.19943","citing_paper":"/paper/2607.10128"},"observation_digest":"sha256:448ff828cd4b62b327c91e2d9f1bda308c88d1d8b0f8d87288c744f9efd8a554","observation_id":"ddb2652f-d714-43f8-8d56-7cc403ef60b9","resolution":{"observed_at":"2026-07-14T14:06:00.410527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.19943","snapshot_observed_at":"2026-08-02T07:25:08.780440Z","title":"Probabilistic tiny recursive model.arXiv preprint arXiv:2605.19943, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10128","last_updated":"2026-07-17T09:09:49Z","snapshot_observed_at":"2026-08-17T13:09:05.806186Z","submitted_at":"2026-07-11T05:39:29Z","title":"Energy-guided Recursive Model","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T07:25:08.780440Z"},"links":{"cited_paper":"/paper/2605.19943","citing_paper":"/paper/2607.10128"},"observation_digest":"sha256:8e5f60d82c278d2cc929119af9b2641c74d46d561ca15fa5bdb5d6167eb7e40f","observation_id":"62d0a3ea-585d-4c54-bd28-a3f8e50e16f6","resolution":{"observed_at":"2026-08-02T07:25:08.780440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.19943","snapshot_observed_at":"2026-08-04T04:22:54.948927Z","title":"arXiv preprint arXiv:2605.19943 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13246","last_updated":"2026-08-01T19:18:42Z","snapshot_observed_at":"2026-08-17T22:30:33.654823Z","submitted_at":"2026-07-14T20:21:38Z","title":"Reassessing Muon for Matrix Factorization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T04:22:54.948927Z"},"links":{"cited_paper":"/paper/2605.19943","citing_paper":"/paper/2607.13246"},"observation_digest":"sha256:00de5b6bb7e05fa8c834177b1c04819f26f2ce17c55f62ac3c6377a45f3d0325","observation_id":"1e664831-5642-4d49-b59b-3d9d1f4502dd","resolution":{"observed_at":"2026-08-04T04:22:54.948927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"cited_work":{"arxiv_id":"2605.19943","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.19943","snapshot_observed_at":"2026-08-06T00:11:27.738186Z","title":"Probabilistic Tiny Recursive Model","venue":"cs.AI","work_id":"6d7c7810-9fd9-49da-a617-5253a4003feb","year":2026},"citing_paper":{"arxiv_id":"2608.01534","last_updated":"2026-08-02T23:01:10Z","snapshot_observed_at":"2026-08-15T12:29:42.683529Z","submitted_at":"2026-08-02T23:01:10Z","title":"Recursive Vision Language Models for General Symbolic Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:11:26.307804Z"},"links":{"cited_paper":"/paper/2605.19943","citing_paper":"/paper/2608.01534"},"observation_digest":"sha256:812ade957f737f8427f3c27e3988ef150ac5bf255d71f8374671ef07f1fb071d","observation_id":"7e91b9e6-d531-4936-bd7f-b9a8727341ff","resolution":{"observed_at":"2026-08-06T00:11:27.815663Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.19943/citation-record","integrity":"/paper/2605.19943/integrity","json":"/paper/2605.19943/citation-record.json","paper":"/paper/2605.19943"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.04871","last_updated":"2025-10-06T14:58:08Z","snapshot_observed_at":"2026-08-17T11:15:52.067219Z","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":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2510.04871","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:2472e0c1dcba3d4b6234719e83d517200b3dac94cf141cceb6c504d442918dc9","observation_id":"bbd1a800-040a-4eea-a640-7c34d9b88cfc","resolution":{"observed_at":"2026-05-20T05:43:05.964022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+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-19T06:32:39.956319+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":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2506.21734","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:90ebba57908fa83f0fcb9bc4fd112c9b8d9c6f77d5c79035fc96b1f59d9940dd","observation_id":"829c4e6b-20a7-4219-a607-60a37c21c068","resolution":{"observed_at":"2026-05-20T05:43:05.888016Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+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-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01547","last_updated":"2019-11-25T13:02:04Z","snapshot_observed_at":"2026-08-17T05:38:14.090895Z","submitted_at":"2019-11-05T00:31:38Z","title":"On the Measure of Intelligence","version":2},"cited_work":{"arxiv_id":"1911.01547","doi":"10.1007/s11432-024-4231-5","metadata_source":"pith","pith_arxiv_id":"1911.01547","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Measure of Intelligence","venue":"cs.AI","work_id":"d8980a59-aa48-447b-8852-b7aca2b41b2c","year":2019},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/1911.01547","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:2132511f2cd4a585e0fcf82b2f329a1c20a928c3d3bad35c78002c5d8f9e2cc1","observation_id":"5590fb07-34b8-4146-8f7a-239e13d57da5","resolution":{"observed_at":"2026-05-20T05:43:05.990908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11831","last_updated":"2026-01-15T23:30:35Z","snapshot_observed_at":"2026-08-17T15:02:18.805323Z","submitted_at":"2025-05-17T04:34:48Z","title":"ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems","version":2},"cited_work":{"arxiv_id":"2505.11831","doi":"10.1145/3474666","metadata_source":"pith","pith_arxiv_id":"2505.11831","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems","venue":"cs.AI","work_id":"2957f2ae-a92d-479e-a1ff-b0b522445d0b","year":2025},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2505.11831","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:76b4b05b517a21c097e4895b21f39665abd8442490b6b5c5b002cde316cad92f","observation_id":"79d332cd-a55e-4c8b-b000-42acd7683492","resolution":{"observed_at":"2026-05-20T05:43:05.983478Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.10679","doi":"10.48550/arxiv.2601.10679","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Are your reasoning models reasoning or guessing? a mechanistic analysis of hierarchical reasoning models","venue":"arXiv (Cornell University)","work_id":"22529d08-15ee-49f8-9ac6-4458351859cb","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:31f9a5c1bee6c4a5ce18af1a4a27710dd60c773d0bbb661e5afe1858d10a18f3","observation_id":"1550fded-7222-48d1-bdba-4ce9ad27e22a","resolution":{"observed_at":"2026-05-20T05:43:05.935148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":"2408.03314","doi":"10.18653/v1/2025.acl-long.1486","metadata_source":"pith","pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","venue":"cs.LG","work_id":"a8d50b24-bdf5-46ed-bc4f-2927dfd81f1d","year":2024},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:3114b853ea6898802e315f0a813f75ca9064d1c2dc33571820302ff3d9003950","observation_id":"4c34525e-8a27-493d-bdd2-71e63aed45c6","resolution":{"observed_at":"2026-05-20T05:43:05.921983Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-19T09:41:48.169666Z","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":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/1603.08983","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:34b06d7befdfb4702ea66db001d4eb1e954abc704404563906c765f486b9a713","observation_id":"23d21152-da43-4980-9d46-b66b6c8e223d","resolution":{"observed_at":"2026-05-20T05:43:05.928902Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.02119","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pencil puzzle bench: A benchmark for multi-step verifiable reasoning","venue":null,"work_id":"ad41c4a1-9faf-4ec5-90ea-68e8707a8d27","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:818013d87228fe3152bc7322092c046fb20acf37973369bebbf0cab29536bc9c","observation_id":"d545bad8-4d08-4f89-8c85-fd021f22b142","resolution":{"observed_at":"2026-05-20T05:43:05.977229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Rent h100 pcie gpus on vast.ai.https://vast.ai/pricing/gpu/H100-PCIE","venue":null,"work_id":"f67c606e-aa57-4a45-8806-db1d0ae2cd0e","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:b099dfc9d155d50e730c86ad8510a908b19b7803e2245492b72ae04725250590","observation_id":"3e5aa5c7-6be5-4ec5-a1c0-c956ad3cc44a","resolution":{"observed_at":"2026-05-20T05:43:24.234491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/1807.03819","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:0adea2f58c3fcec9f17938e5f14c8c2eec1c293faae27de48ae142e7b2131ba9","observation_id":"584dc326-7136-4771-a6ca-ee79409c9484","resolution":{"observed_at":"2026-05-20T05:43:05.957770Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:0560482987951f27878b0720d77985ed93d81fa78291e5d6b0f72a457947a8e6","observation_id":"7322113c-ad00-450b-9bc0-0ad23af889d1","resolution":{"observed_at":"2026-05-20T05:43:05.949956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Can you learn an algorithm? generalizing from easy to hard problems with recurrent networks.Advances in Neural Information Processing Systems, 34:6695–6706","venue":null,"work_id":"46515e93-f1ac-47ae-90be-69f7a40452c2","year":2021},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:60b1ac4cac9c1763a67a5f13354778351b143faec1e4883668aaa7aed3ab0730","observation_id":"11ffcd95-bd20-4546-a258-65a3656af75b","resolution":{"observed_at":"2026-05-20T05:43:24.230205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"End-to-end algorithm synthesis with recurrent networks: Extrapolation without overthinking.Advances in Neural Information Processing Systems, 35:20232–20242","venue":null,"work_id":"ae445eeb-1436-4e23-babd-56c4cfac389c","year":2022},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:7d3f26a754338cf1078818b31cecde657be05c7ea6a5e04d2d3fc0fcc1fc290e","observation_id":"9cb46333-1476-4beb-96dc-788318417030","resolution":{"observed_at":"2026-05-20T05:43:24.237995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Rethinking deep thinking: Stable learning of algorithms using lipschitz constraints.Advances in Neural Information Processing Systems, 37:97027–97052","venue":null,"work_id":"a68117d2-cf50-4d74-92aa-31a153477c9a","year":2024},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:b5fa60d82acf291609402dd786307b9ff4b6eb2a0c1f1c8597abae2a0c9e493d","observation_id":"041ff2a6-c4d8-475a-b12d-0940b65aabb3","resolution":{"observed_at":"2026-05-20T05:43:24.242478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.15641","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Form follows function: Recursive stem model","venue":null,"work_id":"fae0f00d-bd57-417c-8357-477f7a62b943","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:5fd23ccdbf845c653baf1f8e116654b1177bcc617a99e81969db10c08b88287e","observation_id":"2bf308c6-4a28-4a1d-9e32-7e2cfededcb2","resolution":{"observed_at":"2026-05-20T05:43:05.895066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Learning multi-step reasoning via persistent latent state propagation","venue":null,"work_id":"614cc69c-3e7a-427c-a785-c6ffd6214dd8","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:55444293e33066218ecb9832566b413bcdbaff16f842a5f8407ba5f09c456f6d","observation_id":"729ba00e-b2db-4dcf-933f-9829dcd58519","resolution":{"observed_at":"2026-05-20T05:43:24.218348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06769","last_updated":"2025-11-03T00:53:34Z","snapshot_observed_at":"2026-08-17T06:12:37.525438Z","submitted_at":"2024-12-09T18:55:56Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","version":3},"cited_work":{"arxiv_id":"2412.06769","doi":"10.48550/arxiv.2412.06769","metadata_source":"pith","pith_arxiv_id":"2412.06769","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","venue":"cs.CL","work_id":"3ddd0fd2-c176-408f-9b58-0666c2707f2d","year":2024},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2412.06769","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:a1b750550cb3130a450842a978fb711d881ad70fe368881fa28c3b4e54c5bf13","observation_id":"f4a5b635-650c-4609-afe1-868107cbdc67","resolution":{"observed_at":"2026-05-20T05:43:05.882378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-05-23T16:25:44.826594+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T16:25:44.826594+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"0fbc61a0-f9dc-4f21-b26e-bcc9f2d7a8d3","year":2022},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:330a89baaac20bb48cd4a6ab96891e239739a518c5bee4103a69edaef2a28f59","observation_id":"c783708a-a08c-4799-b1cc-db117c3b26f0","resolution":{"observed_at":"2026-05-20T05:43:24.222826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.12514","doi":"10.48550/arxiv.2505.12514","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reasoning by superposition: A theoretical perspective on chain of continuous thought.CoRR, abs/2505.12514","venue":"ArXiv.org","work_id":"bf7a70d2-3159-449c-94b8-c971a586c3bb","year":2025},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:710cedec6ae6ddb76a05f1ea61b59faef70969cb7b941044b14f381aff0535de","observation_id":"a022c526-8f05-4d5a-960e-fb6a844ba9cd","resolution":{"observed_at":"2026-05-20T05:43:05.914419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13702","last_updated":"2023-07-17T01:08:39Z","snapshot_observed_at":"2026-08-13T18:02:27.155379Z","submitted_at":"2023-07-17T01:08:39Z","title":"Measuring Faithfulness in Chain-of-Thought Reasoning","version":1},"cited_work":{"arxiv_id":"2307.13702","doi":"10.48550/arxiv.2307.13702","metadata_source":"pith","pith_arxiv_id":"2307.13702","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Measuring Faithfulness in Chain-of-Thought Reasoning","venue":"cs.AI","work_id":"86ca07b8-4628-4f51-8938-a82683386ae4","year":2023},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2307.13702","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:a65d21af8b6da2fe2b6b90feb80351b4fe4bf9773904df52444953adf0395bae","observation_id":"a38f8d6f-7206-4c3b-9e7a-33a480131a0a","resolution":{"observed_at":"2026-05-20T05:43:05.900954Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.05410","last_updated":"2025-05-08T16:51:43Z","snapshot_observed_at":"2026-08-15T05:29:13.739206Z","submitted_at":"2025-05-08T16:51:43Z","title":"Reasoning Models Don't Always Say What They Think","version":1},"cited_work":{"arxiv_id":"2505.05410","doi":"10.48550/arxiv.2210.14889","metadata_source":"pith","pith_arxiv_id":"2505.05410","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reasoning Models Don't Always Say What They Think","venue":"cs.CL","work_id":"b9bdcbf5-9ae0-464c-b1a6-de04f85a6e33","year":2025},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"cited_paper":"/paper/2505.05410","citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:f2f3ba9b3d71ac46d37c8cd0fe2cb4a352f359da395bdbe36d4b3ee21f3fd083","observation_id":"5de14b6c-8e1f-4937-b5c3-9ee0e0899c22","resolution":{"observed_at":"2026-05-20T05:43:05.907422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Generative recursive reasoning models.ICLR 2026 Workshop on AI with Recursive Self-Improvement","venue":null,"work_id":"347d4ac8-39f2-4629-8e03-3bab0d090e53","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:ca9ae1548d5d334a826d318df00e87d543ccb3a2bd0370c51cf0934c67077d40","observation_id":"14f5aa1a-8fff-4fa2-8a7b-9aea145ffa3f","resolution":{"observed_at":"2026-05-20T05:43:24.226550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"Recursive reasoning as attractor landscape search: Mechanistic dynamics of the tiny recursive model.Workshop on Latent & Implicit Think- ing – Going Beyond CoT Reasoning","venue":null,"work_id":"3a0c821d-bd79-4740-bedb-8a5a188f3a3d","year":2026},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:6aca41e30bd1219181101d5d711437cee6d036696fa78f6004c5691dddfa48d3","observation_id":"a240f028-d6f8-4347-a3a5-ef4214c956cd","resolution":{"observed_at":"2026-05-20T05:43:24.249338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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":"01d285f7-b288-4d10-9c21-4450388e297b","year":null},"citing_paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-20T05:39:38.909349Z"},"links":{"citing_paper":"/paper/2605.19943"},"observation_digest":"sha256:50dfac123a7ebaeb865d4ba189de1e0c247f679fa0d36d29b9753a6d4fd49420","observation_id":"90e1b76d-7303-47c6-892d-5078c41f0b45","resolution":{"observed_at":"2026-05-20T05:43:24.214250Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.19943","last_updated":"2026-05-19T15:00:38Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T18:34:25.395005Z","submitted_at":"2026-05-19T15:00:38Z","title":"Probabilistic Tiny Recursive Model"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":15,"verified_fuzzy":8},"total_outbound_references":24},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 4 inbound Pith citation observations for arXiv:2605.19943."}