{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H4X3672QEFJWGQAR6MN7N5MV4Y","short_pith_number":"pith:H4X3672Q","schema_version":"1.0","canonical_sha256":"3f2fbf7f502153634011f31bf6f595e632bd327ea33b72af3ffaa62f837ac033","source":{"kind":"arxiv","id":"2608.07424","version":1},"attestation_state":"computed","paper":{"title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kaiyang Zheng, Suncheng Xiang, Yan Zhou, Yue Ouyang","submitted_at":"2026-08-07T17:12:13Z","abstract_excerpt":"Test-time scaling is often implemented by spending more compute along one axis: sampling more solutions, extending a chain of thought, or applying a stronger evaluator. Under a fixed inference budget, these choices compete. This paper formulates test-time reasoning as a compute-allocation problem in which a system must decide whether the next unit of compute should be spent on generation, verification, or stopping. We introduce CoBa, a compute-balanced routing policy that first obtains a small set of candidates, applies cheap verification broadly, and routes uncertain or high-value candidates "},"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.07424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-07T17:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"d1221a887222ebd218a9ad764fe93d0842f22d1bf75a1a48cf57b841c0d03228","abstract_canon_sha256":"aaa798465f72e1083abff9a521bd72495032b9d314c107b14e78117354f9d0fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:15:21.512791Z","signature_b64":"x99lKP3Yiu6la2iHXkG+ifBw3kEE8WN5R+JnLQ5hEOmcKItmciHCuIH7PNy5FM52ZPyt0pXgpmk1gnEhGXUhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f2fbf7f502153634011f31bf6f595e632bd327ea33b72af3ffaa62f837ac033","last_reissued_at":"2026-08-10T01:15:21.510186Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:15:21.510186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kaiyang Zheng, Suncheng Xiang, Yan Zhou, Yue Ouyang","submitted_at":"2026-08-07T17:12:13Z","abstract_excerpt":"Test-time scaling is often implemented by spending more compute along one axis: sampling more solutions, extending a chain of thought, or applying a stronger evaluator. Under a fixed inference budget, these choices compete. This paper formulates test-time reasoning as a compute-allocation problem in which a system must decide whether the next unit of compute should be spent on generation, verification, or stopping. We introduce CoBa, a compute-balanced routing policy that first obtains a small set of candidates, applies cheap verification broadly, and routes uncertain or high-value candidates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07424","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.07424/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.07424","created_at":"2026-08-10T01:15:21.511338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07424v1","created_at":"2026-08-10T01:15:21.511338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07424","created_at":"2026-08-10T01:15:21.511338+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4X3672QEFJW","created_at":"2026-08-10T01:15:21.511338+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4X3672QEFJWGQAR","created_at":"2026-08-10T01:15:21.511338+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4X3672Q","created_at":"2026-08-10T01:15:21.511338+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/H4X3672QEFJWGQAR6MN7N5MV4Y","json":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y.json","graph_json":"https://pith.science/api/pith-number/H4X3672QEFJWGQAR6MN7N5MV4Y/graph.json","events_json":"https://pith.science/api/pith-number/H4X3672QEFJWGQAR6MN7N5MV4Y/events.json","paper":"https://pith.science/paper/H4X3672Q"},"agent_actions":{"view_html":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y","download_json":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y.json","view_paper":"https://pith.science/paper/H4X3672Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07424&json=true","fetch_graph":"https://pith.science/api/pith-number/H4X3672QEFJWGQAR6MN7N5MV4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/H4X3672QEFJWGQAR6MN7N5MV4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y/action/storage_attestation","attest_author":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y/action/author_attestation","sign_citation":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y/action/citation_signature","submit_replication":"https://pith.science/pith/H4X3672QEFJWGQAR6MN7N5MV4Y/action/replication_record"}},"created_at":"2026-08-10T01:15:21.511338+00:00","updated_at":"2026-08-10T01:15:21.511338+00:00"}