{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T10:52:08Z","timestamp":1781866328843,"version":"3.54.5"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08645-9","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T10:08:24Z","timestamp":1781863704000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A line graph-based metric learning framework for robust link prediction in complex networks"],"prefix":"10.1007","volume":"82","author":[{"given":"Adil Imad Eddine","family":"Hosni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Islam","family":"Baira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Badis","family":"Djamaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u2019hamed","family":"Mataoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdellah","family":"Hamouda Sidhoum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hichem","family":"Merini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed Chakib","family":"Amrani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,19]]},"reference":[{"key":"8645_CR1","doi-asserted-by":"publisher","unstructured":"Zhang M, Chen Y (2017) Weisfeiler-Lehman neural machine for link prediction. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, Halifax, NS, Canada, pp. 575-583. https:\/\/doi.org\/10.1145\/3097983.3097996","DOI":"10.1145\/3097983.3097996"},{"issue":"1","key":"8645_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","volume":"104","author":"M Nickel","year":"2015","unstructured":"Nickel M, Murphy K, Tresp V, Gabrilovich E (2015) A review of relational machine learning for knowledge graphs. Proc IEEE 104(1):11\u201333. https:\/\/doi.org\/10.1109\/JPROC.2015.2483592","journal-title":"Proc IEEE"},{"issue":"4","key":"8645_CR3","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1093\/bioinformatics\/btw684","volume":"33","author":"T Oyetunde","year":"2017","unstructured":"Oyetunde T, Zhang M, Chen Y, Tang Y, Lo C (2017) BoostGAPFILL: improving the fidelity of metabolic network reconstructions through integrated constraint and pattern-based methods. Bioinformatics 33(4):608\u2013611. https:\/\/doi.org\/10.1093\/bioinformatics\/btw684","journal-title":"Bioinformatics"},{"issue":"1","key":"8645_CR4","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1038\/s41467-019-09177-y","volume":"10","author":"IA Kov\u00e1cs","year":"2019","unstructured":"Kov\u00e1cs IA, Luck K, Spirohn K, Wang Y, Pollis C, Schlabach S, Bian W, Kim D-K, Kishore N, Hao T et al (2019) Network-based prediction of protein interactions. Nat Commun 10(1):1240. https:\/\/doi.org\/10.1038\/s41467-019-09177-y","journal-title":"Nat Commun"},{"issue":"5439","key":"8645_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"issue":"3","key":"8645_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230. https:\/\/doi.org\/10.1016\/S0378-8733(03)00009-1","journal-title":"Soc Netw"},{"key":"8645_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71:623\u2013630. https:\/\/doi.org\/10.1140\/epjb\/e2009-00335-8","journal-title":"Eur Phys J B"},{"issue":"8","key":"8645_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337. https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"8645_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105151","volume":"115","author":"MA Ganaie","year":"2022","unstructured":"Ganaie MA, Hu M, Malik A, Tanveer M, Suganthan P (2022) Ensemble deep learning: a review. Eng Appl Artif Intell 115:105151. https:\/\/doi.org\/10.1016\/j.engappai.2022.105151","journal-title":"Eng Appl Artif Intell"},{"key":"8645_CR10","doi-asserted-by":"publisher","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: Large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences, New York, NY, USA, pp 1067\u20131077. https:\/\/doi.org\/10.1145\/2736277.2741093","DOI":"10.1145\/2736277.2741093"},{"issue":"1","key":"8645_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/s10489-023-04819-3","volume":"54","author":"Y Yao","year":"2024","unstructured":"Yao Y, He Y, Huang Z, Xu Z, Yang F, Tang J, Gao K (2024) Deep non-negative matrix factorization with edge generator for link prediction in complex networks. Appl Intell 54(1):592\u2013613. https:\/\/doi.org\/10.1007\/s10489-023-04819-3","journal-title":"Appl Intell"},{"key":"8645_CR12","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Adv Neural Inf Process Syst. https:\/\/doi.org\/10.48550\/arXiv.1802.09691"},{"key":"8645_CR13","doi-asserted-by":"publisher","unstructured":"Cai L, Ji S (2020) A multi-scale approach for graph link prediction. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp 3308-3315 . https:\/\/doi.org\/10.1609\/AAAI.V34I04.5731","DOI":"10.1609\/AAAI.V34I04.5731"},{"key":"8645_CR14","doi-asserted-by":"publisher","unstructured":"Chamberlain BP, Shirobokov S, Rossi E, Frasca F, Markovich T, Hammerla NY, Bronstein MM (2023) Graph neural networks for link prediction with subgraph sketching. In: International Conference on Learning Representations (ICLR). https:\/\/doi.org\/10.48550\/arXiv.2209.15486","DOI":"10.48550\/arXiv.2209.15486"},{"issue":"9","key":"8645_CR15","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1109\/TPAMI.2021.3080635","volume":"44","author":"L Cai","year":"2021","unstructured":"Cai L, Li J, Wang J, Ji S (2021) Line graph neural networks for link prediction. IEEE Trans Pattern Anal Mach Intell 44(9):5103\u20135113. https:\/\/doi.org\/10.1109\/TPAMI.2021.3080635","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8645_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109537","volume":"140","author":"Z Zhang","year":"2023","unstructured":"Zhang Z, Sun S, Ma G, Zhong C (2023) Line graph contrastive learning for link prediction. Pattern Recogn 140:109537. https:\/\/doi.org\/10.1016\/j.patcog.2023.109537","journal-title":"Pattern Recogn"},{"key":"8645_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2025.130406","volume":"661","author":"J Liang","year":"2025","unstructured":"Liang J, Pu C, Shu X, Xia Y, Xia C (2025) Line graph neural networks for link weight prediction. Phys A 661:130406. https:\/\/doi.org\/10.1016\/j.physa.2025.130406","journal-title":"Phys A"},{"key":"8645_CR18","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1007\/s11227-023-05591-8","volume":"80","author":"D Arrar","year":"2024","unstructured":"Arrar D, Kamel N, Lakhfif A (2024) A comprehensive survey of link prediction methods. J Supercomput 80:3902\u20133942. https:\/\/doi.org\/10.1007\/s11227-023-05591-8","journal-title":"J Supercomput"},{"issue":"15","key":"8645_CR19","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1007\/s11227-025-07882-8","volume":"81","author":"T Ben Smida","year":"2025","unstructured":"Ben Smida T, Bouslimi R, Achour H (2025) A comprehensive survey on link prediction: from heuristics to graph transformers. J Supercomput 81(15):1388. https:\/\/doi.org\/10.1007\/s11227-025-07882-8","journal-title":"J Supercomput"},{"issue":"1","key":"8645_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343. https:\/\/doi.org\/10.1007\/BF02289026","journal-title":"Psychometrika"},{"issue":"18","key":"8645_CR21","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833. https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007","journal-title":"Comput Netw"},{"key":"8645_CR22","doi-asserted-by":"publisher","unstructured":"Jeh G, Widom J (2002) Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, pp 538\u2013543. https:\/\/doi.org\/10.1145\/775047.775126","DOI":"10.1145\/775047.775126"},{"key":"8645_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-024-00958-z","author":"Z Liu","year":"2024","unstructured":"Liu Z, Yao Y, Xu Z (2024) RB-based: link prediction based on the resource broadcast of nodes for complex networks. Evol Intel. https:\/\/doi.org\/10.1007\/s12065-024-00958-z","journal-title":"Evol Intel"},{"key":"8645_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2025.122051","volume":"709","author":"Z Kong","year":"2025","unstructured":"Kong Z, Zhai S, Wang L, Guo G (2025) A general link prediction method based on path node information and source node information. Inf Sci 709:122051. https:\/\/doi.org\/10.1016\/j.ins.2025.122051","journal-title":"Inf Sci"},{"key":"8645_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/s0129183125500330","author":"Y Liu","year":"2025","unstructured":"Liu Y, Kong Z, Zhai S, Wang L, Guo G (2025) BSSLP: a zero-similarity resolving link prediction method combining base and structural similarities in complex networks. Int J Mod Phys C. https:\/\/doi.org\/10.1142\/s0129183125500330","journal-title":"Int J Mod Phys C"},{"key":"8645_CR26","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, pp 855-864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"issue":"2","key":"8645_CR27","doi-asserted-by":"publisher","first-page":"8297","DOI":"10.1007\/s11227-023-05767-2","volume":"80","author":"Y Shu","year":"2024","unstructured":"Shu Y, Dai Y (2024) An effective link prediction method for industrial knowledge graphs by incorporating entity description and neighborhood structure information. J Supercomput 80(2):8297\u20138329. https:\/\/doi.org\/10.1007\/s11227-023-05767-2","journal-title":"J Supercomput"},{"key":"8645_CR28","doi-asserted-by":"publisher","unstructured":"Zhang S, Zhang J, Song X, Adeshina S, Zheng D, Faloutsos C, Sun Y (2023) PaGE-link: path-based graph neural network explanation for heterogeneous link prediction, pp 3784\u20133793 https:\/\/doi.org\/10.1145\/3543507.3583511","DOI":"10.1145\/3543507.3583511"},{"key":"8645_CR29","doi-asserted-by":"publisher","unstructured":"Zhu H, Luo D, Tang X, Xu J, Liu H, Wang S (2023) Self-explainable graph neural networks for link prediction. arXiv preprint arXiv:2305.12578, https:\/\/doi.org\/10.48550\/arXiv.2305.12578","DOI":"10.48550\/arXiv.2305.12578"},{"key":"8645_CR30","doi-asserted-by":"publisher","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. In: NIPS Workshop on Bayesian Deep Learning . https:\/\/doi.org\/10.48550\/arXiv.1611.07308","DOI":"10.48550\/arXiv.1611.07308"},{"key":"8645_CR31","doi-asserted-by":"publisher","unstructured":"Kipf T, Fetaya E, Wang KC, Welling M, Zemel R (2018) Neural relational inference for interacting systems. In: International Conference on Machine Learning, PMLR, pp 2688-2697 . https:\/\/doi.org\/10.48550\/arXiv.1802.04687","DOI":"10.48550\/arXiv.1802.04687"},{"key":"8645_CR32","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton WL, Li\u00f2 P, Bengio Y, Hjelm RD (2019) Deep graph infomax. In: International Conference on Learning Representations (ICLR). https:\/\/doi.org\/10.48550\/arXiv.1809.10341","DOI":"10.48550\/arXiv.1809.10341"},{"key":"8645_CR33","doi-asserted-by":"crossref","unstructured":"Dai Q, Li Q, Tang J, Wang D (2018) Adversarial network embedding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1. https:\/\/doi.org\/10.1609\/aaai.v32i1.11686","DOI":"10.1609\/aaai.v32i1.11865"},{"issue":"7","key":"8645_CR34","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1109\/TNNLS.2019.2921841","volume":"31","author":"H Hong","year":"2020","unstructured":"Hong H, Lu R, Xu J, Liu H, Lan M (2020) GANE: a generative adversarial network embedding. IEEE Trans Neural Netw Learn Syst 31(7):2325\u20132335. https:\/\/doi.org\/10.1109\/TNNLS.2019.2921841","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"8645_CR35","doi-asserted-by":"publisher","unstructured":"Li H, Xu Y, Li Y, Liu H, Li D, Zhang C.J, Chen L, Li Q (2025) When speed meets accuracy: an efficient and effective graph model for temporal link prediction (eagle). In: Proceedings of the VLDB Endowment, vol. 18, pp 3396-3405 . https:\/\/doi.org\/10.14778\/3748191.3748203","DOI":"10.14778\/3748191.3748203"},{"key":"8645_CR36","doi-asserted-by":"publisher","unstructured":"Gao J, Wu J, Ding J (2025) Hyperevent: a strong baseline for dynamic link prediction via relative structural encoding. arXiv preprint https:\/\/doi.org\/10.48550\/arXiv.2507.11836","DOI":"10.48550\/arXiv.2507.11836"},{"key":"8645_CR37","doi-asserted-by":"publisher","unstructured":"Li H, Wan H, Chen Y, Ye D, Gel Y, Jiang H (2025) TMetaNet: topological meta-learning framework for dynamic link prediction. arXiv preprint, https:\/\/doi.org\/10.48550\/arXiv.2506.00453","DOI":"10.48550\/arXiv.2506.00453"},{"key":"8645_CR38","first-page":"129101","volume":"38","author":"D Li","year":"2026","unstructured":"Li D, Tan S, Zhang Y, Jin M, Pan S, Okumura M, Jiang R (2026) DyG-mamba: continuous state space modeling on dynamic graphs. Adv Neural Inf Process Syst 38:129101\u2013129130","journal-title":"Adv Neural Inf Process Syst"},{"key":"8645_CR39","unstructured":"Li D, Zheng S, Xu C, Bian J, Jiang R (2026) Routing channel-patch dependencies in time series forecasting with graph spectral decomposition. arXiv:2603.13702 arXiv preprint"},{"key":"8645_CR40","doi-asserted-by":"publisher","unstructured":"Nouranizadeh A, Far FT, Rahmati M (2024) Contrastive representation learning for dynamic link prediction in temporal networks. arXiv preprint, https:\/\/doi.org\/10.48550\/arXiv.2408.12753","DOI":"10.48550\/arXiv.2408.12753"},{"issue":"6755","key":"8645_CR41","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791. https:\/\/doi.org\/10.1038\/44565","journal-title":"Nature"},{"issue":"6","key":"8645_CR42","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1109\/TKDE.2016.2635227","volume":"29","author":"Y-X Wang","year":"2017","unstructured":"Wang Y-X, Zhang Y-J (2017) Nonnegative matrix factorization: a comprehensive review. IEEE Trans Knowl Data Eng 29(6):1338\u20131352. https:\/\/doi.org\/10.1109\/TKDE.2016.2635227","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8645_CR43","doi-asserted-by":"publisher","unstructured":"Trigeorgis G, Bousmalis K, Zafeiriou S, Schuller BW (2014) A deep matrix factorization method for learning attribute representations. In: 2014 22nd European Signal Processing Conference (EUSIPCO), pp 1347\u20131351 . https:\/\/doi.org\/10.1109\/TPAMI.2016.2554555 . IEEE","DOI":"10.1109\/TPAMI.2016.2554555"},{"issue":"4","key":"8645_CR44","doi-asserted-by":"publisher","first-page":"4567","DOI":"10.3233\/JIFS-212206","volume":"43","author":"G Chen","year":"2022","unstructured":"Chen G, Zhou S, Liu Y et al (2022) Deep nonnegative matrix factorization for community detection and link prediction. J Intell Fuzzy Syst 43(4):4567\u20134579. https:\/\/doi.org\/10.3233\/JIFS-212206","journal-title":"J Intell Fuzzy Syst"},{"issue":"6","key":"8645_CR45","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s11227-024-06013-z","volume":"81","author":"M Li","year":"2025","unstructured":"Li M, Zhou S, Wang D, Chen G (2025) A unified temporal link prediction framework based on nonnegative matrix factorization and graph regularization. J Supercomput 81(6):774. https:\/\/doi.org\/10.1007\/s11227-024-06013-z","journal-title":"J Supercomput"},{"key":"8645_CR46","doi-asserted-by":"publisher","unstructured":"Li D, Kosugi S, Zhang Y, Okumura M, Xia F, Jiang R (2025) Revisiting dynamic graph clustering via matrix factorization. In: Proceedings of the ACM on Web Conference 2025. WWW \u201925. Association for Computing Machinery, New York, NY, USA, pp 1342-1352. https:\/\/doi.org\/10.1145\/3696410.3714646","DOI":"10.1145\/3696410.3714646"},{"key":"8645_CR47","unstructured":"Tola A, Kumar S, Coskunuzer B (2025) DuoLink: a dual perspective on link prediction via line graphs"},{"key":"8645_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108657","volume":"120","author":"U Zulaika","year":"2022","unstructured":"Zulaika U, S\u00e1nchez-Corcuera R, Almeida A, L\u00f3pez-de-Ipi\u00f1a D (2022) LWP-WL: link weight prediction based on CNNs and the Weisfeiler-Lehman algorithm. Appl Soft Comput 120:108657. https:\/\/doi.org\/10.1016\/j.asoc.2022.108657","journal-title":"Appl Soft Comput"},{"key":"8645_CR49","doi-asserted-by":"publisher","unstructured":"Zhang M, Li P, Xia Y, Wang K, Jin L (2021) Neural bellman-ford networks: a general graph neural network framework for link prediction. Adv Neural Inf Process Syst 34:29476\u201329490. https:\/\/doi.org\/10.5555\/3540261.3542517","DOI":"10.5555\/3540261.3542517"},{"issue":"8","key":"8645_CR50","doi-asserted-by":"publisher","first-page":"2312527121","DOI":"10.1073\/pnas.2312527121","volume":"121","author":"N Menand","year":"2024","unstructured":"Menand N, Seshadhri C (2024) Link prediction using low-dimensional node embeddings: the measurement problem. Proc Natl Acad Sci 121(8):2312527121. https:\/\/doi.org\/10.1073\/pnas.2312527121","journal-title":"Proc Natl Acad Sci"},{"issue":"8","key":"8645_CR51","doi-asserted-by":"publisher","first-page":"6531","DOI":"10.1109\/TPAMI.2025.3560423","volume":"47","author":"GG Chrysos","year":"2025","unstructured":"Chrysos GG, Wu Y, Pascanu R, Torr PH, Cevher V (2025) Hadamard product in deep learning: introduction, advances and challenges. IEEE Trans Pattern Anal Mach Intell 47(8):6531\u20136549. https:\/\/doi.org\/10.1109\/TPAMI.2025.3560423","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8645_CR52","first-page":"17009","volume":"33","author":"J You","year":"2020","unstructured":"You J, Ying Z, Leskovec J (2020) Design space for graph neural networks. Adv Neural Inf Process Syst 33:17009\u201317021","journal-title":"Adv Neural Inf Process Syst"},{"key":"8645_CR53","doi-asserted-by":"publisher","unstructured":"Perez E, Strub F, De\u00a0Vries H, Dumoulin V, Courville A (2018) Film: Visual reasoning with a general conditioning layer. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32. https:\/\/doi.org\/10.5555\/3504035.3504518","DOI":"10.5555\/3504035.3504518"},{"key":"8645_CR54","doi-asserted-by":"publisher","unstructured":"Bodnar C, Frasca F, Wang Y.G, Otter N, Montufar G.F, Li\u00f3 P, Bronstein M (2021) Weisfeiler and Lehman go topological: Message passing simplicial networks. In: International Conference on Machine Learning (ICML), pp 1026\u20131037. https:\/\/doi.org\/10.48550\/arXiv.2103.03212","DOI":"10.48550\/arXiv.2103.03212"},{"key":"8645_CR55","unstructured":"Chen J, Chen Z, Yu L, Zhao H (2021) Link prediction with persistent homology: an interactive view. In: International Conference on Machine Learning (ICML), pp 1821-1831"},{"key":"8645_CR56","doi-asserted-by":"publisher","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International Conference on Learning Representations (ICLR). https:\/\/doi.org\/10.48550\/arXiv.1810.00826","DOI":"10.48550\/arXiv.1810.00826"},{"issue":"6","key":"8645_CR57","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman DA, Srivastava N (2011) Graph sparsification by effective resistances. SIAM J Comput 40(6):1913\u20131926. https:\/\/doi.org\/10.1137\/080734029","journal-title":"SIAM J Comput"},{"key":"8645_CR58","doi-asserted-by":"publisher","unstructured":"Cohen M.B, Kelner J, Kyng R, Peebles J, Peng R, Rao AB, Sidford A (2015) Nearly linear-time spectral graph reduction for scalable graph partitioning and data visualization. 1508(1), 00190. arXiv preprint arXiv:1508.00190, https:\/\/doi.org\/10.48550\/arXiv.1812.08942","DOI":"10.48550\/arXiv.1812.08942"},{"key":"8645_CR59","doi-asserted-by":"publisher","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems (NeurIPS), vol. 30. https:\/\/doi.org\/10.48550\/arXiv.1706.02216","DOI":"10.48550\/arXiv.1706.02216"},{"key":"8645_CR60","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108473","volume":"124","author":"F Boutros","year":"2022","unstructured":"Boutros F, Damer N, Kirchbuchner F, Kuijper A (2022) Self-restrained triplet loss for accurate masked face recognition. Pattern Recogn 124:108473. https:\/\/doi.org\/10.1016\/j.patcog.2021.108473","journal-title":"Pattern Recogn"},{"issue":"6684","key":"8645_CR61","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"2","key":"8645_CR62","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404\u2013409. https:\/\/doi.org\/10.1073\/pnas.98.2.404","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"8645_CR63","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 Mag 29(3):93\u2013106. https:\/\/doi.org\/10.1609\/aimag.v29i3.2157","journal-title":"AI Mag"},{"key":"8645_CR64","doi-asserted-by":"publisher","unstructured":"Gehrke J, Ginsparg P, Kleinberg J (2003) Overview of the 2003 KDD cup. In: ACM SIGKDD Explorations Newsletter, vol. 5. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/980972.980992","DOI":"10.1145\/980972.980992"},{"issue":"6","key":"8645_CR65","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383. https:\/\/doi.org\/10.2307\/3001968","journal-title":"Biom Bull"},{"issue":"3","key":"8645_CR66","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1037\/0033-2909.114.3.494","volume":"114","author":"N Cliff","year":"1993","unstructured":"Cliff N (1993) Dominance statistics: ordinal analyses to answer ordinal questions. Psychol Bull 114(3):494. https:\/\/doi.org\/10.1037\/0033-2909.114.3.494","journal-title":"Psychol Bull"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08645-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08645-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08645-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T10:08:34Z","timestamp":1781863714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08645-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,19]]},"references-count":66,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["8645"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08645-9","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,19]]},"assertion":[{"value":"25 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"During the preparation of this work, the authors used AI-assisted tools solely for language proofreading. The ideas, experimental protocol, and manuscript writing were entirely conceived, developed, and executed by the authors. After using AI for language refinement, the authors carefully reviewed and edited the content as needed and take full responsibility for the final version of the publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Generative AI and AI-assisted technologies in the writing process"}}],"article-number":"512"}}