{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:49:38Z","timestamp":1773971378735,"version":"3.50.1"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100019281","name":"Capital University of Economics and Business","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.patcog.2025.113034","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T16:11:17Z","timestamp":1767888677000},"page":"113034","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Uncovering capabilities of hash function in graph classification"],"prefix":"10.1016","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1584-1862","authenticated-orcid":false,"given":"Yingke","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8570-2252","authenticated-orcid":false,"given":"Shangzhe","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4794-5856","authenticated-orcid":false,"given":"Bowen","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6742-4332","authenticated-orcid":false,"given":"Junran","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2025.113034_bib0001","first-page":"27730","article-title":"Training language models to follow instructions with human feedback","volume":"35","author":"Ouyang","year":"2022","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0002","article-title":"Robust locality regularized non-negative matrix factorization with structure preservation for image classification","author":"Wan","year":"2025","journal-title":"Pattern Recognit"},{"key":"10.1016\/j.patcog.2025.113034_bib0003","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0004","series-title":"Iclr","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"key":"10.1016\/j.patcog.2025.113034_bib0005","article-title":"Global\u2013local evolution modeling with cyclic patterns for temporal knowledge graph reasoning","author":"Bi","year":"2025","journal-title":"Pattern Recognit"},{"issue":"5","key":"10.1016\/j.patcog.2025.113034_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3535101","article-title":"Graph neural networks in recommender systems: a survey","volume":"55","author":"Wu","year":"2022","journal-title":"ACM Comput Surv"},{"issue":"6","key":"10.1016\/j.patcog.2025.113034_bib0007","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1109\/72.471375","article-title":"Stochastic choice of basis functions in adaptive function approximation and the functional-link net","volume":"6","author":"Igelnik","year":"1995","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/j.patcog.2025.113034_bib0008","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4471-0847-4_6","article-title":"Random vector functional link (RVFL) networks","author":"Husmeier","year":"1999","journal-title":"Neural Networks for Conditional Probability Estimation: Forecasting Beyond Point Predictions"},{"issue":"9","key":"10.1016\/j.patcog.2025.113034_bib0009","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Leman","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"10.1016\/j.patcog.2025.113034_bib0010","article-title":"GraphST: class-Imbalanced node classification with semantic relation transfer","author":"Wang","year":"2025","journal-title":"Pattern Recognit"},{"key":"10.1016\/j.patcog.2025.113034_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.110977","article-title":"Group link prediction in bipartite graphs with graph neural networks","volume":"158","author":"Luo","year":"2025","journal-title":"Pattern Recognit"},{"issue":"9","key":"10.1016\/j.patcog.2025.113034_bib0012","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.patcog.2025.113034_bib0013","series-title":"Forty-second International Conference on Machine Learning","article-title":"Learn beneficial noise as graph augmentation","author":"Huang","year":"2025"},{"issue":"11","key":"10.1016\/j.patcog.2025.113034_bib0014","doi-asserted-by":"crossref","first-page":"7451","DOI":"10.1109\/TPAMI.2024.3392782","article-title":"Decouple graph neural networks: train multiple simple GNNs simultaneously instead of one","volume":"46","author":"Zhang","year":"2024","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10.1016\/j.patcog.2025.113034_bib0015","series-title":"International Conference on Machine Learning","article-title":"Structural entropy guided graph hierarchical pooling","author":"Wu","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0016","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","article-title":"An end-to-end deep learning architecture for graph classification","volume":"32","author":"Zhang","year":"2018"},{"key":"10.1016\/j.patcog.2025.113034_bib0017","series-title":"Proceedings of the 31-St International Joint Conference on Artificial Intelligence","article-title":"A simple yet effective method for graph classification","author":"Wu","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0018","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.neucom.2017.08.040","article-title":"A review on neural networks with random weights","volume":"275","author":"Cao","year":"2018","journal-title":"Neurocomputing"},{"issue":"2","key":"10.1016\/j.patcog.2025.113034_bib0019","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0925-2312(94)90053-1","article-title":"Learning and generalization characteristics of the random vector functional-link net","volume":"6","author":"Pao","year":"1994","journal-title":"Neurocomputing"},{"issue":"3","key":"10.1016\/j.patcog.2025.113034_bib0020","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cosrev.2009.03.005","article-title":"Reservoir computing approaches to recurrent neural network training","volume":"3","author":"Luko\u0161evi\u010dius","year":"2009","journal-title":"Computer science review"},{"issue":"10","key":"10.1016\/j.patcog.2025.113034_bib0021","doi-asserted-by":"crossref","first-page":"3466","DOI":"10.1109\/TCYB.2017.2734043","article-title":"Stochastic configuration networks: fundamentals and algorithms","volume":"47","author":"Wang","year":"2017","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"10.1016\/j.patcog.2025.113034_bib0022","doi-asserted-by":"crossref","first-page":"2751","DOI":"10.1109\/TPAMI.2022.3183143","article-title":"Are graph convolutional networks with random weights feasible?","volume":"45","author":"Huang","year":"2022","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10.1016\/j.patcog.2025.113034_bib0023","series-title":"International Conference on Artificial Neural Networks","first-page":"278","article-title":"An untrained neural model for fast and accurate graph classification","author":"Navarin","year":"2023"},{"key":"10.1016\/j.patcog.2025.113034_bib0024","first-page":"1","article-title":"An empirical study on training paradigms for deep supervised hashing: y. shen et al","author":"Shen","year":"2025","journal-title":"Int J Comput Vis"},{"issue":"7","key":"10.1016\/j.patcog.2025.113034_bib0025","first-page":"8729","article-title":"Non-Graph data clustering via o(n) bipartite graph convolution","volume":"45","author":"Zhang","year":"2023","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10.1016\/j.patcog.2025.113034_bib0026","series-title":"Proceedings of the Web Conference","first-page":"2910","article-title":"Hashing-accelerated graph neural networks for link prediction","author":"Wu","year":"2021"},{"key":"10.1016\/j.patcog.2025.113034_bib0027","series-title":"Proceedings of the Web Conference","first-page":"1988","article-title":"Learning to hash with graph neural networks for recommender systems","author":"Tan","year":"2020"},{"key":"10.1016\/j.patcog.2025.113034_bib0028","series-title":"European Conference on Computer Vision","first-page":"531","article-title":"SEMICON: A learning-to-hash solution for large-scale fine-grained image retrieval","author":"Shen","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0029","first-page":"5720","article-title":"A2-Net: Learning attribute-Aware hash codes for large-Scale fine-Grained image retrieval","volume":"34","author":"Wei","year":"2021","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0030","series-title":"Neurips","article-title":"Degree-Quant: quantization-aware training for graph neural networks","author":"Liu","year":"2023"},{"key":"10.1016\/j.patcog.2025.113034_bib0031","series-title":"Ijcai","article-title":"Graph-free knowledge distillation for graph neural networks","author":"Yang","year":"2021"},{"key":"10.1016\/j.patcog.2025.113034_bib0032","series-title":"International Conference on Learning Representations","article-title":"Graph-less neural networks: teaching old MLPs new tricks via distillation","author":"Zhang","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0033","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2025.3535877","article-title":"Graph condensation: a survey","author":"Gao","year":"2025","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10.1016\/j.patcog.2025.113034_bib0034","article-title":"Hash embeddings for efficient word representations","volume":"30","author":"Tito Svenstrup","year":"2017","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0035","article-title":"Random features for large-scale kernel machines","volume":"20","author":"Rahimi","year":"2007","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0036","article-title":"Neural injective functions for multisets, measures and graphs via a finite witness theorem","volume":"36","author":"Amir","year":"2024","journal-title":"Adv Neural Inf Process Syst"},{"key":"10.1016\/j.patcog.2025.113034_bib0037","first-page":"1313","article-title":"Weighted sums of random kitchen sinks: replacing minimization with randomization in learning","volume":"21","author":"Rahimi","year":"2008","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2025.113034_bib0038","series-title":"Sobolev Spaces","author":"Adams","year":"2003"},{"key":"10.1016\/j.patcog.2025.113034_bib0039","series-title":"ICML 2020 Workshop on Graph Representation Learning and Beyond","article-title":"TUDataset: a collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"key":"10.1016\/j.patcog.2025.113034_bib0040","series-title":"35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2)","article-title":"OGB-LSC: A large-scale challenge for machine learning on graphs","author":"Hu","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0041","series-title":"International Conference on Learning Representations","article-title":"A fair comparison of graph neural networks for graph classification","author":"Errica","year":"2019"},{"key":"10.1016\/j.patcog.2025.113034_bib0042","series-title":"ECAI 2020","first-page":"1387","article-title":"Learning Kernel-based embeddings in graph neural networks","author":"Navarin","year":"2020"},{"key":"10.1016\/j.patcog.2025.113034_bib0043","series-title":"International Conference on Machine Learning","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"Wu","year":"2019"},{"key":"10.1016\/j.patcog.2025.113034_bib0044","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume":"29","author":"Defferrard","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2025.113034_bib0045","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","volume":"31","author":"Ying","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2025.113034_bib0046","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"3693","article-title":"Dynamic edge-conditioned filters in convolutional neural networks on graphs","author":"Simonovsky","year":"2017"},{"issue":"6","key":"10.1016\/j.patcog.2025.113034_bib0047","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1109\/TNNLS.2021.3090503","article-title":"Multiresolution reservoir graph neural network","volume":"33","author":"Pasa","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.patcog.2025.113034_bib0048","series-title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V. 2","first-page":"1286","article-title":"Divergent paths: separating homophilic and heterophilic learning for enhanced graph-level representations","author":"Lei","year":"2025"},{"key":"10.1016\/j.patcog.2025.113034_bib0049","series-title":"Companion Proceedings of the Web Conference","article-title":"Universal graph transformer self-attention networks","author":"Nguyen","year":"2022"},{"key":"10.1016\/j.patcog.2025.113034_bib0050","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"12456","article-title":"Transitivity-preserving graph representation learning for bridging local connectivity and role-based similarity","volume":"38","author":"Lee","year":"2024"},{"issue":"1","key":"10.1016\/j.patcog.2025.113034_bib0051","doi-asserted-by":"crossref","first-page":"5244","DOI":"10.1038\/s41467-025-60252-z","article-title":"An end-to-end attention-based approach for learning on graphs","volume":"16","author":"Buterez","year":"2025","journal-title":"Nat. Commun."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320325016978?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320325016978?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:32:27Z","timestamp":1773966747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320325016978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":51,"alternative-id":["S0031320325016978"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2025.113034","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Uncovering capabilities of hash function in graph classification","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2025.113034","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":"113034"}}