{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:08:49Z","timestamp":1772755729894,"version":"3.50.1"},"reference-count":62,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Graphical Statistics"],"published-print":{"date-parts":[[2026,1,2]]},"DOI":"10.1080\/10618600.2025.2544182","type":"journal-article","created":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T20:18:27Z","timestamp":1754511507000},"page":"429-442","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory"],"prefix":"10.1080","volume":"35","author":[{"given":"Lingyao","family":"Meng","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University","place":["Baltimore"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengqi","family":"Lou","sequence":"additional","affiliation":[{"name":"School of Industrial and Systems Engineering, Georgia Institute of Technology","place":["Atlanta"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyu","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University","place":["Baltimore"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vince","family":"Lyzinski","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Maryland","place":["College Park"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donniell E.","family":"Fishkind","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University","place":["Baltimore"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965819"},{"key":"e_1_3_4_4_1","doi-asserted-by":"crossref","unstructured":"Chai S. and R\u00e1cz M. Z. (2024) \u201cEfficient Graph Matching for Correlated Stochastic Block Models \u201d arXiv preprint arXiv:2412.02661.","DOI":"10.52202\/079017-3696"},{"key":"e_1_3_4_5_1","first-page":"6301","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Chen H.","year":"2021","unstructured":"Chen, H., Luo, Z., Zhang, J., Zhou, L., Bai, X., Hu, Z., Tai, C.-L., and Quan, L. (2021), \u201cLearning to Match Features with Seeded Graph Matching Network,\u201d in Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 6301\u20136310."},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127876"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"e_1_3_4_9_1","unstructured":"Cullina D. and Kiyavash N. (2017) \u201cExact Alignment Recovery for Correlated Erd\u0151s R\u00e9nyi Graphs \u201d arXiv preprint arXiv:1711.06783."},{"key":"e_1_3_4_10_1","first-page":"1","volume-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","volume":"3","author":"Cullina D.","year":"2019","unstructured":"Cullina, D., Kiyavash, N., Mittal, P., and Poor, H. V. (2019), \u201cPartial Recovery of Erd\u0151s-R\u00e9nyi Graph Alignment via k-core Alignment,\u201d Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3, 1\u201321."},{"key":"e_1_3_4_11_1","article-title":"\u201cSinkhorn Distances: Lightspeed Computation of Optimal Transport,\u201d in","volume":"26","author":"Cuturi M.","year":"2013","unstructured":"Cuturi, M. (2013), \u201cSinkhorn Distances: Lightspeed Computation of Optimal Transport,\u201d in Advances in Neural Information Processing Systems (Vol. 26).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3265009"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"e_1_3_4_15_1","first-page":"2985","volume-title":"International Conference on Machine Learning","author":"Fan Z.","year":"2020","unstructured":"Fan, Z., Mao, C., Wu, Y., and Xu, J. (2020), \u201cSpectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory,\u201d in International Conference on Machine Learning, PMLR, pp. 2985\u20132995."},{"key":"e_1_3_4_16_1","unstructured":"Fang F. Sussman D. L. and Lyzinski V. (2018) \u201cTractable Graph Matching via Soft Seeding \u201d arXiv preprint arXiv:1807.09299."},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.05.008"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-021-00398-z"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_3_4_22_1","first-page":"11744","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","author":"Gao S.","year":"2020","unstructured":"Gao, S., Wang, J., Lu, H., and Liu, Z. (2020), \u201cPose-Guided Visible Part Matching for Occluded Person ReID,\u201d in Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 11744\u201311752."},{"key":"e_1_3_4_23_1","first-page":"2183","volume-title":"Conference on Learning Theory","author":"Gaudio J.","year":"2022","unstructured":"Gaudio, J., Racz, M. Z., and Sridhar, A. (2022), \u201cExact Community Recovery in Correlated Stochastic Block Models,\u201d in Conference on Learning Theory, PMLR, pp. 2183\u20132241."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.10.003"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2355"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-022-10079-1"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10054"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl287"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp203"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2808999"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"e_1_3_4_36_1","first-page":"3513","article-title":"\u201cSeeded Graph Matching for Correlated Erd\u0151s-R\u00e9nyi Graphs,\u201d","volume":"15","author":"Lyzinski V.","year":"2014","unstructured":"Lyzinski, V., Fishkind, D., and Priebe, C. (2014), \u201cSeeded Graph Matching for Correlated Erd\u0151s-R\u00e9nyi Graphs,\u201d Journal of Machine Learning Research, 15, 3513\u20133540.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585156"},{"key":"e_1_3_4_38_1","first-page":"253","volume-title":"Proceedings of the American Mathematical Society","volume":"9","author":"Mendelsohn N. S.","year":"1958","unstructured":"Mendelsohn, N. S., and Dulmage, A. L. (1958), \u201cThe Convex Hull of Sub-Permutation Matrices,\u201d Proceedings of the American Mathematical Society, 9, 253\u2013254."},{"key":"e_1_3_4_39_1","first-page":"3980","volume-title":"2018 IEEE International Conference on Big Data (Big Data), IEEE","author":"Moorman J. D.","year":"2018","unstructured":"Moorman, J. D., Chen, Q., Tu, T. K., Boyd, Z. M., and Bertozzi, A. L. (2018), \u201cFiltering Methods for Subgraph Matching on Multiplex Networks,\u201d in 2018 IEEE International Conference on Big Data (Big Data), IEEE, pp. 3980\u20133985."},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3056329"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20934"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt202"},{"key":"e_1_3_4_43_1","unstructured":"Patsolic H. Adali S. Vogelstein J. T. Park Y. Priebe C. E. Li G. and Lyzinski V. (2014) \u201cSeeded Graph Matching via Joint Optimization of Fidelity and Commensurability \u201d arXiv preprint arXiv:1401.3813."},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11454"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1162\/netn_a_00287"},{"key":"e_1_3_4_47_1","article-title":"\u201cCorrelated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities,\u201d","volume":"34","author":"Racz M.","year":"2021","unstructured":"Racz, M., and Sridhar, A. (2021), \u201cCorrelated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities,\u201d Advances in Neural Information Processing Systems (Vol. 34).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_48_1","unstructured":"Saad-Eldin A. Pedigo B. D. Priebe C. E. and Vogelstein J. T. (2021) \u201cGraph Matching via Optimal Transport \u201d arXiv preprint arXiv:2111.05366."},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"e_1_3_4_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636015"},{"key":"e_1_3_4_51_1","doi-asserted-by":"crossref","unstructured":"Sun H. Zhou W. and Fei M. (2020) \u201cA Survey on Graph Matching in Computer Vision \u201d in 2020 13th International Congress on Image and Signal Processing BioMedical Engineering and Informatics (CISP-BMEI) IEEE pp. 225\u2013230.","DOI":"10.1109\/CISP-BMEI51763.2020.9263681"},{"key":"e_1_3_4_52_1","doi-asserted-by":"crossref","unstructured":"Sun Z. Wang H. Wang H. Shao B. and Li J. (2012) \u201cEfficient Subgraph Matching on Billion Node Graphs \u201d arXiv preprint arXiv:1205.6691.","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_4_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2914651"},{"key":"e_1_3_4_54_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0121002"},{"key":"e_1_3_4_55_1","doi-asserted-by":"crossref","unstructured":"Wu Y. Xu J. and Yu S. H. (2021) \u201cSettling the Sharp Reconstruction Thresholds of Random Graph Matching \u201d arXiv preprint arXiv:2102.00082.","DOI":"10.1109\/ISIT45174.2021.9518266"},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3236028"},{"key":"e_1_3_4_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"e_1_3_4_58_1","first-page":"12829","article-title":"\u201cGraph Matching with Partially-Correct Seeds,\u201d","volume":"22","author":"Yu L.","year":"2021","unstructured":"Yu, L., Xu, J., and Lin, X. (2021), \u201cGraph Matching with Partially-Correct Seeds,\u201d The Journal of Machine Learning Research, 22, 12829\u201312882.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_4_59_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"e_1_3_4_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"e_1_3_4_61_1","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang Z.","year":"2019","unstructured":"Zhang, Z., Xiang, Y., Wu, L., Xue, B., and Nehorai, A. (2019), \u201cKergm: Kernelized Graph Matching,\u201d in Advances in Neural Information Processing Systems (Vol. 32)."},{"key":"e_1_3_4_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107418"},{"key":"e_1_3_4_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247667"}],"container-title":["Journal of Computational and Graphical Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10618600.2025.2544182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:14:31Z","timestamp":1772752471000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10618600.2025.2544182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1,2]]}},"alternative-id":["10.1080\/10618600.2025.2544182"],"URL":"https:\/\/doi.org\/10.1080\/10618600.2025.2544182","relation":{},"ISSN":["1061-8600","1537-2715"],"issn-type":[{"value":"1061-8600","type":"print"},{"value":"1537-2715","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-07-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}