{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:19:24Z","timestamp":1774419564251,"version":"3.50.1"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,6]]},"DOI":"10.1109\/icassp49660.2025.10890271","type":"proceedings-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:52:43Z","timestamp":1741787563000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Topology-Informed Pre-training of Graph Neural Networks"],"prefix":"10.1109","author":[{"given":"Peiyu","family":"Liang","sequence":"first","affiliation":[{"name":"Temple University,Department of Computer and Information Sciences,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulia R.","family":"Gel","sequence":"additional","affiliation":[{"name":"Virginia Tech,Department of Statistics,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhou","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California,Department of Statistics,Riverside,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Strategies for pre-training graph neural networks","author":"Hu","year":"2020","journal-title":"ICLR"},{"key":"ref2","article-title":"Train once and explain everywhere: Pre-training interpretable graph neural networks","author":"Yin","year":"2023","journal-title":"NeurIPS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997870"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.29026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892133"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1146-y"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/9781108975704"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.09.028"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i11.21514"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2023.3266956"},{"key":"ref14","article-title":"Deep learning with topological signatures","author":"Hofer","year":"2017","journal-title":"NeurIPS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005929"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i17.17791"},{"key":"ref17","first-page":"27978","article-title":"ToDD: Topological compound fingerprinting in computer-aided drug discovery","volume":"35","author":"Demir","year":"2022","journal-title":"NeurIPS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26390-3_19"},{"key":"ref19","article-title":"Link prediction with persistent homology: An interactive view","author":"Yan","journal-title":"ICML"},{"key":"ref20","article-title":"Time-conditioned dances with simplicial complexes: Zigzag filtration curve based supra-hodge convolution networks for time-series forecasting","author":"Chen","year":"2022","journal-title":"NeurIPS"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25866"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.29051"},{"key":"ref23","first-page":"4330","article-title":"Tensor-view topological graph neural network","volume-title":"AISTATS","author":"Wen","year":"2024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671980"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i15.33691"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403237"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467396"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25870"},{"key":"ref31","first-page":"1025","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017","journal-title":"NeurIPS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac100"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599546"},{"key":"ref34","article-title":"How to find your friendly neighborhood: Graph attention design with self-supervision","author":"Kim","year":"2021","journal-title":"ICLR"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16552"},{"key":"ref36","first-page":"10294","article-title":"Self-supervised auxiliary learning with meta-paths for heterogeneous graphs","volume":"33","author":"Hwang","year":"2020","journal-title":"NeurIPS"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.17986"},{"key":"ref38","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"NeurIPS"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"ref40","article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","author":"Sun","year":"2019","journal-title":"ICLR"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref42","article-title":"Universal prompt tuning for graph neural networks","author":"Fang","year":"2023","journal-title":"NeurIPS"},{"key":"ref43","first-page":"2177","article-title":"Virtual node tuning for few-shot node classification","author":"Tan","year":"2023","journal-title":"KDD"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"ref47","article-title":"Revisiting semi-supervised learning with graph embeddings","author":"Yang","year":"2016","journal-title":"ICML"},{"key":"ref48","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013","journal-title":"ICLR"},{"key":"ref49","first-page":"291","article-title":"Subgraph matching kernels for attributed graphs","author":"Kriege","year":"2012","journal-title":"ICML"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref51","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"ICLR"},{"key":"ref52","article-title":"ProG: A graph prompt learning benchmark","author":"Zi","year":"2024"}],"event":{"name":"ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Hyderabad, India","start":{"date-parts":[[2025,4,6]]},"end":{"date-parts":[[2025,4,11]]}},"container-title":["ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10887540\/10887541\/10890271.pdf?arnumber=10890271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:23:32Z","timestamp":1774416212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10890271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,6]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/icassp49660.2025.10890271","relation":{},"subject":[],"published":{"date-parts":[[2025,4,6]]}}}