{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:47:22Z","timestamp":1765500442039,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761090","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:37:32Z","timestamp":1762799852000},"page":"2771-2780","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["DiRW: Path-Aware Digraph Learning for Heterophily"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1627-9608","authenticated-orcid":false,"given":"Daohan","family":"Su","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1230-7603","authenticated-orcid":false,"given":"Xunkai","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4176-8879","authenticated-orcid":false,"given":"Zhenjun","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9661-0759","authenticated-orcid":false,"given":"Yinping","family":"Liao","sequence":"additional","affiliation":[{"name":"Shenzhen City Polytechnic, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3105-5325","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17478"},{"key":"e_1_3_2_1_2_1","volume-title":"Jerry Chun-Wei Lin, and Gautam Srivastava","author":"Ahmed Usman","year":"2022","unstructured":"Usman Ahmed, Jerry Chun-Wei Lin, and Gautam Srivastava. 2022. Hyper-Graph Attention Based Federated Learning Method For Mental Health Detection. IEEE Journal of Biomedical and Health Informatics (2022)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2023.200240"},{"key":"e_1_3_2_1_5_1","volume-title":"Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198","author":"Frasca Fabrizio","year":"2020","unstructured":"Fabrizio Frasca, Emanuele Rossi, Davide Eynard, Ben Chamberlain, Michael Bronstein, and Federico Monti. 2020. Sign: Scalable inception graph neural networks. arXiv preprint arXiv:2004.11198 (2020)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_7_1","volume-title":"Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. Advances in Neural Information Processing Systems, NeurIPS","author":"He Mingguo","year":"2021","unstructured":"Mingguo He, Zhewei Wei, Hongteng Xu, et al., 2021. Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. Advances in Neural Information Processing Systems, NeurIPS (2021)."},{"key":"e_1_3_2_1_8_1","volume-title":"DIGRAC: Digraph Clustering Based on Flow Imbalance. In Learning on Graphs Conference, LoG.","author":"He Yixuan","year":"2022","unstructured":"Yixuan He, Gesine Reinert, and Mihai Cucuringu. 2022. DIGRAC: Digraph Clustering Based on Flow Imbalance. In Learning on Graphs Conference, LoG."},{"key":"e_1_3_2_1_9_1","volume-title":"International Conference on Learning Representations, ICLR","author":"Huang Qian","year":"2021","unstructured":"Qian Huang, Horace He, Abhay Singh, Ser-Nam Lim, and Austin R Benson. 2021. Combining label propagation and simple models out-performs graph neural networks. International Conference on Learning Representations, ICLR (2021)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-33377-4_10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/293"},{"key":"e_1_3_2_1_12_1","volume-title":"International Conference on Learning Representations, ICLR.","author":"Kipf Thomas N","year":"2017","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20682"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555904"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3654621.3654623"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645450"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3266453"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014424"},{"key":"e_1_3_2_1_19_1","volume-title":"NeurIPS","author":"Luan Sitao","year":"2022","unstructured":"Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Mingde Zhao, Shuyuan Zhang, Xiao-Wen Chang, and Doina Precup. 2022. Revisiting heterophily for graph neural networks. Advances in Neural Information Processing Systems, NeurIPS (2022)."},{"key":"e_1_3_2_1_20_1","volume-title":"NeurIPS","author":"Luo Yuankai","year":"2023","unstructured":"Yuankai Luo, Veronika Thost, and Lei Shi. 2023. Transformers over Directed Acyclic Graphs. Advances in Neural Information Processing Systems, NeurIPS (2023)."},{"key":"e_1_3_2_1_21_1","volume-title":"International Conference on Learning Representations, ICLR","author":"Ma Yao","year":"2021","unstructured":"Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2021. Is homophily a necessity for graph neural networks? International Conference on Learning Representations, ICLR (2021)."},{"key":"e_1_3_2_1_22_1","volume-title":"Why Using Either Aggregated Features or Adjacency Lists in Directed or Undirected Graph? Empirical Study and Simple Classification Method. arXiv preprint arXiv:2306.08274","author":"Maekawa Seiji","year":"2023","unstructured":"Seiji Maekawa, Yuya Sasaki, and Makoto Onizuka. 2023. Why Using Either Aggregated Features or Adjacency Lists in Directed or Undirected Graph? Empirical Study and Simple Classification Method. arXiv preprint arXiv:2306.08274 (2023)."},{"key":"e_1_3_2_1_23_1","volume-title":"Bioinformatics","volume":"38","author":"Pfeifer Bastian","year":"2022","unstructured":"Bastian Pfeifer, Anna Saranti, and Andreas Holzinger. 2022. GNN-SubNet: disease subnetwork detection with explainable graph neural networks. Bioinformatics, Vol. 38, Supplement_2 (2022), ii120-ii126."},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Learning Representations, ICLR","author":"Platonov Oleg","year":"2023","unstructured":"Oleg Platonov, Denis Kuznedelev, Michael Diskin, Artem Babenko, and Liudmila Prokhorenkova. 2023. A critical look at the evaluation of GNNs under heterophily: are we really making progress? International Conference on Learning Representations, ICLR (2023)."},{"key":"e_1_3_2_1_25_1","first-page":"592","volume-title":"Electronic and Automation Control Conference","volume":"6","author":"Qiu Yuxin","year":"2023","unstructured":"Yuxin Qiu. 2023. Default Risk Assessment of Internet Financial Enterprises Based on Graph Neural Network. In IEEE Information TechnoLoGy, Networking, Electronic and Automation Control Conference, Vol. 6. IEEE, 592-596."},{"key":"e_1_3_2_1_26_1","volume-title":"Fabrizio Frasca, Stephan G\u00fcnnemann, and Michael Bronstein.","author":"Rossi Emanuele","year":"2023","unstructured":"Emanuele Rossi, Bertrand Charpentier, Francesco Di Giovanni, Fabrizio Frasca, Stephan G\u00fcnnemann, and Michael Bronstein. 2023. Edge Directionality Improves Learning on Heterophilic Graphs. in Proceedings of The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD Workshop (2023)."},{"key":"e_1_3_2_1_27_1","volume-title":"DCL: Diversified Graph Recommendation With Contrastive Learning","author":"Su Daohan","year":"2024","unstructured":"Daohan Su, Bowen Fan, Zhi Zhang, Haoyan Fu, and Zhida Qin. 2024. DCL: Diversified Graph Recommendation With Contrastive Learning. IEEE Transactions on Computational Social Systems (2024)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00188"},{"key":"e_1_3_2_1_29_1","first-page":"2233","article-title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","author":"Sun Yifei","year":"2022","unstructured":"Yifei Sun, Haoran Deng, Yang Yang, Chunping Wang, Jiarong Xu, Renhong Huang, Linfeng Cao, Yang Wang, and Lei Chen. 2022. Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network.. In IJCAI. 2233-2240.","journal-title":"IJCAI."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570407"},{"key":"e_1_3_2_1_31_1","volume-title":"Directed acyclic graph neural networks. arXiv preprint arXiv:2101.07965","author":"Thost Veronika","year":"2021","unstructured":"Veronika Thost and Jie Chen. 2021. Directed acyclic graph neural networks. arXiv preprint arXiv:2101.07965 (2021)."},{"key":"e_1_3_2_1_32_1","volume-title":"NeurIPS","author":"Tong Zekun","year":"2020","unstructured":"Zekun Tong, Yuxuan Liang, Changsheng Sun, Xinke Li, David Rosenblum, and Andrew Lim. 2020a. Digraph inception convolutional networks. Advances in Neural Information Processing Systems, NeurIPS (2020)."},{"key":"e_1_3_2_1_33_1","volume-title":"Directed graph convolutional network. arXiv preprint arXiv:2004.13970","author":"Tong Zekun","year":"2020","unstructured":"Zekun Tong, Yuxuan Liang, Changsheng Sun, David S Rosenblum, and Andrew Lim. 2020b. Directed graph convolutional network. arXiv preprint arXiv:2004.13970 (2020)."},{"key":"e_1_3_2_1_34_1","volume-title":"International Conference on Learning Representations, ICLR.","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_1_35_1","volume-title":"Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755","author":"Wang Hongwei","year":"2020","unstructured":"Hongwei Wang and Jure Leskovec. 2020. Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755 (2020)."},{"key":"e_1_3_2_1_36_1","volume-title":"International Conference on Machine Learning, ICML.","author":"Wang Xiyuan","year":"2022","unstructured":"Xiyuan Wang and Muhan Zhang. 2022. How Powerful are Spectral Graph Neural Networks. In International Conference on Machine Learning, ICML."},{"key":"e_1_3_2_1_37_1","volume-title":"International Conference on Machine Learning, ICML.","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International Conference on Machine Learning, ICML."},{"key":"e_1_3_2_1_38_1","volume-title":"PathMLP: Smooth Path Towards High-order Homophily. arXiv preprint arXiv:2306.13532","author":"Xie Chenxuan","year":"2023","unstructured":"Chenxuan Xie, Jiajun Zhou, Shengbo Gong, Jiacheng Wan, Jiaxu Qian, Shanqing Yu, Qi Xuan, and Xiaoniu Yang. 2023. PathMLP: Smooth Path Towards High-order Homophily. arXiv preprint arXiv:2306.13532 (2023)."},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Machine Learning, ICML.","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In International Conference on Machine Learning, ICML."},{"key":"e_1_3_2_1_40_1","volume-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462","author":"Yan Yujun","year":"2022","unstructured":"Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. 2022. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462 (2022)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570472"},{"key":"e_1_3_2_1_42_1","volume-title":"Spagan: Shortest path graph attention network. arXiv preprint arXiv:2101.03464","author":"Yang Yiding","year":"2021","unstructured":"Yiding Yang, Xinchao Wang, Mingli Song, Junsong Yuan, and Dacheng Tao. 2021. Spagan: Shortest path graph attention network. arXiv preprint arXiv:2101.03464 (2021)."},{"key":"e_1_3_2_1_43_1","volume-title":"MGC: A complex-valued graph convolutional network for directed graphs. arXiv e-prints","author":"Zhang Jie","year":"2021","unstructured":"Jie Zhang, Bo Hui, Po-Wei Harn, Min-Te Sun, and Wei-Shinn Ku. 2021b. MGC: A complex-valued graph convolutional network for directed graphs. arXiv e-prints (2021), arXiv-2110."},{"key":"e_1_3_2_1_44_1","volume-title":"NeurIPS","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems, NeurIPS (2018)."},{"key":"e_1_3_2_1_45_1","volume-title":"Magnet: A neural network for directed graphs. Advances in Neural Information Processing Systems, NeurIPS","author":"Zhang Xitong","year":"2021","unstructured":"Xitong Zhang, Yixuan He, Nathan Brugnone, Michael Perlmutter, and Matthew Hirn. 2021a. Magnet: A neural network for directed graphs. Advances in Neural Information Processing Systems, NeurIPS (2021)."},{"key":"e_1_3_2_1_46_1","volume-title":"Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082","author":"Zheng Xin","year":"2022","unstructured":"Xin Zheng, Yixin Liu, Shirui Pan, Miao Zhang, Di Jin, and Philip S Yu. 2022. Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082 (2022)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557344"}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:44:36Z","timestamp":1765500276000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":47,"alternative-id":["10.1145\/3746252.3761090","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761090","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}