{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:53:36Z","timestamp":1773201216440,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1004600"],"award-info":[{"award-number":["2022YFA1004600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62125304"],"award-info":[{"award-number":["62125304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"111 International Collaboration Project","award":["BP2018006"],"award-info":[{"award-number":["BP2018006"]}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["L233005"],"award-info":[{"award-number":["L233005"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017582","name":"Beijing National Research Center For Information Science And Technology","doi-asserted-by":"publisher","award":["BNR2024TD03003"],"award-info":[{"award-number":["BNR2024TD03003"]}],"id":[{"id":"10.13039\/501100017582","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research and Development Project of CRSC Research & Design Institute Group Co., Ltd."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s10626-026-00432-1","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:57:30Z","timestamp":1773125850000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Whittle index policy for real-time storage allocation in railway container yard"],"prefix":"10.1007","volume":"36","author":[{"given":"Yao","family":"Luan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing-Shan","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,10]]},"reference":[{"issue":"3","key":"432_CR1","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/S0363012999361974","volume":"40","author":"J Abounadi","year":"2001","unstructured":"Abounadi J, Bertsekas D, Borkar VS (2001) Learning algorithms for markov decision processes with average cost. SIAM J Control Optim 40(3):681\u2013698","journal-title":"SIAM J Control Optim"},{"key":"432_CR2","doi-asserted-by":"publisher","first-page":"110186","DOI":"10.1016\/j.automatica.2022.110186","volume":"139","author":"KE Avrachenkov","year":"2022","unstructured":"Avrachenkov KE, Borkar VS (2022) Whittle index based q-learning for restless bandits with average reward. Automatica 139:110186","journal-title":"Automatica"},{"key":"432_CR3","doi-asserted-by":"publisher","unstructured":"Biswas A, Aggarwal G, Varakantham P, Tambe M (2021) Learn to intervene: An adaptive learning policy for restless bandits in application to preventive healthcare. In: Zhou Z-H (ed) Proceedings of the Thirtieth international joint conference on artificial intelligence, IJCAI-21, pp 4039\u20134046. International Joint Conferences on Artificial Intelligence Organization. Main Track. https:\/\/doi.org\/10.24963\/ijcai.2021\/556","DOI":"10.24963\/ijcai.2021\/556"},{"issue":"1","key":"432_CR4","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ejor.2023.02.034","volume":"310","author":"R Boschma","year":"2023","unstructured":"Boschma R, Mes MR, Vries LR (2023) Approximate dynamic programming for container stacking. Eur J Oper Res 310(1):328\u2013342","journal-title":"Eur J Oper Res"},{"key":"432_CR5","doi-asserted-by":"publisher","first-page":"108671","DOI":"10.1016\/j.cie.2022.108671","volume":"173","author":"SW Cho","year":"2022","unstructured":"Cho SW, Park HJ, Kim A, Park JH (2022) Gmm-based online optimization for container stacking in port container terminals. Comput Indust Eng 173:108671","journal-title":"Comput Indust Eng"},{"key":"432_CR6","unstructured":"Christodoulou P (2019) Soft actor-critic for discrete action settings. arxiv:1910.07207"},{"key":"432_CR7","unstructured":"Fujimoto S, Hoof H, Meger D (2018) Addressing function approximation error in actor-critic methods. In: International conference on machine learning, pp 1587\u20131596. PMLR"},{"key":"432_CR8","doi-asserted-by":"crossref","unstructured":"Fu J, Nazarathy Y, Moka S, Taylor PG (2019) Towards q-learning the whittle index for restless bandits. In: 2019 Australian & New Zealand control conference (ANZCC), pp 249\u2013254. IEEE","DOI":"10.1109\/ANZCC47194.2019.8945748"},{"key":"432_CR9","doi-asserted-by":"crossref","unstructured":"Gibson LJ, Jacko P, Nazarathy Y (2021) A novel implementation of q-learning for the whittle index. In: EAI International conference on performance evaluation methodologies and tools, pp 154\u2013170. Springer","DOI":"10.1007\/978-3-030-92511-6_10"},{"key":"432_CR10","unstructured":"Haarnoja T, Zhou A, Abbeel P, Levine S (2018) Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor. In: International conference on machine learning, pp 1861\u20131870. PMLR"},{"key":"432_CR11","doi-asserted-by":"publisher","first-page":"101032","DOI":"10.1016\/j.aei.2020.101032","volume":"43","author":"J He","year":"2020","unstructured":"He J, Tan C, Yan W, Huang W, Liu M, Yu H (2020) Two-stage stochastic programming model for generating container yard template under uncertainty and traffic congestion. Adv Eng Inform 43:101032","journal-title":"Adv Eng Inform"},{"issue":"3","key":"432_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TASE.2009.2036375","volume":"7","author":"Q-S Jia","year":"2010","unstructured":"Jia Q-S (2010) A structural property of optimal policies for multi-component maintenance problems. IEEE Trans Autom Sci Eng 7(3):677\u2013680. https:\/\/doi.org\/10.1109\/TASE.2009.2036375","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"432_CR13","doi-asserted-by":"publisher","first-page":"106508","DOI":"10.1016\/j.engappai.2023.106508","volume":"123","author":"X Jin","year":"2023","unstructured":"Jin X, Duan Z, Song W, Li Q (2023) Container stacking optimization based on deep reinforcement learning. Eng Appl Artif Intell 123:106508","journal-title":"Eng Appl Artif Intell"},{"key":"432_CR14","doi-asserted-by":"crossref","unstructured":"Killian JA, Biswas A, Shah S, Tambe M (2021) Q-learning lagrange policies for multi-action restless bandits. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp 871\u2013881","DOI":"10.1145\/3447548.3467370"},{"issue":"4","key":"432_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0360-8352(97)00024-7","volume":"32","author":"KH Kim","year":"1997","unstructured":"Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Indust Eng 32(4):701\u2013711","journal-title":"Comput Indust Eng"},{"issue":"3","key":"432_CR17","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ejor.2016.01.055","volume":"252","author":"D Ku","year":"2016","unstructured":"Ku D, Arthanari TS (2016a) Container relocation problem with time windows for container departure. Eur J Oper Res 252(3):1031\u20131039","journal-title":"Eur J Oper Res"},{"key":"432_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2015.11.006","volume":"68","author":"D Ku","year":"2016","unstructured":"Ku D, Arthanari TS (2016) On the abstraction method for the container relocation problem. Comput Oper Res 68:110\u2013122","journal-title":"Comput Oper Res"},{"key":"432_CR18","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.cor.2016.08.016","volume":"78","author":"XT Le","year":"2017","unstructured":"Le XT, Knust S (2017) Mip-based approaches for robust storage loading problems with stacking constraints. Comput Oper Res 78:138\u2013153","journal-title":"Comput Oper Res"},{"key":"432_CR21","doi-asserted-by":"crossref","unstructured":"Li K, Jin X, Jia Q-S, Ren D, Xia H (2023) An ocba-based method for efficient sample collection in reinforcement learning. IEEE Trans Autom Sci Eng","DOI":"10.1109\/TASE.2023.3282257"},{"issue":"6","key":"432_CR20","doi-asserted-by":"publisher","first-page":"5318","DOI":"10.1109\/TVT.2021.3062653","volume":"70","author":"M Li","year":"2021","unstructured":"Li M, Gao J, Zhao L, Shen X (2021) Adaptive computing scheduling for edge-assisted autonomous driving. IEEE Trans Veh Technol 70(6):5318\u20135331. https:\/\/doi.org\/10.1109\/TVT.2021.3062653","journal-title":"IEEE Trans Veh Technol"},{"issue":"1","key":"432_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s10732-024-09545-y","volume":"31","author":"L Liu","year":"2025","unstructured":"Liu L, Feng Y, Zeng Q, Chen Z, Li Y (2025) A q-learning-based algorithm for the block relocation problem. J Heurist 31(1):14","journal-title":"J Heurist"},{"key":"432_CR22","doi-asserted-by":"publisher","first-page":"103714","DOI":"10.1016\/j.tre.2024.103714","volume":"190","author":"W Liu","year":"2024","unstructured":"Liu W, Zhu X, Wang L, Li S (2024) Flexible yard crane scheduling for mixed railway and road container operations in sea-rail intermodal ports with the sharing storage yard. Transport Res Part E Logist Transport Rev 190:103714","journal-title":"Transport Res Part E Logist Transport Rev"},{"issue":"1","key":"432_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1177\/0037549719843347","volume":"96","author":"W Li","year":"2020","unstructured":"Li W, Xiaoning Z, Zhengyu X (2020) Efficient container stacking approach to improve handling: efficiency in chinese rail-truck transshipment terminals. SIMULATION 96(1):3\u201315","journal-title":"SIMULATION"},{"key":"432_CR24","doi-asserted-by":"publisher","first-page":"14183","DOI":"10.1109\/TASE.2025.3559241","volume":"22","author":"Y Luan","year":"2025","unstructured":"Luan Y, Jia Q-S, Xing Y, Li Z, Wang T (2025) An efficient real-time railway container yard management method based on partial decoupling. IEEE Trans Autom Sci Eng 22:14183\u201314200. https:\/\/doi.org\/10.1109\/TASE.2025.3559241","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"432_CR25","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv:1312.5602"},{"key":"432_CR26","first-page":"828","volume":"34","author":"K Nakhleh","year":"2021","unstructured":"Nakhleh K, Ganji S, Hsieh P-C, Hou I, Shakkottai S et al (2021) Neurwin: Neural whittle index network for restless bandits via deep rl. Adv Neural Inf Process Syst 34:828\u2013839","journal-title":"Adv Neural Inf Process Syst"},{"key":"432_CR27","doi-asserted-by":"publisher","first-page":"105142","DOI":"10.1016\/j.cor.2020.105142","volume":"127","author":"T Oelschl\u00e4gel","year":"2021","unstructured":"Oelschl\u00e4gel T, Knust S (2021) Solution approaches for storage loading problems with stacking constraints. Comput Oper Res 127:105142","journal-title":"Comput Oper Res"},{"key":"432_CR28","first-page":"27730","volume":"35","author":"L Ouyang","year":"2022","unstructured":"Ouyang L, Wu J, Jiang X, Almeida D, Wainwright C, Mishkin P, Zhang C, Agarwal S, Slama K, Ray A et al (2022) Training language models to follow instructions with human feedback. Adv Neural Inf Process Syst 35:27730\u201327744","journal-title":"Adv Neural Inf Process Syst"},{"key":"432_CR29","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH, Tsitsiklis JN (1994) The complexity of optimal queueing network control. In: Proceedings of IEEE 9th annual conference on structure in complexity theory, pp 318\u2013322. IEEE","DOI":"10.1109\/SCT.1994.315792"},{"issue":"3","key":"432_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3670686","volume":"9","author":"F Robledo Rela\u00f1o","year":"2024","unstructured":"Robledo Rela\u00f1o F, Borkar V, Ayesta U, Avrachenkov K (2024) Tabular and deep learning for the whittle index. ACM Trans Model Perform Eval Comput Syst 9(3):1\u201321","journal-title":"ACM Trans Model Perform Eval Comput Syst"},{"key":"432_CR31","unstructured":"Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal policy optimization algorithms. arxiv:1707.06347"},{"key":"432_CR32","doi-asserted-by":"crossref","unstructured":"Silver D, Schrittwieser J, Simonyan K, Antonoglou I, Huang A, Guez A, Hubert T, Baker L, Lai M, Bolton A et al (2017) Mastering the game of go without human knowledge. Nature 550(7676):354\u2013359","DOI":"10.1038\/nature24270"},{"issue":"1","key":"432_CR33","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/LCOMM.2021.3125669","volume":"26","author":"Z Tang","year":"2022","unstructured":"Tang Z, Sun Z, Yang N, Zhou X (2022) Whittle index-based scheduling policy for minimizing the cost of age of information. IEEE Commun Lett 26(1):54\u201358. https:\/\/doi.org\/10.1109\/LCOMM.2021.3125669","journal-title":"IEEE Commun Lett"},{"key":"432_CR34","doi-asserted-by":"crossref","unstructured":"Van Hasselt H, Guez A, Silver D (2016) Deep reinforcement learning with double q-learning. In: Proceedings of the AAAI conference on artificial intelligence, vol 30","DOI":"10.1609\/aaai.v30i1.10295"},{"issue":"2","key":"432_CR35","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TAC.2019.2912492","volume":"65","author":"J Wang","year":"2020","unstructured":"Wang J, Ren X, Mo Y, Shi L (2020) Whittle index policy for dynamic multichannel allocation in remote state estimation. IEEE Trans Autom Control 65(2):591\u2013603. https:\/\/doi.org\/10.1109\/TAC.2019.2912492","journal-title":"IEEE Trans Autom Control"},{"key":"432_CR37","doi-asserted-by":"publisher","first-page":"102657","DOI":"10.1016\/j.tre.2022.102657","volume":"160","author":"M Wang","year":"2022","unstructured":"Wang M, Zhou C, Wang A (2022) A cluster-based yard template design integrated with yard crane deployment using a placement heuristic. Transport Res Part E Logist Transport Rev 160:102657","journal-title":"Transport Res Part E Logist Transport Rev"},{"key":"432_CR38","doi-asserted-by":"publisher","first-page":"109753","DOI":"10.1016\/j.cie.2023.109753","volume":"186","author":"W Wang","year":"2023","unstructured":"Wang W, Lin S, Zhen L (2023) Flexible storage yard management in container terminals under uncertainty. Comput Indust Eng 186:109753","journal-title":"Comput Indust Eng"},{"key":"432_CR39","doi-asserted-by":"publisher","first-page":"103643","DOI":"10.1016\/j.tre.2024.103643","volume":"188","author":"W Wang","year":"2024","unstructured":"Wang W, Liu H, Tian Q, Xia Z, Liu S, Peng Y (2024) An enhanced variable neighborhood search method for refrigerated container stacking and relocation problem with duplicate priorities. Transport Res Part E Logist Transport Rev 188:103643","journal-title":"Transport Res Part E Logist Transport Rev"},{"issue":"3","key":"432_CR36","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1109\/TASE.2020.2996227","volume":"18","author":"X Wang","year":"2020","unstructured":"Wang X, Zhou M, Zhao Q, Liu S, Guo X, Qi L (2020) A branch and price algorithm for crane assignment and scheduling in slab yard. IEEE Trans Autom Sci Eng 18(3):1122\u20131133","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"432_CR40","doi-asserted-by":"publisher","first-page":"107271","DOI":"10.1016\/j.ocecoaman.2024.107271","volume":"256","author":"Y Wang","year":"2024","unstructured":"Wang Y, Tan C, Wu H (2024) Slot assignment for outbound containers in storage space limited container terminal. Ocean Coastal Manag 256:107271","journal-title":"Ocean Coastal Manag"},{"issue":"3","key":"432_CR41","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/3214547","volume":"27","author":"RR Weber","year":"1990","unstructured":"Weber RR, Weiss G (1990) On an index policy for restless bandits. J Appl Probab 27(3):637\u2013648","journal-title":"J Appl Probab"},{"key":"432_CR42","doi-asserted-by":"crossref","unstructured":"Whittle P (1988) Restless bandits: Activity allocation in a changing world. J Appl Probabil 25(A):287\u2013298","DOI":"10.1017\/S0021900200040420"},{"key":"432_CR43","doi-asserted-by":"crossref","unstructured":"Xiang X, Lee LH, Chew EP (2023) An adaptive dynamic scheduling policy for the integrated optimization problem in automated transshipment hubs. IEEE Trans Autom Sci Eng","DOI":"10.1109\/TASE.2023.3267448"},{"key":"432_CR44","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.trb.2022.03.005","volume":"160","author":"L Yang","year":"2022","unstructured":"Yang L, Ng TS, Lee LH (2022) A robust approximation for yard template optimization under uncertainty. Transport Res Part B Methodol 160:21\u201353","journal-title":"Transport Res Part B Methodol"},{"issue":"8","key":"432_CR45","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1109\/TAC.2018.2807924","volume":"63","author":"Z Yu","year":"2018","unstructured":"Yu Z, Xu Y, Tong L (2018) Deadline scheduling as restless bandits. IEEE Trans Autom Control 63(8):2343\u20132358","journal-title":"IEEE Trans Autom Control"},{"key":"432_CR48","unstructured":"Zhang C, Wang X, Jiang W, Yang X, Wang S, Song L, Bian J (2024) Whittle index with multiple actions and state constraint for inventory management. In: The Twelfth international conference on learning representations. https:\/\/openreview.net\/forum?id=5sixirvG0I"},{"key":"432_CR46","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2014.06.012","volume":"52","author":"C Zhang","year":"2014","unstructured":"Zhang C, Wu T, Zhong M, Zheng L, Miao L (2014) Location assignment for outbound containers with adjusted weight proportion. Comput Operat Res 52:84\u201393","journal-title":"Comput Operat Res"},{"issue":"4","key":"432_CR47","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TASE.2018.2877499","volume":"16","author":"W Zhang","year":"2018","unstructured":"Zhang W, Song K, Rong X, Li Y (2018) Coarse-to-fine uav target tracking with deep reinforcement learning. IEEE Trans Autom Sci Eng 16(4):1522\u20131530","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"432_CR49","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tre.2014.06.011","volume":"69","author":"L Zhen","year":"2014","unstructured":"Zhen L (2014) Container yard template planning under uncertain maritime market. Transport Res Part E Logist Transport Rev 69:199\u2013217","journal-title":"Transport Res Part E Logist Transport Rev"},{"key":"432_CR50","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.trb.2016.04.011","volume":"90","author":"L Zhen","year":"2016","unstructured":"Zhen L (2016) Modeling of yard congestion and optimization of yard template in container ports. Transport Res Part B Methodol 90:83\u2013104","journal-title":"Transport Res Part B Methodol"},{"key":"432_CR51","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.trb.2015.12.006","volume":"93","author":"L Zhen","year":"2016","unstructured":"Zhen L, Xu Z, Wang K, Ding Y (2016) Multi-period yard template planning in container terminals. Transport Res Part B Methodol 93:700\u2013719","journal-title":"Transport Res Part B Methodol"},{"key":"432_CR52","doi-asserted-by":"publisher","first-page":"101869","DOI":"10.1016\/j.tre.2020.101869","volume":"136","author":"C Zhou","year":"2020","unstructured":"Zhou C, Wang W, Li H (2020) Container reshuffling considered space allocation problem in container terminals. Transport Res Part E Logist Transport Rev 136:101869","journal-title":"Transport Res Part E Logist Transport Rev"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-026-00432-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10626-026-00432-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-026-00432-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:57:45Z","timestamp":1773125865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10626-026-00432-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,10]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s10626-026-00432-1","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,10]]},"assertion":[{"value":"25 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"10"}}