{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:43:36Z","timestamp":1769514216540,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s40747-024-01604-y","type":"journal-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T10:02:12Z","timestamp":1724839332000},"page":"8383-8401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph convolutional networks with the self-attention mechanism for adaptive influence maximization in social networks"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6822-0590","authenticated-orcid":false,"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[]},{"given":"Shihui","family":"Song","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Du","sequence":"additional","affiliation":[]},{"given":"Yabing","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Jitao","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"1604_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-020-00719-7","volume":"11","author":"P Kumar","year":"2021","unstructured":"Kumar P, Sinha A (2021) Information diffusion modeling and analysis for socially interacting networks. Theoret Comput Sci 11:1\u201318. https:\/\/doi.org\/10.1007\/s13278-020-00719-7","journal-title":"Theoret Comput Sci"},{"key":"1604_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ins.2020.07.046","volume":"543","author":"Y Huo","year":"2021","unstructured":"Huo Y, Chen B, Tang J et al (2021) Privacy-preserving point-of-interest recommendation based on geographical and social influence. Inf Sci 543:202\u2013218. https:\/\/doi.org\/10.1016\/j.ins.2020.07.046","journal-title":"Inf Sci"},{"key":"1604_CR3","doi-asserted-by":"publisher","first-page":"4774","DOI":"10.1007\/s10489-020-02036-0","volume":"51","author":"S Lotfi","year":"2021","unstructured":"Lotfi S, Mirzarezaee M, Hosseinzadeh M et al (2021) Detection of rumor conversations in twitter using graph convolutional networks. Appl Intell 51:4774\u20134787. https:\/\/doi.org\/10.1007\/s10489-020-02036-0","journal-title":"Appl Intell"},{"key":"1604_CR4","doi-asserted-by":"publisher","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","volume":"34","author":"SS Singh","year":"2022","unstructured":"Singh SS, Srivastva D, Verma M et al (2022) Influence maximization frameworks, performance, challenges and directions on social network: a theoretical study. J King Saud Univ-Comput Inform Sci 34:7570\u20137603. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.009","journal-title":"J King Saud Univ-Comput Inform Sci"},{"key":"1604_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/mnsc.1070.0810","volume":"54","author":"Y Chen","year":"2008","unstructured":"Chen Y, Xie J (2008) Online consumer review: Word-of-mouth as a new element of marketing communication mix. Manag Sci 54:477\u2013491. https:\/\/doi.org\/10.1287\/mnsc.1070.0810","journal-title":"Manag Sci"},{"key":"1604_CR6","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (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, Washington, USA, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1604_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2021.02.014","volume":"861","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Yang W, Du D (2021) Rumor correction maximization problem in social networks. Perform Eval 861:102\u2013116. https:\/\/doi.org\/10.1016\/j.tcs.2021.02.014","journal-title":"Perform Eval"},{"key":"1604_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-015-0030-5","volume":"5","author":"Y Chen","year":"2015","unstructured":"Chen Y, Xie J (2015) A novel method for expert finding in online communities based on concept map and pagerank. Manag Sci 5:1\u201318. https:\/\/doi.org\/10.1186\/s13673-015-0030-5","journal-title":"Manag Sci"},{"key":"1604_CR9","doi-asserted-by":"crossref","unstructured":"Baabcha H, Laifa M, Akhrouf S (2022) Social influence analysis in online social networks for viral marketing: a survey. In: International Conference on managing business through web analytics, Cham, Switzerland, pp 143\u2013166","DOI":"10.1007\/978-3-031-06971-0_11"},{"key":"1604_CR10","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TNET.2021.3105427","volume":"30","author":"Z Shi","year":"2021","unstructured":"Shi Z, Yang G, Gong X et al (2021) Quality-aware incentive mechanisms under social influences in data crowdsourcing. IEEE\/ACM Trans Netw 30:176\u2013189. https:\/\/doi.org\/10.1109\/TNET.2021.3105427","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1604_CR11","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar D (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62:3417\u20133455. https:\/\/doi.org\/10.1007\/s10115-020-01461-4","journal-title":"Knowl Inf Syst"},{"key":"1604_CR12","doi-asserted-by":"publisher","first-page":"112905","DOI":"10.1016\/j.eswa.2019.112905","volume":"140","author":"M Keikha","year":"2020","unstructured":"Keikha M, Rahgozar M, Asadpour M et al (2020) Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Syst Appl 140:112905. https:\/\/doi.org\/10.1016\/j.eswa.2019.112905","journal-title":"Expert Syst Appl"},{"key":"1604_CR13","doi-asserted-by":"publisher","first-page":"105893","DOI":"10.1016\/j.knosys.2020.105893","volume":"198","author":"E Yu","year":"2020","unstructured":"Yu E, Wang Y, Fu Y et al (2020) Identifying critical nodes in complex networks via graph convolutional networks. Knowl-Based Syst 198:105893. https:\/\/doi.org\/10.1016\/j.knosys.2020.105893","journal-title":"Knowl-Based Syst"},{"key":"1604_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCSS.2022.3193583","volume":"10","author":"C Zhang","year":"2022","unstructured":"Zhang C, Li W, Wei D et al (2022) Network dynamic gcn influence maximization algorithm with leader fake labeling mechanism. IEEE Trans Comput Soc Syst 10:1\u20139. https:\/\/doi.org\/10.1109\/TCSS.2022.3193583","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1604_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3535101","volume":"55","author":"S Wu","year":"2022","unstructured":"Wu S, Sun F, Zhang W et al (2022) Graph neural networks in recommender systems: a survey. ACM Comput Surv 55:1\u201337. https:\/\/doi.org\/10.1145\/3535101","journal-title":"ACM Comput Surv"},{"key":"1604_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","volume":"414","author":"G Zhao","year":"2020","unstructured":"Zhao G, Jia P, Zhou A et al (2020) Infgcn: identifying influential nodes in complex networks with graph convolutional networks. Neurocomputing 414:18\u201326. https:\/\/doi.org\/10.1016\/j.neucom.2020.07.028","journal-title":"Neurocomputing"},{"key":"1604_CR17","doi-asserted-by":"publisher","first-page":"120748","DOI":"10.1016\/j.eswa.2023.120748","volume":"231","author":"H Liu","year":"2023","unstructured":"Liu H, Wei J, Xu T (2023) Community detection based on community perspective and graph convolutional network. Expert Syst Appl 231:120748. https:\/\/doi.org\/10.1016\/j.eswa.2023.120748","journal-title":"Expert Syst Appl"},{"key":"1604_CR18","doi-asserted-by":"publisher","first-page":"114157","DOI":"10.1016\/j.eswa.2023.120748","volume":"176","author":"X Li","year":"2023","unstructured":"Li X, Zhen X, Qi X et al (2023) Dynamic community detection based on graph convolutional networks and contrastive learning. Chaos Solitons Fractals 176:114157. https:\/\/doi.org\/10.1016\/j.eswa.2023.120748","journal-title":"Chaos Solitons Fractals"},{"key":"1604_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10.1109\/TCSS.2022.3188701","volume":"10","author":"Q He","year":"2022","unstructured":"He Q, Zhang D, Wang X et al (2022) Graph convolutional network-based rumor blocking on social networks. IEEE Trans Comput Soc Syst 10:1\u201310. https:\/\/doi.org\/10.1007\/10.1109\/TCSS.2022.3188701","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1604_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3604559","volume":"17","author":"Y Li","year":"2023","unstructured":"Li Y, Gao H, Gao Y et al (2023) A survey on influence maximization: from an ml-based combinatorial optimization. ACM Trans Knowl Discov Data 17:1\u201350. https:\/\/doi.org\/10.1145\/3604559","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1604_CR21","doi-asserted-by":"publisher","first-page":"100393","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40:100393. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100393","journal-title":"Comput Sci Rev"},{"key":"1604_CR22","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1007\/s00607-021-00945-7","volume":"103","author":"Z Aghaee","year":"2021","unstructured":"Aghaee Z, Ghasemi MM, Beni HA et al (2021) A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103:2437\u20132477. https:\/\/doi.org\/10.1007\/s00607-021-00945-7","journal-title":"Computing"},{"key":"1604_CR23","unstructured":"Mikolov T, Chen K, Corrado G, et\u00a0al (2013) Efficient estimation of word representations in vector space. Preprint at arXiv:1301.3781"},{"key":"1604_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.028","volume":"148","author":"MM Keikha","year":"2018","unstructured":"Keikha MM, Rahgozar M, Asadpour M (2018) Community aware random walk for network embedding. Knowl-Based Syst 148:47\u201354. https:\/\/doi.org\/10.1016\/j.knosys.2018.02.028","journal-title":"Knowl-Based Syst"},{"key":"1604_CR25","doi-asserted-by":"crossref","unstructured":"Ribeiro L, Saverese P, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD International Conference on knowledge discovery and data mining, Halifax, Canada, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"1604_CR26","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","volume":"607","author":"S Kumar","year":"2022","unstructured":"Kumar S, Mallik A, Khetarpal A et al (2022) Influence maximization in social networks using graph embedding and graph neural network. Inf Sci 607:1617\u20131636. https:\/\/doi.org\/10.1016\/j.ins.2022.06.075","journal-title":"Inf Sci"},{"key":"1604_CR27","doi-asserted-by":"publisher","first-page":"118770","DOI":"10.1016\/j.eswa.2022.118770","volume":"212","author":"S Kumar","year":"2023","unstructured":"Kumar S, Mallik A, Panda B (2023) Influence maximization in social networks using transfer learning via graph-based lstm. Expert Syst Appl 212:118770. https:\/\/doi.org\/10.1016\/j.eswa.2022.118770","journal-title":"Expert Syst Appl"},{"key":"1604_CR28","doi-asserted-by":"publisher","first-page":"119086","DOI":"10.1016\/j.eswa.2022.119086","volume":"214","author":"AA Rezaei","year":"2023","unstructured":"Rezaei AA, Munoz J, Jalili M et al (2023) A machine learning-based approach for vital node identification in complex networks. Expert Syst Appl 214:119086. https:\/\/doi.org\/10.1016\/j.eswa.2022.119086","journal-title":"Expert Syst Appl"},{"key":"1604_CR29","unstructured":"Ling C, Jiang J, Wang J, et\u00a0al (2023) Deep graph representation learning and optimization for influence maximization. In: Proceedings of the 40th International Conference on machine learning, Hawaii, USA, pp 21350\u201321361"},{"key":"1604_CR30","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1613\/jair.3278","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin D, Krause A (2011) Adaptive submodularity: theory and applications in active learning and stochastic optimization. J Artif Intell Res 42:427\u2013486. https:\/\/doi.org\/10.1613\/jair.3278","journal-title":"J Artif Intell Res"},{"key":"1604_CR31","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.14778\/3213880.3213883","volume":"11","author":"K Han","year":"2018","unstructured":"Han K, Huang K, Xiao X et al (2018) Efficient algorithms for adaptive influence maximization. Proc VLDB Endow 11:1029\u20131040. https:\/\/doi.org\/10.14778\/3213880.3213883","journal-title":"Proc VLDB Endow"},{"key":"1604_CR32","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, et\u00a0al (2014) Maximizing social influence in nearly optimal time. In: Chekuri C (ed) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"1604_CR33","doi-asserted-by":"crossref","unstructured":"Sun L, Huang W, Yu P, et\u00a0al (2018) Multi-round influence maximization. Proceedings of the 24th ACM SIGKDD International Conference on knowledge discovery and data mining, London, United Kingdom, pp 2249\u20132258","DOI":"10.1145\/3219819.3220101"},{"key":"1604_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447396","volume":"15","author":"J Guo","year":"2021","unstructured":"Guo J, Wu W (2021) Adaptive influence maximization: if influential node unwilling to be the seed. ACM Trans Knowle Discov Data (TKDD) 15:1\u201323. https:\/\/doi.org\/10.1145\/3447396","journal-title":"ACM Trans Knowle Discov Data (TKDD)"},{"key":"1604_CR35","doi-asserted-by":"publisher","first-page":"106692","DOI":"10.1016\/j.knosys.2020.106692","volume":"213","author":"C Wang","year":"2021","unstructured":"Wang C, Shi Q, Xian W et al (2021) Efficient diversified influence maximization with adaptive policies. Knowl-Based Syst 213:106692. https:\/\/doi.org\/10.1016\/j.knosys.2020.106692","journal-title":"Knowl-Based Syst"},{"key":"1604_CR36","doi-asserted-by":"publisher","first-page":"103895","DOI":"10.1016\/j.artint.2023.103895","volume":"318","author":"G D\u2019Angelo","year":"2023","unstructured":"D\u2019Angelo G, Poddar D, Vinci C (2023) Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. Artif Intell 318:103895. https:\/\/doi.org\/10.1016\/j.artint.2023.103895","journal-title":"Artif Intell"},{"key":"1604_CR37","doi-asserted-by":"crossref","unstructured":"Salha G, Tziortziotis N, Vazirgiannis M (2018) Adaptive submodular influence maximization with myopic feedback. In: 2018 IEEE\/ACM International Conference on advances in social networks analysis and mining (ASONAM), Barcelona, Spain, pp 455\u2013462","DOI":"10.1109\/ASONAM.2018.8508254"},{"key":"1604_CR38","unstructured":"Peng B, Chen W (2019) Adaptive influence maximization with myopic feedback. In: The 33th International Conference on neural information processing systems International Conference on Neural Information Processing Systems, Vancouver, Canada, pp 5574\u20135583"},{"key":"1604_CR39","doi-asserted-by":"crossref","unstructured":"Yuan J, Tang S (2017) No time to observe: adaptive influence maximization with partial feedback. In: Proceedings of the 26th International Joint Conference on artificial intelligence, Melbourne, Australia, 3908\u20133914","DOI":"10.24963\/ijcai.2017\/546"},{"key":"1604_CR40","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TETC.2020.3031057","volume":"10","author":"G Tong","year":"2022","unstructured":"Tong G, Wang R (2022) On adaptive influence maximization under general feedback models. IEEE Trans Emerg Top Comput 10:463\u2013475. https:\/\/doi.org\/10.1109\/TETC.2020.3031057","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"1604_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-023-04884-y","volume":"53","author":"J Tang","year":"2023","unstructured":"Tang J, Song S, Lan J et al (2023) Steering the spread of influence adaptively in social networks via a discrete scheduled particle swarm optimization. Appl Intell 53:1\u201322. https:\/\/doi.org\/10.1007\/s10489-023-04884-y","journal-title":"Appl Intell"},{"key":"1604_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Chen D, Ren X et al (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363. https:\/\/doi.org\/10.1016\/j.physrep.2016.06.007","journal-title":"Phys Rep"},{"key":"1604_CR43","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.socnet.2015.08.003","volume":"44","author":"U Brandes","year":"2016","unstructured":"Brandes U, Borgatti S, Freeman L (2016) Maintaining the duality of closeness and betweenness centrality. Soc Netw 44:153\u2013159. https:\/\/doi.org\/10.1016\/j.socnet.2015.08.003","journal-title":"Soc Netw"},{"key":"1604_CR44","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaver\u0161nik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5:129\u2013145. https:\/\/doi.org\/10.1007\/s11634-010-0079-y","journal-title":"Adv Data Anal Classif"},{"key":"1604_CR45","unstructured":"Vaswani A, Shazeer N, Parmar N, et\u00a0al (2017) Attention is all you need. Preprint at arXiv:1312.6203"},{"key":"1604_CR46","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. Preprint at arXiv:1609.02907"},{"key":"1604_CR47","unstructured":"Hinton GE, Srivastava N, Krizhevsky A, et\u00a0al (2012) Improving neural networks by preventing co-adaptation of feature detectors. Preprint at arXiv:1207.0580"},{"key":"1604_CR48","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, et\u00a0al (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge discovery and data mining, California, USA, 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1604_CR49","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s00778-020-00615-8","volume":"29","author":"K Huang","year":"2020","unstructured":"Huang K, Tang J, Han K et al (2020) Efficient approximation algorithms for adaptive influence maximization. Phys Rep 29:1385\u20131406. https:\/\/doi.org\/10.1007\/s00778-020-00615-8","journal-title":"Phys Rep"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01604-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01604-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01604-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T22:20:56Z","timestamp":1729117256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01604-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1604"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01604-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,28]]},"assertion":[{"value":"20 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2024","order":3,"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 Conflict of interest to declare that are relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}