{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T07:02:20Z","timestamp":1780729340809,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819214617","type":"print"},{"value":"9789819214624","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-1462-4_23","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:47:05Z","timestamp":1780728425000},"page":"288-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MITS: Enhanced Tree Search Reasoning for\u00a0LLMs via\u00a0Pointwise Mutual Information"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0344-6712","authenticated-orcid":false,"given":"Jiaxi","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4192-1315","authenticated-orcid":false,"given":"Yucheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3867-900X","authenticated-orcid":false,"given":"Xiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1356-0202","authenticated-orcid":false,"given":"Jin","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9170-2424","authenticated-orcid":false,"given":"Ninghao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"23_CR1","unstructured":"Abdin, M., et al.: Phi-3 technical report: a highly capable language model locally on your phone. arXiv preprint arXiv:2404.14219 (2024)"},{"key":"23_CR2","unstructured":"Clark, P., et al.: Think you have solved question answering? try arc, the ai2 reasoning challenge. arXiv preprint arXiv:1803.05457 (2018)"},{"key":"23_CR3","unstructured":"Cui, G., et al.: The entropy mechanism of reinforcement learning for reasoning language models. arXiv preprint arXiv:2505.22617 (2025)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1162\/tacl_a_00370","volume":"9","author":"M Geva","year":"2021","unstructured":"Geva, M., Khashabi, D., Segal, E., Khot, T., Roth, D., Berant, J.: Did aristotle use a laptop? a question answering benchmark with implicit reasoning strategies. TACL 9, 346\u2013361 (2021)","journal-title":"TACL"},{"key":"23_CR5","unstructured":"Gui, R., et al.: Hypertree planning: enhancing LLM reasoning via hierarchical thinking. In: ICML (2025)"},{"key":"23_CR6","unstructured":"Guo, D.: Deepseek-r1: Incentivizing reasoning capability in LLMs via reinforcement learning. arXiv preprint arXiv:2501.12948 (2025)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Hao, S., et al.: Reasoning with language model is planning with world model. In: Bouamor, H., Pino, J., Bali, K. (eds.) Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pp. 8154\u20138173. ACL, Singapore (2023)","DOI":"10.18653\/v1\/2023.emnlp-main.507"},{"key":"23_CR8","unstructured":"Hu, M.: Tree-planner: efficient close-loop task planning with large language models. In: ICLR (2024)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"23_CR10","first-page":"22199","volume":"35","author":"T Kojima","year":"2022","unstructured":"Kojima, T., Gu, S.S., Reid, M., Matsuo, Y., Iwasawa, Y.: Large language models are zero-shot reasoners. NeurIPS 35, 22199\u201322213 (2022)","journal-title":"NeurIPS"},{"key":"23_CR11","unstructured":"Lai, X., Tian, Z., Chen, Y., Yang, S., Peng, X., Jia, J.: Step-DPO: step-wise preference optimization for long-chain reasoning of LLMs. arXiv preprint arXiv:2406.18629 (2024)"},{"key":"23_CR12","unstructured":"Lightman, H.: Let\u2019s verify step by step. In: ICLR (2024)"},{"key":"23_CR13","unstructured":"Qi, Z., MA, M., Xu, J., Zhang, L.L., Yang, F., Yang, M.: Mutual reasoning makes smaller LLMs stronger problem-solver. In: ICLR (2025)"},{"key":"23_CR14","unstructured":"Shao, R.: Spurious rewards: rethinking training signals in RLVR. arXiv preprint arXiv:2506.10947 (2025)"},{"key":"23_CR15","unstructured":"Shao, Z.: Deepseekmath: pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300 (2024)"},{"key":"23_CR16","unstructured":"Sharma, M.: Towards understanding sycophancy in language models. In: ICLR (2024)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Shi, Y., Tan, Q., Wu, X., Zhong, S., Zhou, K., Liu, N.: Retrieval-enhanced knowledge editing in language models for multi-hop question answering. In: Proceedings of the 33rd ACM CIKM, pp. 2056\u20132066 (2024)","DOI":"10.1145\/3627673.3679722"},{"key":"23_CR18","unstructured":"Snell, C., Lee, J., Xu, K., Kumar, A.: Scaling LLM test-time compute optimally can be more effective than scaling model parameters. arXiv preprint arXiv:2408.03314 (2024)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Talmor, A., Herzig, J., Lourie, N., Berant, J.: Commonsenseqa: a question answering challenge targeting commonsense knowledge. In: Proceedings of the 2019 Conference of NAACL: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 4149\u20134158 (2019)","DOI":"10.18653\/v1\/N19-1421"},{"key":"23_CR20","unstructured":"Team, Q.: Qwen2.5: a party of foundation models (2024). https:\/\/qwenlm.github.io\/blog\/qwen2.5\/"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Wang, P., et al.: Math-shepherd: verify and reinforce LLMs step-by-step without human annotations. In: Proceedings of the 62nd Annual Meeting of the ACL (Volume 1: Long Papers), pp. 9426\u20139439 (2024)","DOI":"10.18653\/v1\/2024.acl-long.510"},{"key":"23_CR22","unstructured":"Wang, X.: Self-consistency improves chain of thought reasoning in language models. In: ICLR (2023)"},{"key":"23_CR23","first-page":"24824","volume":"35","author":"J Wei","year":"2022","unstructured":"Wei, J., et al.: Chain-of-thought prompting elicits reasoning in large language models. NeurIPS 35, 24824\u201324837 (2022)","journal-title":"NeurIPS"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Wu, X., Yu, W., Zhai, X., Liu, N.: Self-regularization with latent space explanations for controllable LLM-based classification. arXiv preprint arXiv:2502.14133 (2025)","DOI":"10.1145\/3711896.3737120"},{"key":"23_CR25","first-page":"41618","volume":"36","author":"Y Xie","year":"2023","unstructured":"Xie, Y., et al.: Self-evaluation guided beam search for reasoning. NeurIPS 36, 41618\u201341650 (2023)","journal-title":"NeurIPS"},{"key":"23_CR26","unstructured":"Yang, A., et al.: Qwen3 technical report. arXiv preprint arXiv:2505.09388 (2025)"},{"key":"23_CR27","first-page":"11809","volume":"36","author":"S Yao","year":"2023","unstructured":"Yao, S., et al.: Tree of thoughts: deliberate problem solving with large language models. NeurIPS 36, 11809\u201311822 (2023)","journal-title":"NeurIPS"},{"key":"23_CR28","unstructured":"Zou, J., et al.: Reasonflux-PRM: trajectory-aware PRMs for long chain-of-thought reasoning in LLMs. arXiv preprint arXiv:2506.18896 (2025)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-1462-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:47:09Z","timestamp":1780728429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-1462-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819214617","9789819214624"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-1462-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2026.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}