{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T14:21:07Z","timestamp":1783088467377,"version":"3.54.6"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2403500"],"award-info":[{"award-number":["2022YFB2403500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.eswa.2026.132519","type":"journal-article","created":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T15:48:38Z","timestamp":1776959318000},"page":"132519","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Adaptive cut generation via hypergraph neural networks for unit commitment problems"],"prefix":"10.1016","volume":"324","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8273-8740","authenticated-orcid":false,"given":"Mengchang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1591-1195","authenticated-orcid":false,"given":"Yuanxin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4113-0480","authenticated-orcid":false,"given":"Jun","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5845-2032","authenticated-orcid":false,"given":"He","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8277-8275","authenticated-orcid":false,"given":"Yiping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8353-4185","authenticated-orcid":false,"given":"Huashi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0642-0183","authenticated-orcid":false,"given":"Qian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.132519_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.rineng.2023.101354","article-title":"An improved binary African vultures optimization approach to solve the UC problem for power systems","volume":"19","author":"Abuelrub","year":"2023","journal-title":"Results in Engineering"},{"issue":"16","key":"10.1016\/j.eswa.2026.132519_bib0002","doi-asserted-by":"crossref","first-page":"3678","DOI":"10.1049\/gtd2.12924","article-title":"Solving wind-integrated unit commitment problem by a modified african vultures optimization algorithm","volume":"17","author":"Abuelrub","year":"2023","journal-title":"IET Generation, Transmission & Distribution"},{"key":"10.1016\/j.eswa.2026.132519_bib0003","unstructured":"Alibaba DAMO Academy (2025). MindOpt. https:\/\/opt.aliyun.com. (Accessed: March 12, 2025)."},{"key":"10.1016\/j.eswa.2026.132519_bib0004","series-title":"2022 3rd international conference on smart grid and renewable energy (SGRE)","first-page":"1","article-title":"Modified particle swarm optimization algorithms for solving economic load dispatch","author":"Alzubi","year":"2022"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0005","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TPWRS.2017.2695964","article-title":"A state transition MIP formulation for the unit commitment problem","volume":"33","author":"Atakan","year":"2017","journal-title":"IEEE Transactions on Power Systems"},{"key":"10.1016\/j.eswa.2026.132519_bib0006","series-title":"Primal Heuristics for Mixed Integer Programs","author":"Berthold","year":"2006"},{"key":"10.1016\/j.eswa.2026.132519_bib0007","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","article-title":"RENS: The optimal rounding","volume":"6","author":"Berthold","year":"2014","journal-title":"Mathematical Programming Computation"},{"key":"10.1016\/j.eswa.2026.132519_bib0008","unstructured":"Berthold, T., Francobaldi, M., & Hendel, G. (2022). Learning to use local cuts. arXiv: 2206.11618."},{"key":"10.1016\/j.eswa.2026.132519_bib0009","unstructured":"Bolusani, S., Besan\u00e7on, M., Bestuzheva, K., Chmiela, A., Dion\u00edsio, J., Donkiewicz, T., van Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A. et al. (2024). The SCIP optimization suite 9.0. arXiv: 2402.17702."},{"key":"10.1016\/j.eswa.2026.132519_bib0010","unstructured":"Bunnak, P., Coniglio, S., & Galelli, S.. Bridging theory and practice: Efficiently solving the unit commitment problem in production cost models. Available at SSRN 4918660."},{"key":"10.1016\/j.eswa.2026.132519_bib0011","doi-asserted-by":"crossref","first-page":"61455","DOI":"10.52202\/079017-1964","article-title":"Learning cut generating functions for integer programming","volume":"37","author":"Cheng","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/j.eswa.2026.132519_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018952429396","article-title":"On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search","volume":"90","author":"Clausen","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2026.132519_bib0013","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-015-0919-9","article-title":"A polyhedral study of production ramping","volume":"158","author":"Damc\u0131-Kurt","year":"2016","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.eswa.2026.132519_bib0014","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","article-title":"Exploring relaxation induced neighborhoods to improve MIP solutions","volume":"102","author":"Danna","year":"2005","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.eswa.2026.132519_bib0015","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.eswa.2026.132519_bib0016","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1109\/TPWRS.2005.857286","article-title":"Long-term security-constrained unit commitment: Hybrid Dantzig-Wolfe decomposition and subgradient approach","volume":"20","author":"Fu","year":"2005","journal-title":"IEEE Transactions on Power Systems"},{"issue":"3","key":"10.1016\/j.eswa.2026.132519_bib0017","first-page":"730","article-title":"Power generation scheduling by integer programming-development of theory","volume":"81","author":"Garver","year":"1962","journal-title":"Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems"},{"key":"10.1016\/j.eswa.2026.132519_bib0018","first-page":"15554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume":"32","author":"Gasse","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0019","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s13675-016-0066-y","article-title":"A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints","volume":"5","author":"Gentile","year":"2017","journal-title":"EURO Journal on Computational Optimization"},{"key":"10.1016\/j.eswa.2026.132519_bib0020","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"Generalized benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.eswa.2026.132519_bib0021","unstructured":"Gurobi Optimization, L. (2025). Gurobi optimizer reference manual. https:\/\/www.gurobi.com."},{"key":"10.1016\/j.eswa.2026.132519_bib0022","unstructured":"Han, Q., Yang, L., Chen, Q., Zhou, X., Zhang, D., Wang, A., Sun, R., & Luo, X. (2023). A GNN-guided predict-and-search framework for mixed-integer linear programming. arXiv: 2302.05636."},{"key":"10.1016\/j.eswa.2026.132519_bib0023","series-title":"2024 IEEE International conference on communications, control, and computing technologies for smart grids (smartgridcomm)","first-page":"295","article-title":"Fast unit commitment constraint screening with learning-based cost model","author":"He","year":"2024"},{"key":"10.1016\/j.eswa.2026.132519_bib0024","unstructured":"Huang, L., Chen, X., Huo, W., Wang, J., Zhang, F., Bai, B., & Shi, L. (2021). Branch and bound in mixed integer linear programming problems: A survey of techniques and trends.arXiv: 2111.06257."},{"key":"10.1016\/j.eswa.2026.132519_bib0025","unstructured":"IBM (2025). ILOG CPLEX. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio\/cplex-optimizer. (Accessed: March 12, 2025)."},{"key":"10.1016\/j.eswa.2026.132519_bib0026","series-title":"Learning and intelligent optimization: 14th international conference, LION 14, Athens, Greece, May 24\u201328, 2020, revised selected papers 14","first-page":"377","article-title":"Learning to configure mathematical programming solvers by mathematical programming","author":"Iommazzo","year":"2020"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0027","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580225","article-title":"Trivial integer programs unsolvable by branch-and-bound","volume":"6","author":"Jeroslow","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.eswa.2026.132519_bib0028","series-title":"Proceedings of the AAAI conference on artificial intelligence","article-title":"Learning to branch in mixed integer programming","volume":"vol. 30","author":"Khalil","year":"2016"},{"issue":"4","key":"10.1016\/j.eswa.2026.132519_bib0029","first-page":"857","article-title":"On mixed-integer programming formulations for the unit commitment problem","volume":"32","author":"Knueven","year":"2020","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.eswa.2026.132519_bib0030","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0031","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2003.12.001","article-title":"Min-up\/min-down polytopes","volume":"1","author":"Lee","year":"2004","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.eswa.2026.132519_bib0032","series-title":"2019 3rd International conference on smart grid and smart cities (ICSGSC)","first-page":"101","article-title":"Approximate mixed-integer programming solution with machine learning technique and linear programming relaxation","author":"Lin","year":"2019"},{"issue":"5","key":"10.1016\/j.eswa.2026.132519_bib0033","doi-asserted-by":"crossref","first-page":"3800","DOI":"10.1109\/TPWRS.2020.2981374","article-title":"A unit commitment algorithm with relaxation-based neighborhood search and improved relaxation inducement","volume":"35","author":"Ma","year":"2020","journal-title":"IEEE Transactions on Power Systems"},{"issue":"4","key":"10.1016\/j.eswa.2026.132519_bib0034","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1007\/s00291-015-0400-4","article-title":"Tight MIP formulations of the power-based unit commitment problem","volume":"37","author":"Morales-Espa\u00f1a","year":"2015","journal-title":"OR Spectrum"},{"key":"10.1016\/j.eswa.2026.132519_bib0035","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","article-title":"Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning","volume":"19","author":"Morrison","year":"2016","journal-title":"Discrete Optimization"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0036","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/TPWRS.2015.2409198","article-title":"Network-constrained AC unit commitment under uncertainty: A benders\u2019 decomposition approach","volume":"31","author":"Nasri","year":"2016","journal-title":"IEEE Transactions on Power Systems"},{"issue":"9","key":"10.1016\/j.eswa.2026.132519_bib0037","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/j.apenergy.2009.01.022","article-title":"A new decomposition approach for the thermal unit commitment problem","volume":"86","author":"Niknam","year":"2009","journal-title":"Applied Energy"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0038","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TPWRS.2003.820707","article-title":"Unit commitment by enhanced adaptive Lagrangian relaxation","volume":"19","author":"Ongsakul","year":"2004","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0039","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TPWRS.2011.2162008","article-title":"Tight mixed integer linear programming formulations for the unit commitment problem","volume":"27","author":"Ostrowski","year":"2011","journal-title":"IEEE Transactions on Power Systems"},{"key":"10.1016\/j.eswa.2026.132519_bib0040","unstructured":"Pan, K., & Guan, Y. (2016). A polyhedral study of the integrated minimum-up\/-down time and ramping polytope. optimization online (2016). http:\/\/www. optimization-online. org\/DB_HTML\/2015\/08\/5070.html."},{"key":"10.1016\/j.eswa.2026.132519_bib0041","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., K\u00f6pf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., & Chintala, S. (2019). PyTorch: An imperative style, high-performance deep learning library. https:\/\/arxiv.org\/abs\/1912.01703."},{"key":"10.1016\/j.eswa.2026.132519_bib0042","first-page":"1","article-title":"Minimum up\/down polytopes of the unit commitment problem with start-up costs","volume":"23628","author":"Rajan","year":"2005","journal-title":"IBM Research Reports"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0043","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ejor.2017.02.005","article-title":"A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems","volume":"261","author":"Schulze","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.eswa.2026.132519_bib0044","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MPAE.2005.1405865","article-title":"Benders decomposition: Applying benders decomposition to power systems","volume":"3","author":"Shahidehopour","year":"2005","journal-title":"IEEE Power and Energy Magazine"},{"key":"10.1016\/j.eswa.2026.132519_bib0045","series-title":"International conference on machine learning","first-page":"9367","article-title":"Reinforcement learning for integer programming: Learning to cut","author":"Tang","year":"2020"},{"key":"10.1016\/j.eswa.2026.132519_bib0046","unstructured":"Turner, M., Koch, T., Serrano, F., & Winkler, M. (2022). Adaptive cut selection in mixed-integer linear programming. arXiv: 2202.10962."},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0047","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","article-title":"On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm","volume":"48","author":"Vanderbeck","year":"2000","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.eswa.2026.132519_bib0048","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","article-title":"A generic view of Dantzig\u2013Wolfe decomposition in mixed integer programming","volume":"34","author":"Vanderbeck","year":"2006","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.eswa.2026.132519_bib0049","series-title":"Proceedings of the 2025 5th international conference on applied mathematics, modelling and intelligent computing","first-page":"1-7","article-title":"A local search and cutting plane approach for security-constrained unit commitment problems","author":"Wang","year":"2025"},{"key":"10.1016\/j.eswa.2026.132519_bib0050","unstructured":"Wang, Z., Li, X., Wang, J., Kuang, Y., Yuan, M., Zeng, J., Zhang, Y., & Wu, F. (2023). Learning cut selection for mixed-integer linear programming via hierarchical sequence model. arXiv: 2302.00244."},{"issue":"3","key":"10.1016\/j.eswa.2026.132519_bib0051","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s12667-010-0015-4","article-title":"Accelerating the benders decomposition for network-constrained unit commitment problems","volume":"1","author":"Wu","year":"2010","journal-title":"Energy Systems"},{"issue":"2","key":"10.1016\/j.eswa.2026.132519_bib0052","first-page":"739","article-title":"Learning to solve large-scale security-constrained unit commitment problems","volume":"33","author":"Xavier","year":"2021","journal-title":"INFORMS Journal on Computing"},{"issue":"24","key":"10.1016\/j.eswa.2026.132519_bib0053","doi-asserted-by":"crossref","first-page":"5728","DOI":"10.1049\/iet-gtd.2020.0823","article-title":"Integrated data-driven framework for fast SCUC calculation","volume":"14","author":"Yang","year":"2020","journal-title":"IET Generation, Transmission & Distribution"},{"key":"10.1016\/j.eswa.2026.132519_bib0054","unstructured":"Zhang, M., Yin, W., Wang, M., Shen, Y., Xiang, P., Wu, Y., Zhao, L., Pan, J., Jiang, H., & Huang, K. (2023). MindOPT tuner: Boost the performance of numerical software by automatic parameter tuning.arXiv: 2307.08085."},{"key":"10.1016\/j.eswa.2026.132519_bib0055","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10479-012-1092-7","article-title":"A decomposition approach to the two-stage stochastic unit commitment problem","volume":"210","author":"Zheng","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.132519_bib0056","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","article-title":"Matpower: Steady-state operations, planning, and analysis tools for power systems research and education","volume":"26","author":"Zimmerman","year":"2010","journal-title":"IEEE Transactions on Power Systems"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426014326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426014326?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T13:28:53Z","timestamp":1783085333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426014326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":56,"alternative-id":["S0957417426014326"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132519","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive cut generation via hypergraph neural networks for unit commitment problems","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132519","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"132519"}}