{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T11:13:21Z","timestamp":1771586001020,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-18-0035"],"award-info":[{"award-number":["FA8750-18-0035"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MIT Lincoln Labs and the Department of Defense","award":["7000384531"],"award-info":[{"award-number":["7000384531"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tpami.2019.2914651","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T03:52:25Z","timestamp":1558669945000},"page":"1-1","source":"Crossref","is-referenced-by-count":21,"title":["Matched Filters for Noisy Induced Subgraph Detection"],"prefix":"10.1109","author":[{"given":"Daniel","family":"Sussman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngser","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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","article-title":"Random dot product graphs: A model for social networks","author":"nickel","year":"2006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_11"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref30","first-page":"1","article-title":"Nonparametric bayes modeling of populations of networks","volume":"112","author":"durante","year":"2016","journal-title":"J Amer Statistical Assoc"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"ref35","volume":"60","author":"lov\u00e1sz","year":"2012","journal-title":"Large Networks and Graph Limits"},{"key":"ref34","article-title":"Matchability of heterogeneous networks pairs","author":"lyzinski","year":"2017","journal-title":"arXiv 1705 02294"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-008-9040-4"},{"key":"ref27","article-title":"Tractable graph matching via soft seeding","author":"fang","year":"2018","journal-title":"arXiv 1807 09299"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1198\/016214502388618906"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"ref20","article-title":"Exact and inexact methods for graph similarity in structural pattern recognition PhD thesis of Vincenzo Carletti","author":"carletti","year":"2016"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1980.4308468"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.51"},{"key":"ref23","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref26","first-page":"3513","article-title":"Seeded graph matching for correlated Erdos-Renyi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401651112"},{"key":"ref50","first-page":"1","article-title":"Statistical inference on random dot product graphs: a survey","volume":"18","author":"athreya","year":"2018","journal-title":"J Mach Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.03.004"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/nature23455"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"ref14","article-title":"Seeded graph matching","author":"fishkind","year":"2018","journal-title":"arXiv 1209 0367"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0121002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265866"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.12.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"ref45","article-title":"Alignment strength and correlation for graphs","author":"fishkind","year":"2018","journal-title":"arXiv [math CO] 1808 08502"},{"key":"ref48","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"airoldi","year":"2008","journal-title":"J Mach Learning Research"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"ref42","first-page":"188706","article-title":"A High-Throughput pipeline identifies robust connectomes but troublesome variability","author":"kiar","year":"2018","journal-title":"BioRxiv"},{"key":"ref41","article-title":"neurodata\/ndmg: Stable ndmg-DWI pipeline release (Version v0.1.0)","author":"kiar","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73232-8"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/08705338.pdf?arnumber=8705338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:59:47Z","timestamp":1651067987000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8705338\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/tpami.2019.2914651","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":[[2019]]}}}