{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:31:02Z","timestamp":1778344262076,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hasso-Plattner-Institut f\u00fcr Digital Engineering gGmbH"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>During a pandemic people have to find a trade-off between meeting others and staying safely at home. While meeting others is pleasant, it also increases the risk of infection. We consider this dilemma by introducing a game-theoretic network creation model in which selfish agents can form bilateral connections. They benefit from network neighbors, but at the same time, they want to maximize their distance to all other agents. This models the inherent conflict that social distancing rules impose on the behavior of selfish agents in a social network. Besides addressing this familiar issue, our model can be seen as the inverse to the well-studied Network Creation Game by Fabrikant et al. (in: PODC 2003, pp 347\u2013351, 2003. <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"doi\" xlink:href=\"10.1145\/872035.872088\">https:\/\/doi.org\/10.1145\/872035.872088<\/jats:ext-link>), where agents aim at being as central as possible in the created network. We look at two variants of network creation governed by social distancing. Firstly, a variant without connection restrictions, where we characterize optimal and equilibrium networks, and derive asymptotically tight bounds on the Price of Anarchy and Price of Stability. The second variant allows connection restrictions. As our main result, we prove that Swap-Maximal Routing-Cost Spanning Trees, an efficiently computable weaker variant of Maximum Routing-Cost Spanning Trees, actually resemble equilibria for a significant range of the parameter space. Moreover, we give almost tight bounds on the Price of Anarchy and Price of Stability. These results imply that under social distancing the agents\u2019 selfishness has a strong impact on the quality of the equilibria.<\/jats:p>","DOI":"10.1007\/s00453-022-01089-6","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T05:02:57Z","timestamp":1673499777000},"page":"2087-2130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Social Distancing Network Creation"],"prefix":"10.1007","volume":"85","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Gawendowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Melnichenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,12]]},"reference":[{"issue":"1","key":"1089_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. IEEE Ann. Hist. Comput. 7(1), 43\u201357 (1985). https:\/\/doi.org\/10.1109\/MAHC.1985.10011","journal-title":"IEEE Ann. Hist. Comput."},{"issue":"4","key":"1089_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"DS Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks 8(4), 279\u2013285 (1978). https:\/\/doi.org\/10.1002\/net.3230080402","journal-title":"Networks"},{"issue":"1","key":"1089_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti, T.L., Wong, R.T.: Network design and transportation planning: models and algorithms. Transp. Sci. 18(1), 1\u201355 (1984). https:\/\/doi.org\/10.1287\/trsc.18.1.1","journal-title":"Transp. Sci."},{"issue":"7","key":"1089_CR4","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013). https:\/\/doi.org\/10.1016\/j.comgeo.2013.04.002","journal-title":"Comput. Geom."},{"key":"1089_CR5","doi-asserted-by":"publisher","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007). https:\/\/doi.org\/10.1017\/CBO9780511546884","DOI":"10.1017\/CBO9780511546884"},{"issue":"1","key":"1089_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"MO Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44\u201374 (1996). https:\/\/doi.org\/10.1006\/jeth.1996.0108","journal-title":"J. Econ. Theory"},{"issue":"5","key":"1089_CR7","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A noncooperative model of network formation. Econometrica 68(5), 1181\u20131229 (2000). https:\/\/doi.org\/10.1111\/1468-0262.00155","journal-title":"Econometrica"},{"key":"1089_CR8","doi-asserted-by":"publisher","unstructured":"Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC 2003, pp. 347\u2013351 (2003). https:\/\/doi.org\/10.1145\/872035.872088","DOI":"10.1145\/872035.872088"},{"issue":"4","key":"1089_CR9","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008). https:\/\/doi.org\/10.1137\/070680096","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1089_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. Theory Comput. 4(1), 77\u2013109 (2008). https:\/\/doi.org\/10.4086\/toc.2008.v004a004","journal-title":"Theory Comput."},{"issue":"2","key":"1089_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM (JACM) 49(2), 236\u2013259 (2002). https:\/\/doi.org\/10.1145\/506147.506153","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"1089_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"TC Hu","year":"1974","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM J. Comput. 3(3), 188\u2013195 (1974). https:\/\/doi.org\/10.1137\/0203015","journal-title":"SIAM J. Comput."},{"key":"1089_CR13","doi-asserted-by":"publisher","unstructured":"Corbo, J., Parkes, D.C.: The price of selfish behavior in bilateral network formation. In: PODC 2005, pp. 99\u2013107 (2005). https:\/\/doi.org\/10.1145\/1073814.1073833","DOI":"10.1145\/1073814.1073833"},{"key":"1089_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume":"1999","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. STACS 1999, 404\u2013413 (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38","journal-title":"STACS"},{"key":"1089_CR15","doi-asserted-by":"publisher","unstructured":"Jackson, M.O.: Social and Economic Networks. Princeton university Press (2008). https:\/\/doi.org\/10.2307\/j.ctvcm4gh1","DOI":"10.2307\/j.ctvcm4gh1"},{"key":"1089_CR16","doi-asserted-by":"publisher","unstructured":"Lenzner, P.: On dynamics in basic network creation games. In: SAGT 2011, pp. 254\u2013265 (2011). https:\/\/doi.org\/10.1007\/978-3-642-24829-0_23","DOI":"10.1007\/978-3-642-24829-0_23"},{"key":"1089_CR17","doi-asserted-by":"publisher","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: SPAA 2013, pp. 83\u201392 (2013). https:\/\/doi.org\/10.1145\/2486159.2486185","DOI":"10.1145\/2486159.2486185"},{"key":"1089_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-35311-6\\_11","volume":"2012","author":"P Lenzner","year":"2012","unstructured":"Lenzner, P.: Greedy selfish network creation. WINE 2012, 142\u2013155 (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_11","journal-title":"WINE"},{"issue":"1","key":"1089_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2560767","volume":"2","author":"S Albers","year":"2014","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On nash equilibria for a network creation game. ACM TEAC 2(1), 1\u201327 (2014). https:\/\/doi.org\/10.1145\/2560767","journal-title":"ACM TEAC"},{"issue":"2","key":"1089_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2151171.2151176","volume":"8","author":"ED Demaine","year":"2012","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. ACM Trans. Algorithms 8(2), 13 (2012). https:\/\/doi.org\/10.1145\/2151171.2151176","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"1089_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00224-013-9459-y","volume":"53","author":"M Mihal\u00e1k","year":"2013","unstructured":"Mihal\u00e1k, M., Schlegel, J.C.: The price of anarchy in network creation games is (mostly) constant. TCS 53(1), 53\u201372 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9459-y","journal-title":"TCS"},{"issue":"4\u20135","key":"1089_CR22","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1080\/15427951.2015.1016248","volume":"11","author":"A Mamageishvili","year":"2015","unstructured":"Mamageishvili, A., Mihal\u00e1k, M., M\u00fcller, D.: Tree nash equilibria in the network creation game. Internet Math. 11(4\u20135), 472\u2013486 (2015). https:\/\/doi.org\/10.1080\/15427951.2015.1016248","journal-title":"Internet Math."},{"key":"1089_CR23","unstructured":"\u00c0lvarez, C., Messegu\u00e9, A.: Network creation games: structure vs anarchy. CoRR (2017). arXiv:1706.09132"},{"issue":"3","key":"1089_CR24","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00224-019-09945-9","volume":"64","author":"D Bil\u00f2","year":"2020","unstructured":"Bil\u00f2, D., Lenzner, P.: On the tree conjecture for the network creation game. Theory Comput. Syst. 64(3), 422\u2013443 (2020). https:\/\/doi.org\/10.1007\/s00224-019-09945-9","journal-title":"Theory Comput. Syst."},{"key":"1089_CR25","doi-asserted-by":"publisher","unstructured":"\u00c0lvarez, C., Messegu\u00e9, A.: On the price of anarchy for high-price links. In: WINE 2019, pp. 316\u2013329 (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_23","DOI":"10.1007\/978-3-030-35389-6_23"},{"key":"1089_CR26","doi-asserted-by":"crossref","unstructured":"Dippel, J., Vetta, A.: An improved bound for the tree conjecture in network creation games. CoRR (2021). arXiv:2106.05175","DOI":"10.1007\/978-3-031-15714-1_14"},{"issue":"2","key":"1089_CR27","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1980522.1980524","volume":"8","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2), 2\u20131220 (2009). https:\/\/doi.org\/10.1145\/1980522.1980524","journal-title":"SIGecom Exchanges"},{"key":"1089_CR28","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/3323165.3323199","volume":"2019","author":"D Bil\u00f2","year":"2019","unstructured":"Bil\u00f2, D., Friedrich, T., Lenzner, P., Melnichenko, A.: Geometric network creation games. SPAA 2019, 323\u2013332 (2019). https:\/\/doi.org\/10.1145\/3323165.3323199","journal-title":"SPAA"},{"key":"1089_CR29","doi-asserted-by":"publisher","unstructured":"Friedemann, W., Friedrich, T., Gawendowicz, H., Lenzner, P., Melnichenko, A., Peters, J., Stephan, D., Vaichenker, M.: Efficiency and stability in euclidean network design. In: SPAA 2021, pp. 232\u2013242 (2021). https:\/\/doi.org\/10.1145\/3409964.3461807","DOI":"10.1145\/3409964.3461807"},{"key":"1089_CR30","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Friedrich, T., Lenzner, P., Lowski, S., Melnichenko, A.: Selfish creation of social networks. In: AAAI 2021, pp. 5185\u20135193 (2021). https:\/\/doi.org\/10.1145\/3323165.3323199","DOI":"10.1145\/3323165.3323199"},{"key":"1089_CR31","doi-asserted-by":"publisher","unstructured":"Goyal, S., Jabbari, S., Kearns, M.J., Khanna, S., Morgenstern, J.: Strategic network formation with attack and immunization. In: WINE 2016, pp. 429\u2013443 (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_30","DOI":"10.1007\/978-3-662-54110-4_30"},{"key":"1089_CR32","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Ihde, S., Ke\u00dfler, C., Lenzner, P., Neubert, S., Schumann, D.: Efficient best response computation for strategic network formation under attack. In: SAGT 2017, pp. 199\u2013211 (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_16","DOI":"10.1007\/978-3-319-66700-3_16"},{"key":"1089_CR33","doi-asserted-by":"publisher","unstructured":"Chen, Y., Jabbari, S., Kearns, M.J., Khanna, S., Morgenstern, J.: Network formation under random attack and probabilistic spread. In: IJCAI 2019, pp. 180\u2013186 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/26","DOI":"10.24963\/ijcai.2019\/26"},{"issue":"1","key":"1089_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/262109","volume":"108","author":"F Allen","year":"2000","unstructured":"Allen, F., Gale, D.: Financial contagion. J. Polit. Econ. 108(1), 1\u201333 (2000). https:\/\/doi.org\/10.1086\/262109","journal-title":"J. Polit. Econ."},{"issue":"7330","key":"1089_CR35","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1038\/nature09659","volume":"469","author":"AG Haldane","year":"2011","unstructured":"Haldane, A.G., May, R.M.: Systemic risk in banking ecosystems. Nature 469(7330), 351\u2013355 (2011). https:\/\/doi.org\/10.1038\/nature09659","journal-title":"Nature"},{"key":"1089_CR36","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.1496592","author":"R Caballero","year":"2009","unstructured":"Caballero, R., Simsek, A.: Fire sales in a model of complexity. J. Finance (2009). https:\/\/doi.org\/10.2139\/ssrn.1496592","journal-title":"J. Finance"},{"issue":"2","key":"1089_CR37","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1257\/aer.20130456","volume":"105","author":"D Acemoglu","year":"2015","unstructured":"Acemoglu, D., Ozdaglar, A., Tahbaz-Salehi, A.: Systemic risk and stability in financial networks. Am. Econ. Rev. 105(2), 564\u2013608 (2015). https:\/\/doi.org\/10.1257\/aer.20130456","journal-title":"Am. Econ. Rev."},{"key":"1089_CR38","doi-asserted-by":"publisher","unstructured":"Blume, L., Easley, D.A., Kleinberg, J.M., Kleinberg, R.D., Tardos, \u00c9.: Network formation in the presence of contagious risk. In: EC 2011, pp. 1\u201310 (2011). https:\/\/doi.org\/10.1145\/1993574.1993576","DOI":"10.1145\/1993574.1993576"},{"issue":"1","key":"1089_CR39","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H Wiener","year":"1947","unstructured":"Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1), 17\u201320 (1947). https:\/\/doi.org\/10.1021\/ja01193a005","journal-title":"J. Am. Chem. Soc."},{"key":"1089_CR40","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010767517079","volume":"66","author":"AA Dobrynin","year":"2001","unstructured":"Dobrynin, A.A., Entringer, R.C., Gutman, I.: Wiener index of trees: theory and applications. Acta Applicandae Mathematica 66, 211\u2013249 (2001). https:\/\/doi.org\/10.1023\/A:1010767517079","journal-title":"Acta Applicandae Mathematica"},{"key":"1089_CR41","first-page":"461","volume":"71","author":"K Xu","year":"2014","unstructured":"Xu, K., Liu, M., Das, K., Gutman, I., Furtula, B.: A survey on graphs extremal with respect to distance-based topological indices. Match (Mulheim an der Ruhr, Germany) 71, 461\u2013508 (2014)","journal-title":"Match (Mulheim an der Ruhr, Germany)"},{"issue":"1","key":"1089_CR42","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0166-218X(83)90014-8","volume":"5","author":"PM Camerini","year":"1983","unstructured":"Camerini, P.M., Galbiati, G., Maffioli, F.: On the complexity of finding multi-constrained spanning trees. Discrete Appl. Math. 5(1), 39\u201350 (1983). https:\/\/doi.org\/10.1016\/0166-218X(83)90014-8","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1089_CR43","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00265-4","volume":"181","author":"G Galbiati","year":"1997","unstructured":"Galbiati, G., Morzenti, A., Maffioli, F.: On the approximability of some maximum spanning tree problems. Theor. Comput. Sci. 181(1), 107\u2013118 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1089_CR44","first-page":"11","volume":"41","author":"L \u0160olt\u00e9s","year":"1991","unstructured":"\u0160olt\u00e9s, L.: Transmission in graphs: a bound and vertex removing. Math. Slovaca 41(1), 11\u201316 (1991)","journal-title":"Math. Slovaca"},{"issue":"1","key":"1089_CR45","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econom. Behav. 14(1), 124\u2013143 (1996). https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econom. Behav."},{"issue":"1","key":"1089_CR46","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"DR Karger","year":"1997","unstructured":"Karger, D.R., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18(1), 82\u201398 (1997). https:\/\/doi.org\/10.1007\/BF02523689","journal-title":"Algorithmica"},{"issue":"3","key":"1089_CR47","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01167206","volume":"2","author":"B Mohar","year":"1988","unstructured":"Mohar, B., Pisanski, T.: How to compute the wiener index of a graph. J. Math. Chem. 2(3), 267\u2013277 (1988). https:\/\/doi.org\/10.1007\/BF01167206","journal-title":"J. Math. Chem."},{"key":"1089_CR48","doi-asserted-by":"publisher","unstructured":"Janus, T., de Keijzer, B.: On strong equilibria and improvement dynamics in network creation games. In: WINE 2017, pp. 161\u2013176 (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_12","DOI":"10.1007\/978-3-319-71924-5_12"},{"issue":"2","key":"1089_CR49","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econom. Behav. 65(2), 289\u2013317 (2009). https:\/\/doi.org\/10.1016\/j.geb.2008.03.005","journal-title":"Games Econom. Behav."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01089-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01089-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01089-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T05:57:46Z","timestamp":1687499866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01089-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,12]]},"references-count":49,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1089"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01089-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,12]]},"assertion":[{"value":"2 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}