{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T04:18:32Z","timestamp":1741839512794,"version":"3.38.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["62072158","62272146","62171180"],"award-info":[{"award-number":["62072158","62272146","62171180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11277-025-11740-4","type":"journal-article","created":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T15:10:17Z","timestamp":1738509017000},"page":"607-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CRDP: Community-Aware Routing Algorithm Based on DNN and PPO"],"prefix":"10.1007","volume":"140","author":[{"given":"Huahong","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyun","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honghai","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,2]]},"reference":[{"key":"11740_CR1","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s11036-020-01624-1","volume":"26","author":"L Liu","year":"2021","unstructured":"Liu, L., Chen, C., Pei, Q., Maharjan, S., & Zhang, Y. (2021). Vehicular edge computing and networking: A survey. Mobile Networks and Applications, 26, 1145\u20131168. https:\/\/doi.org\/10.1007\/s11036-020-01624-1","journal-title":"Mobile Networks and Applications"},{"doi-asserted-by":"publisher","unstructured":"Liu, L., & Jing, Y. (2012). A survey on social-based routing and forwarding protocols in opportunistic networks. In: 2012 IEEE 12th International Conference on Computer and Information Technology, pp. 635\u2013639. https:\/\/doi.org\/10.1109\/CIT.2012.135 . IEEE","key":"11740_CR2","DOI":"10.1109\/CIT.2012.135"},{"doi-asserted-by":"publisher","unstructured":"Dhurandher, S.K., Singh, J., Obaidat, M.S., Woungang, I., Srivastava, S., & Rodrigues, J.J. (2020). Reinforcement learning-based routing protocol for opportunistic networks. In: ICC 2020-2020 IEEE International Conference on Communications (ICC), pp. 1\u20136. https:\/\/doi.org\/10.1109\/ICC40277.2020.9149039 . IEEE","key":"11740_CR3","DOI":"10.1109\/ICC40277.2020.9149039"},{"key":"11740_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2021.100384","volume":"14","author":"K Khalid","year":"2021","unstructured":"Khalid, K., Woungang, I., Dhurandher, S. K., & Singh, J. (2021). Reinforcement learning-based fuzzy geocast routing protocol for opportunistic networks. Internet Things, 14, 100384. https:\/\/doi.org\/10.1016\/j.iot.2021.100384","journal-title":"Internet Things"},{"issue":"17","key":"11740_CR5","doi-asserted-by":"publisher","first-page":"26613","DOI":"10.1007\/s11042-023-14645-1","volume":"82","author":"M Hashemi","year":"2023","unstructured":"Hashemi, M., & Moghim, N. (2023). An efficient multicast multi-rate reinforcement learning based opportunistic routing algorithm. Multimedia Tools and Applications, 82(17), 26613\u201326630. https:\/\/doi.org\/10.1007\/s11042-023-14645-1","journal-title":"Multimedia Tools and Applications"},{"doi-asserted-by":"publisher","unstructured":"Sharma, D.K., Sohi, G., Dhankhar, H., & Yadav, M. (2018). Direct perceptive routing protocol for opportunistic networks. In: 2018 Eleventh International Conference on Contemporary Computing (IC3), pp. 1\u20136. https:\/\/doi.org\/10.1109\/IC3.2018.8530597 . IEEE","key":"11740_CR6","DOI":"10.1109\/IC3.2018.8530597"},{"doi-asserted-by":"publisher","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B.A. (2017). Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282. https:\/\/doi.org\/10.48550\/arXiv.1602.05629 . PMLR","key":"11740_CR7","DOI":"10.48550\/arXiv.1602.05629"},{"doi-asserted-by":"publisher","unstructured":"Vahdat, A., & Becker, D., et al. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University. https:\/\/doi.org\/10.1145\/1341771.1341791","key":"11740_CR8","DOI":"10.1145\/1341771.1341791"},{"doi-asserted-by":"publisher","unstructured":"Kim, E.-H., Nam, J.-C., Choi, J.-I., & Cho, Y.-Z. (2014). Probability-based spray and wait protocol in delay tolerant networks. In: The International Conference on Information Networking 2014 (ICOIN2014), pp. 412\u2013416. https:\/\/doi.org\/10.1109\/ICOIN.2014.6799715 . IEEE","key":"11740_CR9","DOI":"10.1109\/ICOIN.2014.6799715"},{"key":"11740_CR10","doi-asserted-by":"publisher","first-page":"18228","DOI":"10.1109\/ACCESS.2020.2968598","volume":"8","author":"Q Zhang","year":"2020","unstructured":"Zhang, Q., Song, Y., Sun, B., & Dai, Z. (2020). Design of routing protocol for opportunistic network based on adaptive motion. IEEE Access, 8, 18228\u201318239. https:\/\/doi.org\/10.1109\/ACCESS.2020.2968598","journal-title":"IEEE Access"},{"doi-asserted-by":"publisher","unstructured":"Huang, M., Li, C., Yan, L., Cao, S., & Zhang, L. (2023). An improved probabilistic routing algorithm based on moving direction prediction in dtns. In: Proceedings of the World Conference on Intelligent and 3-D Technologies (WCI3DT 2022) Methods, Algorithms and Applications, pp. 111\u2013131. https:\/\/doi.org\/10.1007\/978-981-19-7184-6_10 . Springer","key":"11740_CR11","DOI":"10.1007\/978-981-19-7184-6_10"},{"issue":"12","key":"11740_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/MCOM.2009.5350376","volume":"47","author":"H Liu","year":"2009","unstructured":"Liu, H., Zhang, B., Mouftah, H. T., Shen, X., & Ma, J. (2009). Opportunistic routing for wireless ad hoc and sensor networks: Present and future directions. IEEE Communications Magazine, 47(12), 103\u2013109. https:\/\/doi.org\/10.1109\/MCOM.2009.5350376","journal-title":"IEEE Communications Magazine"},{"issue":"3","key":"11740_CR13","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/JSYST.2016.2630923","volume":"12","author":"DK Sharma","year":"2018","unstructured":"Sharma, D. K., Dhurandher, S. K., Woungang, I., Srivastava, R. K., Mohananey, A., & Rodrigues, J. J. P. C. (2018). A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Systems Journal, 12(3), 2207\u20132213. https:\/\/doi.org\/10.1109\/JSYST.2016.2630923","journal-title":"IEEE Systems Journal"},{"doi-asserted-by":"publisher","unstructured":"Sharma, D.K., Sharma, A., & Kumar, J., et al. (2017). Knnr: K-nearest neighbour classification based routing protocol for opportunistic networks. In: 2017 Tenth International Conference on Contemporary Computing (IC3), pp. 1\u20136. https:\/\/doi.org\/10.1109\/IC3.2017.8284342 . IEEE","key":"11740_CR14","DOI":"10.1109\/IC3.2017.8284342"},{"key":"11740_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.jpdc.2017.08.008","volume":"118","author":"SK Dhurandher","year":"2018","unstructured":"Dhurandher, S. K., Borah, S. J., Woungang, I., Bansal, A., & Gupta, A. (2018). A location prediction-based routing scheme for opportunistic networks in an iot scenario. Journal of Parallel and Distributed Computing, 118, 369\u2013378. https:\/\/doi.org\/10.1016\/j.jpdc.2017.08.008","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"11740_CR16","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1007\/s12652-018-0697-3","volume":"10","author":"DK Sharma","year":"2019","unstructured":"Sharma, D. K., Dhurandher, S. K., Agarwal, D., & Arora, K. (2019). krop: k-means clustering based routing protocol for opportunistic networks. Journal of Ambient Intelligence and Humanized Computing, 10(4), 1289\u20131306. https:\/\/doi.org\/10.1007\/s12652-018-0697-3","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"doi-asserted-by":"crossref","unstructured":"Lakshmi, V.R.V., & Thonnuthodi, G.K. (2020). Socialized proficient routing in opportunistic mobile network using machine learning techniques. International Journal of Intelligent Engineering & Systems, https:\/\/doi.org\/10.22266\/ijies2020.0831.38","key":"11740_CR17","DOI":"10.22266\/ijies2020.0831.38"},{"doi-asserted-by":"publisher","unstructured":"Li, Y., & Zhang, S. (2015). Combo-pre: A combination link prediction method in opportunistic networks. In: 2015 24th International Conference on Computer Communication and Networks (ICCCN), pp. 1\u20136. https:\/\/doi.org\/10.1109\/ICCCN.2015.7288386 . IEEE","key":"11740_CR18","DOI":"10.1109\/ICCCN.2015.7288386"},{"doi-asserted-by":"publisher","unstructured":"Janku, L.S., & Hyniova, K. (2019). Improvement of routing in opportunistic communication networks of vehicles by unsupervised machine learning. In: Macintyre, J., Iliadis, L., Maglogiannis, I., Jayne, C. (eds.) ENGINEERING APPLICATIONS OF NEURAL NETWORKSX. Communications in Computer and Information Science, vol.1000, pp. 412\u2013423 (2019). https:\/\/doi.org\/10.1007\/978-3-030-20257-6_35 . 20th International Conference on Engineering Applications of Neural Networks (EANN) \/1st International Workshop on Pervasive Intelligence (PEINT), Xersonisos, GREECE, MAY 24-26, 2019","key":"11740_CR19","DOI":"10.1007\/978-3-030-20257-6_35"},{"issue":"6","key":"11740_CR20","doi-asserted-by":"publisher","first-page":"4319","DOI":"10.1007\/s11276-020-02331-1","volume":"26","author":"DK Sharma","year":"2020","unstructured":"Sharma, D. K., Rodrigues, J. J. P. C., Vashishth, V., Khanna, A., & Chhabra, A. (2020). Rlproph: A dynamic programming based reinforcement learning approach for optimal routing in opportunistic iot networks. Wireless Networks, 26(6), 4319\u20134338. https:\/\/doi.org\/10.1007\/s11276-020-02331-1","journal-title":"Wireless Networks"},{"issue":"1","key":"11740_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TNET.2011.2159844","volume":"20","author":"A Bhorkar","year":"2012","unstructured":"Bhorkar, A., Naghshvar, M., Javidi, T., & Rao, B. D. (2012). Adaptive opportunistic routing for wireless ad hoc networks. IEEE\/ACM Transactions On Networking, 20(1), 243\u2013256. https:\/\/doi.org\/10.1109\/TNET.2011.2159844","journal-title":"IEEE\/ACM Transactions On Networking"},{"doi-asserted-by":"publisher","unstructured":"Tang, K., Li, C., Xiong, H., Zou, J., & Frossard, P. (2017). Reinforcement learning-based opportunistic routing for live video streaming over multi-hop wireless networks. In: 2017 IEEE 19th International Workshop on Multimedia Signal Processing (MMSP), pp. 1\u20136. https:\/\/doi.org\/10.1109\/MMSP.2017.8122255 . IEEE","key":"11740_CR22","DOI":"10.1109\/MMSP.2017.8122255"},{"doi-asserted-by":"publisher","unstructured":"Zhu, H., Fu, L., Xue, G., Zhu, Y., Li, M., & Ni, L.M. (2010). Recognizing exponential inter-contact time in vanets. In: 2010 Proceedings IEEE INFOCOM, pp. 1\u20135. https:\/\/doi.org\/10.1109\/INFCOM.2010.5462263 . IEEE","key":"11740_CR23","DOI":"10.1109\/INFCOM.2010.5462263"},{"issue":"8","key":"11740_CR24","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPDS.2010.176","volume":"22","author":"H Zhu","year":"2010","unstructured":"Zhu, H., Li, M., Fu, L., Xue, G., Zhu, Y., & Ni, L. M. (2010). Impact of traffic influxes: Revealing exponential intercontact time in urban vanets. IEEE Transactions on Parallel and Distributed Systems, 22(8), 1258\u20131266. https:\/\/doi.org\/10.1109\/TPDS.2010.176","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"11740_CR25","doi-asserted-by":"publisher","first-page":"9928771","DOI":"10.1155\/2021\/9928771","volume":"2021","author":"A Xiaokaiti","year":"2021","unstructured":"Xiaokaiti, A., Qian, Y., & Wu, J. (2021). Efficient data transmission for community detection algorithm based on node similarity in opportunistic social networks. Complexity, 2021(1), 9928771. https:\/\/doi.org\/10.1155\/2021\/9928771","journal-title":"Complexity"},{"issue":"3","key":"11740_CR26","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/JIOT.2020.3001309","volume":"8","author":"X Bi","year":"2020","unstructured":"Bi, X., Qiu, T., Qu, W., Zhao, L., Zhou, X., & Wu, D. O. (2020). Dynamically transient social community detection for mobile social networks. IEEE Internet of Things Journal, 8(3), 1282\u20131293. https:\/\/doi.org\/10.1109\/JIOT.2020.3001309","journal-title":"IEEE Internet of Things Journal"},{"doi-asserted-by":"publisher","unstructured":"Yan, Y., Chen, Z., Wu, J., Wang, L., Liu, K., & Zheng, P. (2019). An effective transmission strategy exploiting node preference and social relations in opportunistic social networks. IEEE Access 7, 58186\u201358199. https:\/\/doi.org\/10.1109\/ACCESS.2019.2914505","key":"11740_CR27","DOI":"10.1109\/ACCESS.2019.2914505"},{"key":"11740_CR28","doi-asserted-by":"publisher","first-page":"22144","DOI":"10.1109\/ACCESS.2019.2914505","volume":"7","author":"Y Yan","year":"2019","unstructured":"Yan, Y., Chen, Z., Wu, J., Wang, L., Liu, K., & Wu, Y. (2019). Effective data transmission strategy based on node socialization in opportunistic social networks. IEEE Access, 7, 22144\u201322160. https:\/\/doi.org\/10.1109\/ACCESS.2019.2914505","journal-title":"IEEE Access"},{"issue":"1","key":"11740_CR29","doi-asserted-by":"publisher","first-page":"2350970","DOI":"10.1080\/14786451.2024.2350970","volume":"43","author":"N Guler","year":"2024","unstructured":"Guler, N. (2024). Smart allocation and sizing of fast charging stations: A metaheuristic solution. International Journal of Sustainable Energy, 43(1), 2350970. https:\/\/doi.org\/10.1080\/14786451.2024.2350970","journal-title":"International Journal of Sustainable Energy"},{"issue":"4","key":"11740_CR30","doi-asserted-by":"publisher","first-page":"150","DOI":"10.3390\/wevj15040150","volume":"15","author":"N Guler","year":"2024","unstructured":"Guler, N., & Ben Hazem, Z. (2024). A k-additive fuzzy logic approach for optimizing fcs sizing and enhanced user satisfaction. World Electric Vehicle Journal, 15(4), 150.","journal-title":"World Electric Vehicle Journal"},{"issue":"2","key":"11740_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M. E., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. https:\/\/doi.org\/10.1103\/physreve.69.026113","journal-title":"Physical Review E"},{"doi-asserted-by":"publisher","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017). Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347. https:\/\/doi.org\/10.48550\/arXiv.1707.06347","key":"11740_CR32","DOI":"10.48550\/arXiv.1707.06347"},{"unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., & Antiga, L., et al. (2019). Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32","key":"11740_CR33"},{"doi-asserted-by":"publisher","unstructured":"He, C., Li, S., So, J., Zeng, X., Zhang, M., Wang, H., Wang, X., Vepakomma, P., Singh, A., & Qiu, H., et al. (2020). Fedml: A research library and benchmark for federated machine learning. arXiv preprint arXiv:2007.13518. https:\/\/doi.org\/10.48550\/arXiv.2007.13518","key":"11740_CR34","DOI":"10.48550\/arXiv.2007.13518"},{"issue":"3","key":"11740_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., & Schel\u00e9n, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19\u201320. https:\/\/doi.org\/10.1145\/961268.961272","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"4","key":"11740_CR36","doi-asserted-by":"publisher","first-page":"576","DOI":"10.3390\/electronics9040576","volume":"9","author":"A Alshehri","year":"2020","unstructured":"Alshehri, A., Badawy, A.-H.A., & Huang, H. (2020). Fq-ago: Fuzzy logic q-learning based asymmetric link aware and geographic opportunistic routing scheme for manets. Electronics, 9(4), 576. https:\/\/doi.org\/10.3390\/electronics9040576","journal-title":"Electronics"},{"key":"11740_CR37","doi-asserted-by":"publisher","first-page":"3123615","DOI":"10.1155\/2022\/3123615","volume":"2022","author":"X Han","year":"2022","unstructured":"Han, X., Wang, H., Tan, J., Lv, H., Wang, C., et al. (2022). Mr-pareto: A multiattribute opportunistic routing method based on pareto optimal solution for mobile crowdsensing. Wireless Communications and Mobile Computing, 2022, 3123615. https:\/\/doi.org\/10.1155\/2022\/3123615","journal-title":"Wireless Communications and Mobile Computing"},{"doi-asserted-by":"publisher","unstructured":"Ekman, F., Ker\u00e4nen, A., Karvo, J., & Ott, J. (2008). Working day movement model. In: Proceedings of the 1st ACM SIGMOBILE Workshop on Mobility Models, pp. 33\u201340. https:\/\/doi.org\/10.1145\/1374688.1374695","key":"11740_CR38","DOI":"10.1145\/1374688.1374695"},{"issue":"11","key":"11740_CR39","doi-asserted-by":"publisher","first-page":"11154","DOI":"10.1109\/TVT.2018.2870113","volume":"67","author":"N Magaia","year":"2018","unstructured":"Magaia, N., Borrego, C., Pereira, P. R., & Correia, M. (2018). eprivo: An enhanced privacy-preserving opportunistic routing protocol for vehicular delay-tolerant networks. IEEE Transactions on Vehicular Technology, 67(11), 11154\u201311168. https:\/\/doi.org\/10.1109\/TVT.2018.2870113","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"1","key":"11740_CR40","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1558590.1558602","volume":"13","author":"SC Nelson","year":"2009","unstructured":"Nelson, S. C., Bakht, M., Kravets, R., & Harris, A. F., III. (2009). Encounter: Based routing in dtns. ACM SIGMOBILE Mobile Computing and Communications Review, 13(1), 56\u201359. https:\/\/doi.org\/10.1145\/1558590.1558602","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-025-11740-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-025-11740-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-025-11740-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:49:49Z","timestamp":1741783789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-025-11740-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["11740"],"URL":"https:\/\/doi.org\/10.1007\/s11277-025-11740-4","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"20 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2025","order":2,"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 potential Conflict of interest in our paper. All authors have seen the manuscript and approved to submit to the journal. We confirm that the content of the manuscript has not been published or submitted for publication elsewhere.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}