{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:01:11Z","timestamp":1760598071979,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-18-2-0035"],"award-info":[{"award-number":["FA8750-18-2-0035"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["BRAIN U01-NS108637"],"award-info":[{"award-number":["BRAIN U01-NS108637"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,10,1]]},"DOI":"10.1109\/tnse.2021.3086508","type":"journal-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T20:25:35Z","timestamp":1622838335000},"page":"3019-3033","source":"Crossref","is-referenced-by-count":1,"title":["Graph Matching Between Bipartite and Unipartite Networks: To Collapse, or Not to Collapse, That Is the Question"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3071-9043","authenticated-orcid":false,"given":"Jesus","family":"Arroyo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0139-7201","authenticated-orcid":false,"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vince","family":"Lyzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF02980577"},{"key":"ref38","first-page":"2012, pp. 1358?1366","article-title":"Graphical models via generalized linear models","author":"yang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2021.1872582"},{"article-title":"Exact alignment recovery for correlated Erdos-Renyi graphs","year":"2017","author":"cullina","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901460"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2808999"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Foundations Trends Mach Learn"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","author":"lauritzen","year":"1996","journal-title":"Graphical Models"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-011-0021-0"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2013.12.039"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33415-3_87"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1089\/brain.2015.0408"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2014.49"},{"key":"ref28","article-title":"A joint graph inference case study: The C elegans chemical and electrical connectomes","volume":"5","author":"chen","year":"2016"},{"key":"ref64","article-title":"A High-Throughput Pipeline Identifies Robust Connectomes but Troublesome Variability","author":"kiar","year":"2018","journal-title":"BioRxiv"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.152"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2008.09.037"},{"key":"ref29","first-page":"2016, pp. 684?697","article-title":"Graph isomorphism in quasipolynomial time","author":"babai","year":"0","journal-title":"Proc 48th Annu ACM Symp Theory Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3107411.3107435"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.012805"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2893383"},{"key":"ref24","first-page":"1","article-title":"Matched bipartite block model with covariates","volume":"20","author":"razaee","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref23","first-page":"1","article-title":"Analysis of spectral clustering algorithms for community detection: The general bipartite setting","volume":"20","author":"zhou","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref26","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1497"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2010.00740.x"},{"key":"ref51","article-title":"Fast approximate quadratic programming for graph matching","volume":"10","author":"vogelstein","year":"2014","journal-title":"PLoS ONE"},{"key":"ref59","first-page":"1059","article-title":"The huge package for high-dimensional undirected graph estimation in r","volume":"13","author":"zhao","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"ref57","article-title":"GLMnet: Lasso and elastic-net regularized generalized linear models","volume":"1","author":"friedman","year":"2009","journal-title":"R Package Version"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v033.i01","article-title":"Regularization paths for generalized linear models via coordinate descent","volume":"33","author":"friedman","year":"2010","journal-title":"J Statist Softw"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref55"},{"key":"ref54","first-page":"2018, pp. 408?418","article-title":"(probably) concave graph matching","author":"maron","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","first-page":"2013, pp. 127?135","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","first-page":"2019, pp. 3335?3346","article-title":"KerGM: Kernelized graph matching","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2913233"},{"key":"ref11","first-page":"2985","article-title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and Theory","volume":"119","author":"fan","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3150\/16-BEJ886"},{"key":"ref12","article-title":"The netflix prize","author":"bennett","year":"0","journal-title":"Proc KDD Cup Workshop Conjunction KDD"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOAS896"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/gigascience\/giy014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.046115"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"ref18","article-title":"Community detection for correlation matrices","volume":"5","author":"macmahon","year":"2013","journal-title":"Phys Rev"},{"key":"ref19","article-title":"Two sample inference for populations of graphical models with applications to functional connectivity","author":"narayan","year":"2015","journal-title":"arXiv 1502 03853"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref6","first-page":"3513","article-title":"Seeded graph matching for correlated erdös-rényi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1162"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2753963"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"ref45","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data","volume":"9","author":"banerjee","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref48","first-page":"2009, pp. 1303?1311","article-title":"Which graphical models are difficult to learn","author":"bento","year":"0","journal-title":"Proc Adv Neural Inf Process Syst 22 Conf"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/08-EJS176"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349846"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000281"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746631"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9644929\/09447239.pdf?arnumber=9447239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T14:49:24Z","timestamp":1699109364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9447239\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,1]]},"references-count":65,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2021.3086508","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2021,10,1]]}}}