{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:30:54Z","timestamp":1770964254257,"version":"3.50.1"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China","award":["JYB2025XDXM101"],"award-info":[{"award-number":["JYB2025XDXM101"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272374"],"award-info":[{"award-number":["62272374"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62192781"],"award-info":[{"award-number":["62192781"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2024JC-JCQN-62"],"award-info":[{"award-number":["2024JC-JCQN-62"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Key Laboratory of Communication Content Cognition","award":["A202502"],"award-info":[{"award-number":["A202502"]}]},{"name":"Key Research and Development Project in Shaanxi Province","award":["2023GXLH-024"],"award-info":[{"award-number":["2023GXLH-024"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tkde.2026.3656720","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T21:11:50Z","timestamp":1769029910000},"page":"1813-1825","source":"Crossref","is-referenced-by-count":0,"title":["HCGBot: Learning Homophilous Context Graphs for Twitter Bot Detection"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3294-3383","authenticated-orcid":false,"given":"Herun","family":"Wan","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0140-7860","authenticated-orcid":false,"given":"Minnan","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8153-6899","authenticated-orcid":false,"given":"Jihong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7778-8807","authenticated-orcid":false,"given":"Xiaojun","family":"Chang","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, University Of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7168-1120","authenticated-orcid":false,"given":"Qinghua","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.24251\/hicss.2020.298"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/20539517211013861"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3292522.3326015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/719\/1\/012063"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481949"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3008732"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3316504"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3487351.3488336"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3150669"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20314"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2961666"},{"key":"ref13","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3298789"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2015.09.003"},{"key":"ref16","first-page":"35254","article-title":"TwiBot-22: Towards graph-based Twitter bot detection","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","volume":"35","author":"Feng","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.findings-emnlp.954"},{"key":"ref18","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei","year":"2020"},{"key":"ref19","first-page":"19314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume":"33","author":"Chen","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s42001-022-00177-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPS-ISA48467.2019.00021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5460"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.11.016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-022-00869-w"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.08.019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00089"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3409116"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.575"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591646"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3118815"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3047857"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00796-3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9892366"},{"key":"ref34","article-title":"Hofa: Twitter bot detection with homophily-oriented augmentation and frequency adaptive attention","author":"Ye","year":"2023"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-78183-4_4"},{"key":"ref36","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref37","first-page":"12782","article-title":"G2CN: Graph gaussian convolution networks with concentrated graph filters","volume-title":"Proc. Int. Conf. on Mach. Learn.,","author":"Li","year":"2022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3146270"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3185388"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29246"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3485880"},{"key":"ref43","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume":"34","author":"Lim","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref44","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi","year":"2019"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2025.3552334"},{"key":"ref46","first-page":"22131","article-title":"Learning causally invariant representations for out-of-distribution generalization on graphs","volume":"35","author":"Chen","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref47","first-page":"24934","article-title":"Debiasing graph neural networks via learning disentangled causal substructure","volume":"35","author":"Fan","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref48","first-page":"9492","article-title":"Dags with no tears: Continuous optimization for structure learning","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","volume":"31","author":"Zheng","year":"2018"},{"key":"ref49","first-page":"8226","article-title":"DAGMA: Learning DAGs via M-matrices and a log-determinant acyclicity characterization","volume":"35","author":"Bello","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref50","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"Liu","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.552"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080809"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/UBMK.2017.8093483"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101715"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v17i1.22179"},{"key":"ref57","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton","year":"2017"},{"key":"ref58","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref60","article-title":"Adaptive universal generalized pagerank graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chien","year":"2021"},{"key":"ref61","article-title":"Ordered GNN: Ordering message passing to deal with heterophily and over-smoothing","volume-title":"Proc. 11th Int. Conf. on Learn. Representations","author":"Song","year":"2023"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11393947\/11360310.pdf?arnumber=11360310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T05:48:10Z","timestamp":1770961690000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11360310\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":61,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2026.3656720","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}