{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:13:15Z","timestamp":1763190795045,"version":"3.45.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1109\/ijcnn64981.2025.11227568","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:46:15Z","timestamp":1763145975000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Improving Graph Contrastive Learning with LLMs: A New Hardness-Aware Negative Sampling Strategy"],"prefix":"10.1109","author":[{"given":"Shuai","family":"Zhong","sequence":"first","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotong","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haorui","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinming","family":"Chen","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanxing","family":"Xu","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wu","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"Kipf","key":"ref1"},{"article-title":"Graph attention networks","year":"2017","author":"Veli\u010dkovi\u0107","key":"ref2"},{"article-title":"Bootstrapped representation learning on graphs","volume-title":"ICLR 2021 Workshop on Geometrical and Topological Representation Learning","author":"Thakoor","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"article-title":"Contrastive learning with hard negative samples","year":"2020","author":"Robinson","key":"ref5"},{"key":"ref6","first-page":"8765","article-title":"De-biased contrastive learning","volume":"33","author":"Chuang","year":"2020","journal-title":"Advances in neural information processing systems"},{"article-title":"Progcl: Rethinking hard negative mining in graph contrastive learning","year":"2021","author":"Xia","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26071"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651476"},{"issue":"3","key":"ref10","first-page":"4","article-title":"Deep graph infomax","volume-title":"ICLR (Poster)","volume":"2","author":"Velickovic"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512186"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52733.2024.02187"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW60847.2023.00145"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28709"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671448"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.801"},{"issue":"4","key":"ref19","first-page":"8","article-title":"Explanations as features: Llm-based features for text-attributed graphs","volume":"2","author":"He","year":"2023"},{"issue":"5","key":"ref20","first-page":"7","article-title":"Natural language is all a graph needs","volume":"4","author":"Ye","year":"2023"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.400"},{"article-title":"Representation learning with contrastive predictive coding","year":"2018","author":"Oord","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref24","first-page":"22 118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref27","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"International conference on machine learning","author":"Hassani"},{"article-title":"Deep graph contrastive representation learning","year":"2020","author":"Zhu","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28698"},{"article-title":"Llama 2: Open foundation and fine-tuned chat models","year":"2023","author":"Touvron","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463052"},{"key":"ref33","first-page":"21 798","article-title":"Hard negative mixing for contrastive learning","volume":"33","author":"Kalantidis","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583499"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599380"}],"event":{"name":"2025 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2025,6,30]]},"location":"Rome, Italy","end":{"date-parts":[[2025,7,5]]}},"container-title":["2025 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11227166\/11227148\/11227568.pdf?arnumber=11227568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:10:07Z","timestamp":1763190607000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11227568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ijcnn64981.2025.11227568","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}