{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T04:01:29Z","timestamp":1744084889693,"version":"3.40.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1652492"],"award-info":[{"award-number":["1652492"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tkde.2025.3543032","type":"journal-article","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T18:40:56Z","timestamp":1739817656000},"page":"2946-2957","source":"Crossref","is-referenced-by-count":0,"title":["SCHENO: Measuring Schema vs. Noise in Graphs"],"prefix":"10.1109","volume":"37","author":[{"given":"Justus Isaiah","family":"Hibshman","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3715-683X","authenticated-orcid":false,"given":"Adnan","family":"Hoq","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3164-2615","authenticated-orcid":false,"given":"Tim","family":"Weninger","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, USA"}]}],"member":"263","reference":[{"volume-title":"OED Online","year":"2024","author":"Schema","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1037\/h0054663"},{"key":"ref3","first-page":"684","article-title":"Graph isomorphism in quasipolynomial time","volume-title":"Proc. Annu. ACM Symp. Theory Comput.","author":"Babai"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/sym10010029"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s00224-016-9686-0","article-title":"Tight lower and upper bounds for the complexity of canonical colour refinement","volume":"60","author":"Berkholz","year":"2017","journal-title":"Theory Comput. Syst."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4_7"},{"year":"2023","key":"ref7","article-title":"Collegefootballdata.com"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1037\/0096-3445.106.3.269"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref10","first-page":"1","article-title":"Trusses: Cohesive subgraphs for social network analysis","volume":"16","author":"Cohen","year":"2008","journal-title":"Nat. Secur. Agency Tech. Rep."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1613\/jair.43"},{"issue":"12","key":"ref12","first-page":"4263","article-title":"Inequalities for entropy-based measures of network information content","volume":"215","author":"Dehmer","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20379"},{"article-title":"Discovering near symmetry in graphs","volume-title":"Proc. Conf. Assoc. Advance. Artif. Intell.","author":"Fox","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/c2013-0-10826-4"},{"article-title":"Ratio of symmetries between any two n-node graphs","year":"2022","author":"Hibshman","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1037\/h0055809"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-017-0124-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.11"},{"key":"ref20","first-page":"1343","article-title":"KONECT \u2013 The Koblenz network collection","volume-title":"Proc. Int. Conf. World Wide Web","author":"Kunegis"},{"article-title":"SNAP Datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555904"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1037\/10101-000"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.008"},{"key":"ref25","first-page":"60","article-title":"Almost-symmetries of graphs","volume-title":"Proc. Int. Symmetry Conf.","author":"Markov"},{"key":"ref26","first-page":"60","article-title":"Almost-symmetries of graphs","volume-title":"Proc. Int. Symmetry Conf.","author":"Markov","year":"2007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/e14030559"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1037\/10101-001"},{"issue":"4","key":"ref30","doi-asserted-by":"crossref","DOI":"10.1037\/0096-1523.4.4.691","article-title":"Orientation and symmetry: Effects of multiple, rotational, and near symmetries","volume":"4","author":"Palmer","year":"1978","journal-title":"J. Exp. Psychol., Hum. Percep. Perform."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-018-0073-4"},{"key":"ref32","first-page":"130","article-title":"The identification and exploitation of almost symmetries in planning problems","volume-title":"Proc. 23rd Workshop UK Plan. Scheduling Special Int. Group","author":"Porteous"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-84882-889-6_5","article-title":"Action and the orbit\u2013stabiliser theorem","author":"Rose","year":"2009","journal-title":"A Course on Finite Groups"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1037\/0096-1523.7.6.1186"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00066"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.121054","article-title":"Measuring the complexity of complex network by tsallis entropy","volume":"526","author":"Wen","year":"2019","journal-title":"Physica A, Stat. Mechanics Appl."},{"issue":"11","key":"ref39","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1016\/j.physa.2008.01.027","article-title":"Symmetry-based structure entropy of complex networks","volume":"387","author":"Xiao","year":"2008","journal-title":"Physica A, Stat. Mechanics Appl."},{"issue":"1","key":"ref40","doi-asserted-by":"crossref","DOI":"10.1088\/1674-1056\/26\/1\/018902","article-title":"Entropy-based link prediction in weighted networks","volume":"26","author":"Xu","year":"2017","journal-title":"Chin. Phys. B"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.04.106"},{"article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","key":"ref42"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/10948402\/10891452-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10948402\/10891452.pdf?arnumber=10891452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:24:39Z","timestamp":1743996279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10891452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":42,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3543032","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":[[2025,5]]}}}