{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T09:44:49Z","timestamp":1747215889354,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100009110","name":"Natural Science Foundation of Xinjiang Province","doi-asserted-by":"publisher","award":["2020D04046"],"award-info":[{"award-number":["2020D04046"]}],"id":[{"id":"10.13039\/100009110","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009110","name":"Natural Science Foundation of Xinjiang Province","doi-asserted-by":"publisher","award":["2021D01C116"],"award-info":[{"award-number":["2021D01C116"]}],"id":[{"id":"10.13039\/100009110","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261085"],"award-info":[{"award-number":["12261085"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11227-022-04896-4","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T18:11:01Z","timestamp":1667239861000},"page":"6070-6086","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The edge fault-tolerant spanning laceability of the enhanced hypercube networks"],"prefix":"10.1007","volume":"79","author":[{"given":"Hongwei","family":"Qiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eminjan","family":"Sabir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,31]]},"reference":[{"key":"4896_CR1","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"JM Xu","year":"2001","unstructured":"Xu JM (2001) Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht"},{"issue":"22","key":"4896_CR2","doi-asserted-by":"crossref","first-page":"3332","DOI":"10.1016\/j.ins.2006.01.001","volume":"176","author":"JX Fan","year":"2006","unstructured":"Fan JX, Jia XH, Lin XL (2006) Complete path embeddings in crossed cubes. Inf Sci 176(22):3332\u20133346","journal-title":"Inf Sci"},{"issue":"2","key":"4896_CR3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.ins.2007.08.012","volume":"178","author":"JX Fan","year":"2008","unstructured":"Fan JX, Jia XH (2008) Edge-pancyclicity and path-embeddability of bijective connection graphs. Inf Sci 178(2):340\u2013351","journal-title":"Inf Sci"},{"issue":"2","key":"4896_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s11227-007-0133-5","volume":"42","author":"SY Hsieh","year":"2007","unstructured":"Hsieh SY, Lin TJ, Huang HL (2007) Panconnectivity and edge-pancyclicity of 3-ary N-cubes. J Supercomput 42(2):225\u2013233","journal-title":"J Supercomput"},{"issue":"1","key":"4896_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/s11227-018-02734-0","volume":"75","author":"HZ L\u00fc","year":"2019","unstructured":"L\u00fc HZ (2019) Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges. J Supercomput 75(1):400\u2013424","journal-title":"J Supercomput"},{"key":"4896_CR6","doi-asserted-by":"crossref","first-page":"6871","DOI":"10.1007\/s11227-020-03512-7","volume":"77","author":"JH Park","year":"2021","unstructured":"Park JH (2021) A suffcient condition for the unpaired k-disjoint path coverability of interval graphs. J Supercomput 77:6871\u20136888","journal-title":"J Supercomput"},{"issue":"9","key":"4896_CR7","first-page":"5409","volume":"218","author":"SY Wang","year":"2012","unstructured":"Wang SY, Feng K, Zhang SR, Li J (2012) Embedding long cycles in faulty $$k$$-ary $$2$$-cubes. Appl Math Comput 218(9):5409\u20135413","journal-title":"Appl Math Comput"},{"issue":"2","key":"4896_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11464-009-0017-5","volume":"4","author":"JM Xu","year":"2009","unstructured":"Xu JM, Ma MJ (2009) A survey on cycle and path embedding in some networks. Front Math China 4(2):217\u2013252","journal-title":"Front Math China"},{"issue":"11","key":"4896_CR9","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPDS.2012.30","volume":"23","author":"DJ Wang","year":"2012","unstructured":"Wang DJ (2012) Hamiltonian embedding in crossed cubes with failed links. IEEE Trans Parallel Distrib Syst 23(11):2117\u20132124","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"4896_CR10","volume":"15","author":"WB Fan","year":"2021","unstructured":"Fan WB, Fan JX, Han ZJ, Li P, Zhang YJ, Wang RC (2021) Fault-tolerant hamiltonian cycles and paths embedding into locally exchanged twisted cubes. Front Comput Sci 15(3):153104","journal-title":"Front Comput Sci"},{"issue":"7","key":"4896_CR11","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1109\/TPDS.2021.3126254","volume":"33","author":"YX Yang","year":"2022","unstructured":"Yang YX, Zhang LL (2022) Hamiltonian paths of $$k$$-ary $$n$$-cubes avoiding faulty links and passing through prescribed linear forests. IEEE Trans Parallel Distrib Syst 33(7):1752\u20131760","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"4896_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(01)00256-3","volume":"82","author":"JX Fan","year":"2002","unstructured":"Fan JX (2002) Hamilton-connectivity and cycle-embedding of the M\u00f6bius cubes. Inf Process Lett 82(2):113\u2013117","journal-title":"Inf Process Lett"},{"key":"4896_CR13","first-page":"447","volume":"244","author":"RX Hao","year":"2014","unstructured":"Hao RX, Zhang R, Feng YQ, Zhou JX (2014) Hamiltonian cycle embedding for fault tolerance in balanced hypercubes. Appl Math Comput 244:447\u2013456","journal-title":"Appl Math Comput"},{"issue":"2","key":"4896_CR14","first-page":"314","volume":"191","author":"SY Hsieh","year":"2007","unstructured":"Hsieh SY, Shiu JY (2007) Cycle embedding of augmented cubes. Appl Math Comput 191(2):314\u2013319","journal-title":"Appl Math Comput"},{"issue":"3","key":"4896_CR15","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/s11227-008-0242-9","volume":"49","author":"SY Hsieh","year":"2009","unstructured":"Hsieh SY, Wu CD (2009) Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults. J Supercomput 49(3):354\u2013372","journal-title":"J Supercomput"},{"issue":"3","key":"4896_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/71.755822","volume":"10","author":"SY Hsieh","year":"1999","unstructured":"Hsieh SY, Chen GH, Ho CW (1999) Fault-free Hamiltonian cycles in faulty arrangement graphs. IEEE Trans Parallel Distrib Syst 10(3):223\u2013237","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"4896_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s11227-013-1040-6","volume":"68","author":"HZ L\u00fc","year":"2014","unstructured":"L\u00fc HZ, Zhang HP (2014) Hyper-Hamiltonian laceability of balanced hypercubes. J Supercomput 68(1):302\u2013314","journal-title":"J Supercomput"},{"issue":"4","key":"4896_CR18","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1006\/jpdc.2000.1681","volume":"61","author":"DJ Wang","year":"2001","unstructured":"Wang DJ (2001) Embedding hamiltonian cycles into folded hypercubes with faulty links. J Parallel Distrib Comput 61(4):545\u2013564","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"4896_CR19","first-page":"1393","volume":"189","author":"M Xu","year":"2007","unstructured":"Xu M, Hu XD, Xu JM (2007) Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes. Appl Math Comput 189(2):1393\u20131401","journal-title":"Appl Math Comput"},{"key":"4896_CR20","first-page":"193","volume":"24","author":"M Albert","year":"2001","unstructured":"Albert M, Aldred REL, Holton D, Sheehan J (2001) On $$3^{*}$$-connected graphs. Austral J Comb 24:193\u2013208","journal-title":"Austral J Comb"},{"key":"4896_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420044829","volume-title":"Graph Theory and Interconnection Networks","author":"LH Hsu","year":"2008","unstructured":"Hsu LH, Lin CK (2008) Graph Theory and Interconnection Networks. CRC Press, Boca Raton"},{"issue":"6","key":"4896_CR22","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1142\/S0129054113500275","volume":"24","author":"J Li","year":"2013","unstructured":"Li J, Liu D, Yuan J (2013) The super spanning connectivity and super spanning laceability of tori with faulty elements. Int J Found Comput Sci 24(6):921\u2013939","journal-title":"Int J Found Comput Sci"},{"key":"4896_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2016.07.005","volume":"98","author":"YH Teng","year":"2016","unstructured":"Teng YH (2016) The spanning connectivity of the arrangement graphs. J Parallel Distrib Comput 98:1\u20137","journal-title":"J Parallel Distrib Comput"},{"issue":"8","key":"4896_CR24","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1142\/S0129054117500381","volume":"28","author":"PS Li","year":"2017","unstructured":"Li PS, Xu M (2017) The super spanning connectivity of arrangement graphs. Int J Found Comput Sci 28(8):1047\u20131072","journal-title":"Int J Found Comput Sci"},{"key":"4896_CR25","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2017.12.023","volume":"713","author":"LT You","year":"2018","unstructured":"You LT, Fan JX, Han YJ (2018) Super spanning connectivity on WK-recursive networks. Theor Comput Sci 713:42\u201355","journal-title":"Theor Comput Sci"},{"issue":"3","key":"4896_CR26","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.disc.2017.11.005","volume":"341","author":"JJ Wang","year":"2018","unstructured":"Wang JJ, Hsu LH (2018) On the spanning connectivity of the generalized Petersen graphs $$P(n,3)$$. Discrete Math 341(3):672\u2013690","journal-title":"Discrete Math"},{"issue":"9","key":"4896_CR27","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1016\/j.aml.2011.04.013","volume":"24","author":"PY Huang","year":"2011","unstructured":"Huang PY, Hsu LH (2011) The spanning connectivity of line graphs. Appl Math Lett 24(9):1614\u20131617","journal-title":"Appl Math Lett"},{"issue":"2","key":"4896_CR28","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.disc.2006.06.021","volume":"307","author":"CK Lin","year":"2007","unstructured":"Lin CK, Huang HM, Hsu LH (2007) On the spanning connectivity of graphs. Discrete Math 307(2):285\u2013289","journal-title":"Discrete Math"},{"issue":"7","key":"4896_CR29","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1016\/j.disc.2007.03.072","volume":"308","author":"CK Lin","year":"2008","unstructured":"Lin CK, Huang HM, Tan JJM, Hsu LH (2008) On spanning connected graphs. Discrete Math 308(7):1330\u20131333","journal-title":"Discrete Math"},{"issue":"6","key":"4896_CR30","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1007\/s00373-013-1362-4","volume":"30","author":"E Sabir","year":"2014","unstructured":"Sabir E, Vumar E (2014) Spanning connectivity of the power of a graph and Hamilton-connected index of a graph. Graphs Comb 30(6):1551\u20131563","journal-title":"Graphs Comb"},{"key":"4896_CR31","volume":"378","author":"E Sabir","year":"2020","unstructured":"Sabir E, Meng JX (2020) Sufficient conditions for graphs to be spanning connected. Appl Math Comput 378:125198","journal-title":"Appl Math Comput"},{"key":"4896_CR32","volume":"403","author":"E Sabir","year":"2021","unstructured":"Sabir E, Meng JX (2021) Generalizations of the classics to spanning connectedness. Appl Math Comput 403:126167","journal-title":"Appl Math Comput"},{"key":"4896_CR33","first-page":"103","volume":"21","author":"G Simmons","year":"1978","unstructured":"Simmons G (1978) Almost all n-dimensional rectangular lattices are Hamilton laceable. Congr Numer 21:103\u2013108","journal-title":"Congr Numer"},{"issue":"1","key":"4896_CR34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2004.06.006","volume":"92","author":"CK Chang","year":"2004","unstructured":"Chang CK, Lin CK, Huang HM, Hsu LH (2004) The super laceability of the hypercubes. Inf Process Lett 92(1):15\u201321","journal-title":"Inf Process Lett"},{"issue":"1\u20133","key":"4896_CR35","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.tcs.2007.05.002","volume":"381","author":"CK Lin","year":"2007","unstructured":"Lin CK, Tan JJM, Hsu DF, Hsu LH (2007) On the spanning connectivity and spanning laceability of hypercube-like networks. Theor Comput Sci 381(1\u20133):218\u2013229","journal-title":"Theor Comput Sci"},{"issue":"1","key":"4896_CR36","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/s11227-008-0206-0","volume":"48","author":"CH Chang","year":"2009","unstructured":"Chang CH, Lin CK, Tan JJM, Huang HM, Hsu LH (2009) The super spanning connectivity and super spanning laceability of the enhanced hypercubes. J Supercomput 48(1):66\u201387","journal-title":"J Supercomput"},{"issue":"2\u20133","key":"4896_CR37","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2005.02.007","volume":"339","author":"CK Lin","year":"2005","unstructured":"Lin CK, Huang HM, Hsu LH (2005) The super connectivity of the pancake graphs and the super laceabilityof the star graphs. Theor Comput Sci 339(2\u20133):257\u2013271","journal-title":"Theor Comput Sci"},{"key":"4896_CR38","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"BL Cheng","year":"2017","unstructured":"Cheng BL, Wang DJ, Fan JX (2017) Constructing completely independent spanning trees in crossed cubes. Discrete Appl Math 219:100\u2013109","journal-title":"Discrete Appl Math"},{"issue":"7","key":"4896_CR39","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1016\/j.dam.2008.11.014","volume":"157","author":"CK Lin","year":"2009","unstructured":"Lin CK, Tan JJM, Hsu DF, Hsu LH (2009) On the spanning fan-connectivity of graphs. Discrete Appl Math 157(7):1342\u20131348","journal-title":"Discrete Appl Math"},{"issue":"3","key":"4896_CR40","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10586-012-0209-8","volume":"15","author":"S Smys","year":"2012","unstructured":"Smys S, Josemin Bala G (2012) Performance analysis of virtual clusters in personal communication networks. Cluster Comput 15(3):211\u2013222","journal-title":"Cluster Comput"},{"issue":"17","key":"4896_CR41","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.ins.2010.05.015","volume":"180","author":"MJ Ma","year":"2010","unstructured":"Ma MJ (2010) The spanning connectivity of folded hypercubes. Inf Sci 180(17):3373\u20133379","journal-title":"Inf Sci"},{"key":"4896_CR42","first-page":"8095","volume":"219","author":"CK Lin","year":"2013","unstructured":"Lin CK, Teng YH, Tan JJM, Hsu LH, Maru\u0161i\u010d D (2013) The spanning laceability on the faulty bipartite hypercube-like networks. Appl Math Comput 219:8095\u20138103","journal-title":"Appl Math Comput"},{"key":"4896_CR43","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.tcs.2020.05.049","volume":"835","author":"M Xu","year":"2020","unstructured":"Xu M, Naik K, Thulasiraman K (2020) Fault tolerance of hypercube like networks: spanning laceability under edge faults. Theor Comput Sci 835:44\u201357","journal-title":"Theor Comput Sci"},{"key":"4896_CR44","volume-title":"Introduction to Parallel Algorithms and Architecture: Arrays, Trees","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to Parallel Algorithms and Architecture: Arrays, Trees. Morgan Kaufmann, Hypercubes"},{"issue":"6","key":"4896_CR45","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(6):867\u2013872","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"4896_CR46","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","volume":"2","author":"A El-Amawy","year":"1991","unstructured":"El-Amawy A, Latifi S (1991) Properties and performance of folded hypercubes. IEEE Trans Parallel Distrib Syst 2(1):31\u201342","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1\u20133","key":"4896_CR47","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0012-365X(97)80334-2","volume":"174","author":"E Sim\u00f3","year":"1997","unstructured":"Sim\u00f3 E, Yebra JLA (1997) The vulnerability of the diameter of folded n-cubes. Discrete Math 174(1\u20133):317\u2013322","journal-title":"Discrete Math"},{"issue":"3","key":"4896_CR48","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/12.76405","volume":"40","author":"NF Tzeng","year":"1991","unstructured":"Tzeng NF, Wei SZ (1991) Enhanced hypercubes. IEEE Trans Comput 40(3):284\u2013294","journal-title":"IEEE Trans Comput"},{"key":"4896_CR49","doi-asserted-by":"crossref","unstructured":"Liu HM (2009) The structural features of enhanced hypercube networks. ICNC(1):345-348","DOI":"10.1109\/ICNC.2009.191"},{"key":"4896_CR50","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tcs.2017.07.005","volume":"694","author":"MJ Ma","year":"2017","unstructured":"Ma MJ, West DB, Xu JM (2017) The vulnerability of the diameter of the enhanced hypercubes. Theor Comput Sci 694:60\u201365","journal-title":"Theor Comput Sci"},{"issue":"1","key":"4896_CR51","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0252-9602(12)60207-0","volume":"33","author":"M Liu","year":"2013","unstructured":"Liu M, Liu HM (2013) Paths and cycles embedding on faulty enhanced hypercube networks. Acta Math Sci 33(1):227\u2013246","journal-title":"Acta Math Sci"},{"issue":"1","key":"4896_CR52","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0743-7315(91)90113-N","volume":"13","author":"S Abraham","year":"1991","unstructured":"Abraham S, Padmanabhan K (1991) The twisted cube topology for multiprocessors: a study in network asymmetry. J Parallel Distrib Comput 13(1):104\u2013110","journal-title":"J Parallel Distrib Comput"},{"issue":"5","key":"4896_CR53","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe K (1992) The crossed cube architecture for parallel computing. IEEE Trans Parallel Distrib Syst 3(5):513\u2013524","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4896_CR54","doi-asserted-by":"crossref","unstructured":"Vaidya AS, Rao PSN, Shankar SR (1993) A class of hypercube-like networks. The Fifth IEEE Symposium on Parallel and Distributed Processing, pp 800\u2013803","DOI":"10.1109\/SPDP.1993.395450"},{"issue":"1","key":"4896_CR55","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ipl.2004.03.009","volume":"91","author":"JH Park","year":"2004","unstructured":"Park JH, Chwa KY (2004) Hamiltonian properties on the class of hypercube-like networks. Inf Process Lett 91(1):11\u201317","journal-title":"Inf Process Lett"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04896-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04896-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04896-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T19:14:02Z","timestamp":1677784442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04896-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,31]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["4896"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04896-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,10,31]]},"assertion":[{"value":"12 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}