{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:45:54Z","timestamp":1748583954574,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["TK-148"],"award-info":[{"award-number":["TK-148"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01331-6","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T15:03:00Z","timestamp":1660748580000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Privacy-Preserving Parallel Computation of Minimum Spanning Forest"],"prefix":"10.1007","volume":"3","author":[{"given":"Mohammad","family":"Anagreh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9030-8142","authenticated-orcid":false,"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eero","family":"Vainikko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,17]]},"reference":[{"key":"1331_CR1","doi-asserted-by":"crossref","unstructured":"Anagreh M, Vainikko E, Laud, P. Parallel privacy-preserving computation of minimum spanning trees. In: Proceedings of the 7th International Conference on Information Systems Security and Privacy\u2014ICISSP, 2021; pp 181\u2013190.","DOI":"10.5220\/0010255701810190"},{"issue":"5","key":"1331_CR2","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1109\/TSMCB.2009.2037132","volume":"40","author":"Y Tarabalka","year":"2009","unstructured":"Tarabalka Y, Jocelyn C, J\u00f3n Atli B. Segmentation and classification of hyperspectral images using minimum spanning forest grown from automatically selected markers.\u2019\u2019. IEEE Trans Syst Man Cybern Part B (Cybern). 2009;40(5):1267\u201379.","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"5","key":"1331_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/00207720802645246","volume":"40","author":"T Yamada","year":"2009","unstructured":"Yamada T. A mini-max spanning forest approach to the political districting problem. Int J Syst Sci. 2009;40(5):471\u20137.","journal-title":"Int J Syst Sci"},{"issue":"3","key":"1331_CR4","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","volume":"91","author":"T Yamada","year":"1996","unstructured":"Yamada T, Takahashi H, Kataoka S. A heuristic algorithm for the mini-max spanning forest problem. Eur J Oper Res. 1996;91(3):565\u201372.","journal-title":"Eur J Oper Res"},{"key":"1331_CR5","doi-asserted-by":"crossref","unstructured":"Pinto A, Carloni LP, Sangiovanni-Vincentelli AL. Efficient synthesis of networks on chip. In: Proceedings 21st International Conference on Computer Design, IEEE, 2003; pp 146\u2013150.","DOI":"10.1109\/ICCD.2003.1240887"},{"key":"1331_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4419-9170-6","volume-title":"Hyperspectral imaging: techniques for spectral detection and classification","author":"CI Chang","year":"2003","unstructured":"Chang CI. Hyperspectral imaging: techniques for spectral detection and classification. Berlin: Springer Science & Business Media; 2003. p. 1."},{"key":"1331_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0470124628","volume-title":"Hyperspectral data exploitation: theory and applications","author":"CI Chang","year":"2007","unstructured":"Chang CI. Hyperspectral data exploitation: theory and applications. Amsterdam: Wiley; 2007."},{"issue":"1","key":"1331_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0734-189X(85)90153-7","volume":"29","author":"RM Haralick","year":"1985","unstructured":"Haralick RM, Shapiro LG. Image segmentation techniques. Comput Vis Graph Image Process. 1985;29(1):100\u201332.","journal-title":"Comput Vis Graph Image Process"},{"key":"1331_CR9","unstructured":"Stawiaski J. Mathematical morphology and graphs: application to interactive medical image segmentation. Doctoral dissertation, \u00c9cole Nationale Sup\u00e9rieure des Mines de Paris, 2008."},{"issue":"2","key":"1331_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"PF Felzenszwalb","year":"2004","unstructured":"Felzenszwalb PF, Huttenlocher DP. Efficient graph-based image segmentation. Int J Comput Vis. 2004;59(2):167\u201381.","journal-title":"Int J Comput Vis"},{"issue":"1","key":"1331_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc. 1956;7(1):48\u201350.","journal-title":"Proc Am Math Soc"},{"issue":"6","key":"1331_CR12","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC. Shortest connection networks and some generalizations. Bell Syst Tech J. 1957;36(6):1389\u2013401.","journal-title":"Bell Syst Tech J"},{"key":"1331_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.patrec.2016.06.001","volume":"87","author":"A Saglam","year":"2017","unstructured":"Saglam A, Baykan NA. Sequential image segmentation based on minimum spanning tree representation. Pattern Recogn Lett. 2017;87:155\u201362.","journal-title":"Pattern Recogn Lett"},{"key":"1331_CR14","doi-asserted-by":"crossref","unstructured":"Wassenberg J, Middelmann W, Sanders P. An efficient parallel algorithm for graph-based image segmentation. In: International Conference on Computer Analysis of Images and Pattern. Springer, Berlin, Heidelberg, 2009; pp 1003\u20131010.","DOI":"10.1007\/978-3-642-03767-2_122"},{"key":"1331_CR15","doi-asserted-by":"crossref","unstructured":"Bernard K, Tarabalka Y, Angulo J, Chanussot J, Benediktsson JA. A stochastic minimum spanning forest approach for spectral-spatial classification of hyperspectral images. In: 2011 18th IEEE International Conference on Image Processing 2011; pp 1265\u20131268.","DOI":"10.1109\/ICIP.2011.6115664"},{"key":"1331_CR16","doi-asserted-by":"crossref","unstructured":"Pike R, Patton SK, Lu G, Halig LV, Wang D, Chen ZG, Fei B. A minimum spanning forest based hyperspectral image classification method for cancerous tissue detection. In: Medical Imaging 2014: Image Processing (Vol. 9034). International Society for Optics and Photonics, 2014; p 90341W.","DOI":"10.1117\/12.2043848"},{"key":"1331_CR17","first-page":"1","volume":"1","author":"F Poorahangaryan","year":"2014","unstructured":"Poorahangaryan F, Ghassemian HA. multiscale modified minimum spanning forest method for spatial-spectral hyperspectral images classification. EURASIP J Image Video Process. 2014;1:1\u20132.","journal-title":"EURASIP J Image Video Process"},{"key":"1331_CR18","first-page":"188","volume":"2","author":"P Laud","year":"2015","unstructured":"Laud P. Parallel oblivious array access for secure multiparty computation and privacy-preserving minimum spanning trees. Proc Priv Enhanc Technol. 2015;2:188\u2013205.","journal-title":"Proc Priv Enhanc Technol"},{"issue":"12","key":"1331_CR19","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1109\/PROC.1966.5273","volume":"54","author":"MJ Flynn","year":"1966","unstructured":"Flynn MJ. Very high-speed computing systems. Proc IEEE. 1966;54(12):1901\u20139.","journal-title":"Proc IEEE"},{"issue":"9","key":"1331_CR20","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"100","author":"MJ Flynn","year":"1972","unstructured":"Flynn MJ. Some computer organizations and their effectiveness. IEEE Trans Comput. 1972;100(9):948\u201360.","journal-title":"IEEE Trans Comput"},{"key":"1331_CR21","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laur S, Willemson J, Sharemind. A framework for fast privacy-preserving computations. Berlin, Heidelberg: In: European Symposium on Research in Computer Security. Springer; 2008. pp 192\u2013206.","DOI":"10.1007\/978-3-540-88313-5_13"},{"issue":"6","key":"1331_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov D, Niitsoo M, Toft T, Willemson J. High-performance secure multi-party computation for data mining applications. Int J Inf Secur. 2012;11(6):403\u201318.","journal-title":"Int J Inf Secur"},{"key":"1331_CR23","first-page":"26","volume-title":"Applications of secure multiparty computation","author":"P Laud","year":"2015","unstructured":"Laud P. Stateful abstractions of secure multiparty computation. In: Laud P, Kamm L, editors. Applications of secure multiparty computation, vol. 13. London: IOS Press; 2015. p. 26\u201342."},{"issue":"3","key":"1331_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.3390\/cryptography5030022","volume":"5","author":"S Laur","year":"2021","unstructured":"Laur S, Pullonen-Raudvere P. Foundations of programmable secure computation. Cryptography. 2021;5(3):22.","journal-title":"Cryptography"},{"key":"1331_CR25","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Jagom\u00e4gis R, Laur S. A universal toolkit for cryptographically secure privacy-preserving data mining. In: Pacific\u2013Asia Workshop on Intelligence and Security Informatics. Springer, Berlin, Heidelberg; 2012; pp 112\u201326.","DOI":"10.1007\/978-3-642-30428-6_9"},{"issue":"3","key":"1331_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/cryptography5030021","volume":"5","author":"A Ostrak","year":"2021","unstructured":"Ostrak A, Randmets J, Sokk V, Laur S, Kamm L. Implementing privacy-preserving genotype analysis with consideration for population stratification. Cryptography. 2021;5(3):21.","journal-title":"Cryptography"},{"issue":"7","key":"1331_CR27","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1093\/bioinformatics\/btt066","volume":"29","author":"L Kamm","year":"2013","unstructured":"Kamm L, Bogdanov D, Laur S, Vilo J. A new way to protect privacy in large-scale genome-wide association studies. Bioinformatics. 2013;29(7):886\u201393.","journal-title":"Bioinformatics"},{"key":"1331_CR28","doi-asserted-by":"crossref","unstructured":"Anagreh M, Vainikko E, Laud P. Parallel privacy-preserving shortest paths by radius-stepping. In: 2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE. 2021; pp 276\u2013280.","DOI":"10.1109\/PDP52278.2021.00051"},{"issue":"4","key":"1331_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3390\/cryptography5040027","volume":"5","author":"M Anagreh","year":"2021","unstructured":"Anagreh M, Laud P, Vainikko E. Parallel privacy-preserving shortest path algorithms. Cryptography. 2021;5(4):27.","journal-title":"Cryptography"},{"key":"1331_CR30","doi-asserted-by":"crossref","unstructured":"Anagreh M, Vainikko E, Laud P. Privacy-preserving parallel computation of shortest path algorithms with low round complexity. In: Proceedings of the 8th International Conference on Information Systems Security and Privacy\u2014ICISSP, 2022; pp 37\u201347.","DOI":"10.5220\/0010775700003120"},{"key":"1331_CR31","doi-asserted-by":"crossref","unstructured":"Pankova A, J\u00e4\u00e4ger, J. Short Paper: secure multiparty logic programming. In: Proceedings of the 15th Workshop on Programming Languages and Analysis for Security, 2020; p 3\u20137.","DOI":"10.1145\/3411506.3417597"},{"key":"1331_CR32","doi-asserted-by":"crossref","unstructured":"J\u00e4\u00e4ger J, Pankova A. PrivaLog: a privacy-aware logic programming language 2020. arXiv preprint arXiv:2010.07057.","DOI":"10.1145\/3479394.3479410"},{"key":"1331_CR33","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Kamm L, Laur S, Pruulmann-Vengerfeldt P, Talviste R, Willemson J. Privacy-preserving statistical data analysis on federated databases. In: Annual privacy forum. Cham: Springer; 2014; pp 30\u201355.","DOI":"10.1007\/978-3-319-06749-0_3"},{"issue":"3","key":"1331_CR34","first-page":"117","volume":"2016","author":"D Bogdanov","year":"2016","unstructured":"Bogdanov D, Kamm L, Kubo B, Rebane R, Sokk V, Talviste R. Students and taxes: a privacy-preserving study using secure computation. Proc Priv Enhanc Technol. 2016;2016(3):117\u201335.","journal-title":"Proc Priv Enhanc Technol"},{"key":"1331_CR35","doi-asserted-by":"crossref","unstructured":"Kapoor V, Singh R, Reddy R, Churi P. Privacy issues in wearable technology: an intrinsic review. In: Proceedings of the International Conference on Innovative Computing & Communications (ICICC) 2020.","DOI":"10.2139\/ssrn.3566918"},{"issue":"5","key":"1331_CR36","first-page":"2088","volume":"10","author":"T Garg","year":"2020","unstructured":"Garg T, Kagalwalla N, Churi P, Pawar A, Deshmukh S. A survey on security and privacy issues in IoV. Int J Electr Comput Eng. 2020;10(5):2088\u20138708.","journal-title":"Int J Electr Comput Eng"},{"key":"1331_CR37","doi-asserted-by":"crossref","unstructured":"Katz J, Ostrovsky R, Smith A. Round efficiency of multi-party computation with a dishonest majority. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg. 2003; pp 578\u2013595.","DOI":"10.1007\/3-540-39200-9_36"},{"key":"1331_CR38","doi-asserted-by":"crossref","unstructured":"Katz J, Koo CY. Round-efficient secure computation in point-to-point networks. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg. 2007; pp 311\u2013328.","DOI":"10.1007\/978-3-540-72540-4_18"},{"key":"1331_CR39","unstructured":"Boyle E, Jain A, Prabhakaran M, Yu CH. The bottleneck complexity of secure multiparty computation. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik 2018."},{"key":"1331_CR40","doi-asserted-by":"crossref","unstructured":"Boyle E, Chung KM, Pass R. Large-scale secure computation: multi-party computation for (parallel) RAM programs. In: Annual Cryptology Conference. Springer, Berlin, Heidelberg. 2015; pp 742\u2013762.","DOI":"10.1007\/978-3-662-48000-7_36"},{"key":"1331_CR41","unstructured":"Cohen R, Coretti S, Garay J, Zikas V. Round-preserving parallel composition of probabilistic-termination cryptographic protocols. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2017."},{"issue":"10","key":"1331_CR42","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TC.1987.1676869","volume":"36","author":"B Awerbuch","year":"1987","unstructured":"Awerbuch B, Shiloach Y. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Trans Comput. 1987;36(10):1258\u201363.","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1331_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJAHUC.2020.107501","volume":"34","author":"CK Rao","year":"2020","unstructured":"Rao CK, Singh K. Securely solving privacy preserving minimum spanning tree algorithms in semi-honest model. Int J Ad Hoc Ubiquitous Comput. 2020;34(1):1\u201310.","journal-title":"Int J Ad Hoc Ubiquitous Comput"},{"key":"1331_CR44","doi-asserted-by":"crossref","unstructured":"Yao AC. Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (sfcs 1982). IEEE. 1982; pp 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"1331_CR45","doi-asserted-by":"crossref","unstructured":"Liu C, Wang XS, Nayak K, Huang Y, Shi E, Oblivm: A programming framework for secure computation. In: IEEE Symposium on Security and Privacy. IEEE. 2015;2015:359\u201376.","DOI":"10.1109\/SP.2015.29"},{"key":"1331_CR46","doi-asserted-by":"crossref","unstructured":"Demmler D, Schneider T, Zohner M. ABY\u2014a frame-work for efficient mixed-protocol secure two-party computation. In: 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California,USA, February 8\u201311, 2014. The Internet Society, 2015.","DOI":"10.14722\/ndss.2015.23113"},{"key":"1331_CR47","doi-asserted-by":"crossref","unstructured":"Laur S, Willemson J, Zhang B. Round-efficient oblivious database manipulation. In: International Conference on Information Security. Springer, Berlin, Heidelberg. 2011; pp 262\u2013277.","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"1331_CR48","doi-asserted-by":"crossref","unstructured":"Canetti R. Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE. 2001; pp 136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1331_CR49","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Nielsen JB. Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh D (ed) CRYPTO, volume 2729 of Lecture Notes in Computer Science. Springer; 2003; pp 247\u201364.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"1331_CR50","doi-asserted-by":"crossref","unstructured":"Henecka W, K\u00e4gl S, Sadeghi AR, Schneider T, Wehrenberg I. TASTY: tool for automating secure two-party computations. In: CCS \u201910: Proceedings of the 17thACM conference on Computer and communications security,ACM. New York, NY, USA. 2010; pp 451\u2013462.","DOI":"10.1145\/1866307.1866358"},{"key":"1331_CR51","doi-asserted-by":"crossref","unstructured":"Liu C, Huang Y, Shi E, Katz J, Hicks M. Automating efficient ram-model secure computation. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, May 18\u201321, 2014, pp. 623\u2013638. IEEE Computer Society, 2014.","DOI":"10.1109\/SP.2014.46"},{"key":"1331_CR52","unstructured":"Burkhart M, Strasser M, Many D, Dimitropoulos X. SEPIA: privacy-preserving aggregation of multi-domain net-work events and statistics. In: USENIX Security Symposium: Washington, DC, USA; 2010; pp 223\u201339."},{"key":"1331_CR53","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Geisler M, Kr\u00f8igaard M, Nielsen JB. Asynchronous multiparty computation: theory and implementation. In: Jarecki S, Tsudik G (eds) Public key cryptography, vol. 5443. Lecture Notes in Computer Science. Springer; 2009; pp 160\u201379.","DOI":"10.1007\/978-3-642-00468-1_10"},{"issue":"11","key":"1331_CR54","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM. 1979;22(11):612\u20133.","journal-title":"Commun ACM"},{"key":"1331_CR55","doi-asserted-by":"crossref","unstructured":"Blakley GR. December. Safeguarding cryptographic keys. In: Managing Requirements Knowledge, International Workshop on IEEE Computer Society. 1979; pp 313-313.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1331_CR56","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laur S, Talviste R. A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Nordic Conference on Secure IT Systems. Springer, Cham, 2014; pp 59\u201374.","DOI":"10.1007\/978-3-319-11599-3_4"},{"key":"1331_CR57","volume-title":"Introduction to graph theory (vol 2)","author":"DB West","year":"2001","unstructured":"West DB. Introduction to graph theory (vol 2). Upper Saddle River: Prentice Hall; 2001."},{"key":"1331_CR58","volume-title":"Modern graph theory (vol 184)","author":"B Bollob\u00e1s","year":"2013","unstructured":"Bollob\u00e1s B. Modern graph theory (vol 184). Berlin: Springer Science & Business Media; 2013."},{"key":"1331_CR59","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laud P, Randmets J. Domain-polymorphic programming of privacy-preserving applications. In: Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014; pp 53\u201365.","DOI":"10.1145\/2637113.2637119"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01331-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01331-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01331-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T22:59:52Z","timestamp":1727823592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01331-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,17]]},"references-count":59,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["1331"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01331-6","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,8,17]]},"assertion":[{"value":"29 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding authors state that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"448"}}