{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:01:29Z","timestamp":1774987289958,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001852","name":"Cefipra","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001852","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s11134-026-09976-3","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T08:52:44Z","timestamp":1772873564000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lagrangian index policy for restless bandits with average reward"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8124-8272","authenticated-orcid":false,"given":"Konstantin","family":"Avrachenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek S.","family":"Borkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratik","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"9976_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2019.102052","volume":"136","author":"S Aalto","year":"2019","unstructured":"Aalto, S., Lassila, P., Taboada, I.: Whittle index approach to opportunistic scheduling with partial channel information. Perform. Eval. 136, 102052 (2019)","journal-title":"Perform. Eval."},{"issue":"3","key":"9976_CR2","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/S0363012999361974","volume":"40","author":"J Abounadi","year":"2001","unstructured":"Abounadi, J., Bertsekas, D., Borkar, V.S.: Learning algorithms for Markov decision processes with average cost. SIAM J. Control. Optim. 40(3), 681\u2013698 (2001)","journal-title":"SIAM J. Control. Optim."},{"key":"9976_CR3","volume-title":"Constrained Markov Decision Processes","author":"E Altman","year":"1999","unstructured":"Altman, E.: Constrained Markov Decision Processes. CRC Press (1999)"},{"key":"9976_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s001860200257","volume":"57","author":"PS Ansell","year":"2003","unstructured":"Ansell, P.S., Glazebrook, K.D., Nino-Mora, J., O\u2019Keeffe, M.: Whittle\u2019s index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57, 21\u201339 (2003)","journal-title":"Math. Methods Oper. Res."},{"issue":"17","key":"9976_CR5","doi-asserted-by":"publisher","first-page":"3463","DOI":"10.1016\/j.comnet.2013.08.001","volume":"57","author":"K Avrachenkov","year":"2013","unstructured":"Avrachenkov, K., Ayesta, U., Doncel, J., Jacko, P.: Congestion control of TCP flows in Internet routers by means of index policy. Comput. Netw. 57(17), 3463\u20133478 (2013)","journal-title":"Comput. Netw."},{"issue":"1","key":"9976_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TCNS.2016.2619066","volume":"5","author":"KE Avrachenkov","year":"2016","unstructured":"Avrachenkov, K.E., Borkar, V.S.: Whittle index policy for crawling ephemeral content. IEEE Trans. Control Netw. Syst. 5(1), 446\u2013455 (2016)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"9976_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110186","volume":"139","author":"KE Avrachenkov","year":"2022","unstructured":"Avrachenkov, K.E., Borkar, V.S.: Whittle index based Q-learning for restless bandits with average reward. Automatica 139, 110186 (2022)","journal-title":"Automatica"},{"key":"9976_CR8","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Patil, K., Thoppe, G.: 2020. Change rate estimation and optimal freshness in web page crawling. In: Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools, ValueTools, 3-10","DOI":"10.1145\/3388831.3388846"},{"key":"9976_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102261","volume":"153","author":"K Avrachenkov","year":"2022","unstructured":"Avrachenkov, K., Patil, K., Thoppe, G.: Online algorithms for estimating change rates of web pages. Perform. Eval. 153, 102261 (2022)","journal-title":"Perform. Eval."},{"issue":"2","key":"9976_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0363012993253534","volume":"34","author":"M Benaim","year":"1996","unstructured":"Benaim, M.: A dynamical system approach to stochastic approximation. SIAM J. Control. Optim. 34(2), 437\u2013472 (1996)","journal-title":"SIAM J. Control. Optim."},{"key":"9976_CR11","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 3rd edn. Athena Scientific, Belmont (2016)","edition":"3"},{"issue":"1","key":"9976_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-247X(85)90288-4","volume":"112","author":"FJ Beutler","year":"1985","unstructured":"Beutler, F.J., Ross, K.W.: Optimal policies for controlled Markov chains with a constraint. J. Math. Anal. Appl. 112(1), 236\u2013252 (1985)","journal-title":"J. Math. Anal. Appl."},{"key":"9976_CR13","doi-asserted-by":"crossref","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 Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Aug. 19-17 (2021)","DOI":"10.24963\/ijcai.2021\/556"},{"issue":"5","key":"9976_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-6911(97)90015-3","volume":"29","author":"VS Borkar","year":"1997","unstructured":"Borkar, V.S.: Stochastic approximation with two time scales. Syst. Control Lett. 29(5), 291\u2013294 (1997)","journal-title":"Syst. Control Lett."},{"issue":"3","key":"9976_CR15","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1137\/S0363012995282784","volume":"36","author":"VS Borkar","year":"1998","unstructured":"Borkar, V.S.: Asynchronous stochastic approximations. SIAM J. Control. Optim. 36(3), 840\u2013851 (1998)","journal-title":"SIAM J. Control. Optim."},{"key":"9976_CR16","unstructured":"Borkar, V. S.: 1991. Topics in Controlled Markov Chains, Pitman Research Notes in Maths No. 240, Longman Scientific and Technical, Harlow, UK"},{"issue":"4\u20135","key":"9976_CR17","first-page":"405","volume":"15","author":"VS Borkar","year":"1990","unstructured":"Borkar, V.S.: Controlled Markov chains with constraints, Sadhana, Indian Academy of Sciences Journal for. Eng. Sci. 15(4\u20135), 405\u2013413 (1990)","journal-title":"Eng. Sci."},{"issue":"1","key":"9976_CR18","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1137\/S1052623491218895","volume":"32","author":"VS Borkar","year":"1994","unstructured":"Borkar, V.S.: Ergodic control of Markov chains with constraints-the general case. SIAM J. Control. Optim. 32(1), 176\u2013186 (1994)","journal-title":"SIAM J. Control. Optim."},{"key":"9976_CR19","volume-title":"Stochastic Approximation: A Dynamical Systems Viewpoint","author":"VS Borkar","year":"2011","unstructured":"Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint, 2nd edn. Hindustan Publishing Agency and Springer Nature (2011)","edition":"2"},{"issue":"7","key":"9976_CR20","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1287\/mnsc.2019.3342","volume":"66","author":"DB Brown","year":"2020","unstructured":"Brown, D.B., Smith, J.E.: Index policies and performance bounds for dynamic selection problems. Manage. Sci. 66(7), 3029\u20133050 (2020)","journal-title":"Manage. Sci."},{"issue":"1","key":"9976_CR21","first-page":"50","volume":"35","author":"D Derevitskii","year":"1974","unstructured":"Derevitskii, D., Fradkov, A.L.: Two models analyzing the dynamics of adaptation algorithms. Autom. Remote. Control. 35(1), 50\u201367 (1974)","journal-title":"Autom. Remote. Control."},{"issue":"4","key":"9976_CR22","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1214\/aop\/1176994663","volume":"8","author":"P Diaconis","year":"1980","unstructured":"Diaconis, P., Freedman, D.: Finite exchangeable sequences. Ann. Probab. 8(4), 745\u2013764 (1980)","journal-title":"Ann. Probab."},{"issue":"2","key":"9976_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0022-247X(62)80007-9","volume":"5","author":"LE Dubins","year":"1962","unstructured":"Dubins, L.E.: On extreme points of convex sets. J. Math. Anal. Appl. 5(2), 237\u2013244 (1962)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"9976_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3179410","volume":"2","author":"S Duran","year":"2018","unstructured":"Duran, S., Verloop, I.M.: Asymptotic optimal control of Markov-modulated restless bandits. Proc. ACM Meas. Anal. Comput. Syst. 2(1), 1\u201325 (2018)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"3","key":"9976_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00186-023-00821-4","volume":"97","author":"N Gast","year":"2023","unstructured":"Gast, N., Gaujal, B., Khun, K.: Testing indexability and computing Whittle and Gittins index in subcubic time. Math. Methods Oper. Res. 97(3), 391\u2013436 (2023)","journal-title":"Math. Methods Oper. Res."},{"issue":"4","key":"9976_CR26","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1287\/moor.2022.0101","volume":"49","author":"N Gast","year":"2024","unstructured":"Gast, N., Gaujal, B., Yan, C.: Linear program-based policies for restless bandits: Necessary and sufficient conditions for (exponentially fast) asymptotic optimality. Math. Oper. Res. 49(4), 2468\u20132491 (2024)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9976_CR27","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","volume":"41","author":"JC Gittins","year":"1979","unstructured":"Gittins, J.C.: Bandit processes and dynamic allocation indices. J. R. Stat. Soc. Ser. B Stat Methodol. 41(2), 148\u2013164 (1979)","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"key":"9976_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices. John Wiley & Sons (2011)"},{"key":"9976_CR29","doi-asserted-by":"crossref","unstructured":"Hsu, Y. P.: 2018. Age of information: Whittle index for scheduling stochastic arrivals. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), 2634-2638","DOI":"10.1109\/ISIT.2018.8437712"},{"key":"9976_CR30","volume-title":"Dynamic Priority Allocation in Restless Bandit Models","author":"P Jacko","year":"2010","unstructured":"Jacko, P.: Dynamic Priority Allocation in Restless Bandit Models. Lambert Academic Publishing (2010)"},{"issue":"2","key":"9976_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1214\/aop\/1176995566","volume":"6","author":"JFC Kingman","year":"1978","unstructured":"Kingman, J.F.C.: Uses of exchangeability. Ann. Probab. 6(2), 183\u2013197 (1978)","journal-title":"Ann. Probab."},{"issue":"11","key":"9976_CR32","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1109\/TIT.2010.2068950","volume":"56","author":"K Liu","year":"2010","unstructured":"Liu, K., Zhao, Q.: Indexability of restless bandit problems and optimality of Whittle index for dynamic multichannel access. IEEE Trans. Inform. Theor 56(11), 5547\u20135567 (2010)","journal-title":"IEEE Trans. Inform. Theor"},{"issue":"4","key":"9976_CR33","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TAC.1977.1101561","volume":"22","author":"L Ljung","year":"1977","unstructured":"Ljung, L.: Analysis of recursive stochastic algorithms. IEEE Trans. Autom. Control 22(4), 551\u2013575 (1977)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"9976_CR34","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TIT.1984.1056894","volume":"30","author":"M Metivier","year":"1984","unstructured":"Metivier, M., Priouret, P.: Applications of a Kushner and Clark lemma to general classes of stochastic algorithms. IEEE Trans. Inf. Theory 30(2), 140\u2013151 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9976_CR35","unstructured":"Mnih, V., et al.: 2013. Playing Atari with deep reinforcement learning. ArXiv preprint arXiv:1312.5602"},{"issue":"7540","key":"9976_CR36","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"key":"9976_CR37","first-page":"828","volume":"34","author":"K Nakhleh","year":"2021","unstructured":"Nakhleh, K., Ganji, S., Hsieh, P.C., Hou, I., Shakkottai, S.: Neurwin: Neural Whittle index network for restless bandits via deep RL. Adv. Neural. Inf. Process. Syst. 34, 828\u2013839 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"7","key":"9976_CR38","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.3390\/math11071639","volume":"11","author":"J Ni\u00f1o-Mora","year":"2023","unstructured":"Ni\u00f1o-Mora, J.: Markovian restless bandits and index policies: A review. Mathematics 11(7), 1639 (2023)","journal-title":"Mathematics"},{"key":"9976_CR39","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00532949","volume":"28","author":"R Olshen","year":"1974","unstructured":"Olshen, R.: A note onexchangeable sequences. Z. Wahrscheinlichkeitstheorie verw. Geb. 28, 317\u2013321 (1974)","journal-title":"Z. Wahrscheinlichkeitstheorie verw. Geb."},{"key":"9976_CR40","unstructured":"Pagare, T., Borkar, V., Avrachenkov, K.: 2023. Full gradient deep reinforcement learning for average-reward criterion. In: Proceedings of Learning for Dynamics and Control Conference (L4DC), 235-247. PMLR"},{"key":"9976_CR41","doi-asserted-by":"crossref","unstructured":"Raghunathan, V., Borkar, V., Cao, M., Kumar, P. R.: 2008. Index policies for real-time multicast scheduling for wireless broadcast systems. In Proceedings of IEEE Infocom 2008 - The 27th Conference on Computer Communications, 1570-1578","DOI":"10.1109\/INFOCOM.2008.217"},{"issue":"3","key":"9976_CR42","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.J.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9976_CR43","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H., Tsitsiklis, J. N.: 1994. The complexity of optimal queueing network control. In: Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, 318-322","DOI":"10.1109\/SCT.1994.315792"},{"key":"9976_CR44","volume-title":"Optimal control of random sequences in problems with constraints","author":"AB Piunovskiy","year":"2012","unstructured":"Piunovskiy, A.B.: Optimal control of random sequences in problems with constraints. Springer (2012)"},{"issue":"2","key":"9976_CR45","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/3512798.3512816","volume":"49","author":"F Robledo","year":"2022","unstructured":"Robledo, F., Borkar, V., Ayesta, U., Avrachenkov, K.: QWI: Q-learning with Whittle index. ACM Sigmetrics Perform. Eval. Rev. 49(2), 47\u201350 (2022)","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"issue":"3","key":"9976_CR46","first-page":"11","volume":"9","author":"F Robledo","year":"2024","unstructured":"Robledo, F., Borkar, V., Ayesta, U., Avrachenkov, K.: Tabular and deep learning for the Whittle index. ACM Trans. Model. Perform. Eval. Comput. Syst 9(3), 11\u201321 (2024)","journal-title":"ACM Trans. Model. Perform. Eval. Comput. Syst"},{"key":"9976_CR47","volume-title":"Indexable Restless Bandits: Index Policies for Some Families of Stochastic Scheduling and Dynamic Allocation Problems","author":"D Ruiz-Hernandez","year":"2008","unstructured":"Ruiz-Hernandez, D.: Indexable Restless Bandits: Index Policies for Some Families of Stochastic Scheduling and Dynamic Allocation Problems. VDM Publishing (2008)"},{"key":"9976_CR48","doi-asserted-by":"crossref","unstructured":"Sombabu, B., Dedhia, B., Moharir, S.: 2023. Whittle index based age-of-information aware scheduling for Markovian channels. Comput. Netwo. Commun., pp.58-84","DOI":"10.37256\/cnc.1120231701"},{"key":"9976_CR49","doi-asserted-by":"crossref","unstructured":"Tripathy, V., Modiano, E.: 2019. A Whittle index approach to minimizing functions of age of information. In: Proceedings of the 57th Annual Allerton Conference on Communication, Control, and Computing, 1160-1167","DOI":"10.1109\/ALLERTON.2019.8919842"},{"issue":"4","key":"9976_CR50","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1214\/15-AAP1137","volume":"26","author":"IM Verloop","year":"2016","unstructured":"Verloop, I.M.: Asymptotically optimal priority policies for indexable and nonindexable restless bandits. Ann. Appl. Probab. 26(4), 1947\u20131995 (2016)","journal-title":"Ann. Appl. Probab."},{"key":"9976_CR51","doi-asserted-by":"crossref","unstructured":"Verma, S., Mate, A., Wang, K., Madhiwalla, N., Hegde, A., Taneja, A., Tambe, M.: 2023. Restless multi-armed bandits for maternal and child health: Results from decision-focused learning. In: Proceedings of AAMAS\u20192023, 1312-1320","DOI":"10.65109\/KZAE8179"},{"issue":"2","key":"9976_CR52","first-page":"199","volume":"30","author":"SS Villar","year":"2015","unstructured":"Villar, S.S., Bowden, J., Wason, J.: Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges. Stat. Sci. Rev. J. Inst. Math. Stat. 30(2), 199 (2015)","journal-title":"Stat. Sci. Rev. J. Inst. Math. Stat."},{"issue":"3","key":"9976_CR53","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/3214547","volume":"27","author":"RR Weber","year":"1990","unstructured":"Weber, R.R., Weiss, G.: On an index policy for restless bandits. J. Appl. Probab. 27(3), 637\u2013648 (1990)","journal-title":"J. Appl. Probab."},{"key":"9976_CR54","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: Activity allocation in a changing world. J. Appl. Probab. 25, 287\u2013298 (1988)","journal-title":"J. Appl. Probab."},{"issue":"8","key":"9976_CR55","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.: Deadline scheduling as restless bandits. IEEE Trans. Autom. Control 63(8), 2343\u20132358 (2018)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-026-09976-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-026-09976-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-026-09976-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:18:00Z","timestamp":1774984680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-026-09976-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9976"],"URL":"https:\/\/doi.org\/10.1007\/s11134-026-09976-3","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"14 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":4,"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 or conflicting interests related to the present work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"21"}}