{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:32:01Z","timestamp":1777941121973,"version":"3.51.4"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB2903904"],"award-info":[{"award-number":["2023YFB2903904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB2903904"],"award-info":[{"award-number":["2023YFB2903904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB2903904"],"award-info":[{"award-number":["2023YFB2903904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92270106"],"award-info":[{"award-number":["92270106"]}],"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":["92270106"],"award-info":[{"award-number":["92270106"]}],"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":["92270106"],"award-info":[{"award-number":["92270106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["4242039"],"award-info":[{"award-number":["4242039"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["4242039"],"award-info":[{"award-number":["4242039"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["4242039"],"award-info":[{"award-number":["4242039"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10994-026-07014-0","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:12:16Z","timestamp":1777702336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Searching to Evolve for Heterophily-Agnostic Network Learning"],"prefix":"10.1007","volume":"115","author":[{"given":"Shuhan","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lanning","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiquan","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanming","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,2]]},"reference":[{"key":"7014_CR1","doi-asserted-by":"crossref","unstructured":"Cheng, A.-C., Lin, C.H., Juan, D.-C., Wei, W., & Sun, M. (2020). Instanas: Instance-aware neural architecture search. In: AAAI, vol. 34, pp. 3577\u20133584.","DOI":"10.1609\/aaai.v34i04.5764"},{"key":"7014_CR2","unstructured":"Chien, E., Peng, J., Li, P., & Milenkovic, O. (2021). Adaptive universal generalized pagerank graph neural network. ICLR."},{"key":"7014_CR3","unstructured":"Dai, E., Zhou, S., Guo, Z., & Wang, S. (2022). Label-wise graph convolutional network for heterophilic graphs. In: Learning on graphs conference, pp. 26\u20131. PMLR."},{"key":"7014_CR4","unstructured":"Dong, X., & Yang, Y. (2020). Nas-bench-201: Extending the scope of reproducible neural architecture search."},{"key":"7014_CR5","doi-asserted-by":"crossref","unstructured":"Du, L., Shi, X., Fu, Q., Ma, X., Liu, H., Han, S., & Zhang, D. (2022). Gbk-gnn: Gated bi-kernel graph neural networks for modeling both homophily and heterophily. In: ACM Web conference, pp. 1550\u20131558.","DOI":"10.1145\/3485447.3512201"},{"key":"7014_CR6","doi-asserted-by":"crossref","unstructured":"Fang, Z., Xu, L., Song, G., Long, Q., & Zhang, Y. (2022). Polarized graph neural networks. In: ACM web conference, pp. 1404\u20131413.","DOI":"10.1145\/3485447.3512187"},{"key":"7014_CR7","unstructured":"Fey, M., & Lenssen, J. E. (2019). Fast graph representation learning with PyTorch geometric."},{"key":"7014_CR8","unstructured":"Gao, Y., Yang, H., Zhang, P., Zhou, C., & Hu, Y. (2020). Graphnas: Graph neural architecture search with reinforcement learning. In: IJCAI"},{"key":"7014_CR9","doi-asserted-by":"crossref","unstructured":"Gasteiger, J., Bojchevski, A., & G\u00fcnnemann, S. (2019). Predict then propagate: Graph neural networks meet personalized pagerank. ICLR.","DOI":"10.1145\/3394486.3403296"},{"key":"7014_CR10","doi-asserted-by":"crossref","unstructured":"Guo, J., Huang, K., Yi, X., & Zhang, R. (2023). Graph neural networks with diverse spectral filtering. In: ACM web conference, pp. 306\u2013316.","DOI":"10.1145\/3543507.3583324"},{"key":"7014_CR11","unstructured":"Hamilton, W., Ying, Z.,& Leskovec, J. (2017). Inductive representation learning on large graphs. In: NeurIPS, pp. 1024\u20131034."},{"key":"7014_CR12","unstructured":"Han, Y., Huang, G., Song, S., Yang, L., Wang, H., & Wang, Y. (2021). Dynamic neural networks: A survey. IEEE transactions on pattern analysis and machine intelligence."},{"key":"7014_CR13","doi-asserted-by":"crossref","unstructured":"He, M., Wei, Z., & Wen, J.-R. (2022). Convolutional neural networks on graphs with chebyshev approximation, revisited. In: NeurIPS.","DOI":"10.52202\/068431-0527"},{"key":"7014_CR14","first-page":"22118","volume":"33","author":"W Hu","year":"2020","unstructured":"Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M., & Leskovec, J. (2020). Open graph benchmark: Datasets for machine learning on graphs. NeurIPS, 33, 22118\u201322133.","journal-title":"NeurIPS"},{"key":"7014_CR65","doi-asserted-by":"crossref","unstructured":"Hu, Y., Li, D., Sun, P., Yi, P. and Wu, J. (2020). Polymorphic smart network: an open, flexible and universal architecture for future heterogeneous networks. IEEE Transactions on Network Science and Engineering, 7(4), pp. 2515\u20132525.","DOI":"10.1109\/TNSE.2020.3006249"},{"key":"7014_CR15","unstructured":"Jin, D., Yu, Z., Huo, C., Wang, R., Wang, X., He, D., & Han, J. (2021). Universal graph convolutional networks. NeurIPS,34, 10654\u201310664."},{"key":"7014_CR16","unstructured":"Kipf, T. N., & Welling, M. (2016). Semi-supervised classification with graph convolutional networks."},{"key":"7014_CR18","doi-asserted-by":"crossref","unstructured":"Lai, K.-H., Zha, D., Zhou, K., & Hu, X. (2020). Policy-gnn: Aggregation optimization for graph neural networks. In: KDD, pp. 461\u2013471.","DOI":"10.1145\/3394486.3403088"},{"key":"7014_CR20","doi-asserted-by":"crossref","unstructured":"Li, B., Pan, E., & Kang, Z. (2024). Pc-conv: Unifying homophily and heterophily with two-fold filtering. In: Proceedings of the AAAI conference on artificial intelligence, vol. 38, pp. 13437\u201313445.","DOI":"10.1609\/aaai.v38i12.29246"},{"key":"7014_CR67","unstructured":"Li, J., Hu, Y., Cui, P., Tian, L. and Dong, Y. (2023). Research on incremental deployment mechanism of network modality for polymorphic network environment. Dianxin Kexue, 39, pp. 33\u201343."},{"key":"7014_CR24","first-page":"20887","volume":"34","author":"D Lim","year":"2021","unstructured":"Lim, D., Hohne, F., Li, X., Huang, S. L., Gupta, V., Bhalerao, O., & Lim, S. N. (2021). Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. Advances in Neural Information Processing Systems, 34, 20887\u201320902.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7014_CR23","unstructured":"Lim, D., Li, X., Hohne, F., & Lim, S.-N. (2021). New benchmarks for learning on non-homophilous graphs. arXiv preprint arXiv:2104.01404"},{"key":"7014_CR25","unstructured":"Liu, H., Simonyan, K., & Yang, Y. (2019). DARTS: Differentiable architecture search. ICLR."},{"key":"7014_CR22","unstructured":"Li, X., Zhu, R., Cheng, Y., Shan, C., Luo, S., Li, D., & Qian, W. (2022). Finding global homophily in graph neural networks when meeting heterophily. ICML."},{"key":"7014_CR19","doi-asserted-by":"crossref","unstructured":"Li, Y., & King, I. (2020). Autograph: Automated graph neural network. In: ICONIP, pp. 189\u2013201.","DOI":"10.1007\/978-3-030-63833-7_16"},{"key":"7014_CR21","doi-asserted-by":"crossref","unstructured":"Li, Y., Wen, Z., & Wang, Y., Xu, C. (2021). One-shot graph neural architecture search with dynamic search space. In: AAAI.","DOI":"10.1609\/aaai.v35i10.17033"},{"key":"7014_CR68","doi-asserted-by":"crossref","unstructured":"Li, Z., Lin, B., Jiang, W., & Tian, L. (2025). Efficient Multi-Topology Failure Tolerance Mechanism in Polymorphic Network. Electronics, 14(18), 3573.","DOI":"10.3390\/electronics14183573"},{"key":"7014_CR26","unstructured":"Luan, S., Hua, C., Lu, Q., Zhu, J., Zhao, M., Zhang, S., Chang, X.-W., & Precup, D. (2021). Is heterophily a real nightmare for graph neural networks to do node classification? arXiv preprint arXiv:2109.05641."},{"key":"7014_CR27","unstructured":"Luan, S., Hua, C., Lu, Q., Zhu, J., Zhao, M., Zhang, S., Chang, X.-W., & Precup, D. (2022). Revisiting heterophily for graph neural networks. In: NeurIPS."},{"key":"7014_CR30","doi-asserted-by":"crossref","unstructured":"Maurya, S.K., Liu, X., & Murata, T. (2022). Not all neighbors are friendly: Learning to choose hop features to improve node classification. In: Proceedings of the 31st ACM international conference on information & knowledge management, pp. 4334\u20134338.","DOI":"10.1145\/3511808.3557543"},{"key":"7014_CR28","doi-asserted-by":"crossref","unstructured":"Ma, X., Chen, Q., Ren, Y., Song, G., & Wang, L. (2022). Meta-weight graph neural network: Push the limits beyond global homophily. In: Proceedings of the ACM web conference 2022, pp. 1270\u20131280.","DOI":"10.1145\/3485447.3512100"},{"key":"7014_CR29","unstructured":"Ma, Y., Liu, X., Shah, N., & Tang, J. (2022). Is homophily a necessity for graph neural networks?"},{"key":"7014_CR31","unstructured":"Pan, E., & Kang, Z. (2023). Beyond homophily: Reconstructing structure for graph-agnostic clustering. arXiv preprint arXiv:2305.02931."},{"key":"7014_CR32","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. In: NeurIPS, pp. 8026\u20138037."},{"key":"7014_CR33","unstructured":"Pei, H., Wei, B., Chang, K. C.-C., Lei, Y., & Yang, B. (2020). Geom-gcn: Geometric graph convolutional networks."},{"key":"7014_CR34","unstructured":"Platonov, O., Kuznedelev, D., Diskin, M., Babenko, A., & Prokhorenkova, L. (2023). A critical look at the evaluation of gnns under heterophily: Are we really making progress? In: The eleventh international conference on learning representations."},{"key":"7014_CR35","doi-asserted-by":"crossref","unstructured":"Qiu, C., Nan, G., Xiong, T., Deng, W., Wang, D., Teng, Z., Sun, L., Cui, Q., & Tao, X. (2024). Refining latent homophilic structures over heterophilic graphs for robust graph convolution networks. In: Proceedings of the AAAI conference on artificial intelligence, vol. 38, pp. 8930\u20138938.","DOI":"10.1609\/aaai.v38i8.28741"},{"key":"7014_CR36","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., & Sarkar, R. (2020). Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. In: CIKM, pp. 1325\u20131334.","DOI":"10.1145\/3340531.3411866"},{"key":"7014_CR37","unstructured":"Rusch, T. K., Chamberlain, B. P., Mahoney, M. W., Bronstein, M. M., & Mishra, S. (2023). Gradient gating for deep multi-rate learning on graphs. ICLR."},{"issue":"3","key":"7014_CR38","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., & Eliassi-Rad, T. (2008). Collective classification in network data. AI Magazine, 29(3), 93\u201393.","journal-title":"AI Magazine"},{"key":"7014_CR39","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., & G\u00fcnnemann, S. (2018). Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868."},{"key":"7014_CR40","doi-asserted-by":"crossref","unstructured":"Suresh, S., Budde, V., Neville, J., Li, P., & Ma, J. (2021). Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns. In: KDD.","DOI":"10.1145\/3447548.3467373"},{"key":"7014_CR42","doi-asserted-by":"crossref","unstructured":"Tang, J., Sun, J., Wang, C., & Yang, Z. (2009). Social influence analysis in large-scale networks. In: KDD, pp. 807\u2013816.","DOI":"10.1145\/1557019.1557108"},{"key":"7014_CR41","doi-asserted-by":"crossref","unstructured":"Tan, Q., Zhang, X., Liu, N., Zha, D., Li, L., Chen, R., Choi, S.-H., & Hu, X. (2023). Bring your own view: Graph neural networks for link prediction with personalized subgraph selection. WSDM.","DOI":"10.1145\/3539597.3570407"},{"key":"7014_CR43","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., & Bengio, Y. (2018). Graph attention networks."},{"key":"7014_CR45","doi-asserted-by":"crossref","unstructured":"Wang, T., Jin, D., Wang, R., He, D., & Huang, Y. (2022). Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily. In: AAAI, vol. 36, pp. 4210\u20134218.","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"7014_CR44","unstructured":"Wang, X., & Zhang, M. (2022). How powerful are spectral graph neural networks. In: ICML, pp. 23341\u201323362. PMLR."},{"key":"7014_CR47","unstructured":"Wang, X., Zhang, Z., & Zhu, W. (2022). Automated graph machine learning: Approaches, libraries and directions. arXiv preprint arXiv:2201.01288"},{"key":"7014_CR46","doi-asserted-by":"crossref","unstructured":"Wang, Z., Wei, Z., Li, Y., Kuang, W., & Ding, B. (2022). Graph neural networks with node-wise architecture. In: KDD, pp. 1949\u20131958.","DOI":"10.1145\/3534678.3539387"},{"key":"7014_CR48","doi-asserted-by":"crossref","unstructured":"Wei, L., Zhao, H., & He, Z. (2022). Designing the topology of graph neural networks: A novel feature fusion perspective. In: ACM web conference, pp. 1381\u20131391.","DOI":"10.1145\/3485447.3512185"},{"key":"7014_CR66","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, J., Sun, P., Hu, Y. and Li, Z. (2024). Theoretical framework for a polymorphic network environment. Engineering, 39, pp. 222\u2013234.","DOI":"10.1016\/j.eng.2024.01.018"},{"key":"7014_CR49","unstructured":"Xiangning, C., & Cho-Jui, H. (2020). Stabilizing differentiable architecture search via perturbation-based regularization."},{"key":"7014_CR50","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How powerful are graph neural networks?."},{"key":"7014_CR51","unstructured":"Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.-I., & Jegelka, S. (2018). Representation learning on graphs with jumping knowledge networks. In: ICML, pp. 5453\u20135462."},{"key":"7014_CR54","doi-asserted-by":"crossref","unstructured":"Yang, Y., Sun, Y., Wang, S., Guo, J., Gao, J., Ju, F., & Yin, B. (2024). Graph neural networks with soft association between topology and attribute. In: Proceedings of the AAAI conference on artificial intelligence, vol. 38, pp. 9260\u20139268.","DOI":"10.1609\/aaai.v38i8.28778"},{"key":"7014_CR52","doi-asserted-by":"crossref","unstructured":"Yan, Y., Chen, Y., Chen, H., Xu, M., Das, M., Yang, H., & Tong, H. (2024). From trainable negative depth to edge heterophily in graphs. Advances in Neural Information Processing Systems, 36.","DOI":"10.52202\/075280-3074"},{"key":"7014_CR53","doi-asserted-by":"crossref","unstructured":"Yan, Y., Hashemi, M., Swersky, K., Yang, Y., & Koutra, D. (2022). Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In: ICDM, pp. 1287\u20131292. IEEE.","DOI":"10.1109\/ICDM54844.2022.00169"},{"key":"7014_CR55","doi-asserted-by":"crossref","unstructured":"Yoon, M., Gervet, T., Hooi, B., & Faloutsos, C. (2020). Autonomous graph mining algorithm search with best speed\/accuracy trade-off.","DOI":"10.1109\/ICDM50108.2020.00084"},{"key":"7014_CR56","first-page":"17009","volume":"33","author":"J You","year":"2020","unstructured":"You, J., Ying, Z., & Leskovec, J. (2020). Design space for graph neural networks. Advances in Neural Information Processing Systems, 33, 17009\u201317021.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7014_CR57","doi-asserted-by":"crossref","unstructured":"Yuan, K., Li, Q., Guo, S., Chen, D., Zhou, A., Yu, F., & Liu, Z. (2021). Differentiable dynamic wirings for neural networks. In: ICCV, pp. 327\u2013336.","DOI":"10.1109\/ICCV48922.2021.00038"},{"key":"7014_CR58","unstructured":"Zeng, H., Zhou, H., Srivastava, A., Kannan, R., & Prasanna, V. (2020). Graphsaint: Graph sampling based inductive learning method."},{"key":"7014_CR59","unstructured":"Zhang, W., Lin, Z., Shen, Y., Li, Y., Yang, Z., & Cui, B. (2022) Deep and flexible graph neural architecture search. In: ICML, pp. 26362\u201326374. PMLR."},{"key":"7014_CR60","unstructured":"Zhao, H., Wei, L., & Yao, Q. (2020). Simplifying architecture search for graph neural network."},{"key":"7014_CR61","doi-asserted-by":"crossref","unstructured":"Zhao, H., Yao, Q., & Tu, W. (2021). Search to aggregate neighborhood for graph neural network. In: ICDE.","DOI":"10.1109\/ICDE51399.2021.00054"},{"key":"7014_CR62","doi-asserted-by":"crossref","unstructured":"Zheng, X., Zhang, M., Chen, C., Zhang, Q., Zhou, C., & Pan, S. (2023). Auto-heg: Automated graph neural network on heterophilic graphs. ACM web conference.","DOI":"10.1145\/3543507.3583498"},{"key":"7014_CR63","unstructured":"Zhu, J., Yan, Y., Heimann, M., Zhao, L., Akoglu, L., & Koutra, D. (2023). Heterophily and graph neural networks: Past, present and future. In IEEE data engineering bulletin."},{"key":"7014_CR64","first-page":"7793","volume":"33","author":"J Zhu","year":"2020","unstructured":"Zhu, J., Yan, Y., Zhao, L., Heimann, M., Akoglu, L., & Koutra, D. (2020). Beyond homophily in graph neural networks: Current limitations and effective designs. NeurIPS, 33, 7793\u20137804.","journal-title":"NeurIPS"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07014-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07014-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07014-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:12:26Z","timestamp":1777702346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07014-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":67,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["7014"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07014-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"21 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"112"}}