{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TKQ6X5YBU6YAQSHRCHBI5KOZUQ","short_pith_number":"pith:TKQ6X5YB","canonical_record":{"source":{"id":"2604.08872","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-10T02:24:17Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"01f93af25a3635f86bce3d0b9887416407a1ff775b62ffc2132d253e0ab14f6a","abstract_canon_sha256":"3805ad40bc0b4d23a563375da9d4f5ddde8708b7a7d08ba2c9606f1dcdeca1b8"},"schema_version":"1.0"},"canonical_sha256":"9aa1ebf701a7b00848f111c28ea9d9a40cbd6baee8b011aa44d8f28c2bab765a","source":{"kind":"arxiv","id":"2604.08872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08872","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08872v2","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08872","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"TKQ6X5YBU6YA","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"TKQ6X5YBU6YAQSHR","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"TKQ6X5YB","created_at":"2026-05-22T01:04:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TKQ6X5YBU6YAQSHRCHBI5KOZUQ","target":"record","payload":{"canonical_record":{"source":{"id":"2604.08872","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-10T02:24:17Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"01f93af25a3635f86bce3d0b9887416407a1ff775b62ffc2132d253e0ab14f6a","abstract_canon_sha256":"3805ad40bc0b4d23a563375da9d4f5ddde8708b7a7d08ba2c9606f1dcdeca1b8"},"schema_version":"1.0"},"canonical_sha256":"9aa1ebf701a7b00848f111c28ea9d9a40cbd6baee8b011aa44d8f28c2bab765a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:01.925442Z","signature_b64":"3CeBQymKa34MYqaYr7ATZi3qOLmUSbhElU2XfKc+vvITUsLvfnDb49vN4RhV50zJLb/ejuf31HoMkly5BWnBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aa1ebf701a7b00848f111c28ea9d9a40cbd6baee8b011aa44d8f28c2bab765a","last_reissued_at":"2026-05-22T01:04:01.924749Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:01.924749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.08872","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjAIQGKIFM8LtZ227HtCd76ROrmAjm9U23ftdEQ6yVTlGEpDNKFZV60wgbVjAnGrZWz1T6TmDvrqKvjqkjSXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:21:20.424197Z"},"content_sha256":"daed3a8e25220c9902d6db23dc3bc5355296be393d81c311d06369140c736dd2","schema_version":"1.0","event_id":"sha256:daed3a8e25220c9902d6db23dc3bc5355296be393d81c311d06369140c736dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TKQ6X5YBU6YAQSHRCHBI5KOZUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How does Chain of Thought decompose complex tasks?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat.","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"cs.LG","authors_text":"Amrut Nadgir, Pratik Chaudhari, Vijay Balasubramanian","submitted_at":"2026-04-10T02:24:17Z","abstract_excerpt":"Many language tasks can be modeled as classification problems where a large language model (LLM) is given a prompt and selects one among many possible answers. We show that the classification error in such problems scales as a power law in the number of classes. This has a dramatic consequence: the prediction error can be reduced substantially by splitting the overall task into a sequence of smaller classification problems, each with the same number of classes (\"degree\"). This tree-structured decomposition models chain-of-thought (CoT). It has been observed that CoT-based predictors perform be"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"It is impossible to surpass this minimal error by increasing the depth of thinking. There exists a critical threshold for the degree, below which thinking is detrimental, and above which there exists an optimal depth that minimizes the error.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The classification error scales as a power law in the number of classes, and the tree-structured decomposition accurately models chain-of-thought behavior in LLMs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Chain-of-thought decomposes complex classification into a tree of fixed-degree sub-classifications whose power-law error implies an optimal thinking depth above a critical degree threshold.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"80ec02b784d64dc516498c3cdb1d70b15dd2ac498aa95de032acba85cf9bbb3e"},"source":{"id":"2604.08872","kind":"arxiv","version":2},"verdict":{"id":"5ddf28ea-b8c6-4977-aacc-cbda69ea8cbe","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:47:43.240338Z","strongest_claim":"It is impossible to surpass this minimal error by increasing the depth of thinking. There exists a critical threshold for the degree, below which thinking is detrimental, and above which there exists an optimal depth that minimizes the error.","one_line_summary":"Chain-of-thought decomposes complex classification into a tree of fixed-degree sub-classifications whose power-law error implies an optimal thinking depth above a critical degree threshold.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The classification error scales as a power law in the number of classes, and the tree-structured decomposition accurately models chain-of-thought behavior in LLMs.","pith_extraction_headline":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08872/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":2,"snapshot_sha256":"d4a695931095301f804f35b1ca5c4d907283355f0e0a4e0be24aa74e899c6ecd"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5ddf28ea-b8c6-4977-aacc-cbda69ea8cbe"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0hAX6EwL3NcTne6SP7+TKY/SvKfsjLMKBpv7hhQiUA1lw2Rp/yil3FC56XacnlI7CI5tXkKQsj5M27g/WqyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:21:20.425075Z"},"content_sha256":"314bd56408a8d5e09c1dfd853888653e778c27086c61981d34b4b04320463d8c","schema_version":"1.0","event_id":"sha256:314bd56408a8d5e09c1dfd853888653e778c27086c61981d34b4b04320463d8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/bundle.json","state_url":"https://pith.science/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:21:20Z","links":{"resolver":"https://pith.science/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ","bundle":"https://pith.science/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/bundle.json","state":"https://pith.science/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKQ6X5YBU6YAQSHRCHBI5KOZUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TKQ6X5YBU6YAQSHRCHBI5KOZUQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3805ad40bc0b4d23a563375da9d4f5ddde8708b7a7d08ba2c9606f1dcdeca1b8","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-10T02:24:17Z","title_canon_sha256":"01f93af25a3635f86bce3d0b9887416407a1ff775b62ffc2132d253e0ab14f6a"},"schema_version":"1.0","source":{"id":"2604.08872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08872","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08872v2","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08872","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"TKQ6X5YBU6YA","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"TKQ6X5YBU6YAQSHR","created_at":"2026-05-22T01:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"TKQ6X5YB","created_at":"2026-05-22T01:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:314bd56408a8d5e09c1dfd853888653e778c27086c61981d34b4b04320463d8c","target":"graph","created_at":"2026-05-22T01:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"It is impossible to surpass this minimal error by increasing the depth of thinking. There exists a critical threshold for the degree, below which thinking is detrimental, and above which there exists an optimal depth that minimizes the error."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The classification error scales as a power law in the number of classes, and the tree-structured decomposition accurately models chain-of-thought behavior in LLMs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Chain-of-thought decomposes complex classification into a tree of fixed-degree sub-classifications whose power-law error implies an optimal thinking depth above a critical degree threshold."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat."}],"snapshot_sha256":"80ec02b784d64dc516498c3cdb1d70b15dd2ac498aa95de032acba85cf9bbb3e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d4a695931095301f804f35b1ca5c4d907283355f0e0a4e0be24aa74e899c6ecd"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.08872/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many language tasks can be modeled as classification problems where a large language model (LLM) is given a prompt and selects one among many possible answers. We show that the classification error in such problems scales as a power law in the number of classes. This has a dramatic consequence: the prediction error can be reduced substantially by splitting the overall task into a sequence of smaller classification problems, each with the same number of classes (\"degree\"). This tree-structured decomposition models chain-of-thought (CoT). It has been observed that CoT-based predictors perform be","authors_text":"Amrut Nadgir, Pratik Chaudhari, Vijay Balasubramanian","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"headline":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-10T02:24:17Z","title":"How does Chain of Thought decompose complex tasks?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.08872","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T17:47:43.240338Z","id":"5ddf28ea-b8c6-4977-aacc-cbda69ea8cbe","model_set":{"reader":"grok-4.3"},"one_line_summary":"Chain-of-thought decomposes complex classification into a tree of fixed-degree sub-classifications whose power-law error implies an optimal thinking depth above a critical degree threshold.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Chain-of-thought thinking decomposes large classification tasks into a tree of smaller ones, but error reaches a minimum at an optimal depth that deeper thinking cannot beat.","strongest_claim":"It is impossible to surpass this minimal error by increasing the depth of thinking. There exists a critical threshold for the degree, below which thinking is detrimental, and above which there exists an optimal depth that minimizes the error.","weakest_assumption":"The classification error scales as a power law in the number of classes, and the tree-structured decomposition accurately models chain-of-thought behavior in LLMs."}},"verdict_id":"5ddf28ea-b8c6-4977-aacc-cbda69ea8cbe"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:daed3a8e25220c9902d6db23dc3bc5355296be393d81c311d06369140c736dd2","target":"record","created_at":"2026-05-22T01:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3805ad40bc0b4d23a563375da9d4f5ddde8708b7a7d08ba2c9606f1dcdeca1b8","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-10T02:24:17Z","title_canon_sha256":"01f93af25a3635f86bce3d0b9887416407a1ff775b62ffc2132d253e0ab14f6a"},"schema_version":"1.0","source":{"id":"2604.08872","kind":"arxiv","version":2}},"canonical_sha256":"9aa1ebf701a7b00848f111c28ea9d9a40cbd6baee8b011aa44d8f28c2bab765a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9aa1ebf701a7b00848f111c28ea9d9a40cbd6baee8b011aa44d8f28c2bab765a","first_computed_at":"2026-05-22T01:04:01.924749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:01.924749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3CeBQymKa34MYqaYr7ATZi3qOLmUSbhElU2XfKc+vvITUsLvfnDb49vN4RhV50zJLb/ejuf31HoMkly5BWnBAA==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:01.925442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.08872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daed3a8e25220c9902d6db23dc3bc5355296be393d81c311d06369140c736dd2","sha256:314bd56408a8d5e09c1dfd853888653e778c27086c61981d34b4b04320463d8c"],"state_sha256":"1c49de5a87f8d5a13fdc09a76b6ce1018ecff7849dc10febb5b99226e2508df2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGIMxPJ627k5WLHdf9KMExHcW5Trlkz59neKqraaWadBYl+kl5sP+tpKjZCj6T9+wxSQNXKmvtgu9rEoAkJcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:21:20.428290Z","bundle_sha256":"f902efe58c227ff279dad0178bd1112156484307afab3a49f7fd31f93081b628"}}