{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:21:44Z","timestamp":1768749704103,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72074203"],"award-info":[{"award-number":["72074203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10489-022-03798-5","type":"journal-article","created":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T06:03:39Z","timestamp":1657260219000},"page":"6401-6420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Misinformation influence minimization by entity protection on multi-social networks"],"prefix":"10.1007","volume":"53","author":[{"given":"Peikun","family":"Ni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"3798_CR1","unstructured":"N PM (2018) Rumors of child-kidnapping gangs and other WhatsApp hoaxes are getting people killed in India. Available from: https:\/\/www.latimes.com\/world\/asia\/la-fg-india-whatsapp-2018-story.html"},{"key":"3798_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.physa.2018.04.082","volume":"506","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Su Y, Weigang L, Liu H (2018) Rumor and authoritative information propagation model considering super spreading in complex social networks. Phys A: Stat Mech Appl 506:395\u2013411","journal-title":"Phys A: Stat Mech Appl"},{"key":"3798_CR3","doi-asserted-by":"publisher","first-page":"105452","DOI":"10.1016\/j.knosys.2019.105452","volume":"193","author":"AIE Hosni","year":"2020","unstructured":"Hosni AIE, Li K (2020) Minimizing the influence of rumors during breaking news events in online social networks. Knowl Based Syst 193:105452. https:\/\/doi.org\/10.1016\/j.knosys.2019.105452","journal-title":"Knowl Based Syst"},{"key":"3798_CR4","doi-asserted-by":"publisher","first-page":"120867","DOI":"10.1016\/j.physa.2019.04.103","volume":"526","author":"J Zhao","year":"2019","unstructured":"Zhao J, Yang LX, Zhong X, Yang X, Wu Y, Tang YY (2019) Minimizing the impact of a rumor via isolation and conversion. Phys A: Stat Mech Appl 526:120867. https:\/\/doi.org\/10.1016\/j.physa.2019.04.103","journal-title":"Phys A: Stat Mech Appl"},{"key":"3798_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2019.05.044","volume":"803","author":"Q Fang","year":"2020","unstructured":"Fang Q, Chen X, Nong Q, Zhang Z, Cao Y, Feng Y et al (2020) General rumor blocking: an efficient random algorithm with martingale approach. Theor Comput Sci 803:82\u201393. https:\/\/doi.org\/10.1016\/j.tcs.2019.05.044","journal-title":"Theor Comput Sci"},{"key":"3798_CR6","doi-asserted-by":"publisher","first-page":"107233","DOI":"10.1016\/j.knosys.2021.107233","volume":"227","author":"W Li","year":"2021","unstructured":"Li W, Bai Q, Liang L, Yang Y, Hu Y, Zhang M (2021) Social influence minimization based on context-aware multiple influences diffusion model. Knowl Based Syst 227:107233. https:\/\/doi.org\/10.1016\/j.knosys.2021.107233","journal-title":"Knowl Based Syst"},{"key":"3798_CR7","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.physa.2018.02.128","volume":"503","author":"D Yang","year":"2018","unstructured":"Yang D, Liao X, Shen H, Cheng X, Chen G (2018) Dynamic node immunization for restraint of harmful information diffusion in social networks. Phys A: Stat Mech Appl 503:640\u2013649. https:\/\/doi.org\/10.1016\/j.physa.2018.02.128","journal-title":"Phys A: Stat Mech Appl"},{"key":"3798_CR8","doi-asserted-by":"publisher","first-page":"107451","DOI":"10.1016\/j.knosys.2021.107451","volume":"231","author":"W Ju","year":"2021","unstructured":"Ju W, Chen L, Li B, Chen Y, Sun X (2021) Node deletion-based algorithm for blocking maximizing on negative influence from uncertain sources. Knowl Based Syst 231:107451. https:\/\/doi.org\/10.1016\/j.knosys.2021.107451","journal-title":"Knowl Based Syst"},{"key":"3798_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350. https:\/\/doi.org\/10.1016\/j.comnet.2017.05.004","journal-title":"Comput Netw"},{"key":"3798_CR10","unstructured":"Ni P, ZHu J, Wang G (2020) Disinformation diffusion activity minimization by edge blocking in online social networks. Chinese journal of management science (10):1\u201310"},{"issue":"11","key":"3798_CR11","doi-asserted-by":"publisher","first-page":"6779","DOI":"10.1109\/TSMC.2019.2963418","volume":"51","author":"L Ding","year":"2021","unstructured":"Ding L, Hu P, Guan ZH, Li T (2021) An efficient hybrid control strategy for restraining rumor spreading. IEEE Trans Syst Man Cybern Syst 51(11):6779\u20136791. https:\/\/doi.org\/10.1109\/TSMC.2019.2963418","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"5","key":"3798_CR12","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1007\/s11280-017-0500-y","volume":"21","author":"G Korkmaz","year":"2018","unstructured":"Korkmaz G, Kuhlman CJ, Ravi SS, Vega-Redondo F (2018) Spreading of social contagions without key players. World Wide Web 21(5):1187\u20131221. https:\/\/doi.org\/10.1007\/s11280-017-0500-y","journal-title":"World Wide Web"},{"key":"3798_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ins.2019.07.055","volume":"506","author":"L Yang","year":"2020","unstructured":"Yang L, Li Z, Giua A (2020) Containment of rumor spread in complex social networks. Inf Sci 506:113\u2013130. https:\/\/doi.org\/10.1016\/j.ins.2019.07.055","journal-title":"Inf Sci"},{"key":"3798_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201901. New York, NY, USA: Association for Computing Machinery. pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"3798_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201903. New York, NY, USA: Association for Computing Machinery. pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3798_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.osnem.2017.07.001","volume":"2","author":"I Litou","year":"2017","unstructured":"Litou I, Kalogeraki V, Katakis I, Gunopulos D (2017) Efficient and timely misinformation blocking under varying cost constraints. Online Social Networks and Media 2:19\u201331. https:\/\/doi.org\/10.1016\/j.osnem.2017.07.001","journal-title":"Online Social Networks and Media"},{"issue":"2","key":"3798_CR17","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10489-019-01506-4","volume":"50","author":"W Liu","year":"2020","unstructured":"Liu W, Chen L, Chen X, Chen B (2020) An algorithm for influence maximization in competitive social networks with unwanted users. Appl Intell 50(2):417\u2013437. https:\/\/doi.org\/10.1007\/s10489-019-01506-4","journal-title":"Appl Intell"},{"issue":"4","key":"3798_CR18","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s10878-019-00439-5","volume":"38","author":"CV Pham","year":"2019","unstructured":"Pham CV, Phu QV, Hoang HX, Pei J, Thai MT (2019) Minimum budget for misinformation blocking in online social networks. J Comb Optim 38(4):1101\u20131127. https:\/\/doi.org\/10.1007\/s10878-019-00439-5","journal-title":"J Comb Optim"},{"issue":"22","key":"3798_CR19","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1007\/s11280-018-0623-9","volume":"07","author":"P Zhang","year":"2019","unstructured":"Zhang P, Bao Z, Niu Y, Zhang Y, Mo S, Geng F et al (2019) Proactive rumor control in online networks. World Wide Web 07(22):1799\u20131818","journal-title":"World Wide Web"},{"key":"3798_CR20","doi-asserted-by":"publisher","unstructured":"Yan R, Li Y, Wu W, Li D, Wang Y (2019) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data 13(2). https:\/\/doi.org\/10.1145\/3301302","DOI":"10.1145\/3301302"},{"key":"3798_CR21","doi-asserted-by":"crossref","unstructured":"Ghoshal AK, Das N, Das S (2019) Misinformation containment in OSNs leveraging community structure. In: 2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST). pp 1\u20136","DOI":"10.1109\/ICAwST.2019.8923277"},{"key":"3798_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s10586-017-1390-6","volume":"05","author":"J Lv","year":"2019","unstructured":"Lv J, Yang B, Yang Z, Zhang W (2019) A community-based algorithm for influence blocking maximization in social networks. Cluster Computing 05:22. https:\/\/doi.org\/10.1007\/s10586-017-1390-6","journal-title":"Cluster Computing"},{"key":"3798_CR23","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.physa.2018.08.096","volume":"503","author":"D Yang","year":"2018","unstructured":"Yang D, Chow TWS, Zhong L, Zhang Q (2018) The competitive information spreading over multiplex social networks. Phys A: Stat Mech Appl 503:981\u2013990","journal-title":"Phys A: Stat Mech Appl"},{"key":"3798_CR24","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1016\/j.ins.2019.10.063","volume":"512","author":"AIE Hosni","year":"2020","unstructured":"Hosni AIE, Li K, Ahmad S (2020) Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors. Inf Sci 512:1458\u20131480","journal-title":"Inf Sci"},{"issue":"3","key":"3798_CR25","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TCSS.2021.3059430","volume":"8","author":"MA Manouchehri","year":"2021","unstructured":"Manouchehri MA, Helfroush MS, Danyali H (2021) A theoretically guaranteed approach to efficiently block the influence of misinformation in social networks. IEEE Trans Comput Soc Syst 8(3):716\u2013727. https:\/\/doi.org\/10.1109\/TCSS.2021.3059430","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"3798_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2021.04.086","volume":"572","author":"J Zhu","year":"2021","unstructured":"Zhu J, Ni P, Wang G, Li Y (2021) Misinformation influence minimization problem based on group disbanded in social networks. Inf Sci 572:1\u201315","journal-title":"Inf Sci"},{"issue":"3","key":"3798_CR27","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/TNSE.2019.2903272","volume":"7","author":"R Yan","year":"2020","unstructured":"Yan R, Li D, Wu W, Du DZ (2020) Minimizing influence of rumors by blockers on social networks: algorithms and analysis. IEEE Trans Netw Sci Eng 7(3):1067\u20131078","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"11","key":"3798_CR28","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang Z, Yang Y, Pei J, Chu L, Chen E (2017) Activity maximization by effective information diffusion in social networks. IEEE Trans Knowl Data Eng 29(11):2374\u20132387. https:\/\/doi.org\/10.1109\/TKDE.2017.2740284","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"3798_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.3233\/IDA-150801","volume":"20","author":"M Hosseini-Pozveh","year":"2016","unstructured":"Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR, Dolog P (2016) Maximizing the spread of positive influence in signed social networks. Intell Data Anal 20(1):199\u2013218","journal-title":"Intell Data Anal"},{"key":"3798_CR30","doi-asserted-by":"publisher","first-page":"106693","DOI":"10.1016\/j.knosys.2020.106693","volume":"213","author":"AK Ghoshal","year":"2021","unstructured":"Ghoshal AK, Das N, Das S (2021) Influence of community structure on misinformation containment in online social networks. Knowl Based Syst 213:106693","journal-title":"Knowl Based Syst"},{"key":"3798_CR31","doi-asserted-by":"crossref","unstructured":"Tripathy RM, Bagchi A, Mehta S (2010) A study of Rumor Control Strategies on Social Networks. New York, USA: Association for Computing Machinery","DOI":"10.1145\/1871437.1871737"},{"issue":"5","key":"3798_CR32","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1509\/jmkr.48.5.869","volume":"48","author":"J Berger","year":"2011","unstructured":"Berger J, Schwartz EM (2011) What drives immediate and ongoing word of mouth? J Mark Res 48(5):869\u2013880. https:\/\/doi.org\/10.1509\/jmkr.48.5.869","journal-title":"J Mark Res"},{"key":"3798_CR33","unstructured":"Berger J (2013) Contagious: why things catch on. Simon and schuster"},{"key":"3798_CR34","doi-asserted-by":"publisher","first-page":"041908","DOI":"10.1103\/PhysRevE.65.041908","volume":"65","author":"DH Zanette","year":"2002","unstructured":"Zanette DH (2002) Dynamics of rumor propagation on small-world networks. Phys Rev E 65:041908. https:\/\/doi.org\/10.1103\/PhysRevE.65.041908","journal-title":"Phys Rev E"},{"key":"3798_CR35","first-page":"13","volume":"7","author":"SP Vishnupad","year":"1999","unstructured":"Vishnupad SP, Shin YC (1999) Adaptive tuning of fuzzy membership functions for non-linear optimization using gradient descent method. J Intell Fuzzy Syst 7:13\u201325","journal-title":"J Intell Fuzzy Syst"},{"issue":"5","key":"3798_CR36","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum P, Karp R, Luby M, Ross S (2000) An optimal algorithm for monte carlo estimation. SIAM J Comput 29(5):1484\u20131496","journal-title":"SIAM J Comput"},{"issue":"3","key":"3798_CR37","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti M, Cornu\u00e9jols G (1984) Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discret Appl Math 7(3):251\u2013274","journal-title":"Discret Appl Math"},{"issue":"23","key":"3798_CR38","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"04","author":"G Cornu\u00e9jols","year":"1977","unstructured":"Cornu\u00e9jols G, Fisher M, Nemhauser G (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag Sci 04(23):789\u2013810","journal-title":"Manag Sci"},{"key":"3798_CR39","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. KDD \u201905. New York, NY, USA: Association for Computing Machinery. pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"2","key":"3798_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/3068777.3068781","volume":"18","author":"K Shu","year":"2017","unstructured":"Shu K, Wang S, Tang J, Zafarani R, Liu H (2017) User identity linkage across online social networks: a review. SIGKDD Explor Newsl 18(2):5\u201317. https:\/\/doi.org\/10.1145\/3068777.3068781","journal-title":"SIGKDD Explor Newsl"},{"key":"3798_CR41","doi-asserted-by":"publisher","first-page":"47114","DOI":"10.1109\/ACCESS.2019.2909089","volume":"7","author":"K Deng","year":"2019","unstructured":"Deng K, Xing L, Zheng L, Wu H, Xie P, Gao F (2019) A user identification algorithm based on user behavior analysis in social networks. IEEE Access 7:47114\u201347123. https:\/\/doi.org\/10.1109\/ACCESS.2019.2909089","journal-title":"IEEE Access"},{"issue":"6","key":"3798_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-8235-9","volume":"14","author":"I Nurgaliev","year":"2020","unstructured":"Nurgaliev I, Qu Q, Bamakan SMH, Muzammal M (2020) Matching user identities across social networks with limited profile data. Front Comput Sci 14(6):1\u201314","journal-title":"Front Comput Sci"},{"key":"3798_CR43","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI\u201915. AAAI Press. pp 4292\u20134293","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"3798_CR44","unstructured":"Tang L, Wang X, Liu H (2009) Uncovering groups via heterogeneous interaction analysis. In: ICDM 2009 - The 9th IEEE International Conference on Data Mining. Proceedings - IEEE International Conference on Data Mining, ICDM; 2009. p. 503\u2013512. 9th IEEE International Conference on Data Mining, ICDM 2009 ; Conference date: 06-12-2009 Through 09-12-2009"},{"key":"3798_CR45","doi-asserted-by":"crossref","unstructured":"De Domenico M, Lima A, Mougel P, Musolesi M (2013) The anatomy of a scientific rumor. Scientific reports. vol 3(1)","DOI":"10.1038\/srep02980"},{"issue":"4","key":"3798_CR46","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"issue":"2","key":"3798_CR47","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30(2):136\u2013145","journal-title":"Soc Netw"},{"key":"3798_CR48","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Stanford infolab. pp 1999\u201366"},{"issue":"1","key":"3798_CR49","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.physa.2004.04.031","volume":"340","author":"P Crucitti","year":"2004","unstructured":"Crucitti P, Latora V, Marchiori M, Rapisarda A (2004) Error and attack tolerance of complex networks. Phys A: Stat Mech Appl 340(1):388\u2013394","journal-title":"Phys A: Stat Mech Appl"},{"key":"3798_CR50","first-page":"219","volume-title":"In: Reducibility among combinatorial problems","author":"RM Karp","year":"2010","unstructured":"Karp RM (2010) In: Reducibility among combinatorial problems. Springer, Berlin, pp 219\u2013241"},{"key":"3798_CR51","first-page":"1","volume":"06","author":"J Zhu","year":"2020","unstructured":"Zhu J, Ni P, Wang G (2020) Activity minimization of misinformation influence in online social networks. IEEE Trans Comput Soc Syst 06:1\u201310","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"1","key":"3798_CR52","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0166-218X(00)00366-8","volume":"114","author":"VP Il\u2019ev","year":"2001","unstructured":"Il\u2019ev VP (2001) An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function. Discret Appl Math 114(1):131\u2013146","journal-title":"Discret Appl Math"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03798-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03798-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03798-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T04:30:14Z","timestamp":1677472214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03798-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["3798"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03798-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"21 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that they are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}