{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:48:54Z","timestamp":1763192934531,"version":"3.45.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1109\/ijcnn64981.2025.11227417","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:46:15Z","timestamp":1763145975000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["DTEM: A Dynamic Trust Evaluation Method Based on GAT and Enhanced GRU"],"prefix":"10.1109","author":[{"given":"Yuanhe","family":"Kuang","sequence":"first","affiliation":[{"name":"Hubei University,School of Computer Science,Wuhan,China,430062"}]},{"given":"Dunhui","family":"Yu","sequence":"additional","affiliation":[{"name":"Hubei University,School of Computer Science,Wuhan,China,430062"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.06.027"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijinfomgt.2024.102780"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/socsci12070416"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.08.063"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/mca29030037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3275634"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3192978"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488516"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737469"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057106"},{"article-title":"How powerful are graph neural networks?","year":"2018","author":"Xu","key":"ref11"},{"key":"ref12","article-title":"Layer-diverse negative sampling for graph neural networks","volume":"2024","author":"Duan","year":"2024","journal-title":"Trans. Mach. Learn. Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125391"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155370"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3174044"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-76714-2_1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS53863.2021.00081"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228962"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3082932"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433405"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3107948"},{"issue":"20","key":"ref25","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"stat"},{"article-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"Kipf","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488814"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.11"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0033"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159729"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"Kingma","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3373469"}],"event":{"name":"2025 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2025,6,30]]},"location":"Rome, Italy","end":{"date-parts":[[2025,7,5]]}},"container-title":["2025 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11227166\/11227148\/11227417.pdf?arnumber=11227417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:45:27Z","timestamp":1763192727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11227417\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/ijcnn64981.2025.11227417","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}