{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:12:15Z","timestamp":1783746735318,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T00:00:00Z","timestamp":1783900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2411386"],"award-info":[{"award-number":["2411386"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2411387"],"award-info":[{"award-number":["2411387"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2514056"],"award-info":[{"award-number":["2514056"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DEAC02-06CH11357\\\/0F-60169"],"award-info":[{"award-number":["DEAC02-06CH11357\\\/0F-60169"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,13]]},"DOI":"10.1145\/3806645.3816237","type":"proceedings-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T04:21:11Z","timestamp":1783743671000},"page":"745-750","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5513-8299","authenticated-orcid":false,"given":"Atkia","family":"Mahila","sequence":"first","affiliation":[{"name":"Rochester Institute of Technology, Rochester, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8200-0148","authenticated-orcid":false,"given":"Avinash","family":"Maurya","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5034-2880","authenticated-orcid":false,"given":"M. Mustafa","family":"Rafique","sequence":"additional","affiliation":[{"name":"Rochester Institute of Technology, Rochester, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0661-7509","authenticated-orcid":false,"given":"Bogdan","family":"Nicolae","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,13]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Argonne Leadership Computing Facility. 2026. Polaris. https:\/\/www.alcf.anl.gov\/polaris. Accessed: May 1 2026."},{"key":"e_1_3_3_1_3_2","volume-title":"ISCA\u201926: The International Symposium on Computer Architecture","author":"Arif Moiz","year":"2026","unstructured":"Moiz Arif, Avinash Maurya, Bogdan Nicolae, and Sudharshan Vazhkudai. 2026. Understanding Inference Scaling for LLMs: Bottlenecks, Trade-offs, and Performance Principles. In ISCA\u201926: The International Symposium on Computer Architecture. IEEE\/ACM, Raleigh, NC, USA."},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1800"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Cameron\u00a0B. Browne Edward Powley Daniel Whitehouse Simon\u00a0M. Lucas Peter\u00a0I. Cowling et\u00a0al. 2012. A Survey of Monte Carlo Tree Search Methods. IEEE: Transactions on Computational Intelligence and AI in Games (2012). 10.1109\/tciaig.2012.2186810","DOI":"10.1109\/tciaig.2012.2186810"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Weipeng Cao Jiongjiong Gu Zhong Ming Zhiyuan Cai Yuzhao Wang et\u00a0al. 2025. Flexible Computing: A New Framework for Improving Resource Allocation and Scheduling in Elastic Computing. IEEE Transactions on Services Computing1 (2025). 10.1109\/tsc.2024.3489433","DOI":"10.1109\/tsc.2024.3489433"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Karl Cobbe Vineet Kosaraju Mohammad Bavarian Mark Chen Heewoo Jun et\u00a0al. 2021. Training Verifiers to Solve Math Word Problems. 10.48550\/ARXIV.2110.14168","DOI":"10.48550\/ARXIV.2110.14168"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.acl-long.550"},{"key":"e_1_3_3_1_9_2","unstructured":"John Duchi Elad Hazan and Yoram Singer. 2021. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. JMLR: Journal of Machine Learning Research (2021). http:\/\/jmlr.org\/papers\/v12\/duchi11a.html"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Zitian Gao Boye Niu Xuzheng He Haotian Xu Hongzhang Liu et\u00a0al. 2024. Interpretable Contrastive Monte Carlo Tree Search Reasoning. 10.48550\/ARXIV.2410.01707","DOI":"10.48550\/ARXIV.2410.01707"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2103.03874"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Nathan Herr Tim Rockt\u00e4schel and Roberta Raileanu. 2025. LLM-First Search: Self-Guided Exploration of the Solution Space. 10.48550\/ARXIV.2506.05213","DOI":"10.48550\/ARXIV.2506.05213"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2176"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Jinhao Jiang Zhipeng Chen Yingqian Min Jie Chen Xiaoxue Cheng et\u00a0al. 2024. Technical Report: Enhancing LLM Reasoning with Reward-guided Tree Search. CoRR (2024). https:\/\/doi.org\/10.48550\/arXiv.2411.11694","DOI":"10.48550\/arXiv.2411.11694"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Jared Kaplan Sam McCandlish Tom Henighan Tom\u00a0B. Brown Benjamin Chess et\u00a0al. 2020. Scaling Laws for Neural Language Models. 10.48550\/ARXIV.2001.08361","DOI":"10.48550\/ARXIV.2001.08361"},{"key":"e_1_3_3_1_16_2","volume-title":"NeurIPS 2025 Workshop on Efficient Reasoning","author":"Kim Joongho","year":"2025","unstructured":"Joongho Kim, Xirui Huang, Zarreen Reza, Gabriel Grand, Kevin Zhu, and Ryan Lagasse. 2025. Chopping Trees: Semantic Similarity Based Dynamic Pruning for Tree-of-Thought Reasoning. In NeurIPS 2025 Workshop on Efficient Reasoning. https:\/\/openreview.net\/forum?id=6xrbjd86dF"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Jiaxi Li Yucheng Shi Xiao Huang Jin Lu and Ninghao Liu. 2025. MITS: Enhanced Tree Search Reasoning for LLMs via Pointwise Mutual Information. 10.48550\/ARXIV.2510.03632","DOI":"10.48550\/ARXIV.2510.03632"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.emnlp-main.410"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Qingwen Lin Boyan Xu Guimin Hu Zijian Li Zhifeng Hao et\u00a0al. 2025. CMCTS: A Constrained Monte Carlo Tree Search framework for mathematical reasoning in large language model. Applied Intelligence 56 (2025). 10.1007\/s10489-025-07044-6","DOI":"10.1007\/s10489-025-07044-6"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Sora Miyamoto Daisuke Oba and Naoaki Okazaki. 2026. Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs. 10.48550\/ARXIV.2602.09574","DOI":"10.48550\/ARXIV.2602.09574"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Hugo Touvron Louis Martin Kevin Stone Peter Albert Amjad Almahairi et\u00a0al. 2023. Llama 2: Open Foundation and Fine-Tuned Chat Models. 10.48550\/ARXIV.2307.09288","DOI":"10.48550\/ARXIV.2307.09288"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2309.17179"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i24.34719"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2502.11183"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.acl-long.40"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2203.11171"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Yuxi Xie Anirudh Goyal Wenyue Zheng Min-Yen Kan Timothy\u00a0P. Lillicrap et\u00a0al. 2024. Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning. 10.48550\/ARXIV.2405.00451","DOI":"10.48550\/ARXIV.2405.00451"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Guanming Xiong Haochen Li and Wen Zhao. 2025. MCTS-KBQA: Monte Carlo Tree Search for Knowledge Base Question Answering. 10.48550\/ARXIV.2502.13428","DOI":"10.48550\/ARXIV.2502.13428"},{"key":"e_1_3_3_1_29_2","volume-title":"NeurIPS: Advances in Neural Information Processing Systems","author":"Yao Huanjin","year":"2026","unstructured":"Huanjin Yao, Jiaxing Huang, Wenhao Wu, Jingyi Zhang, Yibo Wang, et\u00a0al. 2026. Mulberry: Empowering MLLM with o1-like Reasoning and Reflection via Collective Monte Carlo Tree Search. In NeurIPS: Advances in Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=lwOV2ACEK9"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Shunyu Yao Dian Yu Jeffrey Zhao Izhak Shih Liane Levin et\u00a0al. 2023. Tree of thoughts: Deliberate problem solving with large language models. NeurIPS: Advances in Neural Information Processing Systems 36 (2023). 10.48550\/arXiv.2305.10601","DOI":"10.48550\/arXiv.2305.10601"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS64566.2025.00108"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Chung-Wei\u00a0Victor Yuan. 2026. ECR: Manifold-Guided Semantic Cues for Compact Language Models. 10.48550\/arXiv.2601.00543","DOI":"10.48550\/arXiv.2601.00543"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2007.02931"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Maciej \u015awiechowski Konrad Godlewski Bartosz Sawicki and Jacek Ma\u0144dziuk. 2022. Monte Carlo Tree Search: a review of recent modifications and applications. Artificial Intelligence Review 56 (2022). 10.1007\/s10462-022-10228-y","DOI":"10.1007\/s10462-022-10228-y"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO57284.2023.10159709"}],"event":{"name":"HPDC '26: 35th International Symposium on High-Performance Parallel and Distributed Computing","location":"Cleveland USA","acronym":"HPDC '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 35th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T04:23:02Z","timestamp":1783743782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3806645.3816237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,13]]},"references-count":34,"alternative-id":["10.1145\/3806645.3816237","10.1145\/3806645"],"URL":"https:\/\/doi.org\/10.1145\/3806645.3816237","relation":{},"subject":[],"published":{"date-parts":[[2026,7,13]]},"assertion":[{"value":"2026-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}