{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TE66YHR3JPYINBWLKOTDYUSUB4","short_pith_number":"pith:TE66YHR3","schema_version":"1.0","canonical_sha256":"993dec1e3b4bf08686cb53a63c52540f35aa25ef75bc519f328e2847c0609173","source":{"kind":"arxiv","id":"2602.02909","version":2},"attestation_state":"computed","paper":{"title":"Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Adith Swaminathan, Jennifer Neville, Kiran Tomlinson, Tobias Schnabel","submitted_at":"2026-02-02T23:33:34Z","abstract_excerpt":"Inference-time scaling via chain-of-thought (CoT) reasoning is a major driver of state-of-the-art LLM performance, but it comes with substantial latency and compute costs. We address a fundamental theoretical question: how many reasoning tokens are required to solve a problem as input size grows? By extending the bounded attention prefix oracle (BAPO) model--an abstraction of LLMs that quantifies the information flow required to solve a task--we prove lower bounds on the CoT tokens required for three canonical BAPO-hard tasks: binary majority, triplet matching, and graph reachability. We show "},"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":"2602.02909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-02T23:33:34Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"5cbbb0c17d6a0ed7cbe594e7856e59afd111cd4c2fb75d1950ebe04a6512306c","abstract_canon_sha256":"c497157c41b8d9a0452e38cc7b57d8c0d749654a5289ebe7cb9b3ce54982d135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:03.269169Z","signature_b64":"/6Nx9cFBWrss+TKw6qCYESxPbxbHnmL2u2cEQmGFnOBMueSm+sMFoWLLQToo8AKZcaoAMPeSQQIV61wS2hNbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"993dec1e3b4bf08686cb53a63c52540f35aa25ef75bc519f328e2847c0609173","last_reissued_at":"2026-05-29T01:05:03.268220Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:03.268220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Adith Swaminathan, Jennifer Neville, Kiran Tomlinson, Tobias Schnabel","submitted_at":"2026-02-02T23:33:34Z","abstract_excerpt":"Inference-time scaling via chain-of-thought (CoT) reasoning is a major driver of state-of-the-art LLM performance, but it comes with substantial latency and compute costs. We address a fundamental theoretical question: how many reasoning tokens are required to solve a problem as input size grows? By extending the bounded attention prefix oracle (BAPO) model--an abstraction of LLMs that quantifies the information flow required to solve a task--we prove lower bounds on the CoT tokens required for three canonical BAPO-hard tasks: binary majority, triplet matching, and graph reachability. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.02909","kind":"arxiv","version":2},"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/2602.02909/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":"2602.02909","created_at":"2026-05-29T01:05:03.268333+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.02909v2","created_at":"2026-05-29T01:05:03.268333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02909","created_at":"2026-05-29T01:05:03.268333+00:00"},{"alias_kind":"pith_short_12","alias_value":"TE66YHR3JPYI","created_at":"2026-05-29T01:05:03.268333+00:00"},{"alias_kind":"pith_short_16","alias_value":"TE66YHR3JPYINBWL","created_at":"2026-05-29T01:05:03.268333+00:00"},{"alias_kind":"pith_short_8","alias_value":"TE66YHR3","created_at":"2026-05-29T01:05:03.268333+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/TE66YHR3JPYINBWLKOTDYUSUB4","json":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4.json","graph_json":"https://pith.science/api/pith-number/TE66YHR3JPYINBWLKOTDYUSUB4/graph.json","events_json":"https://pith.science/api/pith-number/TE66YHR3JPYINBWLKOTDYUSUB4/events.json","paper":"https://pith.science/paper/TE66YHR3"},"agent_actions":{"view_html":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4","download_json":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4.json","view_paper":"https://pith.science/paper/TE66YHR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.02909&json=true","fetch_graph":"https://pith.science/api/pith-number/TE66YHR3JPYINBWLKOTDYUSUB4/graph.json","fetch_events":"https://pith.science/api/pith-number/TE66YHR3JPYINBWLKOTDYUSUB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4/action/storage_attestation","attest_author":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4/action/author_attestation","sign_citation":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4/action/citation_signature","submit_replication":"https://pith.science/pith/TE66YHR3JPYINBWLKOTDYUSUB4/action/replication_record"}},"created_at":"2026-05-29T01:05:03.268333+00:00","updated_at":"2026-05-29T01:05:03.268333+00:00"}