{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:04:13Z","timestamp":1767143053801,"version":"build-2238731810"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the National Numerical Wind Tunnel Project","award":["NNW2019ZT6-B21"],"award-info":[{"award-number":["NNW2019ZT6-B21"]}]},{"name":"the National Key Research and Development Program of China","award":["2018YFB0204301"],"award-info":[{"award-number":["2018YFB0204301"]}]},{"name":"the Hunan Natural Science Foundation of China","award":["2020JJ4669"],"award-info":[{"award-number":["2020JJ4669"]}]},{"name":"the Foundation of Parallel and Distributed Processing Laboratory","award":["6142110190206"],"award-info":[{"award-number":["6142110190206"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s42514-021-00070-z","type":"journal-article","created":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T16:02:21Z","timestamp":1626364941000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["VPC: Pruning connected components using vector-based path compression for Graph500"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5339-4985","authenticated-orcid":false,"given":"Hao","family":"Bai","sequence":"first","affiliation":[]},{"given":"Xinbiao","family":"Gan","sequence":"additional","affiliation":[]},{"given":"Tianjing","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Menghan","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Wen","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yiming","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"issue":"21","key":"70_CR1","doi-asserted-by":"publisher","first-page":"4947","DOI":"10.1242\/jcs.02714","volume":"118","author":"R Albert","year":"2005","unstructured":"Albert, R.: Scale-free networks in cell biology Scale-free networks in cell biology. J. Cell Sci. 118(21), 4947\u20134957 (2005)","journal-title":"J. Cell Sci."},{"key":"70_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Song, Z., Stein, C., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 674\u2013685 (2018)","DOI":"10.1109\/FOCS.2018.00070"},{"key":"70_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Shiloach, Y.: New connectivity and MSF algorithms for shuffle-exchange network and PRAM New connectivity and msf algorithms for shuffle-exchange network and pram. IEEE Comput. Archit. Lett. 36(10), 1258\u20131263 (1987)","DOI":"10.1109\/TC.1987.1676869"},{"key":"70_CR4","doi-asserted-by":"crossref","unstructured":"Azad, A., Bulu\u00e7, A.: LACC: a linear-algebraic algorithm for finding connected components in distributed memory Lacc: a linear-algebraic algorithm for finding connected components in distributed memory. In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 2\u201312 (2019)","DOI":"10.1109\/IPDPS.2019.00012"},{"key":"70_CR5","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Mattson, T., McMillan, S., Moreira, J., Yang, C.: Design of the GraphBLAS API for C Design of the graphblas api for c. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 643\u2013652 (2017)","DOI":"10.1109\/IPDPSW.2017.117"},{"issue":"3","key":"70_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298989","volume":"5","author":"R Chen","year":"2019","unstructured":"Chen, R., Shi, J., Chen, Y., Zang, B., Guan, H., Chen, H.: Powerlyra: Differentiated graph computation and partitioning on skewed graphs. ACM Trans. Parallel Comput. (TOPC) 5(3), 1\u201339 (2019)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"key":"70_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT press, Cambridge (2009)"},{"key":"70_CR8","doi-asserted-by":"crossref","unstructured":"Everitt, T., Hutter, M.: Universal artificial intelligence. In: Foundations of trusted autonomy, pp. 15\u201346. Springer (2018)","DOI":"10.1007\/978-3-319-64816-3_2"},{"key":"70_CR9","volume-title":"The complexity of computation on the parallel random access machine","author":"FE Fich","year":"1993","unstructured":"Fich, F.E.: The complexity of computation on the parallel random access machine. Citeseer (1993)"},{"issue":"6","key":"70_CR10","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1137\/0220066","volume":"20","author":"H Gazit","year":"1991","unstructured":"Gazit, H.: An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput. 20(6), 1046\u20131067 (1991)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"70_CR11","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TSG.2013.2245155","volume":"4","author":"A Giani","year":"2013","unstructured":"Giani, A., Bitar, E., Garcia, M., McQueen, M., Khar-gonekar, P.P., Poolla, K.: Smart grid data integrity attacks. IEEE Trans. Smart Grid 4(3), 1244\u20131253 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"key":"70_CR12","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: 10th fUSENIXg Symposium on Operating Systems Design and Implementation (fOSDIg 12), pp. 17\u201330 (2012)"},{"key":"70_CR13","unstructured":"Gonzalez, J. E., Xin, R. S., Dave, A., Crankshaw, D., Franklin, M. J., Stoica, I.: Graphx: Graph processing in a distributed data flow frame-work. In 11th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 14) 11th $$\\{$$USENIX$$\\}$$ symposium on operating systems design and implementation ($$\\{$$OSDI$$\\}$$ 14), pp.  599\u2013613 (2014)"},{"issue":"3","key":"70_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jcss.1996.0078","volume":"53","author":"S Halperin","year":"1996","unstructured":"Halperin, S., Zwick, U.: An optimal ran- domised logarithmic time connectivity algorithm for the erew pram. J. Comput. Syst. Sci. 53(3), 395\u2013416 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"70_CR15","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1016\/j.patcog.2008.10.013","volume":"42","author":"L He","year":"2009","unstructured":"He, L., Chao, Y., Suzuki, K., Wu, K.: Fast connected-component labeling. Pattern Recogn. 42(9), 1977\u20131987 (2009)","journal-title":"Pattern Recogn."},{"issue":"8","key":"70_CR16","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"DS Hirschberg","year":"1979","unstructured":"Hirschberg, D.S., Chandra, A.K., Sarwate, D.V.: Computing connected components on parallel computers. Commun. ACM 22(8), 461\u2013464 (1979)","journal-title":"Commun. ACM"},{"key":"70_CR17","doi-asserted-by":"crossref","unstructured":"Hogan, E., Hui, P., Choudhury, S., Halappanavar, M., Oler, K., Joslyn, C.: Towards a multi-scale approach to cybersecurity modeling. In: 2013 IEEE International Conference on Technologies for Homeland Security (hst), pp. 80\u201385 (2013)","DOI":"10.1109\/THS.2013.6698980"},{"issue":"6","key":"70_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"4","key":"70_CR19","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0202024","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Ullman, J.D.: Set merging algorithms. SIAM J. Comput. 2(4), 294\u2013303 (1973)","journal-title":"SIAM J. Comput."},{"key":"70_CR20","unstructured":"Huijbregts, M.: Segmentation, diarization and speech transcription: surprise data unraveled. Citeseer (2008)"},{"issue":"9","key":"70_CR21","doi-asserted-by":"publisher","first-page":"2428","DOI":"10.1109\/TPDS.2017.2672739","volume":"28","author":"C Jain","year":"2017","unstructured":"Jain, C., Flick, P., Pan, T., Green, O., Aluru, S.: An adaptive parallel algorithm for computing connected components. IEEE Trans. Parallel Distrib. Syst. 28(9), 2428\u20132439 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"70_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2901736","volume":"41","author":"J Jung","year":"2016","unstructured":"Jung, J., Shin, K., Sael, L., Kang, U.: Random walk with restart on large graphs using block elimination. ACM Trans. Database Syst. (TODS) 41(2), 1\u201343 (2016)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"70_CR23","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond\u2019caveman communities\u2019: Hubs and spokes for graph com- pression and mining. In: 2011 IEEE 11th International Conference on Data Mining, pp. 300\u2013309 (2011)","DOI":"10.1109\/ICDM.2011.26"},{"key":"70_CR24","doi-asserted-by":"crossref","unstructured":"Kang, U., McGlohon, M., Akoglu, L., Faloutsos, C.: Patterns on the connected components of terabyte-scale graphs. In: 2010 IEEE International Conference on Data Mining, pp. 875\u2013880 (2010)","DOI":"10.1109\/ICDM.2010.121"},{"issue":"3","key":"70_CR25","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/srt.12264","volume":"22","author":"K Kikuchi","year":"2016","unstructured":"Kikuchi, K., Masuda, Y., Yamashita, T., Sato, K., Katagiri, C., Hirao, T., Yaguchi, H.: A new quantitative evaluation method for age- related changes of individual pigmented spots in facial skin. Skin Res. Technol. 22(3), 318\u2013324 (2016)","journal-title":"Skin Res. Technol."},{"issue":"2","key":"70_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11390-015-1520-7","volume":"30","author":"X-K Liao","year":"2015","unstructured":"Liao, X.-K., Pang, Z.-B., Wang, K.-F., Lu, Y.-T., Xie, M., Xia, J., Suo, G.: High performance interconnect network for tianhe system. J. Comput. Sci. Technol. 30(2), 259\u2013272 (2015)","journal-title":"J. Comput. Sci. Technol."},{"key":"70_CR27","doi-asserted-by":"crossref","unstructured":"Lim, Y., Lee, W.-J., Choi, H.-J., Kang, U.: Discovering large subsets with high quality partitions in real world graphs. In: 2015 International Conference on Big Data and Smart Computing (big-comp), pp. 186\u2013193 (2015)","DOI":"10.1109\/35021BIGCOMP.2015.7072830"},{"issue":"12","key":"70_CR28","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim, Y., Kang, U., Faloutsos, C.: Slashburn: Graph compression and mining beyond caveman communities. IEEE Trans. Knowl. Data Eng. 26(12), 3077\u20133089 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"70_CR29","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11280-016-0393-1","volume":"20","author":"Y Lim","year":"2017","unstructured":"Lim, Y., Lee, W.-J., Choi, H.-J., Kang, U.: Mtp: discovering high quality partitions in real world graphs. World Wide Web 20(3), 491\u2013514 (2017)","journal-title":"World Wide Web"},{"key":"70_CR30","doi-asserted-by":"crossref","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: A framework for machine learning in the cloud. Preprint at arXiv:1204.6078 (2012)","DOI":"10.14778\/2212351.2212354"},{"issue":"6","key":"70_CR31","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11432-006-2030-6","volume":"49","author":"X Lu","year":"2006","unstructured":"Lu, X., Wang, H., Wang, J.: Internet-based virtual computing environment (ivce): Concepts and architecture. Sci. China Ser. F Inf. Sci. 49(6), 681\u2013701 (2006)","journal-title":"Sci. China Ser. F Inf. Sci."},{"issue":"1","key":"70_CR32","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.future.2011.08.005","volume":"29","author":"X Lu","year":"2013","unstructured":"Lu, X., Wang, H., Wang, J., Xu, J., Li, D.: Internet-based virtual computing environment: Beyond the data center as a computer. Futur. Gener. Comput. Syst. 29(1), 309\u2013322 (2013)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"12","key":"70_CR33","doi-asserted-by":"publisher","first-page":"e173","DOI":"10.1371\/journal.pcbi.0020173","volume":"2","author":"D Medini","year":"2006","unstructured":"Medini, D., Covacci, A., Donati, C.: Protein homology network families reveal step-wise diversification of type iii and type iv secretion systems. PLoS Comput. Biol. 2(12), e173 (2006)","journal-title":"PLoS Comput. Biol."},{"key":"70_CR34","doi-asserted-by":"crossref","unstructured":"Nowosielski, A., Frejlichowski, D., Forczma\u0144ski, P., Go\u015bciewska, K., Hofman, R.: Automatic analysis of vehicle trajectory applied to visual surveillance. In: Image processing and communications challenges, vol. 7, pp. 89\u201396. Springer (2016)","DOI":"10.1007\/978-3-319-23814-2_11"},{"key":"70_CR35","doi-asserted-by":"crossref","unstructured":"Patil, G.P., Acharya, R., Phoha, S.: Digital governance, hotspot detection, and homeland security. Encyclopedia of Quantitative Risk Analysis and Assessment, vol. 2 (2008)","DOI":"10.1002\/9780470061596.risk0679"},{"issue":"6","key":"70_CR36","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1137\/S0097539700371065","volume":"31","author":"S Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V.: A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput. 31(6), 1879\u20131895 (2002)","journal-title":"SIAM J. Comput."},{"key":"70_CR37","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Inf. Process. Lett. 20(5), 229\u2013234 (1985a)","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"70_CR38","unstructured":"Reif, J. H.: Optimal parallel algorithms for interger sorting and graph connectivity. (Tech. Rep.). HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB (1985b)"},{"key":"70_CR39","unstructured":"Shiloach, Y., Vishkin, U.: An o (log n) parallel connectivity algorithm (Tech. Rep.). Computer Science Department, Technion (1980)"},{"key":"70_CR40","doi-asserted-by":"crossref","unstructured":"Shun, J., Dhulipala, L., Blelloch, G.: A simple and practical linear-work parallel algorithm for connectivity. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 143\u2013153 (2014)","DOI":"10.1145\/2612669.2612692"},{"key":"70_CR41","doi-asserted-by":"crossref","unstructured":"Slota, G. M., Rajamanickam, S., Madduri, K.: A case study of complex graph analysis in distributed memory: Implementation and optimiza- tion. In: 2016 IEEE International Parallel and Dis- Tributed Processing Symposium (ipdps), pp. 293\u2013302 (2016)","DOI":"10.1109\/IPDPS.2016.93"},{"issue":"9","key":"70_CR43","doi-asserted-by":"publisher","first-page":"11199","DOI":"10.1007\/s11042-015-3201-5","volume":"76","author":"W Song","year":"2017","unstructured":"Song, W., Wu, D., Xi, Y., Park, Y.W., Cho, K.: Motion-based skin region of interest detection with a real-time connected component labeling algorithm. Multimed. Tools Appl. 76(9), 11199\u201311214 (2017)","journal-title":"Multimed. Tools Appl."},{"key":"70_CR44","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E., Van Leeuwen, J.: Worst-case analysis of set union algorithms. Journal of the CM (JACM), 31(2), 245\u2013281 (1984). https:\/\/investor.fb.com\/investor-news\/press-release-details\/2021\/Facebook-Reports-First-Quarter-2021-Results\/default.aspx.(n.d.)https:\/\/www.tencent.com\/zh-cn\/investors.html.(n.d.)","DOI":"10.1145\/62.2160"},{"issue":"2","key":"70_CR45","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"70_CR46","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM (JACM) 22(2), 215\u2013225 (1975)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"70_CR47","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(84)90019-2","volume":"9","author":"U Vishkin","year":"1984","unstructured":"Vishkin, U.: An optimal parallel connectivity algorithm. Discret. Appl. Math. 9(2), 197\u2013207 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"70_CR48","doi-asserted-by":"publisher","first-page":"361","DOI":"10.26599\/TST.2020.9010009","volume":"26","author":"R Wang","year":"2020","unstructured":"Wang, R., Lu, K., Chen, J., Zhang, W., Li, J., Yuan, Y., Fan, X.: Brief introduction of tianhe exascale prototype system. Tsinghua Sci. Technol. 26(3), 361\u2013369 (2020)","journal-title":"Tsinghua Sci. Technol."},{"key":"70_CR49","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.patcog.2015.09.010","volume":"51","author":"X Wu","year":"2016","unstructured":"Wu, X., Yuan, P., Peng, Q., Ngo, C.-W., He, J.-Y.: Detection of bird nests in overhead catenary system images for high-speed rail. Pattern Recogn. 51, 242\u2013254 (2016)","journal-title":"Pattern Recogn."},{"issue":"1","key":"70_CR50","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/0214010","volume":"14","author":"AC Yao","year":"1985","unstructured":"Yao, A.C.: On the expected performance of path compression algorithms. SIAM J. Comput. 14(1), 129\u2013133 (1985)","journal-title":"SIAM J. Comput."},{"key":"70_CR51","doi-asserted-by":"crossref","unstructured":"Yip, M., Shadbolt, N., Webber, C.: Structural analysis of online criminal social networks. In: 2012 IEEE International Conference on Intelligence and Security Informatics, pp. 60\u201365 (2012)","DOI":"10.1109\/ISI.2012.6284092"},{"key":"70_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Azad, A., Hu, Z.: Fastsv: A distributed-memory connected component algo- rithm with fast convergence. In: Proceedings of the 2020 SIAM Conference on Parallel Processing for Scientific Computing, pp. 46\u201357 (2020)","DOI":"10.1137\/1.9781611976137.5"},{"key":"70_CR53","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.jpdc.2020.04.009","volume":"144","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Azad, A., Buluc, A.: Parallel algorithms for finding connected components using linear algebra. J. Parallel Distrib. Comput. 144, 14\u201327 (2020)","journal-title":"J. Parallel Distrib. Comput."}],"updated-by":[{"DOI":"10.1007\/s42514-021-00085-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T00:00:00Z","timestamp":1636934400000}}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-021-00070-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-021-00070-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-021-00070-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T02:17:13Z","timestamp":1640053033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-021-00070-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,15]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s42514-021-00070-z","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"value":"2524-4922","type":"print"},{"value":"2524-4930","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,15]]},"assertion":[{"value":"23 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2021","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s42514-021-00085-6","URL":"https:\/\/doi.org\/10.1007\/s42514-021-00085-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}