{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:19:35Z","timestamp":1787314775503,"version":"3.56.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI1454737"],"award-info":[{"award-number":["CMMI1454737"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015599","name":"Toyota Research Institute","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015599","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ravitz Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10458-023-09616-7","type":"journal-article","created":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T09:02:26Z","timestamp":1690966946000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Balancing fairness and efficiency in traffic routing via interpolated traffic assignment"],"prefix":"10.1007","volume":"37","author":[{"given":"Devansh","family":"Jalota","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kiril","family":"Solovey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Tsao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Zoepf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Pavone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,2]]},"reference":[{"key":"9616_CR1","unstructured":"Fleming, S. (2019). Traffic congestion cost the US economy nearly \\$87 billion in 2018. WEF. Retrieved February 19, 2021 from https:\/\/www.weforum.org\/agenda\/2019\/03\/traffic-congestion-cost-the-us-economy-nearly-87-billion-in-2018\/."},{"issue":"2","key":"9616_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., & Tardos, E. (2002). How bad is selfish routing? Journal of the ACM, 49(2), 236\u2013259. https:\/\/doi.org\/10.1145\/506147.506153","journal-title":"Journal of the ACM"},{"issue":"2","key":"9616_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T., & Tardos, \u00c9va. (2004). Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior, 47(2), 389\u2013403. https:\/\/doi.org\/10.1016\/j.geb.2003.06.004","journal-title":"Games and Economic Behavior"},{"key":"9616_CR4","volume-title":"Urban transportation networks: Equilibrium analysis with mathematical programming methods","author":"Y Sheffi","year":"1985","unstructured":"Sheffi, Y. (1985). Urban transportation networks: Equilibrium analysis with mathematical programming methods (1st ed.). Prentice-Hall.","edition":"1"},{"issue":"4","key":"9616_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/JPROC.2018.2790405","volume":"106","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Pourazarm, S., Cassandras, C., & Paschalidis, I. (2018). The price of anarchy in transportation networks: Data-driven evaluation and reduction strategies. Proceedings of the IEEE, 106(4), 538\u2013553. https:\/\/doi.org\/10.1109\/JPROC.2018.2790405","journal-title":"Proceedings of the IEEE"},{"key":"9616_CR6","doi-asserted-by":"crossref","unstructured":"Sharon, G., Albert, M., Rambha, T., Boyles, S., & Stone, P. (2018). Traffic optimization for a mixture of self-interested and compliant agents. In International symposium on artificial intelligence and mathematics.","DOI":"10.1609\/aaai.v32i1.11444"},{"key":"9616_CR7","volume-title":"Wealth and Welfare","author":"A Pigou","year":"1912","unstructured":"Pigou, A. (1912). Wealth and Welfare (1st ed.). Macmillan and Co.","edition":"1"},{"issue":"3","key":"9616_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J. G. (1952). Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 1(3), 325\u2013362. https:\/\/doi.org\/10.1680\/ipeds.1952.11259","journal-title":"Proceedings of the Institution of Civil Engineers"},{"key":"9616_CR9","doi-asserted-by":"publisher","DOI":"10.1108\/9780080456713","volume-title":"Mathematical and economic theory of road pricing","author":"H Yang","year":"2005","unstructured":"Yang, H., & Huang, H.-J. (2005). Mathematical and economic theory of road pricing (1st ed.). Emerald Publishing.","edition":"1"},{"issue":"4","key":"9616_CR10","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O Jahn","year":"2005","unstructured":"Jahn, O., M\u00f6hring, R., Schulz, A., & Stier-Moses, N. (2005). System-optimal routing of traffic flows with user constraints in networks with congestion. Operations Research, 53(4), 600\u2013616. https:\/\/doi.org\/10.1287\/opre.1040.0197","journal-title":"Operations Research"},{"key":"9616_CR11","unstructured":"Roughgarden, T. (2002). How unfair is optimal routing? In ACM-SIAM symposium on discrete algorithms."},{"key":"9616_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2016.08.015","volume":"94","author":"E Angelelli","year":"2016","unstructured":"Angelelli, E., Arsik, I., Morandi, V., Savelsbergh, M., & Speranza, M. G. (2016). Proactive route guidance to avoid congestion. Transportation Research Part B: Methodological, 94, 1\u201321. https:\/\/doi.org\/10.1016\/j.trb.2016.08.015","journal-title":"Transportation Research Part B: Methodological"},{"key":"9616_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.043","author":"E Angelelli","year":"2020","unstructured":"Angelelli, E., Morandi, V., Savelsbergh, M., & Speranza, M. G. (2020). System optimal routing of traffic flows with user constraints using linear programming. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.043","journal-title":"European Journal of Operational Research"},{"key":"9616_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2018.07.009","volume":"99","author":"E Angelelli","year":"2018","unstructured":"Angelelli, E., Morandi, V., & Speranza, M. G. (2018). Congestion avoiding heuristic path generation for the proactive route guidance. Computers & Operations Research, 99, 234\u2013248. https:\/\/doi.org\/10.1016\/j.cor.2018.07.009","journal-title":"Computers & Operations Research"},{"key":"9616_CR15","doi-asserted-by":"publisher","first-page":"105016","DOI":"10.1016\/j.cor.2020.105016","volume":"123","author":"E Angelelli","year":"2020","unstructured":"Angelelli, E., Morandi, V., & Speranza, M. G. (2020). Minimizing the total travel time with limited unfairness in traffic networks. Computers & Operations Research, 123, 105016. https:\/\/doi.org\/10.1016\/j.cor.2020.105016","journal-title":"Computers & Operations Research"},{"key":"9616_CR16","doi-asserted-by":"publisher","unstructured":"Fleischer, L., Jain, K., & Mahdian, M. (2004). Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In IEEE symposium on foundations of computer science. https:\/\/doi.org\/10.1109\/FOCS.2004.69.","DOI":"10.1109\/FOCS.2004.69"},{"key":"9616_CR17","unstructured":"Jalota, D., Solovey, K., Tsao, M., Zoepf, S., & Pavone, M. (2022). Balancing fairness and efficiency in traffic routing via interpolated traffic assignment. In: Proceedings of the 21st international conference on autonomous agents and multiagent systems. AAMAS \u201922 (pp. 678\u2013686). International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC."},{"key":"9616_CR18","doi-asserted-by":"crossref","unstructured":"Rahmattalabi, A., Jabbari, S., Lakkaraju, H., Vayanos, P., Rice, E., & Tambe, M. (2020). Fair influence maximization: A welfare optimization approach. CoRR arXiv:2006.07906.","DOI":"10.1609\/aaai.v35i13.17383"},{"issue":"12","key":"9616_CR19","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","volume":"58","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Farias, V., & Trichakis, N. (2012). On the efficiency-fairness trade-off. Management Science, 58(12), 2234\u20132250. https:\/\/doi.org\/10.1287\/mnsc.1120.1549","journal-title":"Management Science"},{"key":"9616_CR20","doi-asserted-by":"publisher","unstructured":"Stoica, A.-A., Han, J.X., & Chaintreau, A. (2020). Seeding network influence in biased networks and the benefits of diversity. In Proceedings of the web conference 2020. WWW \u201920 (pp. 2089\u20132098). Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3366423.3380275.","DOI":"10.1145\/3366423.3380275"},{"key":"9616_CR21","doi-asserted-by":"publisher","unstructured":"Hu, L., & Chen, Y. (2020). Fair classification and social welfare. In Proceedings of the 2020 conference on fairness, accountability, and transparency. FAT* \u201920 (pp. 535\u2013545). Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3351095.3372857.","DOI":"10.1145\/3351095.3372857"},{"key":"9616_CR22","doi-asserted-by":"crossref","unstructured":"Tsang, A., Wilder, B., Rice, E., Tambe, M., & Zick, Y. (2019). Group-fairness in influence maximization. CoRR arxiv:1903.00967.","DOI":"10.24963\/ijcai.2019\/831"},{"issue":"2","key":"9616_CR23","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/trsc.30.2.93","volume":"30","author":"R Dial","year":"1996","unstructured":"Dial, R. (1996). Bicriterion traffic assignment: Basic theory and elementary algorithms. Transportation Science, 30(2), 93\u2013111. https:\/\/doi.org\/10.1287\/trsc.30.2.93","journal-title":"Transportation Science"},{"issue":"5","key":"9616_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0191-2615(96)00034-3","volume":"31","author":"R Dial","year":"1997","unstructured":"Dial, R. (1997). Bicriterion traffic assignment: Efficient algorithms plus examples. Transportation Research Part B: Methodological, 31(5), 357\u2013379. https:\/\/doi.org\/10.1016\/S0191-2615(96)00034-3","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"9616_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/net.20133","volume":"48","author":"A Schulz","year":"2006","unstructured":"Schulz, A., & Stier-Moses, N. (2006). Efficiency and fairness of system-optimal routing with user constraints. Networks, 48(4), 223\u2013234. https:\/\/doi.org\/10.1002\/net.20133","journal-title":"Networks"},{"key":"9616_CR26","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.trb.2014.11.010","volume":"72","author":"V Bayram","year":"2015","unstructured":"Bayram, V., Tansel, B., & Yaman, H. (2015). Compromising system and user interests in shelter location and evacuation planning. Transportation Research Part B: Methodological, 72, 146\u2013163. https:\/\/doi.org\/10.1016\/j.trb.2014.11.010","journal-title":"Transportation Research Part B: Methodological"},{"key":"9616_CR27","doi-asserted-by":"publisher","unstructured":"Ferguson, B., & Marden, J. (2021). The impact of fairness on performance in congestion networks. In 2021 American control conference (ACC) (pp. 4521\u20134526). https:\/\/doi.org\/10.23919\/ACC50511.2021.9483197.","DOI":"10.23919\/ACC50511.2021.9483197"},{"key":"9616_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.08.071","author":"M Lujak","year":"2014","unstructured":"Lujak, M., Giordani, S., & Ossowski, S. (2014). Route guidance: Bridging system and user optimization in traffic assignment. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2014.08.071","journal-title":"Neurocomputing"},{"key":"9616_CR29","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In Theoretical aspects of computer science.","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9616_CR30","doi-asserted-by":"crossref","unstructured":"Basu, S., Yang, G., Lianeas, T., Nikolova, E., & Chen, Y. (2017). Reconciling selfish routing with social good. CoRR arXiv:1707.00208.","DOI":"10.1007\/978-3-319-66700-3_12"},{"key":"9616_CR31","doi-asserted-by":"publisher","unstructured":"Cole, R., Dodis, Y., & Roughgarden, T. (2003). Pricing network edges for heterogeneous selfish users. In Proceedings of the thirty-fifth annual ACM symposium on theory of computing. STOC \u201903 (pp. 521\u2013530). Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/780542.780618.","DOI":"10.1145\/780542.780618"},{"issue":"2","key":"9616_CR32","first-page":"227","volume":"14","author":"M Solodov","year":"2007","unstructured":"Solodov, M. (2007). An explicit descent method for bilevel convex optimization. Journal of Convex Analysis, 14(2), 227.","journal-title":"Journal of Convex Analysis"},{"key":"9616_CR33","unstructured":"Caltrans. (2020). US 101 South, Corridor system management plan, 2010. Retrieved July 01."},{"key":"9616_CR34","unstructured":"Still, G. (2018). Lectures on parametric optimization: An introduction. Optimization Online."},{"issue":"3","key":"9616_CR35","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.trb.2010.10.002","volume":"45","author":"H Yang","year":"2011","unstructured":"Yang, H., & Wang, X. (2011). Managing network mobility with tradable credits. Transportation Research Part B: Methodological, 45(3), 580\u2013594. https:\/\/doi.org\/10.1016\/j.trb.2010.10.002","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"9616_CR36","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/trsc.1120.0409","volume":"47","author":"M Mitradjieva","year":"2013","unstructured":"Mitradjieva, M., & Lindberg, P. O. (2013). The stiff is moving\u2014Conjugate direction Frank-Wolfe methods with applications to traffic assignment. Transportation Science, 47(2), 280\u2013293.","journal-title":"Transportation Science"},{"key":"9616_CR37","doi-asserted-by":"publisher","DOI":"10.1145\/3362693","author":"V Buchhold","year":"2019","unstructured":"Buchhold, V., Sanders, P., & Wagner, D. (2019). Real-time traffic assignment using engineered customizable contraction hierarchies. ACM Journal of Experimental Algorithmics. https:\/\/doi.org\/10.1145\/3362693","journal-title":"ACM Journal of Experimental Algorithmics"},{"issue":"4","key":"9616_CR38","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1287\/trsc.36.4.398.549","volume":"36","author":"H Bar-Gera","year":"2002","unstructured":"Bar-Gera, H. (2002). Origin-based algorithm for the traffic assignment problem. Transportation Science, 36(4), 398\u2013417.","journal-title":"Transportation Science"},{"issue":"8","key":"9616_CR39","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.trb.2009.11.004","volume":"44","author":"H Bar-Gera","year":"2010","unstructured":"Bar-Gera, H. (2010). Traffic assignment by paired alternative segments. Transportation Research Part B: Methodological, 44(8), 1022\u20131046. https:\/\/doi.org\/10.1016\/j.trb.2009.11.004","journal-title":"Transportation Research Part B: Methodological"},{"key":"9616_CR40","unstructured":"Patriksson, M. (2015). The traffic assignment problem: Models and methods. Courier Dover Publications, 2015."},{"issue":"1","key":"9616_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2478\/s13531-011-0057-y","volume":"2","author":"W Szeto","year":"2012","unstructured":"Szeto, W., & Wong, S. (2012). Dynamic traffic assignment: Model classifications and recent advances in travel choice principles. Open Engineering, 2(1), 1\u201318. https:\/\/doi.org\/10.2478\/s13531-011-0057-y","journal-title":"Open Engineering"},{"key":"9616_CR42","doi-asserted-by":"publisher","first-page":"137010","DOI":"10.1109\/ACCESS.2019.2942497","volume":"7","author":"W Wei","year":"2019","unstructured":"Wei, W., Hu, L., Wu, Q., & Ding, T. (2019). Efficient computation of user optimal traffic assignment via second-order cone and linear programming techniques. IEEE Access, 7, 137010\u2013137019. https:\/\/doi.org\/10.1109\/ACCESS.2019.2942497","journal-title":"IEEE Access"},{"issue":"5","key":"9616_CR43","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., & Kov\u00e1cs, P. (2011). Lemon-an open source c++ graph template library. Electronic Notes in Theoretical Computer Science, 264(5), 23\u201345.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9616_CR44","unstructured":"Boost C++ Libraries. (2010). www.boost.org."},{"key":"9616_CR45","first-page":"1955","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed., p. 1955). Addison-Wesley: Princeton University.","edition":"4"},{"key":"9616_CR46","unstructured":"Transportation Networks for Research Core Team. (2016). Transportation networks for research. Retrieved Accessed Jan 20, 2021, from github.com\/bstabler\/TransportationNetworks."},{"issue":"3","key":"9616_CR47","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., & Vetter, C. (2012). Exact routing in large road networks using contraction hierarchies. Transportation Science, 46(3), 388\u2013404.","journal-title":"Transportation Science"},{"issue":"2","key":"9616_CR48","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"J Correa","year":"2007","unstructured":"Correa, J., Schulz, A., & Stier-Moses, N. (2007). Fast, fair, and efficient flows in networks. Operations Research, 55(2), 215\u2013225. https:\/\/doi.org\/10.1287\/opre.1070.0383","journal-title":"Operations Research"},{"issue":"10","key":"9616_CR49","doi-asserted-by":"publisher","first-page":"851","DOI":"10.4169\/000298910X523344","volume":"117","author":"F Farris","year":"2010","unstructured":"Farris, F. (2010). The Gini index and measures of inequality. The American Mathematical Monthly, 117(10), 851\u2013864. https:\/\/doi.org\/10.4169\/000298910X523344","journal-title":"The American Mathematical Monthly"},{"issue":"9","key":"9616_CR50","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.trb.2012.05.004","volume":"46","author":"D Wu","year":"2012","unstructured":"Wu, D., Yin, Y., Lawphongpanich, S., & Yang, H. (2012). Design of more equitable congestion pricing and tradable credit schemes for multimodal transportation networks. Transportation Research Part B: Methodological, 46(9), 1273\u20131287.","journal-title":"Transportation Research Part B: Methodological"},{"key":"9616_CR51","doi-asserted-by":"crossref","unstructured":"Jalota, D., Solovey, K., Gopalakrishnan, K., Zoepf, S., Balakrishnan, H., & Pavone, M. (2021). When efficiency meets equity in congestion pricing and revenue refunding schemes. CoRR arXiv:2106.10407.","DOI":"10.1145\/3465416.3483296"},{"issue":"1","key":"9616_CR52","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/3292040.3219634","volume":"46","author":"J Kleinberg","year":"2018","unstructured":"Kleinberg, J. (2018). Inherent trade-offs in algorithmic fairness. SIGMETRICS Performance Evaluation Review, 46(1), 40. https:\/\/doi.org\/10.1145\/3292040.3219634","journal-title":"SIGMETRICS Performance Evaluation Review"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09616-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-023-09616-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09616-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T23:50:59Z","timestamp":1702857059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-023-09616-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,2]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9616"],"URL":"https:\/\/doi.org\/10.1007\/s10458-023-09616-7","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,2]]},"assertion":[{"value":"9 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"32"}}