{"as_of":"2026-08-08T04:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9fab7f52b88a0d91decfb26bcbc8c582cbd8aeaf0b12224f0871914a0f69c015","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:17:48.500610Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.21552/citation-record","integrity":"/paper/2505.21552/integrity","json":"/paper/2505.21552/citation-record.json","paper":"/paper/2505.21552"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:48.941409Z","title":"Nonetheless, the contribution of L12H12 is relatively limited","venue":null,"work_id":"f2020409-6a27-4430-9536-e0ae54b1a56f","year":2024},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.500610Z"},"links":{"citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:70585cb9b842b82294d4878ec8fde236a7b90bc64c07de87076105412d319a9a","observation_id":"85d67faf-cc82-4896-8348-c495a8727f99","resolution":{"observed_at":"2026-08-07T14:17:49.013380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:49.123208Z","title":"• The puzzle’s PV must not be a checkmate","venue":null,"work_id":"be056505-ffa7-4cd5-b272-9f605bb11e0c","year":2024},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.401460Z"},"links":{"citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:b4a74efed674a3c0a8a934294cde9cc8a9ae5d0e32504dcea0d75b5b07a9fd69","observation_id":"68858d91-d8b5-4053-a3e9-920c2443b285","resolution":{"observed_at":"2026-08-07T14:17:49.219060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14992","last_updated":"2023-10-23T07:24:28Z","snapshot_observed_at":"2026-07-06T15:32:25.931739Z","submitted_at":"2023-05-24T10:28:28Z","title":"Reasoning with Language Model is Planning with World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14992","snapshot_observed_at":"2026-08-07T14:17:47.512946Z","title":"Reasoning with language model is planning with world model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.512946Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:1e25cc87c0f95f1ec23366afdceda1029d50ee67068521a88cda4e8b7e0a5566","observation_id":"0b8cc274-5fd7-40ae-a832-e9da98b70ea9","resolution":{"observed_at":"2026-08-07T14:17:47.512946Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:49.545118Z","title":"Designing and interpreting probes with control tasks","venue":null,"work_id":"7b5be106-4cce-4d6a-9820-2806cc888600","year":2019},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.598870Z"},"links":{"citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:6f466aaf6dfbda81e9d372f84cdf590e914b856034553346970dd46f8d193efc","observation_id":"5a77d74c-71d7-4a15-b31b-088582fde4c2","resolution":{"observed_at":"2026-08-07T14:17:49.621271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00941","last_updated":"2023-09-07T20:36:48Z","snapshot_observed_at":"2026-07-06T16:13:34.788427Z","submitted_at":"2023-09-02T13:37:34Z","title":"Emergent Linear Representations in World Models of Self-Supervised Sequence Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00941","snapshot_observed_at":"2026-08-07T14:17:47.799785Z","title":"Emergent linear representations in world models of self-supervised sequence models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.799785Z"},"links":{"cited_paper":"/paper/2309.00941","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:81456e0b3933fd43ed9aacf3d4ce664b0af77d3733a967d6c8b0a8b61531f5ba","observation_id":"cc192d4b-c79b-4d19-b930-07014592f85c","resolution":{"observed_at":"2026-08-07T14:17:47.799785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04897","last_updated":"2023-11-08T18:56:35Z","snapshot_observed_at":"2026-08-06T05:52:56.931849Z","submitted_at":"2023-11-08T18:56:35Z","title":"Future Lens: Anticipating Subsequent Tokens from a Single Hidden State","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.04897","snapshot_observed_at":"2026-08-07T14:17:47.919056Z","title":"Future lens: Anticipating subsequent tokens from a single hidden state","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.919056Z"},"links":{"cited_paper":"/paper/2311.04897","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:99ed47a0e5c296a3cfc431b32f72909b31cfda81d52443ad9fb2dccb52a44da5","observation_id":"1d5b22ad-cb99-49d7-8912-5c34e574aeb9","resolution":{"observed_at":"2026-08-07T14:17:47.919056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04494","last_updated":"2024-10-21T09:37:12Z","snapshot_observed_at":"2026-07-06T17:26:35.513723Z","submitted_at":"2024-02-07T00:36:24Z","title":"Amortized Planning with Large-Scale Transformers: A Case Study on Chess","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04494","snapshot_observed_at":"2026-08-07T14:17:48.001162Z","title":"David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.001162Z"},"links":{"cited_paper":"/paper/2402.04494","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:6b985885a773de161576e9456a928f44e28c354d2bfb49fa0f0c56d599950d1e","observation_id":"32807e80-f610-4dc5-aae3-18492a16147f","resolution":{"observed_at":"2026-08-07T14:17:48.001162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09220","last_updated":"2024-11-11T09:16:56Z","snapshot_observed_at":"2026-07-06T18:14:37.777553Z","submitted_at":"2024-05-15T09:59:37Z","title":"ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.09220","snapshot_observed_at":"2026-08-07T14:17:48.172808Z","title":"Alpine: Un- veiling the planning capability of autoregressive learning in language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.172808Z"},"links":{"cited_paper":"/paper/2405.09220","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:b3846f00f6cd76981356ab0615e987a9be725cfc51396edfa6c6d6386ce27dcc","observation_id":"825a7a4c-fa73-444c-88f3-2f18a4b592bc","resolution":{"observed_at":"2026-08-07T14:17:48.172808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00859","last_updated":"2024-08-01T21:21:28Z","snapshot_observed_at":"2026-07-30T19:51:51.122527Z","submitted_at":"2024-04-01T02:01:28Z","title":"Do language models plan ahead for future tokens?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00859","snapshot_observed_at":"2026-08-07T14:17:48.246055Z","title":"Do language models plan ahead for future tokens? arXiv preprint arXiv:2404.00859,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.246055Z"},"links":{"cited_paper":"/paper/2404.00859","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:6ff3186782bb4dbde61a93e2becc844a0f380766d8f5956755a4fe3694faef16","observation_id":"c4f68c85-d20a-4d0d-aa16-df02c0f75358","resolution":{"observed_at":"2026-08-07T14:17:48.246055Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:17:49.327836Z","title":"Corrupted","venue":null,"work_id":"8a234cf5-4670-4b3c-a189-ddb0df2ac91b","year":2024},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":112,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.321974Z"},"links":{"citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:a4214264b55f27d064d7a1f648cf04683dce3bbef6fc82de4bf9ee763a429657","observation_id":"fac5dfd1-b747-44d4-8566-d1373956af8e","resolution":{"observed_at":"2026-08-07T14:17:49.433942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14160","last_updated":"2023-12-19T15:13:52Z","snapshot_observed_at":"2026-08-04T17:03:48.643939Z","submitted_at":"2023-05-23T15:26:20Z","title":"Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14160","snapshot_observed_at":"2026-08-07T14:17:48.094636Z","title":"Label words are anchors: An information flow perspective for understanding in-context learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:48.094636Z"},"links":{"cited_paper":"/paper/2305.14160","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:c83edb58fe587ffba8d02c8808f950987bf66573f9c7ee681311eab50b25d3b4","observation_id":"5017c3a6-e926-4217-b057-3190eae5e1a4","resolution":{"observed_at":"2026-08-07T14:17:48.094636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14767","last_updated":"2023-10-13T19:01:20Z","snapshot_observed_at":"2026-08-08T01:23:06.292487Z","submitted_at":"2023-04-28T11:26:17Z","title":"Dissecting Recall of Factual Associations in Auto-Regressive Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.14767","snapshot_observed_at":"2026-08-07T14:17:47.357345Z","title":"Dissecting recall of factual associations in auto-regressive language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.357345Z"},"links":{"cited_paper":"/paper/2304.14767","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:098a5d57af8d4133eab5a35a504bc8336378f1d6f4d3b020ba21c9fb4d2b2529","observation_id":"181d07f1-3637-48f5-890e-75057f40a969","resolution":{"observed_at":"2026-08-07T14:17:47.357345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15771","last_updated":"2023-07-28T19:13:26Z","snapshot_observed_at":"2026-08-06T01:59:30.696076Z","submitted_at":"2023-07-28T19:13:26Z","title":"The Hydra Effect: Emergent Self-repair in Language Model Computations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15771","snapshot_observed_at":"2026-08-07T14:17:47.703476Z","title":"URL https://www.pnas.org/doi/abs/10.1073/ pnas.2206625119","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.703476Z"},"links":{"cited_paper":"/paper/2307.15771","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:ad513332ca0fd7be74da63cfdb748404b681ba615017e99c9260a0f955c28e3a","observation_id":"2bc85b35-2c69-4439-b621-7260c1795161","resolution":{"observed_at":"2026-08-07T14:17:47.703476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01610","last_updated":"2023-06-02T21:52:17Z","snapshot_observed_at":"2026-08-02T17:50:59.894886Z","submitted_at":"2023-05-02T17:13:55Z","title":"Finding Neurons in a Haystack: Case Studies with Sparse Probing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01610","snapshot_observed_at":"2026-08-07T14:17:47.434967Z","title":"Finding neurons in a haystack: Case studies with sparse probing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.434967Z"},"links":{"cited_paper":"/paper/2305.01610","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:5ad4da2afd2ad717e31332fba957742fef2bb48b74289985110029e06bed1c68","observation_id":"7c3aee70-7e65-4b93-aa95-46e43127fa63","resolution":{"observed_at":"2026-08-07T14:17:47.434967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14918","last_updated":"2024-08-20T16:49:43Z","snapshot_observed_at":"2026-07-06T15:21:15.939061Z","submitted_at":"2023-04-28T15:33:39Z","title":"Representation Matters for Mastering Chess: Improved Feature Representation in AlphaZero Outperforms Switching to Transformers","version":2},"cited_work":{"arxiv_id":"2304.14918","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.14918","snapshot_observed_at":"2026-08-07T14:17:48.790609Z","title":"Representation Matters for Mastering Chess: Improved Feature Representation in AlphaZero Outperforms Switching to Transformers","venue":"cs.AI","work_id":"9c353a2d-b6c0-4cec-a235-2fef683ff342","year":2023},"citing_paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:47.302096Z"},"links":{"cited_paper":"/paper/2304.14918","citing_paper":"/paper/2505.21552"},"observation_digest":"sha256:585c628456d2c29dd5507d7faf36150ae4e96ad6d05b43ddcbc9bc278e32463a","observation_id":"0620cd97-3010-47c3-b267-c287489895d4","resolution":{"observed_at":"2026-08-07T14:17:48.858441Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21552","last_updated":"2025-05-26T04:03:59Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T14:11:10.316305Z","submitted_at":"2025-05-26T04:03:59Z","title":"Understanding the learned look-ahead behavior of chess neural networks"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2505.21552."}