{"as_of":"2026-08-12T04:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a9e36780dc169163cef5150c8d8df2ee8f03edc0f10309e57a488b9d4acf4fd","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:17:28.305280Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.07424/citation-record","integrity":"/paper/2608.07424/integrity","json":"/paper/2608.07424/citation-record.json","paper":"/paper/2608.07424"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:27.997519Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:27.997519Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:95f679950422c8c785ef8754b727b67f9464ae94916f3dceabecde6c1ab3e11d","observation_id":"2cafa792-6977-4c2b-9aa3-9bcc0657f2a8","resolution":{"observed_at":"2026-08-11T04:17:27.997519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-07-06T12:50:22.773056Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-11T04:17:28.007256Z","title":"arXiv preprint arXiv:2203.11171 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.007256Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:4918a9b48ec3d2427c9e9575b1b9e6cf6fc102eb1e0880118996a629dd3172e9","observation_id":"290ef5f8-c5bb-48b5-a5d5-23afc4682617","resolution":{"observed_at":"2026-08-11T04:17:28.007256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-11T04:17:28.016185Z","title":"URL https://arxiv","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.016185Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:c8ab19ddfbc9822937ca368255df235ddabb557a754af5531cc015427d66df52","observation_id":"ff110e4d-a562-47d8-aff4-2dfec021fa2e","resolution":{"observed_at":"2026-08-11T04:17:28.016185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.264873Z","title":"International Conference on Learning Representations , volume =","venue":null,"work_id":"5f972918-929f-47fb-a125-de2d2965975b","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.023144Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:d9aaf4439a589133df3a08905be4090675b82542f4bfa9fec3f0da4607415d64","observation_id":"cf478559-665f-4d71-b504-dbbe0fec7224","resolution":{"observed_at":"2026-08-11T04:17:29.271169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-11T04:17:28.030642Z","title":"arXiv preprint arXiv:2408.03314 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.030642Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:9b3da8967969844355bdd7bd9da9186631856a4ee453694fc8f40ac4221a3b47","observation_id":"f7fd3c4a-6be5-40be-960d-f56a2b627180","resolution":{"observed_at":"2026-08-11T04:17:28.030642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.240772Z","title":"Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing , pages =","venue":null,"work_id":"7deaf50f-01f0-456b-8466-1da0c36653f0","year":2025},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.037588Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:2c599fb0148fb067fb23d471a9ccaca76fc3d62ac4dddef1f6ef45922cce14de","observation_id":"8ca671a7-b423-4174-a300-31ef0a0c9e79","resolution":{"observed_at":"2026-08-11T04:17:29.248203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-11T04:17:28.043739Z","title":"arXiv preprint arXiv:2505.09388 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.043739Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:d8e1ecc1161fc3b274a220a2012a97b45fceee41fe4869d3d91f60de8cc95da8","observation_id":"346ef0e5-4e16-4b06-b183-6cc64fd232fc","resolution":{"observed_at":"2026-08-11T04:17:28.043739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.223393Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume =","venue":null,"work_id":"90201d0e-b122-478b-b636-b391f1377518","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.049979Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:d710f29f6c03f66112cef73c733ceacd15df3e81d871dccc4339db0998a41460","observation_id":"a80663ef-42f0-47ee-8dbd-df341351d05f","resolution":{"observed_at":"2026-08-11T04:17:29.229381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19877","last_updated":"2026-07-16T03:37:34Z","snapshot_observed_at":"2026-08-08T12:26:31.053048Z","submitted_at":"2025-03-25T17:41:18Z","title":"Scaling Evaluation-time Compute with Reasoning Models as Evaluators","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19877","snapshot_observed_at":"2026-08-11T04:17:28.057098Z","title":"arXiv preprint arXiv:2503.19877 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.057098Z"},"links":{"cited_paper":"/paper/2503.19877","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:9dc0eae556e8864f8ee65c81b3215f7ea391ee4bc7037e648c3800855b766825","observation_id":"642b8728-98c6-4eea-82dc-587aaf354f2e","resolution":{"observed_at":"2026-08-11T04:17:28.057098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04842","last_updated":"2026-04-12T16:48:19Z","snapshot_observed_at":"2026-08-02T13:20:15.810974Z","submitted_at":"2025-05-07T22:41:26Z","title":"Putting the Value Back in RL: Better Test-Time Scaling by Unifying LLM Reasoners With Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04842","snapshot_observed_at":"2026-08-11T04:17:28.064277Z","title":"arXiv preprint arXiv:2505.04842 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.064277Z"},"links":{"cited_paper":"/paper/2505.04842","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:974b034a9bcf37a15ed54faf6af9e15fc96aa86a88de548588b8e8dbe93761af","observation_id":"3248d106-bf70-4246-a449-32b3074ef3a4","resolution":{"observed_at":"2026-08-11T04:17:28.064277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.11202","last_updated":"2026-05-13T11:00:51Z","snapshot_observed_at":"2026-08-03T04:35:10.290241Z","submitted_at":"2026-02-05T08:35:01Z","title":"interwhen: A Generalizable Framework for Steering Reasoning Models with Test-time Verification","version":3},"cited_work":{"arxiv_id":"2602.11202","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.11202","snapshot_observed_at":"2026-08-11T04:17:28.641772Z","title":"interwhen: A Generalizable Framework for Steering Reasoning Models with Test-time Verification","venue":"cs.LO","work_id":"74fceaf3-76fb-4f07-8c7d-a0cf03e4901a","year":2026},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.070475Z"},"links":{"cited_paper":"/paper/2602.11202","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:522c250b5f5ed335e334441f236d63e5e5a57843b817ae2b5087f5e6c335fb05","observation_id":"427aefa4-3d98-4a6d-afcc-317dfa97d7c3","resolution":{"observed_at":"2026-08-11T04:17:28.650358Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21318","last_updated":"2025-04-30T05:05:09Z","snapshot_observed_at":"2026-08-08T08:43:53.657438Z","submitted_at":"2025-04-30T05:05:09Z","title":"Phi-4-reasoning Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21318","snapshot_observed_at":"2026-08-11T04:17:28.076043Z","title":"arXiv preprint arXiv:2504.21318 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.076043Z"},"links":{"cited_paper":"/paper/2504.21318","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:0821e6fd39a889d89f3675d7809b3d528358d198d6936cf958da2261ff641544","observation_id":"8791c5be-a7fe-473e-a472-02174321f6cb","resolution":{"observed_at":"2026-08-11T04:17:28.076043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-11T04:17:28.083777Z","title":"arXiv preprint arXiv:2103.03874 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.083777Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:7e6573e0e66abb8dfdceea98ff1a82e159bade911d39663b3238a24087c9f1fe","observation_id":"a92ffd19-719e-4298-b521-5021aca5f90f","resolution":{"observed_at":"2026-08-11T04:17:28.083777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.089929Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.089929Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:81aeb2d48b302c04c32d9c1a27cfbd14d71e835830f79363943eeff0b7f74d42","observation_id":"a9e4560f-7ef6-4e54-96f0-de506de92825","resolution":{"observed_at":"2026-08-11T04:17:28.089929Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.184344Z","title":"2025 , note =","venue":null,"work_id":"58118193-5ff6-488f-bc2a-3d0a55912283","year":2025},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.095755Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:668afa808f8edb0bc3c29405b74e65672a9113327d7d9675e2edf0bc0428e865","observation_id":"f1421ae3-5987-4d74-94d4-b1c00dc04336","resolution":{"observed_at":"2026-08-11T04:17:29.193110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.101776Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.101776Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:d8618b6a8ad9ee329cb26364c3eff921a5b89459d24575dd18fe34c7e062f1de","observation_id":"a505c9fb-4434-4263-abb3-36d041a27ee8","resolution":{"observed_at":"2026-08-11T04:17:28.101776Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.148890Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"0920afec-abdf-40ca-8590-799f5209f0c3","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.107932Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:1335d8f365e761d5fd5df9e023ef2fb8c80a57f9a7a9e4db2efdeb7704cbf68d","observation_id":"161a4e2d-7da2-4970-bde5-5779b6032303","resolution":{"observed_at":"2026-08-11T04:17:29.154388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.125541Z","title":"Proceedings of the 29th symposium on operating systems principles , pages =","venue":null,"work_id":"fe696a3b-b4b6-4914-b0e0-944f964d3a88","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.115423Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:ebe71627f3bf02a00faeae61490c9271e1fd5ca18731867f9979c930fb167798","observation_id":"ef0bd0c6-03d6-467f-8a9a-9880ced533f3","resolution":{"observed_at":"2026-08-11T04:17:29.131371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.121383Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.121383Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:2bafc8f3bd914d5ecbf7558088bd1bdf8c620429070efe11d762fdca3234d2a3","observation_id":"b8480696-9fa0-45a0-85dd-7c7edbd08858","resolution":{"observed_at":"2026-08-11T04:17:28.121383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.093364Z","title":"Journal of machine learning research , volume =","venue":null,"work_id":"125bb28c-3238-42db-8c93-6891e7f43481","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.127387Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:21c9180ddc86bfb1c2a5e3142718eeee22895b0d20ab37905740470ed161283b","observation_id":"128d014b-96d6-4869-978f-5975cdb9eb7a","resolution":{"observed_at":"2026-08-11T04:17:29.100083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.073991Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":"bc01d75c-dfb2-4927-af8f-28471425f767","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.133822Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:038c4d9d326c9283d791d2d8aa864ba57f31818499f8a1c2db4cc3d3ccc21203","observation_id":"754197af-3181-4b5c-9834-2d4d0cd0d543","resolution":{"observed_at":"2026-08-11T04:17:29.080647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.053381Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"ed338467-a279-4fa2-8ee7-14ac5d9c8b42","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.140019Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:f3b83415df06e94fbb7a4a2da8bad6a0af629096fe9d27d60a85f7995afaf81c","observation_id":"2e481435-7c3b-41b5-80b4-63253e5c09f0","resolution":{"observed_at":"2026-08-11T04:17:29.059872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-11T04:17:28.146474Z","title":"arXiv preprint arXiv:2210.03629 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.146474Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:7740237e1014db3492f3db790e045bd5ecfc4fd890ce5bfac5b2a8274c3a07bc","observation_id":"5309beed-365f-4720-9a76-59839fae02f0","resolution":{"observed_at":"2026-08-11T04:17:28.146474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.032835Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":"dff4ffa5-e6cf-434b-9936-d22fa1033ca3","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.152332Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:926e06138ec4a43ade6e641191f441d6879be6fddceccbe465e3ebdbb4e64f7d","observation_id":"34ec474d-634b-46c0-a86a-646953606e92","resolution":{"observed_at":"2026-08-11T04:17:29.038630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:29.014489Z","title":"International conference on machine learning , pages =","venue":null,"work_id":"7f0006dd-49d6-4cc3-a3e0-9b7a180bc494","year":2023},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.159017Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:ca9fb64b7a266a0e5c306461930a2664ecf35571b0dc18ce339ef227348ae16b","observation_id":"3de86866-820a-466f-92d1-eafd912caa27","resolution":{"observed_at":"2026-08-11T04:17:29.019989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-11T04:17:28.167249Z","title":"arXiv preprint arXiv:2211.12588 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.167249Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:a57dee463129711afec97f3381c5a661c796de25bc6f6e5d73a3712cd8a5eb42","observation_id":"d6a854de-ba36-4621-9f70-4cc1ac5a6f9b","resolution":{"observed_at":"2026-08-11T04:17:28.167249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.173117Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.173117Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:6f01f947eb392a7049f50dcf52463215ca095c346eebb3a14cce8c146755fc7b","observation_id":"8fde510c-3519-4480-931b-bb18242e811a","resolution":{"observed_at":"2026-08-11T04:17:28.173117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.178912Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.178912Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:ac1b4ad823707a779ae1d5882650dc28521c081596667a786306f663ead62f2c","observation_id":"1574ef32-115b-4c3e-8708-616ff981a471","resolution":{"observed_at":"2026-08-11T04:17:28.178912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-11T04:17:28.184752Z","title":"arXiv preprint arXiv:2407.21787 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.184752Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:32305564f9c96e63ad2db52a1962beaa5a7e48ca485e6085e9de9640ae391e07","observation_id":"b24f7f8b-1b90-465f-9321-f8b6387a3c31","resolution":{"observed_at":"2026-08-11T04:17:28.184752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.191367Z","title":"Science , volume =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.191367Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:85decf8ed638c5304b25ef122109b7123008be1a68a6a9791fbd9a2fae38a14b","observation_id":"3c4a006a-640c-4a61-a2ce-39460fd2a1c0","resolution":{"observed_at":"2026-08-11T04:17:28.191367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14275","last_updated":"2022-11-25T18:19:44Z","snapshot_observed_at":"2026-08-01T02:16:43.109337Z","submitted_at":"2022-11-25T18:19:44Z","title":"Solving math word problems with process- and outcome-based feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14275","snapshot_observed_at":"2026-08-11T04:17:28.197376Z","title":"arXiv preprint arXiv:2211.14275 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.197376Z"},"links":{"cited_paper":"/paper/2211.14275","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:11dd88f5127bd3fc78540cfc699a65f53910c1fc3d3e46b984e5bbc4a448363c","observation_id":"b1e290e3-1084-4114-babb-31c43c7a34ff","resolution":{"observed_at":"2026-08-11T04:17:28.197376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.936619Z","title":"Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages =","venue":null,"work_id":"59bf9a05-f433-4720-bbec-605edfe2291e","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.204653Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:a04eb40b601c7f0d2983915a839d9e9ede1cb4aa516efd62f259e34af4e92382","observation_id":"a45bda8f-3cf8-4f7b-b93e-837781e34c2b","resolution":{"observed_at":"2026-08-11T04:17:28.942638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.914632Z","title":"Findings of the Association for Computational Linguistics: NAACL 2025 , pages =","venue":null,"work_id":"69e673a4-2550-4795-86e5-77049ba611d4","year":2025},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.210520Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:e96239c6dd93d779ecd2ea11d35ae0dee0db8c485d8d6a0e609167698664958e","observation_id":"f3747ede-0460-44c3-8f33-a3ae0e820d87","resolution":{"observed_at":"2026-08-11T04:17:28.920690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.895654Z","title":"Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages =","venue":null,"work_id":"7c26a8b2-87fa-4bb5-bc77-3edd8be1db7b","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.216829Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:7ff69f80d86e75d7168e8ce7548e5255442af5e60095851b67aa3f57a693463d","observation_id":"f7234770-3fb3-488b-975b-413299a3c6f1","resolution":{"observed_at":"2026-08-11T04:17:28.901732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08983","last_updated":"2017-02-21T16:21:21Z","snapshot_observed_at":"2026-08-04T14:24:45.814840Z","submitted_at":"2016-03-29T22:09:00Z","title":"Adaptive Computation Time for Recurrent Neural Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.08983","snapshot_observed_at":"2026-08-11T04:17:28.222826Z","title":"arXiv preprint arXiv:1603.08983 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.222826Z"},"links":{"cited_paper":"/paper/1603.08983","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:de241723ce5957ab2d8388ea7e458dad2e80c0095c8c0a5df29f5ac86b0c43b6","observation_id":"23f9cad9-35fb-4011-ac61-311c1d974c4c","resolution":{"observed_at":"2026-08-11T04:17:28.222826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-11T04:17:28.229120Z","title":"arXiv preprint arXiv:2305.05176 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.229120Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:7b60f7a4437cab0f08bb1f745e3320fdf0eabac32be6f4d1ac962d73cb1fcf3a","observation_id":"56ca2d5c-e547-4a8f-939f-1683c8f1d2dc","resolution":{"observed_at":"2026-08-11T04:17:28.229120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.874938Z","title":"Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages =","venue":null,"work_id":"850e45e4-0a6c-4b8a-9cb3-7987b1fc4865","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.235425Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:e8e0d8b348a51bc95a51905965b262955a4cd2c489481ad436220536d2359428","observation_id":"eb62b819-ad96-442e-954b-20c9f5b45d32","resolution":{"observed_at":"2026-08-11T04:17:28.882327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-11T04:17:28.241598Z","title":"arXiv preprint arXiv:2406.18665 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.241598Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:0a237058e6cfc5b646e3ce53ed30fcd34bbbb41593da5fbf4ef8396cc29a157c","observation_id":"ebe21d6c-a89c-4fa2-9d92-22b822072e47","resolution":{"observed_at":"2026-08-11T04:17:28.241598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.247755Z","title":"Advances in neural information processing systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.247755Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:a2992f6449279a9626282ba5e9590e93d7fe2ae2ee8998d7946f042726362bf6","observation_id":"d2df65ab-7274-4388-95fb-843a56d93014","resolution":{"observed_at":"2026-08-11T04:17:28.247755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-11T04:17:28.254832Z","title":"arXiv preprint arXiv:2402.03300 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.254832Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:100c61cb78c456819c8b31c73abf1a6147fcdad349512dd4a7f3b50c8eb37778","observation_id":"ace57279-01d2-452c-ab8c-e1817ee3c64c","resolution":{"observed_at":"2026-08-11T04:17:28.254832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-10T12:02:35.919497Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-11T04:17:28.261804Z","title":"arXiv preprint arXiv:2311.12022 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.261804Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:d0b6837efb600d7310dcc1f105a2c52eac9f3ec9a209dadd64934248b162dba9","observation_id":"76e62273-57a7-41a2-9c7e-2baa89388e64","resolution":{"observed_at":"2026-08-11T04:17:28.261804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.839797Z","title":"Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages =","venue":null,"work_id":"04c28cc2-3024-42a5-9a66-be2c5fd6109b","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.269292Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:6d3342b7284269df59edd5bbf05f35057b6de71c2bcae2a15aa920c271f1c95b","observation_id":"4821a21b-80c7-49c0-98cc-898ba7fa18af","resolution":{"observed_at":"2026-08-11T04:17:28.846678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.817831Z","title":"International Conference on Learning Representations , volume =","venue":null,"work_id":"d47c8109-1820-407f-8fd7-315e8129db15","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.275356Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:9aa63c5a8db9449eccc264691429d1fc7a7bbd2644fb640509f6a904aa598a09","observation_id":"3a76bdd2-776e-4d56-a622-5ca8bae1c6b2","resolution":{"observed_at":"2026-08-11T04:17:28.826192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-11T04:17:28.280891Z","title":"arXiv preprint arXiv:2501.12948 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.280891Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:4656ae6fa44d27c7645ea9cf4759dfaf0ee521799a7f001c2fa87229bafdf630","observation_id":"d20f26ec-b36a-4f60-a2ca-78c6e0d50db4","resolution":{"observed_at":"2026-08-11T04:17:28.280891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.24235","last_updated":"2025-05-04T15:48:08Z","snapshot_observed_at":"2026-08-11T13:17:40.816545Z","submitted_at":"2025-03-31T15:46:15Z","title":"A Survey on Test-Time Scaling in Large Language Models: What, How, Where, and How Well?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.24235","snapshot_observed_at":"2026-08-11T04:17:28.287021Z","title":"arXiv preprint arXiv:2503.24235 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.287021Z"},"links":{"cited_paper":"/paper/2503.24235","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:5b168cfbd716018b6ddecd2a3580207151ef3e4b6cce882f7429660ea8f5c423","observation_id":"253e62c3-bf05-4300-b54b-97b6fe472d81","resolution":{"observed_at":"2026-08-11T04:17:28.287021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:17:28.799756Z","title":"arXiv e-prints , pages =","venue":null,"work_id":"987f5807-7c6e-488c-831e-fe2d2922d364","year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.293282Z"},"links":{"citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:809faa9c671dbb5b1d0cca49575837913d87b73f392bc8b4b7945750c3e0bdf5","observation_id":"c18e873b-5cdd-4b26-bf99-1a1e96b02573","resolution":{"observed_at":"2026-08-11T04:17:28.804720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.09864","snapshot_observed_at":"2026-08-11T04:17:28.305280Z","title":"arXiv preprint arXiv:2509.09864 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T04:17:28.305280Z"},"links":{"cited_paper":"/paper/2509.09864","citing_paper":"/paper/2608.07424"},"observation_digest":"sha256:ddaffc94b051869098b3dbec84f25a8cdf735fcee0e653e0053874aa2eed8c57","observation_id":"5924a9b0-1e17-43ac-b442-ce885de8e09b","resolution":{"observed_at":"2026-08-11T04:17:28.305280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.07424","last_updated":"2026-08-10T06:21:10Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T04:17:35.913940Z","submitted_at":"2026-08-07T17:12:13Z","title":"CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":2,"unresolved":26,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2608.07424."}