{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:42:48Z","timestamp":1767678168504,"version":"3.48.0"},"reference-count":94,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276002"],"award-info":[{"award-number":["62276002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tkde.2025.3621493","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T17:41:39Z","timestamp":1760463699000},"page":"1364-1379","source":"Crossref","is-referenced-by-count":0,"title":["TowerDNA: Fast and Accurate Graph Retrieval With Dividing, Contrasting and Alignment"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0402-5147","authenticated-orcid":false,"given":"Junwei","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5915-4448","authenticated-orcid":false,"given":"Yiyang","family":"Gu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7520-8039","authenticated-orcid":false,"given":"Yifang","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7987-3714","authenticated-orcid":false,"given":"Xiao","family":"Luo","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Wisconsin–Madison, Madison, WI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8583-4789","authenticated-orcid":false,"given":"Zhiping","family":"Xiao","sequence":"additional","affiliation":[{"name":"Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9307-0566","authenticated-orcid":false,"given":"Kangjie","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9657-951X","authenticated-orcid":false,"given":"Wei","family":"Ju","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8232-5049","authenticated-orcid":false,"given":"Xian-Sheng","family":"Hua","sequence":"additional","affiliation":[{"name":"Terminus Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9809-3430","authenticated-orcid":false,"given":"Ming","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"12187","article-title":"Deep latent graph matching","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"ref3","first-page":"861","article-title":"Generalizing graph matching beyond quadratic assignment model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2023.3254518"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymeth.2014.08.005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298990"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/app9102110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/b:visi.0000029664.99615.94"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3447571"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1264"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103165"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3580511"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462960"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3102234"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401216"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.5b00654"},{"key":"ref22","article-title":"A dual augmented two-tower model for online large-scale recommendation","author":"Yu","year":"2021","journal-title":"DLP-KDD"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3386195"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591643"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i2.25363"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2013.05.013"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.26434\/chemrxiv-2022-jjm0j-v4","article-title":"Uni-mol: A universal 3D molecular representation learning framework","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Zhou","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3220219"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05855-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3160211"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441720"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3080635"},{"key":"ref34","first-page":"29476","article-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","volume-title":"Adv. Neural Inf. Process. Syst. 34: Annu. Conf. Neural Inf. Process. Syst.","author":"Zhu","year":"2021"},{"key":"ref35","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Defferrard"},{"article-title":"Deep convolutional networks on graph-structured data","year":"2015","author":"Henaff","key":"ref36"},{"article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf","key":"ref37"},{"article-title":"How powerful are graph neural networks","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Xu","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327389"},{"key":"ref40","first-page":"3734","article-title":"Self-attention graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref41","first-page":"20479","article-title":"3D infomax improves GNNs for molecular property prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"St\u00e4rk"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1101\/2024.04.13.589331","article-title":"Mol-AE: Auto-encoder based molecular representation learning with 3D cloze test objective","author":"Yang","year":"2024"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126441"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531770"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2007.367902"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"ref49","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst. 30: Annu. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20784"},{"key":"ref52","first-page":"30181","article-title":"Efficient graph similarity computation with alignment regularization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhuo"},{"key":"ref53","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref54","first-page":"529","article-title":"Semi-supervised learning by entropy minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Grandvalet"},{"article-title":"Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks","volume-title":"Proc. Workshop Challenges Representation Learn.","author":"Lee","key":"ref55"},{"key":"ref56","first-page":"18408","article-title":"Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref57","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9892241"},{"article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","year":"2019","author":"Sun","key":"ref59"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3164696"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/295"},{"article-title":"Towards understanding mixture of experts in deep learning","year":"2022","author":"Chen","key":"ref62"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01591"},{"article-title":"GPT-4 technical report","year":"2023","author":"Achiam","key":"ref64"},{"article-title":"Non-autoregressive neural machine translation","year":"2017","author":"Gu","key":"ref65"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3277122"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-021-01453-z"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011190"},{"key":"ref69","first-page":"21702","article-title":"Llm-pruner: On the structural pruning of large language models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ma"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3066410"},{"issue":"20","key":"ref71","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"Stat"},{"article-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"Kipf","key":"ref72"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00252"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00608"},{"article-title":"A new analysis of co-training","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","key":"ref75"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00674"},{"key":"ref77","first-page":"281","article-title":"Classification and analysis of multivariate observations","volume-title":"Proc. 5th Berkeley Symp. Math. Statist. Probability","author":"MacQueen"},{"article-title":"Tudataset: A collection of benchmark datasets for learning with graphs","year":"2020","author":"Morris","key":"ref78"},{"year":"2004","key":"ref79","article-title":"Aids antiviral screen"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_30"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105992"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16220-1_24"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2019.00100"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01117"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/292"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3580511"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403117"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3513546"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.52202\/079017-2466"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988796"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/295"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031549"},{"key":"ref94","first-page":"1195","article-title":"Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tarvainen"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11329113\/11203274.pdf?arnumber=11203274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:39:36Z","timestamp":1767677976000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11203274\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":94,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3621493","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}