{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:54:10Z","timestamp":1781765650899,"version":"3.54.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T00:00:00Z","timestamp":1779840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T00:00:00Z","timestamp":1779840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"LabEx PERSYVAL-Lab","award":["ANR-11-LABX-0025-01"],"award-info":[{"award-number":["ANR-11-LABX-0025-01"]}]},{"name":"LabEx PERSYVAL-Lab","award":["ANR-11-LABX-0025-01"],"award-info":[{"award-number":["ANR-11-LABX-0025-01"]}]},{"name":"LabEx PERSYVAL-Lab","award":["ANR-11-LABX-0025-01"],"award-info":[{"award-number":["ANR-11-LABX-0025-01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10458-026-09757-5","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T09:27:10Z","timestamp":1779874030000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Traveling salesman games: semicore allocations for collaborative transportation in short food supply chains"],"prefix":"10.1007","volume":"40","author":[{"given":"Nicolas","family":"Besson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Bouveret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadia","family":"Brauner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Brulard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,27]]},"reference":[{"key":"9757_CR1","doi-asserted-by":"publisher","first-page":"103517","DOI":"10.1016\/j.trc.2021.103517","volume":"135","author":"Q An","year":"2022","unstructured":"An, Q., & Chen, H. (2022). Double-type player games and proportional cross-evaluation allocation method for collaborative logistics. Transportation Research. Part C, Emerging Technologies, 135, 103517.","journal-title":"Transportation Research. Part C, Emerging Technologies"},{"key":"9757_CR2","unstructured":"Applegate, D.\u00a0L., Bixby, R.\u00a0E., Chvat\u00e1l, V., & Cook, W.\u00a0J. (2006). The traveling salesman problem: A computational study. Princeton University Press. http:\/\/www.jstor.org\/stable\/j.ctt7s8xg."},{"key":"9757_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1613\/jair.5021","volume":"56","author":"H Aziz","year":"2016","unstructured":"Aziz, H., Cahan, C., Gretton, C., Kilby, P., Mattei, N., & Walsh, T. (2016). A study of proxies for shapley allocations of transport costs. Journal of Artificial Intelligence Research, 56, 573\u2013611.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9757_CR4","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., & Rosenschein, J.\u00a0S. (2009). The cost of stability in coalitional games. In Algorithmic Game Theory, (pp. 122\u2013134), Berlin, Heidelberg. Springer. ISBN 978-3-642-04645-2.","DOI":"10.1007\/978-3-642-04645-2_12"},{"issue":"1","key":"9757_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R. (1962). Dynamic programming treatment of the travelling salesman problem. Journals ACM, 9(1), 61\u201363. https:\/\/doi.org\/10.1145\/321105.321111","journal-title":"Journals ACM"},{"issue":"1","key":"9757_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00224-007-9072-z","volume":"43","author":"M Bl\u00e4ser","year":"2008","unstructured":"Bl\u00e4ser, M., & Shankar Ram, L. (2008). Approximately fair cost allocation in metric traveling salesman games. Theory of Computing Systems, 43(1), 19\u201337.","journal-title":"Theory of Computing Systems"},{"key":"9757_CR7","first-page":"119","volume":"10","author":"ON Bondareva","year":"1963","unstructured":"Bondareva, O. N. (1963). Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernetiki, 10, 119\u2013139.","journal-title":"Problemy Kibernetiki"},{"key":"9757_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, F., Saile, C., & Stricker, C. (2018). Voting with ties: Strong impossibilities via sat solving. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (pp. 1285\u20131293).","DOI":"10.65109\/PXTK5903"},{"key":"9757_CR9","doi-asserted-by":"crossref","unstructured":"Burgess, M.\u00a0A., & Chapman, A.\u00a0C. (2021). Approximating the shapley value using stratified empirical bernstein sampling. In IJCAI, (pp. 73\u201381).","DOI":"10.24963\/ijcai.2021\/11"},{"issue":"1","key":"9757_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02574802","volume":"3","author":"E Calvo","year":"1995","unstructured":"Calvo, E., Tijs, S. H., Valenciano, F., & Zarzuelo, J. M. (1995). On the axiomatization of the t-value. TOP, 3(1), 35\u201346.","journal-title":"TOP"},{"key":"9757_CR11","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., & Wooldridge, M.\u00a0J. (2012). Computational aspects of cooperative game theory. Synthesis lectures on artificial intelligence and machine learning 16. Morgan and Claypool Publishers, San Rafael, Calif.","DOI":"10.1007\/978-3-031-01558-8"},{"key":"9757_CR12","unstructured":"Curiel, I. (2013). Cooperative game theory and applications: Cooperative games arising from combinatorial optimization problems. US: Theory and Decision Library C. Springer."},{"key":"9757_CR13","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., & Bj\u00f8rner, N. (2008). Z3: An efficient smt solver. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (pp. 337\u2013340). Springer.","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"2","key":"9757_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., & Papadimitriou, C. H. (1994). On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2), 257\u2013266.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"9757_CR15","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1002\/bse.4051","volume":"34","author":"LNK Duong","year":"2025","unstructured":"Duong, L. N. K., Kumar, V., & He, Q. (2025). Collaboration for the sustainable food supply chain: A bibliometric analysis. Business Strategy and The Environment, 34(1), 1287\u20131301.","journal-title":"Business Strategy and The Environment"},{"key":"9757_CR16","doi-asserted-by":"publisher","unstructured":"Elkind, E., & Rothe, J. (2016). Cooperative game theory, (pp. 135\u2013193). Springer Berlin Heidelberg, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-47904-9_3","DOI":"10.1007\/978-3-662-47904-9_3"},{"issue":"1","key":"9757_CR17","first-page":"10","volume":"4","author":"A Elomri","year":"2015","unstructured":"Elomri, A. (2015). Cooperation in supply chain networks: Motives, outcomes, and barriers. The International Journal of Supply Chain Management, 4(1), 10\u20131081.","journal-title":"The International Journal of Supply Chain Management"},{"issue":"1","key":"9757_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1093\/qje\/qjx033","volume":"133","author":"M Embrey","year":"2018","unstructured":"Embrey, M., Fr\u00e9chette, G. R., & Yuksel, S. (2018). Cooperation in the finitely repeated prisoner\u2019s dilemma. The Quarterly Journal of Economics, 133(1), 509\u2013551.","journal-title":"The Quarterly Journal of Economics"},{"key":"9757_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1018935324969","volume":"82","author":"S Engevall","year":"1998","unstructured":"Engevall, S., G\u00f6the-Lundgren, M., & V\u00e4rbrand, P. (1998). The traveling salesman game: An application of cost allocation in a gas and oil company. Annals of Operations Research, 82, 203.","journal-title":"Annals of Operations Research"},{"key":"9757_CR20","volume-title":"and Peter V\u00e4rbrand","author":"S Engevall","year":"2000","unstructured":"Engevall, S., & G\u00f6the-Lundgren, M. (2000). and Peter V\u00e4rbrand. The vehicle routing game: An application of cost allocation in a gas and oil company."},{"issue":"1","key":"9757_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01545526","volume":"20","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Fekete, S. P., Hochst ttler, W., & Kern, W. (1998). On approximately fair cost allocation in euclidean tsp games. OR Spektrum, 20(1), 29\u201337.","journal-title":"OR Spektrum"},{"key":"9757_CR22","doi-asserted-by":"crossref","unstructured":"Fardi, K., Jafarzadeh_Ghoushchi, S., & Hafezalkotob, A. (2019). An extended robust approach for a cooperative inventory routing problem. Expert Systems with Applications,116, 310\u2013327.","DOI":"10.1016\/j.eswa.2018.09.002"},{"issue":"1","key":"9757_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.energy.2015.03.105","volume":"85","author":"P Flisberg","year":"2015","unstructured":"Flisberg, P., Frisk, M., R\u00f6nnqvist, M., & Guajardo, M. (2015). Potential savings and cost allocations for forest fuel transportation in Sweden: A country-wide study. Energy (Oxford), 85(1), 353\u2013365.","journal-title":"Energy (Oxford)"},{"key":"9757_CR24","unstructured":"Garey, M.R., & Johnson, D. S. (1979). Computers and intractability : A guide to the theory of NP-completeness \/ Michael R. Garey, David S. Johnson,... \u00a1\u00a1A\u00bf\u00bf series of books in the mathematical sciences. W. H. Freeman, New York, N.Y. ISBN 978-0-7167-1045-5."},{"issue":"2","key":"9757_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1015551010381","volume":"52","author":"WV Gehrlein","year":"2002","unstructured":"Gehrlein, W. V. (2002). Condorcet\u2019s paradox and the likelihood of its occurrence: different perspectives on balanced preferences. Theory and Decision, 52(2), 171\u2013199.","journal-title":"Theory and Decision"},{"key":"9757_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1613\/jair.3126","volume":"40","author":"C Geist","year":"2011","unstructured":"Geist, C., & Endriss, U. (2011). Automated search for impossibility theorems in social choice theory: Ranking sets of objects. The Journal of Artificial Intelligence Research, 40, 143\u2013174.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"9757_CR27","doi-asserted-by":"crossref","unstructured":"Greco, F. (2008). Traveling salesman problem. Rijeka, Croatia: IntechOpen.","DOI":"10.5772\/66"},{"issue":"3","key":"9757_CR28","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo, M., & R\u00f6nnqvist, M. (2016). A review on cost allocation methods in collaborative transportation. International Transactions in Operational Research, 23(3), 371\u2013392.","journal-title":"International Transactions in Operational Research"},{"key":"9757_CR29","doi-asserted-by":"crossref","unstructured":"Gu\u00e9neron, J., & Bonnet, G. (2023). A solution concept with an exploration bias for repeated stochastic coalitional games. In Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection21st International Conference, PAAMS 2023, Guimar\u00e3es, Portugal, July 12\u201314, 2023, Proceedings, volume 13955 of Lecture Notes in Computer Science, (pp. 100\u2013112). Springer Nature Switzerland. ISBN 3031376153.","DOI":"10.1007\/978-3-031-37616-0_9"},{"issue":"3","key":"9757_CR30","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s00291-022-00675-y","volume":"44","author":"F Kellner","year":"2022","unstructured":"Kellner, F. (2022). Generating greenhouse gas cutting incentives when allocating carbon dioxide emissions to shipments in road freight transportation. OR Spectrum, 44(3), 833\u2013874.","journal-title":"OR Spectrum"},{"issue":"3","key":"9757_CR31","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.ejor.2015.08.002","volume":"248","author":"A Kimms","year":"2016","unstructured":"Kimms, A., & Kozeletskyi, I. (2016). Core-based cost allocation in the cooperative traveling salesman problem. European Journal of Operational Research, 248(3), 910\u2013916.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"9757_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01414209","volume":"38","author":"J Kuipers","year":"1993","unstructured":"Kuipers, J. (1993). A note on the 5-person traveling salesman game. ZOR - Methods and Models of Operations Research, 38(2), 131\u2013139.","journal-title":"ZOR - Methods and Models of Operations Research"},{"issue":"8","key":"9757_CR33","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1080\/24725854.2024.2324358","volume":"57","author":"M Lai","year":"2025","unstructured":"Lai, M., Yating, W., & Cai, X. (2025). Core-based cost allocation for collaborative multi-stop truckload shipping problem. IISE Transactions, 57(8), 938\u2013956.","journal-title":"IISE Transactions"},{"key":"9757_CR34","unstructured":"Laudier, M.-C.(2017). Mutualiser le transport des produits, une bonne id\u00e9e pour les petits paysans. https:\/\/reporterre.net\/Mutualiser-le-transport-des-produits-une-bonne-idee-pour-les-petits-paysans."},{"key":"9757_CR35","doi-asserted-by":"crossref","unstructured":"Leenders, B. P. J., Vel\u00e1zquez-Mart\u00ednez, J. C., & Fransoo, J. C. (2017). Emissions allocation in transportation routes. Transportation Research Part D: Transport and Environment, 57, 39\u201351. https:\/\/doi.org\/10.1016\/j.trd.2017.08.016, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1361920917307253.","DOI":"10.1016\/j.trd.2017.08.016"},{"issue":"3","key":"9757_CR36","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.dam.2003.08.005","volume":"138","author":"Y Okamoto","year":"2004","unstructured":"Okamoto, Y. (2004). Traveling salesman games with the monge property. Discrete Applied Mathematics, 138(3), 349\u2013369.","journal-title":"Discrete Applied Mathematics"},{"issue":"15\u201316","key":"9757_CR37","doi-asserted-by":"publisher","first-page":"5340","DOI":"10.1080\/00207543.2019.1574040","volume":"57","author":"S Pan","year":"2019","unstructured":"Pan, S., Trentesaux, D., Ballot, E., & Huang, G. Q. (2019). Horizontal collaborative transport: Survey of solutions and practical implementation issues. International Journal of Production Research, 57(15\u201316), 5340\u20135361.","journal-title":"International Journal of Production Research"},{"key":"9757_CR38","unstructured":"Pantelidis, T.\u00a0P., Chow, J.\u00a0Y. J., & Cats, O. (2020). Mobility operator resource-pooling contract design to hedge against network disruptions. CoRR."},{"key":"9757_CR39","volume-title":"Introduction to the Theory of Cooperative Games","author":"B Peleg","year":"2007","unstructured":"Peleg, B., & Sudh\u00f6lter, P. (2007). Introduction to the Theory of Cooperative Games (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"2","key":"9757_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10479-020-03616-6","volume":"289","author":"DC Popescu","year":"2020","unstructured":"Popescu, D. C., & Kilby, P. (2020). Approximation of the shapley value for the euclidean travelling salesman game. Annals of Operations Research, 289(2), 341\u2013362.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"9757_CR41","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01585702","volume":"53","author":"JAM Potters","year":"1992","unstructured":"Potters, J. A. M., Curiel, I. J., & Tijs, S. H. (1992). Traveling salesman games. Mathematical Programming, 53(2), 199\u2013211.","journal-title":"Mathematical Programming"},{"issue":"6","key":"9757_CR42","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D. (1969). The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics, 17(6), 1163\u20131170.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9757_CR43","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1515\/9781400881970-018","volume":"2","author":"L Shapley","year":"1953","unstructured":"Shapley, L. (1953). A value for n-person games. Contributions to the Theory of Games, 2, 307\u2013317. https:\/\/doi.org\/10.1515\/9781400881970-018","journal-title":"Contributions to the Theory of Games"},{"issue":"4","key":"9757_CR44","doi-asserted-by":"publisher","first-page":"805","DOI":"10.2307\/1910101","volume":"34","author":"LS Shapley","year":"1966","unstructured":"Shapley, L. S., & Shubik, M. (1966). Quasi-cores in a monetary economy with nonconvex preferences. Econometrica, 34(4), 805\u2013827.","journal-title":"Econometrica"},{"issue":"4","key":"9757_CR45","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1002\/NAV.3800140404","volume":"14","author":"LS Shapley","year":"1967","unstructured":"Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14(4), 453\u2013460. https:\/\/doi.org\/10.1002\/NAV.3800140404","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"9757_CR46","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L. S. (1971). Cores of convex games. International journal of game theory, 1(1), 11\u201326.","journal-title":"International journal of game theory"},{"issue":"4","key":"9757_CR47","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.orl.2015.04.008","volume":"43","author":"L Sun","year":"2015","unstructured":"Sun, L., & Karwan, M. H. (2015). On the core of traveling salesman games. Operations Research Letters, 43(4), 365\u2013369.","journal-title":"Operations Research Letters"},{"key":"9757_CR48","unstructured":"Tijs, S. (1981). Bounds for the core of a game and the t-value. In O.\u00a0Moeschlin, & D.\u00a0Pallaschke (eds.), Game Theory and Mathematical Economics, (pp. 123\u2013132). North-Holland Publishing Company."},{"issue":"6","key":"9757_CR49","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1287\/opre.2013.1225","volume":"61","author":"A Toriello","year":"2013","unstructured":"Toriello, A., & Uhan, N. A. (2013). Technical note-on traveling salesman games with asymmetric costs. Operations Research, 61(6), 1429\u20131434.","journal-title":"Operations Research"},{"key":"9757_CR50","doi-asserted-by":"crossref","unstructured":"Urli, T., Kilby, P. (2017). Constraint-based fleet design optimisation for multi-compartment split-delivery rich vehicle routing. In International Conference on Principles and Practice of Constraint Programming, (pp. 414\u2013430). Springer.","DOI":"10.1007\/978-3-319-66158-2_27"},{"key":"9757_CR51","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2015). Challenges in resource and cost allocation. In Proceedings of the AAAI Conference on Artificial Intelligence, (vol.\u00a029).","DOI":"10.1609\/aaai.v29i1.9774"},{"key":"9757_CR52","first-page":"11044","volume":"33","author":"L Xia","year":"2020","unstructured":"Xia, L. (2020). The smoothed possibility of social choice. Advances in Neural Information Processing Systems, 33, 11044\u201311055.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9757_CR53","doi-asserted-by":"publisher","first-page":"102024","DOI":"10.1016\/j.tre.2020.102024","volume":"141","author":"F Yang","year":"2020","unstructured":"Yang, F., Dai, Y., & Ma, Z.-J. (2020). A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas. Transportation Research. Part E, Logistics and Transportation Review, 141, 102024.","journal-title":"Transportation Research. Part E, Logistics and Transportation Review"},{"key":"9757_CR54","doi-asserted-by":"publisher","unstructured":"Young, H. P. (1994). Chapter 34 cost allocation. In Handbook of Game Theory with Economic Applications, (vol.\u00a02, pp. 1193\u20131235). Elsevier. https:\/\/doi.org\/10.1016\/S1574-0005(05)80066-9","DOI":"10.1016\/S1574-0005(05)80066-9"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09757-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-026-09757-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09757-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:32:25Z","timestamp":1781764345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-026-09757-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,27]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9757"],"URL":"https:\/\/doi.org\/10.1007\/s10458-026-09757-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4164447\/v1","asserted-by":"object"}]},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,27]]},"assertion":[{"value":"25 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 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":"31"}}