{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T19:53:39Z","timestamp":1782849219609,"version":"3.54.5"},"reference-count":87,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2410-H-011-026-MY3"],"award-info":[{"award-number":["114-2410-H-011-026-MY3"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers and Electrical Engineering"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.compeleceng.2026.111341","type":"journal-article","created":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:41:46Z","timestamp":1782222106000},"page":"111341","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Graph contrastive link prediction with theoretical guarantees via model-aware augmentations and structure-aware alignment"],"prefix":"10.1016","volume":"139","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0102-447X","authenticated-orcid":false,"given":"Chih-Chieh","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming-Hung","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.compeleceng.2026.111341_b1","series-title":"Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining","first-page":"635","article-title":"Supervised random walks: Predicting and recommending links in social networks","author":"Backstrom","year":"2011"},{"key":"10.1016\/j.compeleceng.2026.111341_b2","series-title":"Proceedings of the 2011 SIAM international conference on data mining","first-page":"91","article-title":"Temporal link prediction using matrix and tensor factorizations","author":"Dunlavy","year":"2011"},{"key":"10.1016\/j.compeleceng.2026.111341_b3","series-title":"Mining of massive datasets","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1017\/9781108684163","author":"Leskovec","year":"2020","ISBN":"https:\/\/id.crossref.org\/isbn\/9781108476348"},{"issue":"9","key":"10.1016\/j.compeleceng.2026.111341_b4","doi-asserted-by":"crossref","first-page":"4509","DOI":"10.1109\/TVT.2011.2168247","article-title":"S-AKA: A provable and secure authentication key agreement protocol for UMTS networks","volume":"60","author":"Huang","year":"2011","journal-title":"IEEE Trans Veh Technol"},{"issue":"4","key":"10.1016\/j.compeleceng.2026.111341_b5","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1109\/JSYST.2021.3139319","article-title":"GDPR-aware revocable P2P file-sharing system over consortium blockchain","volume":"16","author":"Yeh","year":"2022","journal-title":"IEEE Syst J"},{"key":"10.1016\/j.compeleceng.2026.111341_b6","article-title":"Link prediction approach based on graph neural networks","author":"L\u00fc","year":"2011","journal-title":"Proc Int Conf Neural Networks Signal Process"},{"key":"10.1016\/j.compeleceng.2026.111341_b7","series-title":"Machine learning models and algorithms for big data classification: A survey","author":"Suthaharan","year":"2015"},{"issue":"4","key":"10.1016\/j.compeleceng.2026.111341_b8","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1007\/s10618-024-01038-7","article-title":"Improving graph-based recommendation with unraveled graph learning","volume":"38","author":"Chang","year":"2024","journal-title":"Data Min Knowl Discov"},{"key":"10.1016\/j.compeleceng.2026.111341_b9","series-title":"2017 IEEE 10th conference on service-oriented computing and applications","first-page":"206","article-title":"A consumer review-driven recommender service for web e-commerce","author":"Lin","year":"2017"},{"issue":"6","key":"10.1016\/j.compeleceng.2026.111341_b10","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2005.99","article-title":"Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions","volume":"17","author":"Adomavicius","year":"2005","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"10.1016\/j.compeleceng.2026.111341_b11","first-page":"384","article-title":"A survey of knowledge graph-based link prediction methods","volume":"31","author":"Xiong","year":"2017","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"10.1016\/j.compeleceng.2026.111341_b12","first-page":"5","article-title":"A survey of network anomaly detection techniques","volume":"11","author":"Ahmed","year":"2015","journal-title":"Comput Sci Eng"},{"issue":"4","key":"10.1016\/j.compeleceng.2026.111341_b13","first-page":"355","article-title":"Epidemic spread modeling in social networks: A survey","volume":"11","author":"Jiang","year":"2014","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"10.1016\/j.compeleceng.2026.111341_b14","series-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"10.1016\/j.compeleceng.2026.111341_b15","unstructured":"Velickovic P, et al. Graph attention networks. In: Proceedings of the international conference on learning representations. 2018."},{"key":"10.1016\/j.compeleceng.2026.111341_b16","unstructured":"Chen X, et al. A simple framework for contrastive learning of visual representations. In: Proceedings of the international conference on machine learning. 2020."},{"key":"10.1016\/j.compeleceng.2026.111341_b17","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Graph contrastive learning with augmentations","author":"You","year":"2020"},{"key":"10.1016\/j.compeleceng.2026.111341_b18","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Link prediction based on graph neural networks","author":"Zhang","year":"2018"},{"key":"10.1016\/j.compeleceng.2026.111341_b19","series-title":"Neural link prediction with walk pooling","author":"Pan","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b20","series-title":"Proceedings of the web conference","article-title":"Graph contrastive learning with adaptive augmentation","author":"Zhu","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b21","unstructured":"Wang T, Isola P. Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hypersphere. In: Proceedings of the 37th international conference on machine learning. 2020."},{"key":"10.1016\/j.compeleceng.2026.111341_b22","series-title":"International conference on machine learning","article-title":"Graph contrastive learning automated","author":"You","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b23","series-title":"Proceedings of the 15th ACM international conference on web search and data mining","article-title":"Bringing your own view: Graph contrastive learning without prefabricated data augmentations","author":"You","year":"2022"},{"issue":"1\u20132","key":"10.1016\/j.compeleceng.2026.111341_b24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","article-title":"Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013seidel methods","volume":"137","author":"Attouch","year":"2013","journal-title":"Math Program"},{"issue":"1\u20132","key":"10.1016\/j.compeleceng.2026.111341_b25","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte","year":"2014","journal-title":"Math Program"},{"key":"10.1016\/j.compeleceng.2026.111341_b26","series-title":"Conference on learning theory","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"Lee","year":"2016"},{"issue":"1\u20132","key":"10.1016\/j.compeleceng.2026.111341_b27","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","article-title":"First-order methods almost always avoid strict saddle points","volume":"176","author":"Lee","year":"2019","journal-title":"Math Program"},{"key":"10.1016\/j.compeleceng.2026.111341_b28","series-title":"CIKM","article-title":"Variational graph normalized autoencoders","author":"Ahn","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b29","series-title":"WSDM","article-title":"Multi-scale variational graph AutoEncoder for link prediction","author":"Guo","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b30","series-title":"WSDM","article-title":"S2GAE: Self-supervised graph autoencoders are generalizable learners with graph masking","author":"Tan","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b31","series-title":"Advances in neural information processing systems","first-page":"13683","article-title":"Neo-GNNs: Neighborhood overlap-aware graph neural networks for link prediction","volume":"vol. 34","author":"Yun","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b32","series-title":"The twelfth international conference on learning representations","article-title":"Neural common neighbor with completion for link prediction","author":"Wang","year":"2024"},{"key":"10.1016\/j.compeleceng.2026.111341_b33","series-title":"ICML","first-page":"1263","article-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017"},{"key":"10.1016\/j.compeleceng.2026.111341_b34","series-title":"The twelfth international conference on learning representations","article-title":"Revisiting link prediction: a data perspective","author":"Mao","year":"2024"},{"key":"10.1016\/j.compeleceng.2026.111341_b35","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"14964","article-title":"Structural information enhanced graph representation for link prediction","volume":"vol. 38","author":"Shi","year":"2024"},{"key":"10.1016\/j.compeleceng.2026.111341_b36","doi-asserted-by":"crossref","first-page":"65823","DOI":"10.52202\/079017-2104","article-title":"On the impact of feature heterophily on link prediction with graph neural networks","volume":"37","author":"Zhu","year":"2024","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.compeleceng.2026.111341_b37","doi-asserted-by":"crossref","unstructured":"Mattos J, Huang Z, Kosan M, Singh A, Silva A. Attribute-Enhanced Similarity Ranking for Sparse Link Prediction. In: Proceedings of the 31st ACM SIGKDD conference on knowledge discovery and data mining v. 1. 2025, p. 1044\u201355.","DOI":"10.1145\/3690624.3709314"},{"key":"10.1016\/j.compeleceng.2026.111341_b38","series-title":"Forty-second international conference on machine learning","article-title":"Open your eyes: Vision enhances message passing neural networks in link prediction","author":"Wei","year":"2025"},{"key":"10.1016\/j.compeleceng.2026.111341_b39","doi-asserted-by":"crossref","unstructured":"Song Y, Hua Z, Shomer H, Xie Y, Liu J, Long B, Liu H. A Scalable Pretraining Framework for Link Prediction with Efficient Adaptation. In: Proceedings of the 31st ACM SIGKDD conference on knowledge discovery and data mining v. 2. 2025, p. 2621\u201332.","DOI":"10.1145\/3711896.3736822"},{"key":"10.1016\/j.compeleceng.2026.111341_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2024.109927","article-title":"Heterogeneous graph transformer auto-encoder for multivariate time series forecasting","volume":"122","author":"Ye","year":"2025","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111341_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2024.109304","article-title":"Heterogeneous data augmentation in graph contrastive learning for effective negative samples","volume":"118","author":"Ali","year":"2024","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111341_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2024.109213","article-title":"Dual-view multi-modal contrastive learning for graph-based recommender systems","volume":"116","author":"Guo","year":"2024","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111341_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2022.108541","article-title":"A causal-based symbolic reasoning framework for uncertain knowledge graphs","volume":"105","author":"Lu","year":"2023","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111341_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2022.107835","article-title":"Structural\u2013temporal embedding of large-scale dynamic networks with parallel implementation","volume":"100","author":"Xie","year":"2022","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111341_b45","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"17877","article-title":"Accurate link prediction for edge-incomplete graphs via PU learning","volume":"vol. 39","author":"Kim","year":"2025"},{"key":"10.1016\/j.compeleceng.2026.111341_b46","doi-asserted-by":"crossref","unstructured":"Chang C-H, Hung H-J, Lu C-H, Shen C-Y. Enhancing Contrastive Link Prediction With Edge Balancing Augmentation. In: Proceedings of the 34th ACM international conference on information and knowledge management. 2025, p. 199\u2013208.","DOI":"10.1145\/3746252.3760994"},{"key":"10.1016\/j.compeleceng.2026.111341_b47","unstructured":"Tan S, Li D, Jiang R, Zhang Y, Okumura M. Community-invariant graph contrastive learning. In: Proceedings of the 41st international conference on machine learning. 2024."},{"key":"10.1016\/j.compeleceng.2026.111341_b48","doi-asserted-by":"crossref","unstructured":"Tan S, You J, Li D. Temporality-and frequency-aware graph contrastive learning for temporal network. In: Proceedings of the 31st ACM international conference on information & knowledge management. 2022, p. 1878\u201388.","DOI":"10.1145\/3511808.3557469"},{"key":"10.1016\/j.compeleceng.2026.111341_b49","article-title":"DyGMamba: Efficiently modeling long-term temporal dependency on continuous-time dynamic graphs with state space models","author":"Ding","year":"2025","journal-title":"Trans Mach Learn Res","ISSN":"https:\/\/id.crossref.org\/issn\/2835-8856","issn-type":"print"},{"key":"10.1016\/j.compeleceng.2026.111341_b50","doi-asserted-by":"crossref","unstructured":"Li D, Tan S, Wang Y, Funakoshi K, Okumura M. Temporal and topological augmentation-based cross-view contrastive learning model for temporal link prediction. In: Proceedings of the 32nd ACM international conference on information and knowledge management. 2023, p. 4059\u201363.","DOI":"10.1145\/3583780.3615231"},{"key":"10.1016\/j.compeleceng.2026.111341_b51","doi-asserted-by":"crossref","first-page":"141153","DOI":"10.52202\/079017-4482","article-title":"Improving temporal link prediction via temporal walk matrix projection","volume":"37","author":"Lu","year":"2024","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.compeleceng.2026.111341_b52","series-title":"ICLR","article-title":"Graph neural networks for link prediction with subgraph sketching","author":"Chamberlain","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b53","series-title":"2013 IEEE 13th international conference on data mining","first-page":"677","article-title":"On pattern preserving graph generation","author":"Shuai","year":"2013"},{"key":"10.1016\/j.compeleceng.2026.111341_b54","doi-asserted-by":"crossref","unstructured":"Ma L, Han H, Li J, Shomer H, Liu H, Gao X, Tang J. Mixture of Link Predictors on Graphs. In: The thirty-eighth annual conference on neural information processing systems. 2024.","DOI":"10.52202\/079017-0511"},{"key":"10.1016\/j.compeleceng.2026.111341_b55","doi-asserted-by":"crossref","unstructured":"Shomer H, Ma Y, Mao H, Li J, Wu B, Tang J. LPFormer: an adaptive graph transformer for link prediction. In: Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining. 2024, p. 2686\u201398.","DOI":"10.1145\/3637528.3672025"},{"key":"10.1016\/j.compeleceng.2026.111341_b56","doi-asserted-by":"crossref","unstructured":"Zangari L, Mandaglio D, Tagarelli A. Link prediction on multilayer networks through learning of within-layer and across-layer node-pair structural features and node embedding similarity. In: Proceedings of the ACM web conference 2024. 2024, p. 924\u201335.","DOI":"10.1145\/3589334.3645646"},{"key":"10.1016\/j.compeleceng.2026.111341_b57","series-title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","isbn-type":"print","author":"Mattos","year":"2025","ISBN":"https:\/\/id.crossref.org\/isbn\/9798400712456"},{"key":"10.1016\/j.compeleceng.2026.111341_b58","series-title":"ICML","first-page":"9929","article-title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere","author":"Wang","year":"2020"},{"key":"10.1016\/j.compeleceng.2026.111341_b59","doi-asserted-by":"crossref","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L. Graph Contrastive Learning with Adaptive Augmentation. In: The web conference. 2021.","DOI":"10.1145\/3442381.3449802"},{"key":"10.1016\/j.compeleceng.2026.111341_b60","series-title":"AAAI","article-title":"AutoGCL: Automated graph contrastive learning via learnable view generators","author":"Yin","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b61","series-title":"Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining","article-title":"GraphMAE: Self-supervised masked graph autoencoders","author":"Hou","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b62","series-title":"Proceedings of the web conference","article-title":"GraphMAE2: A decoding-enhanced masked self-supervised graph learner","author":"Hou","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b63","series-title":"Proceedings of the web conference","article-title":"SimGRACE: A simple framework for graph contrastive learning without data augmentation","author":"Xia","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b64","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"7372","article-title":"Augmentation-free self-supervised learning on graphs","author":"Lee","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b65","series-title":"International conference on machine learning","article-title":"ProGCL: Rethinking hard negative mining in graph contrastive learning","author":"Xia","year":"2022"},{"key":"10.1016\/j.compeleceng.2026.111341_b66","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Certifiably robust graph contrastive learning","author":"Lin","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b67","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Provable training for graph contrastive learning","author":"Yu","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b68","series-title":"Advances in neural information processing systems (neurIPS)","article-title":"Simple and asymmetric graph contrastive learning on homophilic and heterophilic graphs","author":"Xiao","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b69","doi-asserted-by":"crossref","unstructured":"Bengio Y, Louradour J, Collobert R, Weston J. Curriculum learning. In: Proceedings of the 26th annual international conference on machine learning. 2009, p. 41\u20138.","DOI":"10.1145\/1553374.1553380"},{"issue":"11","key":"10.1016\/j.compeleceng.2026.111341_b70","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1145\/3442381.3450025","article-title":"CurGraph: Curriculum learning for graph classification","author":"Wang","year":"2021","journal-title":"Proc Web Conf 2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b71","series-title":"Proceedings of the sixteenth ACM international conference on web search and data mining","isbn-type":"print","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/3539597.3570385","article-title":"CLNode: Curriculum learning for node classification","author":"Wei","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450394079"},{"key":"10.1016\/j.compeleceng.2026.111341_b72","series-title":"Proceedings of the 37th international conference on neural information processing systems","article-title":"Curriculum learning for graph neural networks: which edges should we learn first","author":"Zhang","year":"2024"},{"key":"10.1016\/j.compeleceng.2026.111341_b73","series-title":"Proceedings of the thirtieth international joint conference on artificial intelligence, IJCAI-21","first-page":"2300","article-title":"CuCo: Graph representation with curriculum contrastive learning","author":"Chu","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b74","series-title":"Multi-scale contrastive siamese networks for self-supervised graph representation learning","author":"Jin","year":"2021"},{"key":"10.1016\/j.compeleceng.2026.111341_b75","series-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"10.1016\/j.compeleceng.2026.111341_b76","doi-asserted-by":"crossref","unstructured":"Vincent P, Larochelle H, Bengio Y, Manzagol P-A. Extracting and composing robust features with denoising autoencoders. In: Proceedings of the 25th international conference on machine learning. 2008, p. 1096\u2013103.","DOI":"10.1145\/1390156.1390294"},{"key":"10.1016\/j.compeleceng.2026.111341_b77","series-title":"Towards graph contrastive learning: A survey and beyond","author":"Ju","year":"2024"},{"key":"10.1016\/j.compeleceng.2026.111341_b78","series-title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining","first-page":"507","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","author":"Bojchevski","year":"2018"},{"key":"10.1016\/j.compeleceng.2026.111341_b79","series-title":"ICLR","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020"},{"key":"10.1016\/j.compeleceng.2026.111341_b80","series-title":"KDD","first-page":"843","article-title":"Image-based recommendations on styles and substitutes","author":"McAuley","year":"2015"},{"key":"10.1016\/j.compeleceng.2026.111341_b81","series-title":"Proceedings of the 2018 IEEE\/ACM international conference on advances in social networks analysis and mining","first-page":"65","article-title":"GEMSEC: Graph embedding with self clustering","author":"Rozemberczki","year":"2018"},{"key":"10.1016\/j.compeleceng.2026.111341_b82","series-title":"International conference on learning representations","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"Zeng","year":"2020"},{"key":"10.1016\/j.compeleceng.2026.111341_b83","doi-asserted-by":"crossref","unstructured":"Park J, Jung H, Park H. CIMAGE: Exploiting the Conditional Independence in Masked Graph Auto-encoders. In: Proceedings of the eighteenth ACM international conference on web search and data mining. 2025, p. 10\u20139.","DOI":"10.1145\/3701551.3703515"},{"key":"10.1016\/j.compeleceng.2026.111341_b84","series-title":"LUMEN\/LUMENC Reproducibility Package","author":"Anonymous Authors","year":"2026"},{"key":"10.1016\/j.compeleceng.2026.111341_b85","series-title":"WSDM","first-page":"23","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","author":"Cai","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111341_b86","series-title":"SIGIR","first-page":"639","article-title":"LightGCN: Simplifying and powering graph convolution network for recommendation","author":"He","year":"2020"},{"issue":"4","key":"10.1016\/j.compeleceng.2026.111341_b87","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","article-title":"Cumulated gain-based evaluation of IR techniques","volume":"20","author":"J\u00e4rvelin","year":"2002","journal-title":"ACM Trans Inf Syst (TOIS)"}],"container-title":["Computers and Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790626004118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790626004118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T19:09:36Z","timestamp":1782846576000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790626004118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":87,"alternative-id":["S0045790626004118"],"URL":"https:\/\/doi.org\/10.1016\/j.compeleceng.2026.111341","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph contrastive link prediction with theoretical guarantees via model-aware augmentations and structure-aware alignment","name":"articletitle","label":"Article Title"},{"value":"Computers and Electrical Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compeleceng.2026.111341","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111341"}}