{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:26:37Z","timestamp":1777577197135,"version":"3.51.4"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-024-01381-z","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:41:35Z","timestamp":1732650095000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient hybrid rumor mitigation in dynamic and multilayer online social networks"],"prefix":"10.1007","volume":"14","author":[{"given":"Adil Imad Eddine","family":"Hosni","sequence":"first","affiliation":[]},{"given":"Islam","family":"Baira","sequence":"additional","affiliation":[]},{"given":"Hichame","family":"Merini","sequence":"additional","affiliation":[]},{"given":"Kadda","family":"Beghdad Bey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"1381_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68560-1","volume-title":"Survival and event history analysis: a process point of view","author":"O Aalen","year":"2008","unstructured":"Aalen O, Borgan O, Gjessing H (2008) Survival and event history analysis: a process point of view. Springer, Berlin"},{"key":"1381_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2015.10.036","volume":"331","author":"NM Ahmed","year":"2016","unstructured":"Ahmed NM, Chen L (2016) An efficient algorithm for link prediction in temporal uncertain social networks. Inf Sci 331:120\u2013136","journal-title":"Inf Sci"},{"key":"1381_CR3","doi-asserted-by":"crossref","unstructured":"Allcott H, Gentzkow M (2017) Social media and fake news in the 2016 election (no. w23089). National Bureau of Economic Research. Retrieved March 31, 2017","DOI":"10.3386\/w23089"},{"issue":"5439","key":"1381_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"1381_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2019.05.050","volume":"498","author":"Z Bu","year":"2019","unstructured":"Bu Z, Wang Y, Li H-J, Jiang J, Wu Z, Cao J (2019) Link prediction in temporal networks: integrating survival analysis and game theory. Inf Sci 498:41\u201361","journal-title":"Inf Sci"},{"key":"1381_CR6","doi-asserted-by":"publisher","unstructured":"Budak C, Abbadi AE (2011) Limiting the spread of misinformation in social networks. Distribution 665\u2013674. https:\/\/doi.org\/10.1145\/1963405.1963499","DOI":"10.1145\/1963405.1963499"},{"issue":"9","key":"1381_CR7","first-page":"5103","volume":"44","author":"L Cai","year":"2021","unstructured":"Cai L, Li J, Wang J, Ji S (2021) Line graph neural networks for link prediction. IEEE Trans Pattern Anal Mach Intell 44(9):5103\u20135113","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1381_CR8","doi-asserted-by":"crossref","unstructured":"Cai L, Ji S (2020) A multi-scale approach for graph link prediction. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 3308\u20133315","DOI":"10.1609\/aaai.v34i04.5731"},{"key":"1381_CR9","doi-asserted-by":"crossref","unstructured":"Das S, Das SK (2017) A probabilistic link prediction model in time-varying social networks. In: 2017 IEEE international conference on communications (ICC). IEEE, pp 1\u20136","DOI":"10.1109\/ICC.2017.7996909"},{"issue":"11","key":"1381_CR10","doi-asserted-by":"publisher","first-page":"6779","DOI":"10.1109\/TSMC.2019.2963418","volume":"51","author":"L Ding","year":"2020","unstructured":"Ding L, Hu P, Guan Z-H, Li T (2020) An efficient hybrid control strategy for restraining rumor spreading. IEEE Trans Syst Man Cybern Syst 51(11):6779\u20136791","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1381_CR11","doi-asserted-by":"crossref","unstructured":"Divakaran A, Mohan A (2019) Temporal link prediction: a survey. New Gener Comput 1\u201346","DOI":"10.1007\/s00354-019-00065-z"},{"key":"1381_CR12","doi-asserted-by":"publisher","unstructured":"Fan L, Lu Z, Wu W, Bhavani T, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: IEEE 33rd Int Conf Distrib Comput Syst. https:\/\/doi.org\/10.1109\/ICDCS.2013.34","DOI":"10.1109\/ICDCS.2013.34"},{"key":"1381_CR13","doi-asserted-by":"crossref","unstructured":"Gao F, He Q, Wang X, Qiu L, Huang M (2024) An efficient rumor suppression approach with knowledge graph convolutional network in social network. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2024.3383493"},{"key":"1381_CR14","doi-asserted-by":"crossref","unstructured":"Gao F, Wang X, He Q, Qiu L, Huang M (2023) Multi-feature rumor suppression mechanism based on community division in social networks. IEEE Trans Netw Sci Eng","DOI":"10.1109\/TNSE.2023.3336649"},{"key":"1381_CR15","unstructured":"Gomez-Rodriguez M, Leskovec J (2013) Modeling information propagation with survival theory. In: Proceedings of the 30th international conference on machine learning (ICML-13), pp 666\u2013674. arXiv:1305.3616"},{"key":"1381_CR16","unstructured":"Goyal P, Kamra N, He X, Liu Y (2018) Dyngem: Deep embedding method for dynamic graphs. arXiv preprint arXiv:1805.11273"},{"key":"1381_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.physa.2013.10.003","volume":"394","author":"S Han","year":"2014","unstructured":"Han S, Zhuang F, He Q, Shi Z, Ao X (2014) Energy model for rumor propagation on social networks. Phys A Stat Mech Appl 394:99\u2013109. https:\/\/doi.org\/10.1016\/j.physa.2013.10.003","journal-title":"Phys A Stat Mech Appl"},{"key":"1381_CR18","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Hafiani KA, Chenoui A, Beghdad\u00a0Bey K (2022) Hybrid approach for rumor influence minimization in dynamic multilayer online social networks. In: International conference on computing systems and applications. Springer, pp 275\u2013285","DOI":"10.1007\/978-3-031-12097-8_24"},{"key":"1381_CR19","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Li K (2019) Minimizing the influence of rumors during breaking news events in online social networks. Knowl Based Syst 105452","DOI":"10.1016\/j.knosys.2019.105452"},{"key":"1381_CR20","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Li K, Ahmad S (2019) Analysis of the impact of online social networks addiction on the propagation of rumors. Phys A Stat Mech Appl 123456","DOI":"10.1016\/j.physa.2019.123456"},{"key":"1381_CR21","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Li K, Ahmad S (2019) Darim: dynamic approach for rumor influence minimization in online social networks. In: International conference on neural information processing. Springer, pp 619\u2013630","DOI":"10.1007\/978-3-030-36711-4_52"},{"key":"1381_CR22","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Li K, Ahmed S (2018) Hisbmodel: a rumor diffusion model based on human individual and social behaviors in online social networks. In: International conference on neural information processing. Springer, pp 14\u201327","DOI":"10.1007\/978-3-030-04179-3_2"},{"key":"1381_CR23","doi-asserted-by":"crossref","unstructured":"Hosni AIE, Li K, Ding C, Ahmed S (2018) Least cost rumor influence minimization in multiplex social networks. In: International conference on neural information processing. Springer, pp 93\u2013105","DOI":"10.1007\/978-3-030-04224-0_9"},{"key":"1381_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"},{"key":"1381_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jnca.2018.10.003","volume":"125","author":"V Indu","year":"2019","unstructured":"Indu V, Thampi SM (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28\u201341","journal-title":"J Netw Comput Appl"},{"issue":"17","key":"1381_CR26","doi-asserted-by":"publisher","first-page":"20293","DOI":"10.1007\/s10489-023-04555-y","volume":"53","author":"J Jiang","year":"2023","unstructured":"Jiang J, Chen X, Huang Z, Li X, Du Y (2023) Deep reinforcement learning-based approach for rumor influence minimization in social networks. Appl Intell 53(17):20293\u201320310","journal-title":"Appl Intell"},{"key":"1381_CR27","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. Kdd 137. https:\/\/doi.org\/10.1145\/956755.956769arXiv:0806.2034v2","DOI":"10.1145\/956755.956769"},{"key":"1381_CR28","unstructured":"Kimura M, Saito K, Motoda H (2008) Minimizing the spread of contamination by blocking links in a network. Aaai 1175\u20131180"},{"issue":"1","key":"1381_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10489-016-0883-y","volume":"47","author":"TJ Lakshmi","year":"2017","unstructured":"Lakshmi TJ, Bhavani SD (2017) Temporal probabilistic measure for link prediction in collaborative networks. Appl Intell 47(1):83\u201395","journal-title":"Appl Intell"},{"key":"1381_CR30","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/www.citeulike.org\/group\/19235\/article\/13433079"},{"key":"1381_CR31","doi-asserted-by":"publisher","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","journal-title":"Knowl-Based Syst"},{"key":"1381_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.patcog.2017.06.025","volume":"71","author":"X Ma","year":"2017","unstructured":"Ma X, Sun P, Qin G (2017) Nonnegative matrix factorization algorithms for link prediction in temporal networks using graph communicability. Pattern Recogn 71:361\u2013374","journal-title":"Pattern Recogn"},{"key":"1381_CR33","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.physa.2017.12.092","volume":"496","author":"X Ma","year":"2018","unstructured":"Ma X, Sun P, Wang Y (2018) Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks. Phys A 496:121\u2013136","journal-title":"Phys A"},{"key":"1381_CR34","doi-asserted-by":"crossref","unstructured":"Magnani M, Rossi L (2011) The ml-model for multi-layer social networks, pp 5\u201312","DOI":"10.1109\/ASONAM.2011.114"},{"issue":"6","key":"1381_CR35","doi-asserted-by":"publisher","first-page":"6401","DOI":"10.1007\/s10489-022-03798-5","volume":"53","author":"P Ni","year":"2023","unstructured":"Ni P, Zhu J, Wang G (2023) Misinformation influence minimization by entity protection on multi-social networks. Appl Intell 53(6):6401\u20136420","journal-title":"Appl Intell"},{"issue":"4","key":"1381_CR36","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/JSTSP.2014.2328312","volume":"8","author":"B Oselio","year":"2014","unstructured":"Oselio B, Kulesza A, Hero AO (2014) Multi-layer graph analysis for dynamic social networks. IEEE J Sel Top Signal Process 8(4):514\u2013523","journal-title":"IEEE J Sel Top Signal Process"},{"key":"1381_CR37","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1007\/s13042-020-01233-0","volume":"12","author":"S Srinivasan","year":"2021","unstructured":"Srinivasan S, Dhinesh Babu LD (2021) A social immunity based approach to suppress rumors in online social networks. Int J Mach Learn Cybern 12:1281\u20131296","journal-title":"Int J Mach Learn Cybern"},{"key":"1381_CR38","unstructured":"Tong A, Du D-Z, Wu W (2018) On misinformation containment in online social networks. In: Advances in neural information processing systems, pp 341\u2013351"},{"key":"1381_CR39","doi-asserted-by":"crossref","unstructured":"Tong G, Wu W, Guo L, Li (2017) An efficient randomized algorithm for rumor blocking in online social networks arXiv:1701.02368","DOI":"10.1109\/INFOCOM.2017.8056957"},{"issue":"3","key":"1381_CR40","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s41060-021-00293-x","volume":"13","author":"R Tripathi","year":"2022","unstructured":"Tripathi R, Rao S (2022) Rumor containment in peer-to-peer message sharing online social networks. Int J Data Sci Anal 13(3):185\u2013198","journal-title":"Int J Data Sci Anal"},{"issue":"6380","key":"1381_CR41","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1126\/science.aap9559","volume":"359","author":"S Vosoughi","year":"2018","unstructured":"Vosoughi S, Roy D, Aral S (2018) The spread of true and false news online. Science 359(6380):1146\u20131151","journal-title":"Science"},{"issue":"1","key":"1381_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5237-y","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B, Wu Y, Zhou X (2015) Link prediction in social networks: the state-of-the-art. Sci China Inf Sci 58(1):1\u201338","journal-title":"Sci China Inf Sci"},{"issue":"10","key":"1381_CR43","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/TKDE.2017.2728064","volume":"29","author":"B Wang","year":"2017","unstructured":"Wang B, Chen G, Fu L, Song L, Wang X (2017) Drimux: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng 29(10):2168\u20132181","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1381_CR44","doi-asserted-by":"crossref","unstructured":"Wang B, Chen G, Fu L, Song L, Wang X, Liu X (2016) DRIMUX : dynamic rumor influence minimization with user experience in social networks. In: Proc. 30th AAAI Conf. Artif. Intell., pp 791\u2013797","DOI":"10.1609\/aaai.v30i1.10063"},{"issue":"6684","key":"1381_CR45","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440","journal-title":"Nature"},{"issue":"2","key":"1381_CR46","first-page":"16","volume":"13","author":"R Yan","year":"2019","unstructured":"Yan R, Li Y, Wu W, Li D, Wang Y (2019) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discovery Data (TKDD) 13(2):16","journal-title":"ACM Trans Knowl Discovery Data (TKDD)"},{"key":"1381_CR47","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","journal-title":"Inf Sci"},{"issue":"7","key":"1381_CR48","doi-asserted-by":"publisher","first-page":"3990","DOI":"10.1109\/TSMC.2023.3237933","volume":"53","author":"L Yang","year":"2023","unstructured":"Yang L, Ma Z, Li Z, Giua A (2023) Rumor containment by blocking nodes in social networks. IEEE Trans Syst Man Cybern Syst 53(7):3990\u20134002","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1381_CR49","doi-asserted-by":"publisher","unstructured":"Yao Q, Shi R, Zhou C, Wang P, Guo L (2015) Topic-aware Social Influence Minimization. In: Proc. 24th Int. Conf. World Wide Web\u2014WWW\u201915 Companion (1), pp 139\u2013140. https:\/\/doi.org\/10.1145\/2740908.2742767","DOI":"10.1145\/2740908.2742767"},{"key":"1381_CR50","doi-asserted-by":"crossref","unstructured":"Yu W, Cheng W, Aggarwal CC, Chen H, Wang W (2017) Link prediction with spatial and temporal consistency in dynamic networks. In: IJCAI international joint conference on artificial intelligence, pp 3343\u20133349","DOI":"10.24963\/ijcai.2017\/467"},{"key":"1381_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103094","volume":"186","author":"A Zareie","year":"2021","unstructured":"Zareie A, Sakellariou R (2021) Minimizing the spread of misinformation in online social networks: a survey. J Netw Comput Appl 186:103094","journal-title":"J Netw Comput Appl"},{"key":"1381_CR52","doi-asserted-by":"crossref","unstructured":"Zhang M, Chen Y (2017) Weisfeiler-lehman neural machine for link prediction. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 575\u2013583","DOI":"10.1145\/3097983.3097996"},{"key":"1381_CR53","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.physa.2018.09.015","volume":"513","author":"H Zhu","year":"2019","unstructured":"Zhu H, Ma J (2019) Analysis of Shir rumor propagation in random heterogeneous networks with dynamic friendships. Phys A 513:257\u2013271","journal-title":"Phys A"},{"issue":"22","key":"1381_CR54","doi-asserted-by":"publisher","first-page":"5769","DOI":"10.1016\/j.physa.2012.06.003","volume":"391","author":"Y-X Zhu","year":"2012","unstructured":"Zhu Y-X, L\u00fc L, Zhang Q-M, Zhou T (2012) Uncovering missing links with cold ends. Phys A 391(22):5769\u20135778","journal-title":"Phys A"},{"issue":"10","key":"1381_CR55","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TKDE.2016.2591009","volume":"28","author":"L Zhu","year":"2016","unstructured":"Zhu L, Guo D, Yin J, Steeg GV, Galstyan A (2016) Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans Knowl Data Eng 28(10):2765\u20132777. https:\/\/doi.org\/10.1109\/TKDE.2016.2591009","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1381_CR56","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11280-020-00841-8","volume":"24","author":"J Zhu","year":"2021","unstructured":"Zhu J, Ghosh S, Wu W (2021) Robust rumor blocking problem with uncertain rumor sources in social networks. World Wide Web 24:229\u2013247","journal-title":"World Wide Web"},{"key":"1381_CR57","doi-asserted-by":"crossref","unstructured":"Zhuang H, Sun Y, Tang J, Zhang J, Sun X (2013) Influence maximization in dynamic social networks. In: 2013 IEEE 13th international conference on data mining, pp 1313\u20131318. IEEE","DOI":"10.1109\/ICDM.2013.145"},{"key":"1381_CR58","doi-asserted-by":"crossref","unstructured":"Zi H, Wu S, Wu K (2023) Hybrid control strategy for rumor spread in social networks. In: International artificial intelligence conference. Springer, pp 198\u2013210","DOI":"10.1007\/978-981-97-1332-5_16"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01381-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01381-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01381-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T14:34:11Z","timestamp":1740494051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01381-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1381"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01381-z","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"31 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest or conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"224"}}