{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T13:23:58Z","timestamp":1778765038533,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:00:00Z","timestamp":1626912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:00:00Z","timestamp":1626912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["712\/20"],"award-info":[{"award-number":["712\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10458-021-09524-8","type":"journal-article","created":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T07:02:49Z","timestamp":1626937369000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair cake-cutting algorithms with real land-value data"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3310-360X","authenticated-orcid":false,"given":"Itay","family":"Shtechman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rica","family":"Gonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erel","family":"Segal-HaLevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,22]]},"reference":[{"key":"9524_CR1","doi-asserted-by":"crossref","unstructured":"Arunachaleswaran, E.R., Barman, S., Kumar, R., & Rathi, N. (2019). Fair and efficient cake division with connected pieces. arXiv preprint arXiv:190711019.","DOI":"10.1007\/978-3-030-35389-6_5"},{"key":"9524_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, Y., & Dombb, Y. (2010). The efficiency of fair division with connected pieces. In International workshop on internet and network economics (pp. 26\u201337). Springer.","DOI":"10.1007\/978-3-642-17572-5_3"},{"key":"9524_CR3","unstructured":"Aumann, Y., Dombb, Y., & Hassidim, A. (2013). Computing socially-efficient cake divisions. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems (pp. 343\u2013350). International Foundation for Autonomous Agents and Multiagent Systems"},{"key":"9524_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., & Ye, C. (2014). Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In International conference on web and internet economics (pp. 1\u201314). Springer.","DOI":"10.1007\/978-3-319-13129-0_1"},{"key":"9524_CR5","first-page":"471","volume":"67","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Hassidim, A., & Segal-Halevi, E. (2020). Fair allocation with diminishing differences. Journal of Artificial Intelligence Research, 67, 471\u2013507.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9524_CR6","unstructured":"Barman, S., & Rathi, N. (2020). Fair cake division under monotone likelihood ratios. CoRR abs\/2006.00481, https:\/\/arxiv.org\/abs\/2006.00481, 2006.00481."},{"key":"9524_CR7","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., & Yang, E. (2012). Optimal proportional cake cutting with connected pieces. In Proceedings of the 26th AAAI conference on artificial intelligence (AAAI-12) (pp. 1263\u20131269)."},{"key":"9524_CR8","doi-asserted-by":"crossref","unstructured":"Bei, X., Huzhang, G., & Suksompong, W. (2018). Truthful fair division without free disposal. In Proceedings of IJCAI-18.","DOI":"10.24963\/ijcai.2018\/9"},{"issue":"1","key":"9524_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2011). The price of fairness. Operations Research, 59(1), 17\u201331.","journal-title":"Operations Research"},{"issue":"2","key":"9524_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1163\/15718069720847997","volume":"2","author":"S Brams","year":"1997","unstructured":"Brams, S., & Denoon, D. (1997). Fair division: A new approach to the spratly islands controversy. International Negotiation, 2(2), 303\u2013329.","journal-title":"International Negotiation"},{"key":"9524_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: From cake-cutting to dispute resolution","author":"S Brams","year":"1996","unstructured":"Brams, S., & Taylor, A. (1996). Fair division: From cake-cutting to dispute resolution. Cambridge University Press."},{"issue":"1","key":"9524_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1177\/073889429601500105","volume":"15","author":"S Brams","year":"1996","unstructured":"Brams, S., & Togman, J. (1996). Camp David: Was the agreement fair? Conflict Management and Peace Science, 15(1), 99\u2013112. https:\/\/doi.org\/10.1177\/073889429601500105.","journal-title":"Conflict Management and Peace Science"},{"key":"9524_CR13","volume-title":"Mathematics and democracy: Designing better voting and fair-division procedures","author":"SJ Brams","year":"2007","unstructured":"Brams, S. J. (2007). Mathematics and democracy: Designing better voting and fair-division procedures (1st ed.). Princeton: Princeton University Press.","edition":"1"},{"key":"9524_CR14","unstructured":"Br\u00e2nzei, S. (2015). Computational fair division. Ph.D. thesis, Faculty of Science and Technology in Aarhus university."},{"key":"9524_CR15","first-page":"6","volume":"1","author":"E Budish","year":"2007","unstructured":"Budish, E., & Cantillon, E. (2007). Strategic behavior in multi-unit assignment problems: Theory and evidence from course allocations. Computational Social Systems and the Internet, 1, 6\u20137.","journal-title":"Computational Social Systems and the Internet"},{"issue":"5","key":"9524_CR16","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., & Cantillon, E. (2012). The multi-unit assignment problem: Theory and evidence from course allocation at harvard. American Economic Review, 102(5), 2237\u201371.","journal-title":"American Economic Review"},{"issue":"4","key":"9524_CR17","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., & Kyropoulou, M. (2012). The efficiency of fair division. Theory of Computing Systems, 50(4), 589\u2013610.","journal-title":"Theory of Computing Systems"},{"key":"9524_CR18","unstructured":"Cavallo, R. (2012). Fairness and welfare through redistribution when utility is transferable. In Proceedings of the conference on artificial intelligence (AAAI)."},{"issue":"1","key":"9524_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J. K., Parkes, D. C., & Procaccia, A. D. (2013). Truth, justice, and cake cutting. Games and Economic Behavior, 77(1), 284\u2013297.","journal-title":"Games and Economic Behavior"},{"key":"9524_CR20","doi-asserted-by":"crossref","unstructured":"Cohler, Y. J., Lai, J. K., Parkes, D. C., & Procaccia, A. D. (2011). Optimal envy-free cake cutting. In Proceedings of the 25th AAAI conference on artificial intelligence (AAAI-11) (pp. 626\u2013631).","DOI":"10.1609\/aaai.v25i1.7874"},{"issue":"3","key":"9524_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10726-005-1245-z","volume":"14","author":"T Daniel","year":"2005","unstructured":"Daniel, T., & Parco, J. (2005). Fair, efficient and envy-free bargaining: An experimental test of the Brams-Taylor adjusted winner mechanism. Group Decision and Negotiation, 14(3), 241\u2013264.","journal-title":"Group Decision and Negotiation"},{"key":"9524_CR22","doi-asserted-by":"crossref","unstructured":"Dickerson, J., Goldman, J., Karp, J., Procaccia, A., & Sandholm, T. (2014). The computational rise and fall of fairness. In Proceedings of the conference on artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v28i1.8884"},{"key":"9524_CR23","unstructured":"Dupuis-Roy, N., & Gosselin, F. (2011). The simpler, the better: A new challenge for fair-division theory. In: Proceedings of the annual meeting of the cognitive science society (pp. 3229\u20133234). http:\/\/csjarchive.cogsci.rpi.edu\/Proceedings\/2011\/papers\/0742\/paper0742.pdf."},{"issue":"4","key":"9524_CR24","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1257\/0002828042002741","volume":"94","author":"D Engelmann","year":"2004","unstructured":"Engelmann, D., & Strobel, M. (2004). Inequality aversion, efficiency, and maximin preferences in simple distribution experiments. American Economic Review, 94(4), 857\u2013869.","journal-title":"American Economic Review"},{"issue":"3","key":"9524_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218x(84)90005-2","volume":"7","author":"S Even","year":"1984","unstructured":"Even, S., & Paz, A. (1984). A note on cake cutting. Discrete Applied Mathematics, 7(3), 285\u2013296. https:\/\/doi.org\/10.1016\/0166-218x(84)90005-2.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"9524_CR26","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1257\/aer.96.5.1912","volume":"96","author":"E Fehr","year":"2006","unstructured":"Fehr, E., Naef, M., & Schmidt, K. (2006). Inequality aversion, efficiency, and maximin preferences in simple distribution experiments: Comment. American Economic Review, 96(5), 1912\u20131917.","journal-title":"American Economic Review"},{"issue":"1","key":"9524_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1287\/mnsc.5.1.5","volume":"5","author":"M Flood","year":"1958","unstructured":"Flood, M. (1958). Some experimental games. Management Science, 5(1), 5\u201326.","journal-title":"Management Science"},{"issue":"6","key":"9524_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/3131361","volume":"64","author":"YK Gal","year":"2017","unstructured":"Gal, Y. K., Mash, M., Procaccia, A. D., & Zick, Y. (2017). Which is the fairest (rent division) of them all? Journal of the ACM (JACM), 64(6), 39.","journal-title":"Journal of the ACM (JACM)"},{"key":"9524_CR29","doi-asserted-by":"crossref","unstructured":"Goldberg, P., Hollender, A., & Suksompong, W. (2020). Contiguous cake cutting: Hardness results and approximation algorithms. arXiv:1911.05416.","DOI":"10.1613\/jair.1.12222"},{"issue":"2","key":"9524_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2728732.2728738","volume":"13","author":"J Goldman","year":"2015","unstructured":"Goldman, J., & Procaccia, A. D. (2015). Spliddit: Unleashing fair division algorithms. ACM SIGecom Exchanges, 13(2), 41\u201346.","journal-title":"ACM SIGecom Exchanges"},{"issue":"2","key":"9524_CR31","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.jebo.2010.06.002","volume":"76","author":"DK Herreiner","year":"2010","unstructured":"Herreiner, D. K., & Puppe, C. (2010). Inequality aversion and efficiency with ordinal and cardinal social preferences-an experimental study. Journal of Economic Behavior & Organization, 76(2), 238\u2013253.","journal-title":"Journal of Economic Behavior & Organization"},{"issue":"2","key":"9524_CR32","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.geb.2010.02.005","volume":"70","author":"R Hortala-Vallve","year":"2010","unstructured":"Hortala-Vallve, R., & Llorente-Saguer, A. (2010). A simple mechanism for resolving conflict. Games and Economic Behavior, 70(2), 375\u2013391. https:\/\/doi.org\/10.1016\/j.geb.2010.02.005.","journal-title":"Games and Economic Behavior"},{"key":"9524_CR33","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Lai, J. K., & Procaccia, A. D. (2013). How to cut a cake before the party ends. In Proceedings of the twenty-seventh AAAI conference on artificial intelligence (pp. 555\u2013561).","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"9524_CR34","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A., & Shah, N. (2015). Leximin allocations in the real world. In Proceedings of the sixteenth ACM conference on economics and computation (pp. 345\u2013362). ACM.","DOI":"10.1145\/2764468.2764490"},{"key":"9524_CR35","doi-asserted-by":"crossref","unstructured":"Kyropoulou, M., Ortega, J., & Segal-Halevi, E. (2019). Fair cake-cutting in practice. In Proceedings of the 2019 ACM conference on economics and computation (pp. 547\u2013548). ACM.","DOI":"10.1145\/3328526.3329592"},{"key":"9524_CR36","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jmateco.2019.11.001","volume":"86","author":"J Legut","year":"2020","unstructured":"Legut, J. (2020). Simple fair division of a square. Journal of Mathematical Economics, 86, 35\u201340.","journal-title":"Journal of Mathematical Economics"},{"key":"9524_CR37","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-662-47904-9_7","volume-title":"Economics and computation: An introduction to algorithmic game theory, computational social choice, and fair division","author":"C Lindner","year":"2016","unstructured":"Lindner, C., & Rothe, J. (2016). Cake-cutting: Fair division of divisible goods. In J. Rothe (Ed.), Economics and computation: An introduction to algorithmic game theory, computational social choice, and fair division (pp. 395\u2013491). Springer."},{"issue":"3","key":"9524_CR38","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1177\/0022002700044003003","volume":"44","author":"T Massoud","year":"2000","unstructured":"Massoud, T. (2000). Fair division, adjusted winner procedure (AW), and the Israeli-Palestinian conflict. Journal of Conflict Resolution, 44(3), 333\u2013358. https:\/\/doi.org\/10.1177\/0022002700044003003.","journal-title":"Journal of Conflict Resolution"},{"key":"9524_CR39","doi-asserted-by":"crossref","unstructured":"Mattei, N., & Walsh, T. (2013). Preflib: A library for preferences. In International conference on algorithmic decision theory (pp. 259\u2013270). Springer. http:\/\/www.preflib.org.","DOI":"10.1007\/978-3-642-41575-3_20"},{"key":"9524_CR40","doi-asserted-by":"crossref","unstructured":"Menon, V., & Larson, K. (2017). Deterministic, strategyproof, and fair cake cutting. In Proceedings of the joint conference on artificial intelligence (IJCAI).","DOI":"10.24963\/ijcai.2017\/50"},{"key":"9524_CR41","doi-asserted-by":"crossref","unstructured":"Oluwasuji, O. I., Malik, O., Zhang, J., & Ramchurn S. D., et\u00a0al. (2018). Algorithms for fair load shedding in developing countries. In IJCAI (pp. 1590\u20131596).","DOI":"10.24963\/ijcai.2018\/220"},{"issue":"6","key":"9524_CR42","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10726-005-3824-4","volume":"13","author":"J Parco","year":"2004","unstructured":"Parco, J., & Rapoport, A. (2004). Enhancing honesty in bargaining under incomplete information: An experimental study of the bonus procedure. Group Decision and Negotiation, 13(6), 539\u2013562.","journal-title":"Group Decision and Negotiation"},{"issue":"11","key":"9524_CR43","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1287\/mnsc.36.11.1293","volume":"36","author":"J Pratt","year":"1990","unstructured":"Pratt, J., & Zeckhauser, R. (1990). The fair and efficient division of the Winsor family silver. Management Science, 36(11), 1293\u20131301. https:\/\/doi.org\/10.1287\/mnsc.36.11.1293.","journal-title":"Management Science"},{"key":"9524_CR44","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/CBO9781107446984.014","volume-title":"Handbook of computational social choice","author":"A Procaccia","year":"2016","unstructured":"Procaccia, A. (2016). Cake cutting algorithms. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice (pp. 311\u2013330). Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9781107446984.014."},{"key":"9524_CR45","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: Be fair if you can","author":"J Robertson","year":"1998","unstructured":"Robertson, J., & Webb, W. (1998). Cake-cutting algorithms: Be fair if you can. AK Peters\/CRC Press."},{"issue":"4","key":"9524_CR46","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1177\/0022002704266148","volume":"48","author":"G Schneider","year":"2004","unstructured":"Schneider, G., & Kr\u00e4mer, U. (2004). The limitations of fair division. Journal of Conflict Resolution, 48(4), 506\u2013524. https:\/\/doi.org\/10.1177\/0022002704266148.","journal-title":"Journal of Conflict Resolution"},{"issue":"2","key":"9524_CR47","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00199-018-1128-6","volume":"68","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi, E., & Sziklai, B. R. (2019). Monotonicity and competitive equilibrium in cake-cutting. Economic Theory, 68(2), 363\u2013401.","journal-title":"Economic Theory"},{"issue":"1","key":"9524_CR48","first-page":"12","volume":"13","author":"E Segal-Halevi","year":"2016","unstructured":"Segal-Halevi, E., Hassidim, A., & Aumann, Y. (2016). Waste makes haste: Bounded time algorithms for envy-free cake cutting with free disposal. ACM Transactions on Algorithms (TALG), 13(1), 12.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"9524_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2017.01.007","volume":"70","author":"E Segal-Halevi","year":"2017","unstructured":"Segal-Halevi, E., Nitzan, S., Hassidim, A., & Aumann, Y. (2017). Fair and square: Cake-cutting in two dimensions. Journal of Mathematical Economics, 70, 1\u201328. https:\/\/doi.org\/10.1016\/j.jmateco.2017.01.007.","journal-title":"Journal of Mathematical Economics"},{"issue":"3","key":"9524_CR50","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1287\/moor.2019.1016","volume":"45","author":"E Segal-Halevi","year":"2020","unstructured":"Segal-Halevi, E., Nitzan, S., Hassidim, A., & Aumann, Y. (2020). Envy-free division of land. Mathematics of Operations Research, 45(3), 896\u2013922.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"9524_CR51","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23\u201337. https:\/\/doi.org\/10.1016\/0304-4068(74)90033-0.","journal-title":"Journal of Mathematical Economics"},{"issue":"1","key":"9524_CR52","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H. (1948). The problem of fair division. Econometrica, 16(1), 101\u2013104.","journal-title":"Econometrica"},{"issue":"1","key":"9524_CR53","doi-asserted-by":"publisher","first-page":"11","DOI":"10.37236\/735","volume":"15","author":"W Stromquist","year":"2008","unstructured":"Stromquist, W. (2008). Envy-free cake divisions cannot be found by finite protocols. The Electronic Journal of Combinatorics, 15(1), 11.","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"10","key":"9524_CR54","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F. E. (1999). Rental Harmony: Sperner\u2019s Lemma in Fair Division. The American Mathematical Monthly, 106(10), 930\u2013942.","journal-title":"The American Mathematical Monthly"},{"key":"9524_CR55","doi-asserted-by":"crossref","unstructured":"Tijs, S., Branzei, R. (2004). Cases in cooperation and cutting the cake. SSRN preprint http:\/\/ssrn.com\/abstract=627424.","DOI":"10.2139\/ssrn.627424"},{"key":"9524_CR56","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-24873-3_22","volume":"6992","author":"T Walsh","year":"2011","unstructured":"Walsh, T. (2011). Online cake cutting. Algorithmic Decision Theory, 6992, 292\u2013305.","journal-title":"Algorithmic Decision Theory"},{"issue":"2","key":"9524_CR57","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"GJ Woeginger","year":"2007","unstructured":"Woeginger, G. J., & Sgall, J. (2007). On the complexity of cake cutting. Discrete Optimization, 4(2), 213\u2013220.","journal-title":"Discrete Optimization"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09524-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-021-09524-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09524-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T05:04:42Z","timestamp":1672895082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-021-09524-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,22]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["9524"],"URL":"https:\/\/doi.org\/10.1007\/s10458-021-09524-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,22]]},"assertion":[{"value":"5 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"39"}}