{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:59:34Z","timestamp":1775325574839,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"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 Funds of China","doi-asserted-by":"crossref","award":["62088102"],"award-info":[{"award-number":["62088102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Funds of China","doi-asserted-by":"crossref","award":["62021002"],"award-info":[{"award-number":["62021002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4222025"],"award-info":[{"award-number":["4222025"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1109\/tpami.2024.3353199","type":"journal-article","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T18:55:36Z","timestamp":1705085736000},"page":"3880-3896","source":"Crossref","is-referenced-by-count":14,"title":["Hypergraph Isomorphism Computation"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0878-2986","authenticated-orcid":false,"given":"Yifan","family":"Feng","sequence":"first","affiliation":[{"name":"School of Software, BNRist, THUIBCS, BLBCI, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4000-9893","authenticated-orcid":false,"given":"Jiashu","family":"Han","sequence":"additional","affiliation":[{"name":"School of Software, BNRist, THUIBCS, BLBCI, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9423-0146","authenticated-orcid":false,"given":"Shihui","family":"Ying","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Science, Shanghai University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4971-590X","authenticated-orcid":false,"given":"Yue","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Software, BNRist, THUIBCS, BLBCI, Tsinghua University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2576939"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3039374"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016131"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441835"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3030076"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-23339-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219633602000117"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1874005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482351"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532058"},{"key":"ref11","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref12","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Veli\u010dkovi\u0107"},{"key":"ref13","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref14","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref15","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"ref18","first-page":"1511","article-title":"HyperGCN: A new method for training graph convolutional networks on hypergraphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yadati"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3182052"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2023.3332768"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/366"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-018-2908-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.09.019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"issue":"9","key":"ref26","first-page":"12","article-title":"The reduction of a graph to canonical form and the algebra which appears therein","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"NTI, Ser."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"ref28","volume-title":"Discrete Mathematics","author":"Biggs","year":"2002"},{"key":"ref29","volume-title":"Data Structures and Efficient Algorithms","author":"Mehlhorn","year":"1984"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.8"},{"key":"ref31","first-page":"1660","article-title":"Fast subtree kernels on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shervashidze"},{"key":"ref32","volume-title":"An Introduction to Support Vector Machines","author":"Cristianini","year":"2000"},{"issue":"77","key":"ref33","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref34","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proc. Mach. Learn. Res.","author":"Shervashidze"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273615"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539342"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2014.665"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301427"},{"issue":"3","key":"ref39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"ref40","first-page":"61","article-title":"Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods","volume-title":"Proc. Adv. Large Margin Classifiers","volume":"10","author":"Platt"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref45","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"9","author":"Weisfeiler","year":"1968","journal-title":"Nauchno\u2013Technicheskaja Informatsia"},{"key":"ref46","first-page":"65","article-title":"Expressivity versus efficiency of graph kernels","volume-title":"Proc. 1st Int. Workshop Mining Graphs","author":"Ramon"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553443"},{"key":"ref49","first-page":"321","article-title":"Marginalized kernels between labeled graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kashima"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.80"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9787-y"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10490207\/10398457.pdf?arnumber=10398457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T19:34:10Z","timestamp":1712691250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10398457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":52,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3353199","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]}}}