{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T13:02:31Z","timestamp":1771074151804,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62471411"],"award-info":[{"award-number":["62471411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,12,19]]},"DOI":"10.1145\/3788731.3788750","type":"proceedings-article","created":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T11:49:28Z","timestamp":1771069768000},"page":"118-121","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Aware Recursive Decomposition for Math Reasoning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0102-3816","authenticated-orcid":false,"given":"Kaleem Ullah","family":"Qasim","sequence":"first","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2086-0991","authenticated-orcid":false,"given":"Jiashu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7972-729X","authenticated-orcid":false,"given":"Hafiz Saif","family":"Ur Rehman","sequence":"additional","affiliation":[{"name":"Southwestern University of Finance and Economics, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Henry Bae Aghyad Deeb Alex Fleury and Kehang Zhu. 2024. ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity. arxiv:https:\/\/arXiv.org\/abs\/2312.11511\u00a0[cs.CL] https:\/\/arxiv.org\/abs\/2312.11511"},{"key":"e_1_3_3_1_3_2","unstructured":"Karl Cobbe Vineet Kosaraju Mohammad Bavarian Mark Chen Heewoo Jun Lukasz Kaiser Matthias Plappert Jerry Tworek Jacob Hilton Reiichiro Nakano Christopher Hesse and John Schulman. 2021. Training Verifiers to Solve Math Word Problems. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2110.14168 (2021). https:\/\/arxiv.org\/abs\/2110.14168"},{"key":"e_1_3_3_1_4_2","unstructured":"Daniela Gottesman and Mor Geva. 2024. Estimating Knowledge in Large Language Models Without Generating a Single Token. arxiv:https:\/\/arXiv.org\/abs\/2406.12673\u00a0[cs.CL] https:\/\/arxiv.org\/abs\/2406.12673"},{"key":"e_1_3_3_1_5_2","unstructured":"Tingxu Han Zhenting Wang Chunrong Fang Shiyu Zhao Shiqing Ma and Zhenyu Chen. 2025. Token-Budget-Aware LLM Reasoning. arxiv:https:\/\/arXiv.org\/abs\/2412.18547\u00a0[cs.CL] https:\/\/arxiv.org\/abs\/2412.18547"},{"key":"e_1_3_3_1_6_2","volume-title":"Advances in Neural Information Processing Systems","author":"Hendrycks Dan","year":"2021","unstructured":"Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. 2021. Measuring Mathematical Problem Solving With the MATH Dataset. In Advances in Neural Information Processing Systems , Vol.\u00a034. https:\/\/arxiv.org\/abs\/2103.03874"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-emnlp.164"},{"key":"e_1_3_3_1_8_2","volume-title":"International Conference on Learning Representations","author":"Khot Tushar","year":"2023","unstructured":"Tushar Khot, Harsh Trivedi, Matthew Finlayson, Yao Fu, Kyle Richardson, Peter Clark, and Ashish Sabharwal. 2023. Decomposed Prompting: A Modular Approach for Solving Complex Tasks. In International Conference on Learning Representations. https:\/\/arxiv.org\/abs\/2210.02406"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-naacl.264"},{"key":"e_1_3_3_1_10_2","unstructured":"Kaleem\u00a0Ullah Qasim and Jiashu Zhang. 2025. Accelerating Training of Recursive Reasoning Models with Curriculum Guided Adaptive Recursion. arxiv:https:\/\/arXiv.org\/abs\/2511.08653\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/2511.08653"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Kaleem\u00a0Ullah Qasim Jiashu Zhang Tariq Alsahfi and Ateeq Ur\u00a0Rehman Butt. 2025. Recursive Decomposition of Logical Thoughts: Framework for Superior Reasoning and Knowledge Propagation in Large Language Models. JAIR (2025). https:\/\/arxiv.org\/abs\/2501.0202 https:\/\/doi.org\/10.1613\/jair.1.18562","DOI":"10.1613\/jair.1.18562"},{"key":"e_1_3_3_1_12_2","unstructured":"Xuezhi Wang Jason Wei Dale Schuurmans Quoc Le Ed Chi Sharan Narang Aakanksha Chowdhery and Denny Zhou. 2023. Self-Consistency Improves Chain of Thought Reasoning in Language Models. arxiv:https:\/\/arXiv.org\/abs\/2203.11171\u00a0[cs.CL] https:\/\/arxiv.org\/abs\/2203.11171"},{"key":"e_1_3_3_1_13_2","unstructured":"Jason Wei Xuezhi Wang Dale Schuurmans Maarten Bosma Brian Ichter Fei Xia Ed Chi Quoc Le and Denny Zhou. 2023. Chain-of-Thought Prompting Elicits Reasoning in Large Language Models. arxiv:https:\/\/arXiv.org\/abs\/2201.11903\u00a0[cs.CL]"},{"key":"e_1_3_3_1_14_2","unstructured":"Shunyu Yao Dian Yu Jeffrey Zhao Izhak Shafran Thomas\u00a0L. Griffiths Yuan Cao and Karthik Narasimhan. 2023. Tree of Thoughts: Deliberate Problem Solving with Large Language Models. arxiv:https:\/\/arXiv.org\/abs\/2305.10601\u00a0[cs.CL] https:\/\/arxiv.org\/abs\/2305.10601"},{"key":"e_1_3_3_1_15_2","volume-title":"International Conference on Learning Representations","author":"Zhou Denny","year":"2023","unstructured":"Denny Zhou, Nathanael Sch\u00e4rli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc Le, and Ed Chi. 2023. Least-to-Most Prompting Enables Complex Reasoning in Large Language Models. In International Conference on Learning Representations. https:\/\/arxiv.org\/abs\/2205.10625"}],"event":{"name":"EILM 2025: 2025 International Conference on Embodied Intelligence and Large Models","location":"Chengdu China","acronym":"EILM 2025"},"container-title":["Proceedings of the 2025 International Conference on Embodied Intelligence and Large Models"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3788731.3788750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T12:09:40Z","timestamp":1771070980000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788731.3788750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":14,"alternative-id":["10.1145\/3788731.3788750","10.1145\/3788731"],"URL":"https:\/\/doi.org\/10.1145\/3788731.3788750","relation":{},"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"2026-02-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}