{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:45:20Z","timestamp":1740123920515,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8750-20-2-1001"],"award-info":[{"award-number":["FA8750-20-2-1001"]}],"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-20-2-1001"],"award-info":[{"award-number":["FA8750-20-2-1001"]}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11222-023-10206-6","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T18:02:25Z","timestamp":1678125745000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subgraph nomination: query by example subgraph retrieval in networks"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2875-1730","authenticated-orcid":false,"given":"Al-Fahad","family":"Al-Qadhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hayden S.","family":"Helm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vince","family":"Lyzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"issue":"2","key":"10206_CR1","doi-asserted-by":"publisher","first-page":"3230","DOI":"10.1214\/20-EJS1744","volume":"14","author":"J Agterberg","year":"2020","unstructured":"Agterberg, J., Park, Y., Larson, J., White, C., Priebe, C.E., Lyzinski, V.: Vertex nomination, consistent estimation, and adversarial modification. Electron. J. Stat. 14(2), 3230\u20133267 (2020)","journal-title":"Electron. J. Stat."},{"issue":"4","key":"10206_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM (JACM) 42(4), 844\u2013856 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"10206_CR3","first-page":"105","volume":"35","author":"S Amershi","year":"2014","unstructured":"Amershi, S., Cakmak, M., Knox, W.B., Kulesza, T.: Power to the people: the role of humans in interactive machine learning. AI Mag. 35(4), 105\u2013120 (2014)","journal-title":"AI Mag."},{"key":"10206_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2016","unstructured":"Angles, R., Arenas, M., Barcelo, P., Hogan, A., Reutter, J., Vrgoc, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50, 1\u201340 (2016)","journal-title":"ACM Comput. Surv."},{"key":"10206_CR5","doi-asserted-by":"crossref","unstructured":"Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., Wang, W.: Simgnn: a neural network approach to fast graph similarity computation. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 384\u2013392 (2019)","DOI":"10.1145\/3289600.3290967"},{"key":"10206_CR6","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1609\/icwsm.v14i1.7347","volume":"14","author":"J Baumgartner","year":"2020","unstructured":"Baumgartner, J., Zannettou, S., Keegan, B., Squire, M., Blackburn, J.: The pushshift reddit dataset. Proc. Int. AAAI Conf. Web Soc. Media 14, 830\u2013839 (2020)","journal-title":"Proc. Int. AAAI Conf. Web Soc. Media"},{"issue":"10","key":"10206_CR7","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"4","key":"10206_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TPAMI.2004.1265866","volume":"26","author":"T Caelli","year":"2004","unstructured":"Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 26(4), 515\u2013519 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10206_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98\u2013101 (2008)","journal-title":"Nature"},{"issue":"2","key":"10206_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1002\/wics.1294","volume":"6","author":"G Coppersmith","year":"2014","unstructured":"Coppersmith, G.: Vertex nomination. Wiley Interdiscipl. Rev. Comput. Stat. 6(2), 144\u2013153 (2014)","journal-title":"Wiley Interdiscipl. Rev. Comput. Stat."},{"issue":"10","key":"10206_CR11","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10206_CR12","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: IEEE International Parallel & Distributed Processing Symposium, pp. 1135\u20131146. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"issue":"3","key":"10206_CR13","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.neuroimage.2006.01.021","volume":"31","author":"RS Desikan","year":"2006","unstructured":"Desikan, R.S., S\u00e9gonne, F., Fischl, B., Quinn, B.T., Dickerson, B.C., Blacker, D., Buckner, R.L., Dale, A.M., Maguire, R.P., Hyman, B.T., et al.: An automated labeling system for subdividing the human cerebral cortex on MRI scans into gyral based regions of interest. Neuroimage 31(3), 968\u2013980 (2006)","journal-title":"Neuroimage"},{"issue":"3","key":"10206_CR14","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1214\/15-AOAS834","volume":"9","author":"DE Fishkind","year":"2015","unstructured":"Fishkind, D.E., Lyzinski, V., Pao, H., Chen, L., Priebe, C.E.: Vertex nomination schemes for membership prediction. Ann. Appl. Stat. 9(3), 1510\u20131532 (2015)","journal-title":"Ann. Appl. Stat."},{"issue":"3","key":"10206_CR15","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1214\/15-AOAS834","volume":"9","author":"DE Fishkind","year":"2015","unstructured":"Fishkind, D.E., Lyzinski, V., Pao, H., Chen, L., Priebe, C.E.: Vertex nomination schemes for membership prediction. Ann. Appl. Stat. 9(3), 1510\u20131532 (2015)","journal-title":"Ann. Appl. Stat."},{"key":"10206_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.patcog.2018.09.014","volume":"87","author":"DE Fishkind","year":"2019","unstructured":"Fishkind, D.E., Adali, S., Patsolic, H.G., Meng, L., Singh, D., Lyzinski, V., Priebe, C.E.: Seeded graph matching. Pattern Recogn. 87, 203\u2013215 (2019)","journal-title":"Pattern Recogn."},{"key":"10206_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.patrec.2019.05.008","volume":"125","author":"DE Fishkind","year":"2019","unstructured":"Fishkind, D.E., Meng, L., Sun, A., Priebe, C.E., Lyzinski, V.: Alignment strength and correlation for graphs. Pattern Recogn. Lett. 125, 295\u2013302 (2019)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"10206_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s003579900058","volume":"16","author":"C Fraley","year":"1999","unstructured":"Fraley, C., Raftery, A.E.: MCLUST: software for model-based cluster analysis. J. Classif. 16(2), 297\u2013306 (1999)","journal-title":"J. Classif."},{"issue":"5","key":"10206_CR19","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/TNNLS.2013.2292894","volume":"25","author":"B Fr\u00e9nay","year":"2013","unstructured":"Fr\u00e9nay, B., Verleysen, M.: Classification in the presence of label noise: a survey. IEEE Trans. Neural Netw. Learn. Syst. 25(5), 845\u2013869 (2013)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"10206_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MPUL.2011.2181023","volume":"3","author":"WR Gray","year":"2012","unstructured":"Gray, W.R., Bogovic, J.A., Vogelstein, J.T., Landman, B.A., Prince, J.L., Vogelstein, R.J.: Magnetic resonance connectome automated pipeline: an overview. IEEE Pulse 3(2), 42\u201348 (2012)","journal-title":"IEEE Pulse"},{"key":"10206_CR21","unstructured":"Helm, H.S., Basu, A., Athreya, A., Park, Y., Vogelstein, J.T., Winding, M., Zlatic, M., Cardona, A., Bourke, P., Larson, J., White, C., Priebe, C.E.: Learning to rank via combining representations. arXiv preprint. arXiv:2005.10700 (2020)"},{"issue":"2","key":"10206_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109\u2013137 (1983)","journal-title":"Soc. Netw."},{"key":"10206_CR23","doi-asserted-by":"crossref","unstructured":"Jin, H., He, X., Wang, Y., Li, H., Bertozzi, A.L.: Noisy subgraph isomorphisms on multiplex networks. In: IEEE International Conference on Big Data (Big Data), pp. 4899\u20134905. IEEE (2019)","DOI":"10.1109\/BigData47090.2019.9005645"},{"issue":"7","key":"10206_CR24","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274\u20131279 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10206_CR25","unstructured":"Levin, K., Priebe, C.E., Lyzinski, V.: On the role of features in vertex nomination: content and context together are better (sometimes). arXiv preprint. arXiv:2005.02151 (2020)"},{"key":"10206_CR26","unstructured":"Li, Y., Gu, C., Dullien, T., Vinyals, O., Kohli, P.: Graph matching networks for learning the similarity of graph structured objects. In: International Conference on Machine Learning, pp. 3835\u20133845. PMLR (2019)"},{"key":"10206_CR27","unstructured":"Li, T., Lei, L., Bhattacharyya, S., Sarkar, P., Bickel, P.J., Levina, E.: Hierarchical community detection by recursive partitioning. arXiv preprint. arXiv:1810.01509 (2018)"},{"key":"10206_CR28","first-page":"2549","volume":"2020","author":"M Lissandrini","year":"2020","unstructured":"Lissandrini, M., Mottin, D., Palpanas, T., Velegrakis, Y.: Graph-query suggestions for knowledge graph exploration. Proc. Web Conf. 2020, 2549\u20132555 (2020)","journal-title":"Proc. Web Conf."},{"key":"10206_CR29","doi-asserted-by":"crossref","unstructured":"Liu, T.-Y.: Learning to Rank for Information Retrieval. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-14267-3"},{"issue":"10","key":"10206_CR30","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/34.954603","volume":"23","author":"J Llad\u00f3s","year":"2001","unstructured":"Llad\u00f3s, J., Mart\u00ed, E., Villanueva, J.J.: Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1137\u20131143 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"179","key":"10206_CR31","first-page":"1","volume":"17","author":"V Lyzinski","year":"2016","unstructured":"Lyzinski, V., Levin, K., Fishkind, D.E., Priebe, C.E.: On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching. J. Mach. Learn. Res. 17(179), 1\u201334 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10206_CR32","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/TNSE.2016.2634322","volume":"4","author":"V Lyzinski","year":"2017","unstructured":"Lyzinski, V., Tang, M., Athreya, A., Park, Y., Priebe, C.E.: Community detection and classification in hierarchical stochastic blockmodels. IEEE Trans. Netw. Sci. Eng. 4(1), 13\u201326 (2017)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"69","key":"10206_CR33","first-page":"1","volume":"20","author":"V Lyzinski","year":"2019","unstructured":"Lyzinski, V., Levin, K., Priebe, C.E.: On consistent vertex nomination schemes. J. Mach. Learn. Res. 20(69), 1\u201339 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"10206_CR34","unstructured":"Marchette, D., Priebe, C.E., Coppersmith, G.: Vertex nomination via attributed random dot product graphs. In: Proceedings of the 57th ISI World Statistics Congress, vol. 6 (2011)"},{"issue":"5594","key":"10206_CR35","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"10206_CR36","doi-asserted-by":"crossref","unstructured":"Moorman, J.D., Chen, Q., Tu, T.K., Boyd, Z.M., Bertozzi, A.L.: Filtering methods for subgraph matching on multiplex networks. In: IEEE International Conference on Big Data (Big Data) (2018)","DOI":"10.1109\/BigData.2018.8622566"},{"issue":"6","key":"10206_CR37","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00778-016-0429-2","volume":"25","author":"D Mottin","year":"2016","unstructured":"Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: a new way of searching. VLDB J. 25(6), 741\u2013765 (2016)","journal-title":"VLDB J."},{"key":"10206_CR38","unstructured":"Natarajan, N., Dhillon, I.S., Ravikumar, P.K., Tewari, A.: Learning with noisy labels. In: Advances in Neural Information Processing Systems, pp. 1196\u20131204 (2013)"},{"issue":"23","key":"10206_CR39","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10206_CR40","doi-asserted-by":"publisher","first-page":"e8118","DOI":"10.1371\/journal.pone.0008118","volume":"5","author":"Y Park","year":"2010","unstructured":"Park, Y., Moore, C., Bader, J.S.: Dynamic networks from hierarchical Bayesian graph clustering. PLoS ONE 5, e8118 (2010)","journal-title":"PLoS ONE"},{"issue":"3","key":"10206_CR41","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/sam.11454","volume":"13","author":"HG Patsolic","year":"2020","unstructured":"Patsolic, H.G., Park, Y., Lyzinski, V., Priebe, C.E.: Vertex nomination via local neighborhood matching. Stat. Ana. Data Min. ASA Data Sci. J. 13(3), 229\u2013244 (2020)","journal-title":"Stat. Ana. Data Min. ASA Data Sci. J."},{"issue":"011047","key":"10206_CR42","first-page":"1","volume":"4","author":"TP Peixoto","year":"2014","unstructured":"Peixoto, T.P.: Hierarchical block structures and high-resolution model selection in large networks. Phys. Rev. X 4(011047), 1\u201318 (2014)","journal-title":"Phys. Rev. X"},{"key":"10206_CR43","unstructured":"Rastogi, P., Lyzinski, V., Van Durme, B.: Vertex nomination on the cold start knowledge graph. Technical report, Human Language Technology Center of Excellence (2017)"},{"issue":"3\u20134","key":"10206_CR44","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s10791-018-9342-1","volume":"22","author":"P Rastogi","year":"2019","unstructured":"Rastogi, P., Poliak, A., Lyzinski, V., Van Durme, B.: Neural variational entity set expansion for automatically populated knowledge graphs. Inf. Retr. J. 22(3\u20134), 232\u2013255 (2019)","journal-title":"Inf. Retr. J."},{"key":"10206_CR45","doi-asserted-by":"publisher","first-page":"15224","DOI":"10.1073\/pnas.0703740104","volume":"104","author":"M Sales-Pardo","year":"2007","unstructured":"Sales-Pardo, M., Guimer\u00e0, R., Moreira, A.A., Amaral, L.A.N.: Extracting the hierarchical organization of complex systems. Proc. Natl. Acad. Sci. U.S.A. 104, 15224\u201315229 (2007)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10206_CR46","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Madduri, K.: Fast approximate subgraph counting and enumeration. In: 42nd International Conference on Parallel Processing, pp. 210\u2013219. IEEE (2013)","DOI":"10.1109\/ICPP.2013.30"},{"key":"10206_CR47","first-page":"2887","volume":"42","author":"DL Sussman","year":"2019","unstructured":"Sussman, D.L., Lyzinski, V., Park, Y., Priebe, C.E.: Matched filters for noisy induced subgraph detection. IEEE Trans. Pattern Anal. Mach. Intell. 42, 2887\u20132900 (2019)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"10206_CR48","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1002\/wics.1365","volume":"7","author":"S Suwan","year":"2015","unstructured":"Suwan, S., Lee, D.S., Priebe, C.E.: Bayesian vertex nomination using content and context. Wiley Interdiscipl. Rev. Comput. Stat. 7(6), 400\u2013416 (2015)","journal-title":"Wiley Interdiscipl. Rev. Comput. Stat."},{"key":"10206_CR49","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.3150\/15-BEJ789","volume":"23","author":"M Tang","year":"2017","unstructured":"Tang, M., Athreya, A., Sussman, D.L., Lyzinski, V., Priebe, C.E.: A nonparametric two-sample hypothesis testing for random dot product graphs. Bernoulli 23, 1599\u20131630 (2017)","journal-title":"Bernoulli"},{"issue":"1","key":"10206_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag, V.A., Waltman, L., Van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Sci. Rep. 9(1), 1\u201312 (2019)","journal-title":"Sci. Rep."},{"key":"10206_CR51","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM (JACM) 23(1), 31\u201342 (1976)","DOI":"10.1145\/321921.321925"},{"key":"10206_CR52","doi-asserted-by":"publisher","first-page":"106916","DOI":"10.1016\/j.csda.2020.106916","volume":"145","author":"J Yoder","year":"2020","unstructured":"Yoder, J., Chen, L., Pao, H., Bridgeford, E., Levin, K., Fishkind, D.E., Priebe, C.E., Lyzinski, V.: Vertex nomination: the canonical sampling and the extended spectral nomination schemes. Comput. Stat. Data Anal. 145, 106916 (2020)","journal-title":"Comput. Stat. Data Anal."},{"key":"10206_CR53","unstructured":"Zuo, X.-N., Anderson, J.S., Bellec, P., Birn, R.M., Biswal, B.B., Blautzik, J., Breitner, J.C.S., Buckner, R.L., Calhoun, V.D., Castellanos, F.X., et al.: An open science resource for establishing reliability and reproducibility in functional connectomics. Sci. Data 1(1), 1\u201313 (2014)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10206-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-023-10206-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10206-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T06:14:50Z","timestamp":1680502490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-023-10206-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10206"],"URL":"https:\/\/doi.org\/10.1007\/s11222-023-10206-6","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2023,3,6]]},"assertion":[{"value":"14 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"52"}}