{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:20:44Z","timestamp":1783110044572,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819543663","type":"print"},{"value":"9789819543670","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4367-0_28","type":"book-chapter","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:38:11Z","timestamp":1763728691000},"page":"414-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Breaking the\u00a0Heterophily Mixing Barrier in\u00a0Graph Learning: A Mixed-Curvature Product Manifold Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6983-4914","authenticated-orcid":false,"given":"Lizhi","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"28_CR1","unstructured":"Abu-El-Haija, S., et al.: Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In: ICML. Proceedings of Machine Learning Research, vol.\u00a097, pp. 21\u201329 (2019)"},{"key":"28_CR2","unstructured":"B\u00e9cigneul, G., Ganea, O.: Riemannian adaptive optimization methods. In: ICLR (2019)"},{"issue":"12","key":"28_CR3","doi-asserted-by":"publisher","first-page":"8744","DOI":"10.1109\/TKDE.2024.3441766","volume":"36","author":"W Bi","year":"2024","unstructured":"Bi, W., Du, L., Fu, Q., Wang, Y., Han, S., Zhang, D.: Make heterophilic graphs better fit GNN: a graph rewiring approach. IEEE Trans. Knowl. Data Eng. 36(12), 8744\u20138757 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bo, D., Wang, X., Shi, C., Shen, H.: Beyond low-frequency information in graph convolutional networks. In: AAAI, pp. 3950\u20133957 (2021)","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"28_CR5","unstructured":"Chami, I., Ying, Z., R\u00e9, C., Leskovec, J.: Hyperbolic graph convolutional neural networks. In: NeurIPS, pp. 4869\u20134880 (2019)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., et al.: Fully hyperbolic neural networks. In: ACL, pp. 5672\u20135686 (2022)","DOI":"10.18653\/v1\/2022.acl-long.389"},{"key":"28_CR7","unstructured":"Chien, E., Peng, J., Li, P., Milenkovic, O.: Adaptive universal generalized pagerank graph neural network. In: ICLR (2021)"},{"key":"28_CR8","unstructured":"Chlenski, P., Chu, Q., Khan, R.R., Moretti, A.K., Pe\u2019er, I.: Mixed-curvature decision trees and random forests. arXiv abs\/2410.13879 (2024)"},{"key":"28_CR9","unstructured":"Cho, S., Cho, S., Park, S., Lee, H., Lee, H., Lee, M.: Curve your attention: Mixed-curvature transformers for graph representation learning. arXiv abs\/2309.04082 (2023)"},{"key":"28_CR10","unstructured":"Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: NIPS, pp. 3837\u20133845 (2016)"},{"key":"28_CR11","unstructured":"Deng, C., Yue, Z., Zhang, Z.: Polynormer: Polynomial-expressive graph transformer in linear time. In: ICLR (2024)"},{"key":"28_CR12","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with pytorch geometric. arXiv abs\/1903.02428 (2019)"},{"key":"28_CR13","unstructured":"Fu, D., et al.: VCR-graphormer: A mini-batch graph transformer via virtual connections. In: ICLR (2024)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Gong, S., Zhou, J., Xie, C., Xuan, Q.: Neighborhood homophily-based graph convolutional network. In: CIKM, pp. 3908\u20133912 (2023)","DOI":"10.1145\/3583780.3615195"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Guo, Z., et al.: Graphmore: Mitigating topological heterogeneity via mixture of riemannian experts. In: AAAI, pp. 11754\u201311762 (2025)","DOI":"10.1609\/aaai.v39i11.33279"},{"key":"28_CR16","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"28_CR17","unstructured":"Kong, K., Chen, J., Kirchenbauer, J., Ni, R., Bruss, C.B., Goldstein, T.: GOAT: A global transformer on large-scale graphs. In: ICML. Proceedings of Machine Learning Research, vol.\u00a0202, pp. 17375\u201317390 (2023)"},{"key":"28_CR18","unstructured":"Lee, S.Y., Bu, F., Yoo, J., Shin, K.: Towards deep attention in graph neural networks: Problems and remedies. In: ICML. Proceedings of Machine Learning Research, vol.\u00a0202, pp. 18774\u201318795 (2023)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Li, B., Pan, E., Kang, Z.: Pc-conv: Unifying homophily and heterophily with two-fold filtering. In: AAAI, pp. 13437\u201313445 (2024)","DOI":"10.1609\/aaai.v38i12.29246"},{"key":"28_CR20","unstructured":"Li, X., et al.: Finding global homophily in graph neural networks when meeting heterophily. In: ICML. Proceedings of Machine Learning Research, vol.\u00a0162, pp. 13242\u201313256 (2022)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Liang, L., Hu, X., Xu, Z., Song, Z., King, I.: Predicting global label relationship matrix for graph neural networks under heterophily. In: NeurIPS (2023)","DOI":"10.52202\/075280-0480"},{"key":"28_CR22","unstructured":"Liang, L., Kim, S., Shin, K., Xu, Z., Pan, S., Qi, Y.: Sign is not a remedy: Multiset-to-multiset message passing for learning on heterophilic graphs. In: ICML (2024)"},{"issue":"19","key":"28_CR23","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1093\/bioinformatics\/btab224","volume":"37","author":"L Liu","year":"2021","unstructured":"Liu, L., Mamitsuka, H., Zhu, S.: Hpofiller: identifying missing protein-phenotype associations by graph convolutional network. Bioinform. 37(19), 3328\u20133336 (2021)","journal-title":"Bioinform."},{"issue":"3","key":"28_CR24","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1093\/bioinformatics\/btab729","volume":"38","author":"L Liu","year":"2022","unstructured":"Liu, L., Mamitsuka, H., Zhu, S.: Hpodnets: deep graph convolutional networks for predicting human protein-phenotype associations. Bioinform. 38(3), 799\u2013808 (2022)","journal-title":"Bioinform."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Luan, S., et al.: Revisiting heterophily for graph neural networks. In: NeurIPS (2022)","DOI":"10.52202\/068431-0100"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Luan, S., et\u00a0al.: The heterophilic graph learning handbook: Benchmarks, models, theoretical analysis, applications and challenges. arXiv abs\/2407.09618 (2024)","DOI":"10.2139\/ssrn.5347632"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Ma, J., He, M., Wei, Z.: Polyformer: Scalable node-wise filters via polynomial graph transformer. In: KDD, pp. 2118\u20132129 (2024)","DOI":"10.1145\/3637528.3671849"},{"key":"28_CR28","unstructured":"Pei, H., et al.: Multi-track message passing: Tackling oversmoothing and oversquashing in graph learning via preventing heterophily mixing. In: ICML (2024)"},{"key":"28_CR29","unstructured":"Pei, H., Wei, B., Chang, K.C., Lei, Y., Yang, B.: Geom-GCN: Geometric graph convolutional networks. In: ICLR (2020)"},{"key":"28_CR30","unstructured":"Platonov, O., Kuznedelev, D., Diskin, M., Babenko, A., Prokhorenkova, L.: A critical look at the evaluation of GNNs under heterophily: Are we really making progress? In: ICLR (2023)"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Allen, C., Sarkar, R.: Multi-scale attributed node embedding. J. Complex Netw. 9(2) (2021)","DOI":"10.1093\/comnet\/cnab014"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: CIKM, pp. 1325\u20131334 (2020)","DOI":"10.1145\/3340531.3411866"},{"key":"28_CR33","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. arXiv abs\/1811.05868 (2018)"},{"key":"28_CR34","unstructured":"Song, Y., Zhou, C., Wang, X., Lin, Z.: Ordered GNN: ordering message passing to deal with heterophily and over-smoothing. In: ICLR (2023)"},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"Sun, L., et al.: A self-supervised mixed-curvature graph neural network. In: AAAI, pp. 4146\u20134155 (2022)","DOI":"10.1609\/aaai.v36i4.20333"},{"key":"28_CR36","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS, pp. 5998\u20136008 (2017)"},{"key":"28_CR37","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: ICLR (2018)"},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Wu, L., Wang, H., Chen, E., Li, Z., Zhao, H., Ma, J.: Preference enhanced social influence modeling for network-aware cascade prediction. In: SIGIR, pp. 2704\u20132708 (2022)","DOI":"10.1145\/3477495.3532042"},{"key":"28_CR39","doi-asserted-by":"crossref","unstructured":"Wu, Q., Zhao, W., Yang, C., Zhang, H., Nie, F., Jiang, H., Bian, Y., Yan, J.: Simplifying and empowering transformers for large-graph representations. In: NeurIPS (2023)","DOI":"10.52202\/075280-2826"},{"key":"28_CR40","doi-asserted-by":"crossref","unstructured":"Wu, S., Sun, F., Zhang, W., Xie, X., Cui, B.: Graph neural networks in recommender systems: a survey. ACM Comput. Surv. 55(5), 97:1\u201397:37 (2023)","DOI":"10.1145\/3535101"},{"key":"28_CR41","doi-asserted-by":"crossref","unstructured":"Yang, M., Verma, H., Zhang, D.C., Liu, J., King, I., Ying, R.: Hypformer: exploring efficient transformer fully in hyperbolic space. In: KDD, pp. 3770\u20133781 (2024)","DOI":"10.1145\/3637528.3672039"},{"key":"28_CR42","doi-asserted-by":"crossref","unstructured":"Yang, M., Zhou, M., Pan, L., King, I.: $$\\kappa $$HGCN: tree-likeness modeling via continuous and discrete curvature learning. In: KDD, pp. 2965\u20132977 (2023)","DOI":"10.1145\/3580305.3599532"},{"issue":"1","key":"28_CR43","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14778\/3421424.3421430","volume":"14","author":"R Yang","year":"2020","unstructured":"Yang, R., Shi, J., Xiao, X., Yang, Y., Liu, J., Bhowmick, S.S.: Scaling attributed network embedding to massive graphs. Proc. VLDB Endow. 14(1), 37\u201349 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"28_CR44","unstructured":"Yang, Z., Cohen, W.W., Salakhutdinov, R.: Revisiting semi-supervised learning with graph embeddings. In: ICML. JMLR Workshop and Conference Proceedings, vol.\u00a048, pp. 40\u201348 (2016)"},{"key":"28_CR45","unstructured":"Zheng, Y., Zhang, H., Lee, V.C., Zheng, Y., Wang, X., Pan, S.: Finding the missing-half: Graph complementary learning for homophily-prone and heterophily-prone graphs. In: ICML. Proceedings of Machine Learning Research, vol.\u00a0202, pp. 42492\u201342505 (2023)"},{"key":"28_CR46","unstructured":"Zhou, K., Huang, X., Li, Y., Zha, D., Chen, R., Hu, X.: Towards deeper graph neural networks with differentiable group normalization. In: NeurIPS (2020)"},{"key":"28_CR47","unstructured":"Zhu, J., Yan, Y., Zhao, L., Heimann, M., Akoglu, L., Koutra, D.: Beyond homophily in graph neural networks: Current limitations and effective designs. In: NeurIPS (2020)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4367-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:39:28Z","timestamp":1783107568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4367-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,22]]},"ISBN":["9789819543663","9789819543670"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4367-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,22]]},"assertion":[{"value":"22 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okinawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2025.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}