{"as_of":"2026-08-21T06:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3b00c40c618e276bed2576d97a6782621087e21583eef983f65e67957e4a0c2","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:39:41.867196Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.11716/citation-record","integrity":"/paper/2608.11716/integrity","json":"/paper/2608.11716/citation-record.json","paper":"/paper/2608.11716"},"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-16T00:39:41.982716Z","title":"Lemma 4.Let U be a vector space and letU′,U′′ be vector spaces withW=U ′⊕U′′","venue":null,"work_id":"af714ed9-66d2-4be6-b66c-40436f3cc55d","year":2023},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.867196Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:c110cd1a85a77a9971999be4618e519396f517ac2038e637e209507699577169","observation_id":"e463a34d-b192-4e59-91bd-d86be2a2ab25","resolution":{"observed_at":"2026-08-16T00:39:41.988769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.179155Z","title":null,"venue":null,"work_id":"e3007d7c-2fdb-4245-af77-e28d832c1a1f","year":2021},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.789059Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:6676e4601e4cadac4e5feb384d5e9199f9b72535bc6960f95892a6b8e06280ab","observation_id":"384a67dc-c5a2-4e3a-961d-a6078bdef0f4","resolution":{"observed_at":"2026-08-16T00:39:42.184145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.162613Z","title":"In International Conference on Machine Learning, pages 2319–2363","venue":null,"work_id":"506fc838-90da-4a91-bf5f-c43418aa10d3","year":2017},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.795371Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:99f07d54aef5c047959387e67201096e150d193d5bb5a1468ca56cd168d17eca","observation_id":"114ae361-4bc0-4689-bcd6-077caed06386","resolution":{"observed_at":"2026-08-16T00:39:42.167713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07932","last_updated":"2025-08-11T08:23:28Z","snapshot_observed_at":"2026-08-16T15:03:47.936839Z","submitted_at":"2025-03-11T00:21:32Z","title":"A Theory of Learning with Autoregressive Chain of Thought","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07932","snapshot_observed_at":"2026-08-16T00:39:41.818460Z","title":"Yanghao Li, Naiyan Wang, Jiaying Liu, and Xiaodi Hou","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.818460Z"},"links":{"cited_paper":"/paper/2503.07932","citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:6a6be068ab7da377b038783bb26037d565d30d8f72380b229f37b619b5864297","observation_id":"58bf7dd4-57b8-40b4-9bb1-5822fcbf0d6f","resolution":{"observed_at":"2026-08-16T00:39:41.818460Z","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-16T00:39:42.092581Z","title":"InInternational Conference on Learning Representations, volume 2025, pages 6286–6309","venue":null,"work_id":"b971db38-62dd-4416-acc3-ab8571eeadec","year":2025},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.834577Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:7d4bd2e850efa9908aa0c67177f4d8306b62fe1b37f458a63e247a16afa90683","observation_id":"b5b1a1b8-ac7b-439d-b588-81c65e5f4add","resolution":{"observed_at":"2026-08-16T00:39:42.098162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.054643Z","title":"InThe Fourteenth International Conference on Learning Representations","venue":null,"work_id":"c276edf2-28a6-4fa0-a025-b4a6e59775b9","year":2020},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.845357Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:7c1ed5b2e51aee2fb0781333fa817c08309495e38bd982c119992aa26c30c31b","observation_id":"6730b0f9-a523-431b-8a05-4da238c63145","resolution":{"observed_at":"2026-08-16T00:39:42.060369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.037319Z","title":null,"venue":null,"work_id":"89f5575f-e7a4-44f8-b01f-aacaef245947","year":2024},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.850114Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:d4972f725b48b30f5a0b57edc9bb54e3a109fa3ee9aaf822b6dc940bc2f79caf","observation_id":"ae0968a3-37f4-46ef-a4f1-6d9adb0505b6","resolution":{"observed_at":"2026-08-16T00:39:42.042528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.020494Z","title":null,"venue":null,"work_id":"445daa4e-68df-4018-82dd-446396bc8637","year":2024},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.855369Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:9ff997f18480b1e8a9c055c515955c57be74f27cccdf114bc9c71b28f5c9ef80","observation_id":"31222366-f87e-416e-993e-ca7c1f9e20f4","resolution":{"observed_at":"2026-08-16T00:39:42.025881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.002486Z","title":"While these characterize classes, concrete problems instantiating them remain scarce","venue":null,"work_id":"82194447-2275-4ff9-a5fb-1925c667bc4b","year":2024},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.861454Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:7dc7b0eb4e122cf1fafb0f38c172cb94508c2255096e994e437c8ac8c58bdffc","observation_id":"dbc68b6f-9c5e-47cd-9c5e-dbfc0569b8b9","resolution":{"observed_at":"2026-08-16T00:39:42.008421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.213635Z","title":"1974.The Design and Analysis of Computer Algorithms","venue":null,"work_id":"6e37d00e-4463-4e93-a302-20cc48745dae","year":1974},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":1087,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.778193Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:2d73cfd0a930e740521fe130bc3fd8115261900f3943f4426a569ba8af42d61b","observation_id":"1bd2e429-b7b4-47e3-9ecf-104e728fb2e5","resolution":{"observed_at":"2026-08-16T00:39:42.219000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.145610Z","title":"Philippe Flajolet and Robert Sedgewick","venue":null,"work_id":"b37385db-14d6-4438-9089-b6465cfc3736","year":2009},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.807543Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:8d8ddfa2764a9798f75625c47ad880cf94d75a3dec976631194654453257b29d","observation_id":"8f107ca1-2f2d-40e6-b898-391acae7fa8b","resolution":{"observed_at":"2026-08-16T00:39:42.151338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.110440Z","title":"In 2017 IEEE International Conference on Computer Vision (ICCV), pages 2098–2106","venue":null,"work_id":"0cde0f78-856d-47f4-bda5-68da3d521896","year":2017},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.823634Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:e02d32ab62e2d89830116f25c0ece9ff94d45d04cfb20f139d9412d7bf98da47","observation_id":"1d0ec07a-10a1-49d0-861f-0b00dc06c4f4","resolution":{"observed_at":"2026-08-16T00:39:42.116323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.03429","last_updated":"2019-01-10T23:21:35Z","snapshot_observed_at":"2026-08-17T13:36:17.570233Z","submitted_at":"2019-01-10T23:21:35Z","title":"On the Turing Completeness of Modern Neural Network Architectures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.03429","snapshot_observed_at":"2026-08-16T00:39:41.829039Z","title":"Jorge Pérez, Pablo Barceló, and Javier Marinkovic","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.829039Z"},"links":{"cited_paper":"/paper/1901.03429","citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:611e6a1a335bade1287728ce46789803d71df1a45803b9de86702fb0dea96f9d","observation_id":"15acb808-67b8-4acb-b5ba-25d2d7133469","resolution":{"observed_at":"2026-08-16T00:39:41.829039Z","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-16T00:39:42.195115Z","title":"InProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, page 481–489, New York, NY , USA","venue":null,"work_id":"8d69d977-e269-45f4-8592-c6d69dfdf67e","year":2021},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.783309Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:dd46774ecc515f40c704c42928044d61cca0c003127bc2a6c557965fa9da4e90","observation_id":"bdb2c7b6-e01e-45db-a9c2-020df4766616","resolution":{"observed_at":"2026-08-16T00:39:42.201471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.074350Z","title":"Association for Computational Linguistics","venue":null,"work_id":"12e5bc12-2fab-4314-ac06-c620b9d98faf","year":2023},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.840008Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:b6602f2943f6da86b11ddca95e7a5ccec5cdb6652cadc57879a46875610f7816","observation_id":"d0f10551-6a9d-4aef-bc12-8de75fae5ac2","resolution":{"observed_at":"2026-08-16T00:39:42.080453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03025","last_updated":"2024-06-05T07:48:07Z","snapshot_observed_at":"2026-08-16T13:45:59.866356Z","submitted_at":"2024-06-05T07:48:07Z","title":"Refined Horton-Strahler numbers I: a discrete bijection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03025","snapshot_observed_at":"2026-08-16T00:39:41.772029Z","title":"Louigi Addario-Berry, Luc Devroye, and Svante Janson","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.772029Z"},"links":{"cited_paper":"/paper/2406.03025","citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:04472c0f9b9c2fa71841ac028daaf641872d16362e8832a64777df45439ddcb1","observation_id":"951f21a5-4cff-4956-a4c1-a7e4549b547b","resolution":{"observed_at":"2026-08-16T00:39:41.772029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.18739","last_updated":"2026-04-22T14:40:08Z","snapshot_observed_at":"2026-07-06T21:46:25.566565Z","submitted_at":"2025-06-23T15:15:25Z","title":"On the Existence of Universal Simulators of Attention","version":2},"cited_work":{"arxiv_id":"2506.18739","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.18739","snapshot_observed_at":"2026-08-16T00:39:41.945939Z","title":"On the Existence of Universal Simulators of Attention","venue":"cs.LG","work_id":"5aba3908-3c7d-4ac2-b63b-50966ab44943","year":2025},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.801028Z"},"links":{"cited_paper":"/paper/2506.18739","citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:7753a960fb3608d06bd2831b46bc2a9a5cbec4a7ec239ebdf31437625b902856","observation_id":"ba74cd40-fd55-4301-8aca-858ca8bd3af2","resolution":{"observed_at":"2026-08-16T00:39:41.953335Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T00:39:42.128000Z","title":"In43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026, LIPIcs, pages 41:1–41:22","venue":null,"work_id":"fbcc84d3-beaa-4ab0-a026-0fca7e35fc3b","year":2026},"citing_paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-16T00:39:41.813614Z"},"links":{"citing_paper":"/paper/2608.11716"},"observation_digest":"sha256:0c5fc6cf7c9c985ec12215675d2d2b043b985007a039d1cfbb623c6456bfe71a","observation_id":"eec794f3-9f71-424f-b33a-cd698431a4a6","resolution":{"observed_at":"2026-08-16T00:39:42.133829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.11716","last_updated":"2026-08-12T06:57:08Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T04:55:48.044252Z","submitted_at":"2026-08-12T06:57:08Z","title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":11},"total_outbound_references":18},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.11716."}