Paper Citation Record · LEDGER

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2608.11716 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:39:41.867196Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

18 of 18 outbound references displayed

verified exact1
verified fuzzy11
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e463a34d-b192-4e59-91bd-d86be2a2ab25 · outbound

This paper cites Lemma 4.Let U be a vector space and letU′,U′′ be vector spaces withW=U ′⊕U′′.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Lemma 4.Let U be a vector space and letU′,U′′ be vector spaces withW=U ′⊕U′′

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:41.988769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 384a67dc-c5a2-4e3a-961d-a6078bdef0f4 · outbound

This paper cites an unresolved cited work.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Unresolved cited work

Reference 4

Resolution: unresolved; raw_fallback, observed 2026-08-16T00:39:42.184145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 114ae361-4bc0-4689-bcd6-077caed06386 · outbound

This paper cites In International Conference on Machine Learning, pages 2319–2363.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity In International Conference on Machine Learning, pages 2319–2363

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.167713Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 58bf7dd4-57b8-40b4-9bb1-5822fcbf0d6f · outbound

This paper cites A Theory of Learning with Autoregressive Chain of Thought.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity A Theory of Learning with Autoregressive Chain of Thought

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-16T00:39:41.818460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5b1a1b8-ac7b-439d-b588-81c65e5f4add · outbound

This paper cites InInternational Conference on Learning Representations, volume 2025, pages 6286–6309.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity InInternational Conference on Learning Representations, volume 2025, pages 6286–6309

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.098162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6730b0f9-a523-431b-8a05-4da238c63145 · outbound

This paper cites InThe Fourteenth International Conference on Learning Representations.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity InThe Fourteenth International Conference on Learning Representations

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.060369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ae0968a3-37f4-46ef-a4f1-6d9adb0505b6 · outbound

This paper cites an unresolved cited work.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-16T00:39:42.042528Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 31222366-f87e-416e-993e-ca7c1f9e20f4 · outbound

This paper cites an unresolved cited work.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Unresolved cited work

Reference 16

Resolution: unresolved; raw_fallback, observed 2026-08-16T00:39:42.025881Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation dbc68b6f-9c5e-47cd-9c5e-dbfc0569b8b9 · outbound

This paper cites While these characterize classes, concrete problems instantiating them remain scarce.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity While these characterize classes, concrete problems instantiating them remain scarce

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.008421Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1bd2e429-b7b4-47e3-9ecf-104e728fb2e5 · outbound

This paper cites 1974.The Design and Analysis of Computer Algorithms.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity 1974.The Design and Analysis of Computer Algorithms

Reference 1087

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.219000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8f107ca1-2f2d-40e6-b898-391acae7fa8b · outbound

This paper cites Philippe Flajolet and Robert Sedgewick.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Philippe Flajolet and Robert Sedgewick

Reference 1979

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.151338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1d0ec07a-10a1-49d0-861f-0b00dc06c4f4 · outbound

This paper cites In 2017 IEEE International Conference on Computer Vision (ICCV), pages 2098–2106.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity In 2017 IEEE International Conference on Computer Vision (ICCV), pages 2098–2106

Reference 2017

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.116323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 15acb808-67b8-4acb-b5ba-25d2d7133469 · outbound

This paper cites On the Turing Completeness of Modern Neural Network Architectures.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity On the Turing Completeness of Modern Neural Network Architectures

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-16T00:39:41.829039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bdb2c7b6-e01e-45db-a9c2-020df4766616 · outbound

This paper cites InProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, page 481–489, New York, NY , USA.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity InProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, page 481–489, New York, NY , USA

Reference 2021

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.201471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d0f10551-6a9d-4aef-bc12-8de75fae5ac2 · outbound

This paper cites Association for Computational Linguistics.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Association for Computational Linguistics

Reference 2023

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.080453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 951f21a5-4cff-4956-a4c1-a7e4549b547b · outbound

This paper cites Refined Horton-Strahler numbers I: a discrete bijection.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity Refined Horton-Strahler numbers I: a discrete bijection

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-16T00:39:41.772029Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba74cd40-fd55-4301-8aca-858ca8bd3af2 · outbound

This paper cites On the Existence of Universal Simulators of Attention.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity On the Existence of Universal Simulators of Attention

Reference 2025

Resolution: verified exact; local_arxiv, observed 2026-08-16T00:39:41.953335Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation eec794f3-9f71-424f-b33a-cd698431a4a6 · outbound

This paper cites In43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026, LIPIcs, pages 41:1–41:22.

Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity In43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026, LIPIcs, pages 41:1–41:22

Reference 2026

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:39:42.133829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.