{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T15:46:54Z","timestamp":1768664814386,"version":"3.49.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Linkage Projects","award":["LP210100129"],"award-info":[{"award-number":["LP210100129"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tbdata.2025.3618447","type":"journal-article","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T17:50:39Z","timestamp":1759859439000},"page":"276-287","source":"Crossref","is-referenced-by-count":0,"title":["Differential Encoding for Improved Representation Learning Over Graphs"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0021-3634","authenticated-orcid":false,"given":"Haimin","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Electrical and Data Engineering, Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9628-9563","authenticated-orcid":false,"given":"Jiaohao","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Electrical and Data Engineering, Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9581-8849","authenticated-orcid":false,"given":"Min","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Electrical and Data Engineering, Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref2","first-page":"18774","article-title":"Towards deep attention in graph neural networks: Problems and remedies","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref3","first-page":"31613","article-title":"EXPHORMER: Sparse transformers for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shirzad"},{"key":"ref4","first-page":"21618","article-title":"Rethinking graph transformers with spectral attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kreuzer"},{"key":"ref5","article-title":"PairNorm: Tackling oversmoothing in GNN","author":"Zhao","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3188888"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3154778"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2024.3352978"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3266590"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3234529"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3188888"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/72.712151"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/72.572108"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2200\/S01045ED1V01Y202009AIM046"},{"key":"ref15","first-page":"14501","article-title":"Recipe for a general, powerful, scalable graph transformer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ramp\u00e1\u0161ek"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref17","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref18","first-page":"1","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bruna"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref20","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref21","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref22","article-title":"Residual gated graph convnets","author":"Bresson","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"key":"ref25","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref26","first-page":"35","article-title":"Rank collapse causes over-smoothing and over-correlation in graph neural networks","volume-title":"Proc. Learn. Graphs Conf.","author":"Roth"},{"key":"ref27","first-page":"28877","article-title":"Do transformers really perform badly for graph representation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref28","first-page":"13266","article-title":"Representing long-range context for graph neural networks with global attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref29","article-title":"Self-attention in colors: Another take on encoding graph structure in transformers","author":"Menegaux","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref32","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref34","first-page":"1","article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref35","first-page":"13260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Corso"},{"key":"ref36","first-page":"748","article-title":"Directional graph networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Beaini"},{"key":"ref37","first-page":"1","article-title":"Cycle to clique (CY2C) graph neural network: A sight to see beyond neighborhood aggregation","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Choi"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01059"},{"key":"ref39","article-title":"Graph learning with 1 D convolutions on random walks","author":"Toenshoff","year":"2021"},{"key":"ref40","article-title":"From stars to subgraphs: Uplifting any GNN with local structure awareness","author":"Zhao","year":"2021"},{"key":"ref41","article-title":"Provably powerful graph networks","author":"Maron","year":"2019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539296"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3228102"},{"key":"ref44","article-title":"Topology-informed graph transformer","author":"Choi","year":"2024"},{"key":"ref45","article-title":"Graph inductive biases in transformers without message passing","author":"Ma","year":"2023"},{"key":"ref46","first-page":"1","article-title":"Learning long range dependencies on graphs via random walks","volume-title":"Proc. 13th Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-025-60252-z"},{"key":"ref48","article-title":"Strategies for pre-training graph neural networks","author":"Hu","year":"2019"},{"key":"ref49","first-page":"22326","article-title":"Long range graph benchmark","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dwivedi"},{"key":"ref50","article-title":"Diffusing graph attention","author":"Glickman","year":"2023"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3168070"},{"issue":"43","key":"ref52","first-page":"1","article-title":"Benchmarking graph neural networks","volume":"24","author":"Dwivedi","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref54","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.120"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0275-4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10602-1_48"},{"key":"ref58","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref59","first-page":"1","article-title":"A unified framework for rank-based evaluation metrics for link prediction in knowledge graphs","volume-title":"Proc. Graph Learn. Benchmarks Workshop Web. Conf.","author":"Hoyt"},{"key":"ref60","article-title":"Decoupled weight decay regularization","author":"Loshchilov","year":"2017"},{"key":"ref61","first-page":"1","article-title":"Graph neural networks with learnable structural and positional representations","volume-title":"Proc. Intern. Conf. Learn. Representations","author":"Dwivedi"},{"key":"ref62","article-title":"Graphit: Encoding graph structure in transformers","author":"Mialon","year":"2021"},{"key":"ref63","first-page":"1","article-title":"GraphSaint: Graph sampling based inductive learning method","volume-title":"Proc. 13th Int. Conf. Learn. Representations","author":"Zeng"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/s1064827595287997"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11357241\/11194709.pdf?arnumber=11194709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:19:14Z","timestamp":1768627154000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11194709\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":64,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2025.3618447","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}