{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBYCBP2HPJWZ74RKEBYMUGDQSL","short_pith_number":"pith:CBYCBP2H","schema_version":"1.0","canonical_sha256":"107020bf477a6d9ff22a2070ca187092d222811367044dfd091c60eb5e3347cc","source":{"kind":"arxiv","id":"2608.11716","version":1},"attestation_state":"computed","paper":{"title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anish Chakrabarty, Debanjan Dutta, Swagatam Das","submitted_at":"2026-08-12T06:57:08Z","abstract_excerpt":"Chain of Thought (CoT) lifts the expressive ceiling of bounded-depth Transformers, with characterizations tying the number of CoT steps to circuit complexity classes. What remains largely missing are concrete instantiations with explicit, depth-bounded constructions, and the traversal procedures such characterizations presuppose. We close this gap for branching complexity. We give CoT realizations of depth-first search (DFS) and of Dijkstra algorithm, the latter subsuming breadth-first search, by unique hard-attention decoders of at most two layers, and use them as a shared computational subst"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.11716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T06:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"9fbbf72009440bd6069f1cd0b524c600fdbae5f8c68ff7218099066456a304d1","abstract_canon_sha256":"6de17064f398282fb39b145d3dc9b7eaf3bdf17e9cc66944045b28d6c4e05b0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:27:54.751000Z","signature_b64":"3MvCxMjvnXH9KmXBQGHJpy/6QkyGF2AkAh3kTew7uK4IXoa6x6m9bbLr+8LAZaufBaXtxmaFC1EzRMaPTdRgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"107020bf477a6d9ff22a2070ca187092d222811367044dfd091c60eb5e3347cc","last_reissued_at":"2026-08-13T01:27:54.748514Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:27:54.748514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anish Chakrabarty, Debanjan Dutta, Swagatam Das","submitted_at":"2026-08-12T06:57:08Z","abstract_excerpt":"Chain of Thought (CoT) lifts the expressive ceiling of bounded-depth Transformers, with characterizations tying the number of CoT steps to circuit complexity classes. What remains largely missing are concrete instantiations with explicit, depth-bounded constructions, and the traversal procedures such characterizations presuppose. We close this gap for branching complexity. We give CoT realizations of depth-first search (DFS) and of Dijkstra algorithm, the latter subsuming breadth-first search, by unique hard-attention decoders of at most two layers, and use them as a shared computational subst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11716","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.11716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.11716","created_at":"2026-08-13T01:27:54.749852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11716v1","created_at":"2026-08-13T01:27:54.749852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11716","created_at":"2026-08-13T01:27:54.749852+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBYCBP2HPJWZ","created_at":"2026-08-13T01:27:54.749852+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBYCBP2HPJWZ74RK","created_at":"2026-08-13T01:27:54.749852+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBYCBP2H","created_at":"2026-08-13T01:27:54.749852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL","json":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL.json","graph_json":"https://pith.science/api/pith-number/CBYCBP2HPJWZ74RKEBYMUGDQSL/graph.json","events_json":"https://pith.science/api/pith-number/CBYCBP2HPJWZ74RKEBYMUGDQSL/events.json","paper":"https://pith.science/paper/CBYCBP2H"},"agent_actions":{"view_html":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL","download_json":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL.json","view_paper":"https://pith.science/paper/CBYCBP2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11716&json=true","fetch_graph":"https://pith.science/api/pith-number/CBYCBP2HPJWZ74RKEBYMUGDQSL/graph.json","fetch_events":"https://pith.science/api/pith-number/CBYCBP2HPJWZ74RKEBYMUGDQSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL/action/storage_attestation","attest_author":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL/action/author_attestation","sign_citation":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL/action/citation_signature","submit_replication":"https://pith.science/pith/CBYCBP2HPJWZ74RKEBYMUGDQSL/action/replication_record"}},"created_at":"2026-08-13T01:27:54.749852+00:00","updated_at":"2026-08-13T01:27:54.749852+00:00"}