{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:21:50Z","timestamp":1772641310345,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10208-024-09662-x","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T11:03:25Z","timestamp":1721646205000},"page":"1287-1344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation"],"prefix":"10.1007","volume":"25","author":[{"given":"Jian","family":"Ding","sequence":"first","affiliation":[]},{"given":"Zhangsong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"issue":"1\u20132","key":"9662_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S0963548307008917","volume":"18","author":"N Alon","year":"2009","unstructured":"N.\u00a0Alon. Perturbed identity matrices have high rank: proof and applications. Combinatorics, Probability and Computing, 18(1-2):3\u201315, 2009.","journal-title":"Combinatorics, Probability and Computing"},{"key":"9662_CR2","unstructured":"B.\u00a0Barak, C.-N. Chou, Z.\u00a0Lei, T.\u00a0Schramm, and Y.\u00a0Sheng. (nearly) efficient algorithms for the graph matching problem on correlated random graphs. In Advances in Neural Information Processing Systems (NIPS), volume\u00a032. Curran Associates, Inc., 2019."},{"issue":"2","key":"9662_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s00220-013-1782-2","volume":"323","author":"F Barthe","year":"2013","unstructured":"F.\u00a0Barthe and E.\u00a0Milman. Transference principles for log-Sobolev and spectral-gap with applications to conservative spin systems. Communications in Mathematical Physics, 323(2):575\u2013625, 2013.","journal-title":"Communications in Mathematical Physics"},{"issue":"2","key":"9662_CR4","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/TIT.2010.2094817","volume":"57","author":"M Bayati","year":"2011","unstructured":"M.\u00a0Bayati and A.\u00a0Montanari. The dynamics of message passing on dense graphs, with applications to compressed sensing. IEEE Transactions on Information Theory, 57(2):764\u2013785, 2011.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9662_CR5","doi-asserted-by":"crossref","unstructured":"A.\u00a0Berg, T.\u00a0Berg, and J.\u00a0Malik. Shape matching and object recognition using low distortion correspondences. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pages 26\u201333, IEEE, 2005.","DOI":"10.1109\/CVPR.2005.320"},{"key":"9662_CR6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bourgain. Random points in isotropic convex sets. In Convex geometric analysis, volume\u00a034 of MSRI Publications, pages 53\u201358. Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/9781009701761.005"},{"key":"9662_CR7","unstructured":"M.\u00a0Bozorg, S.\u00a0Salehkaleybar, and M.\u00a0Hashemi. Seedless graph matching via tail of degree distribution for correlated Erd\u0151s-R\u00e9nyi graphs. ArXiv Preprint, arXiv:1907.06334, 2019."},{"key":"9662_CR8","unstructured":"S.\u00a0Chen, S.\u00a0Jiang, Z.\u00a0Ma, G.\u00a0P. Nolan, and B.\u00a0Zhu. One-way matching of datasets with low rank signals. ArXiv Preprint, arXiv:2204.13858, 2022."},{"key":"9662_CR9","doi-asserted-by":"crossref","unstructured":"T.\u00a0Cour, P.\u00a0Srinivasan, and J.\u00a0Shi. Balanced graph matching. In Advances in Neural Information Processing Systems (NIPS), volume\u00a019. MIT Press, 2006.","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"9662_CR10","unstructured":"D.\u00a0Cullina and N.\u00a0Kiyavash. Exact alignment recovery for correlated Erd\u0151s-R\u00e9nyi graphs. ArXiv Preprint, arXiv:1711.06783, 2017."},{"key":"9662_CR11","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cullina and N.\u00a0Kiyavash. Improved achievability and converse bounds for Erd\u0151s-R\u00e9nyi graph matching. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pages 63\u201372, ACM, 2016.","DOI":"10.1145\/2896377.2901460"},{"key":"9662_CR12","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cullina, N.\u00a0Kiyavash, P.\u00a0Mittal, and H.\u00a0V. Poor. Partial recovery of Erd\u0151s-R\u00e9nyi graph alignment via $$k$$-core alignment. In Proceedings of the 2020 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pages 99\u2013100, ACM, 2020.","DOI":"10.1145\/3393691.3394211"},{"key":"9662_CR13","doi-asserted-by":"crossref","unstructured":"O.\u00a0E. Dai, D.\u00a0Cullina, N.\u00a0Kiyavash, and M.\u00a0Grossglauser. Analysis of a canonical labeling algorithm for the alignment of correlated Erd\u0151s-R\u00e9nyi graphs. In Proceedings of the ACM on Measurement and Analysis of Computing Systems, pages 1\u201325, ACM, 2019.","DOI":"10.1145\/3341617.3326151"},{"key":"9662_CR14","doi-asserted-by":"crossref","unstructured":"I.\u00a0Diakonikolas, D.\u00a0M. Kane, and J.\u00a0Nelson. Bounded independence fools degree-2 threshold functions. In IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS), pages 11\u201320, IEEE, 2010.","DOI":"10.1109\/FOCS.2010.8"},{"issue":"8","key":"9662_CR15","doi-asserted-by":"publisher","first-page":"5289","DOI":"10.1109\/TIT.2023.3265009","volume":"69","author":"J Ding","year":"2023","unstructured":"J.\u00a0Ding and H.\u00a0Du. Detection threshold for correlated Erd\u0151s-R\u00e9nyi graphs via densest subgraph. IEEE Transactions on Information Theory, 69(8): 5289\u20135298, 2023.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9662_CR16","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1214\/23-AOS2305","volume":"51","author":"J Ding","year":"2023","unstructured":"J.\u00a0Ding and H.\u00a0Du. Matching recovery threshold for correlated random graphs. Annals of Statistics, 51(4): 1718\u20131743, 2023.","journal-title":"Annals of Statistics"},{"key":"9662_CR17","unstructured":"J.\u00a0Ding, H.\u00a0Du, and S.\u00a0Gong. A polynomial-time approximation scheme for the maximal overlap of two independent Erd\u0151s-R\u00e9nyi graphs. To appear in Random Structures and Algorithms."},{"key":"9662_CR18","unstructured":"J.\u00a0Ding, H.\u00a0Du, and Z.\u00a0Li. Low-degree hardness of detection for correlated Erd\u0151s-R\u00e9nyi graphs. ArXiv Preprint, arXiv:2311.15931, 2023."},{"key":"9662_CR19","unstructured":"J.\u00a0Ding and Z.\u00a0Li. A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation. ArXiv Preprint, arXiv:2306.00266, 2023."},{"issue":"1\u20132","key":"9662_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00440-020-00997-4","volume":"179","author":"J Ding","year":"2021","unstructured":"J.\u00a0Ding, Z.\u00a0Ma, Y.\u00a0Wu, and J.\u00a0Xu. Efficient random graph matching via degree profiles. Probability Theory and Related Fields, 179(1-2):29\u2013115, 2021.","journal-title":"Probability Theory and Related Fields"},{"key":"9662_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of measure for the analysis of randomized algorithms","author":"DP Dubhashi","year":"2009","unstructured":"D.\u00a0P. Dubhashi and A.\u00a0Panconesi. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, Cambridge, 2009."},{"issue":"5","key":"9662_CR22","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s10208-022-09570-y","volume":"23","author":"Z Fan","year":"2023","unstructured":"Z.\u00a0Fan, C.\u00a0Mao, Y.\u00a0Wu, and J.\u00a0Xu. Spectral graph matching and regularized quadratic relaxations I: Algorithm and theory. Foundations of Computational Mathematics, 23(5):1511\u20131565, 2023.","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"9662_CR23","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1007\/s10208-022-09575-7","volume":"23","author":"Z Fan","year":"2023","unstructured":"Z.\u00a0Fan, C.\u00a0Mao, Y.\u00a0Wu, and J.\u00a0Xu. Spectral graph matching and regularized quadratic relaxations II: Erd\u0151s-R\u00e9nyi graphs and universality. Foundations of Computational Mathematics, 23(5):1567\u20131617, 2023.","journal-title":"Foundations of Computational Mathematics"},{"key":"9662_CR24","unstructured":"S.\u00a0Feizi, G.\u00a0Quon, M.\u00a0Medard, M.\u00a0Kellis, and A.\u00a0Jadbabaie. Spectral alignment of networks. ArXiv Preprint, arXiv:1602.04181, 2016."},{"key":"9662_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A mathematical introduction to compressive sensing","author":"S Foucart","year":"2013","unstructured":"S.\u00a0Foucart and H.\u00a0Rauhut. A mathematical introduction to compressive sensing. Applied and Numerical Harmonic Analysis. Birkh\u00e4user\/Springer, New York, 2013."},{"issue":"41","key":"9662_CR26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2108492118","volume":"118","author":"D Gamarnik","year":"2021","unstructured":"D.\u00a0Gamarnik. The overlap gap property: A topological barrier to optimizing over random structures. Proceedings of the National Academy of Sciences, 118(41):e2108492118, 2021.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9662_CR27","unstructured":"L.\u00a0Ganassali. Sharp threshold for alignment of graph databases with Gaussian weights. In Mathematical and Scientific Machine Learning, pages 314\u2013335, PMLR, 2022."},{"key":"9662_CR28","unstructured":"L.\u00a0Ganassali and L.\u00a0Massouli\u00e9. From tree matching to sparse graph alignment. In Proceedings of Thirty Third Conference on Learning Theory (COLT), pages 1633\u20131665, PMLR, 2020."},{"key":"9662_CR29","unstructured":"L.\u00a0Ganassali, L.\u00a0Massouli\u00e9, and M.\u00a0Lelarge. Impossibility of partial recovery in the graph alignment problem. In Proceedings of Thirty Fourth Conference on Learning Theory (COLT), pages 2080\u20132102, PMLR, 2021."},{"key":"9662_CR30","unstructured":"L.\u00a0Ganassali, L.\u00a0Massouli\u00e9, and M.\u00a0Lelarge. Correlation detection in trees for planted graph alignment. To appear in Annals of Applied Probability."},{"key":"9662_CR31","unstructured":"L.\u00a0Ganassali, L.\u00a0Massouli\u00e9, and G.\u00a0Semerjian. Statistical limits of correlation detection in trees. To appear in Annals of Applied Probability."},{"key":"9662_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Haghighi, A.\u00a0Ng, and C.\u00a0Manning. Robust textual inference via graph matching. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, pages 387\u2013394, Vancouver, British Columbia, Canada, 2005.","DOI":"10.3115\/1220575.1220624"},{"issue":"1","key":"9662_CR33","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/opre.2022.2355","volume":"71","author":"G Hall","year":"2023","unstructured":"G.\u00a0Hall and L.\u00a0Massouli\u00e9. Partial recovery in the graph alignment problem. Operations Research, 71(1):259\u2013272, 2023.","journal-title":"Operations Research"},{"key":"9662_CR34","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1214\/aoms\/1177693335","volume":"42","author":"DL Hanson","year":"1971","unstructured":"D.\u00a0L. Hanson and F.\u00a0T. Wright. A bound on tail probabilities for quadratic forms in independent random variables. Annals of Mathematical Statistics, 42:1079\u20131083, 1971.","journal-title":"Annals of Mathematical Statistics"},{"issue":"10","key":"9662_CR35","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.14778\/2794367.2794371","volume":"8","author":"E Kazemi","year":"2015","unstructured":"E.\u00a0Kazemi, S.\u00a0H. Hassani, and M.\u00a0Grossglauser. Growing a graph matching from a handful of seeds. Proceedings of the VLDB Endowment, 8(10):1010\u20131021, 2015.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"6","key":"9662_CR36","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1214\/009117906000000421","volume":"34","author":"R Lata\u0142a","year":"2006","unstructured":"R.\u00a0Lata\u0142a. Estimates of moments and tails of Gaussian chaoses. Annals of Probability, 34(6):2315\u20132331, 2006.","journal-title":"Annals of Probability"},{"issue":"1","key":"9662_CR37","first-page":"3513","volume":"15","author":"V Lyzinski","year":"2014","unstructured":"V.\u00a0Lyzinski, D.\u00a0E. Fishkind, and C.\u00a0E. Priebe. Seeded graph matching for correlated Erd\u0151s-R\u00e9nyi graphs. Journal of Machine Learning Research, 15(1):3513\u20133540, 2014.","journal-title":"Journal of Machine Learning Research"},{"key":"9662_CR38","unstructured":"C.\u00a0Mao, M.\u00a0Rudelson, and K.\u00a0Tikhomirov. Random Graph Matching with Improved Noise Robustness. In Proceedings of Thirty Fourth Conference on Learning Theory (COLT), pages 3296\u20133329, PMLR, 2021."},{"issue":"2","key":"9662_CR39","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00440-022-01184-3","volume":"186","author":"C Mao","year":"2023","unstructured":"C.\u00a0Mao, M.\u00a0Rudelson, and K.\u00a0Tikhomirov. Exact matching of random graphs with constant correlation. Probability Theory and Related Fields, 186(2):327\u2013389, 2023.","journal-title":"Probability Theory and Related Fields"},{"key":"9662_CR40","doi-asserted-by":"crossref","unstructured":"C.\u00a0Mao, Y.\u00a0Wu, J.\u00a0Xu, and S.\u00a0H. Yu. Random graph matching at Otter\u2019s threshold via counting chandeliers. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), pages 1345\u20131356, ACM, 2023.","DOI":"10.1145\/3564246.3585156"},{"key":"9662_CR41","unstructured":"C.\u00a0Mao, Y.\u00a0Wu, J.\u00a0Xu, and S.\u00a0H. Yu. Testing network correlation efficiently via counting trees. To appear in Annals of Statistics."},{"issue":"3","key":"9662_CR42","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1002\/rsa.20934","volume":"57","author":"E Mossel","year":"2020","unstructured":"E.\u00a0Mossel and J.\u00a0Xu. Seeded graph matching via large neighborhood statistics. Random Structures and Algorithms, 57(3):570\u2013611, 2020.","journal-title":"Random Structures and Algorithms"},{"key":"9662_CR43","doi-asserted-by":"crossref","unstructured":"A.\u00a0Narayanan and V.\u00a0Shmatikov. Robust de-anonymization of large sparse datasets. In 2008 IEEE Symposium on Security and Privacy, pages 111\u2013125, IEEE, 2008.","DOI":"10.1109\/SP.2008.33"},{"key":"9662_CR44","doi-asserted-by":"crossref","unstructured":"A.\u00a0Narayanan and V.\u00a0Shmatikov. De-anonymizing social networks. In 2009 30th IEEE Symposium on Security and Privacy, pages 173\u2013187, IEEE, 2009.","DOI":"10.1109\/SP.2009.22"},{"key":"9662_CR45","doi-asserted-by":"crossref","unstructured":"P.\u00a0Pedarsani and M.\u00a0Grossglauser. On the privacy of anonymized networks. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 1235\u20131243, ACM, 2011.","DOI":"10.1145\/2020408.2020596"},{"issue":"6","key":"9662_CR46","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ac70d2","volume":"2022","author":"G Piccioli","year":"2022","unstructured":"G.\u00a0Piccioli, G.\u00a0Semerjian, G.\u00a0Sicuro, and L.\u00a0Zdeborov\u00e1. Aligning random graphs with a sub-tree similarity message-passing algorithm. Journal of Statistical Mechanics: Theory and Experiment, 2022(6):063401, 2022.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"2","key":"9662_CR47","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1214\/21-AAP1703","volume":"32","author":"MZ Racz","year":"2022","unstructured":"M.\u00a0Z. Racz and A.\u00a0Sridhar. Correlated randomly growing graphs. Annals of Applied Probability, 32(2):1058\u20131111, 2022.","journal-title":"Annals of Applied Probability"},{"key":"9662_CR48","unstructured":"M.\u00a0Z. Racz and A.\u00a0Sridhar. Correlated stochastic block models: Exact graph matching with applications to recovering communities. In Advances in Neural Information Processing Systems (NIPS), pages 22259\u201322273, Curran Associates, 2021."},{"key":"9662_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/ECP.v18-2865","volume":"18","author":"M Rudelson","year":"2013","unstructured":"M.\u00a0Rudelson and R.\u00a0Vershynin. Hanson-Wright inequality and sub-Gaussian concentration. Electronic Communication in Probability, 18:1\u20139, 2013.","journal-title":"Electronic Communication in Probability"},{"issue":"3","key":"9662_CR50","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1214\/22-AOS2179","volume":"50","author":"T Schramm","year":"2022","unstructured":"T.\u00a0Schramm and A.\u00a0S. Wein. Computational barriers to estimation from low-degree polynomials. Annals of Statistics, 50(3):1833\u20131858, 2022.","journal-title":"Annals of Statistics"},{"key":"9662_CR51","doi-asserted-by":"crossref","unstructured":"F.\u00a0Shirani, S.\u00a0Garg, and E.\u00a0Erkip. Seeded graph matching: Efficient algorithms and theoretical guarantees. In 2017 51st Asilomar Conference on Signals, Systems, and Computers, pages 253\u2013257, IEEE, 2017.","DOI":"10.1109\/ACSSC.2017.8335178"},{"issue":"35","key":"9662_CR52","doi-asserted-by":"publisher","first-page":"12763","DOI":"10.1073\/pnas.0806627105","volume":"105","author":"R Singh","year":"2008","unstructured":"R.\u00a0Singh, J.\u00a0Xu, and B.\u00a0Berger. Global alignment of multiple protein interaction networks with application to functional orthology detection. Proceedings of the National Academy of Sciences of the United States of America, 105(35):12763\u201312768, 2008.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"4","key":"9662_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0121002","volume":"10","author":"JT Vogelstein","year":"2015","unstructured":"J.\u00a0T. Vogelstein, J.\u00a0M. Conroy, V.\u00a0Lyzinski, L.\u00a0J. Podrazik, S.\u00a0G. Kratzer, E.\u00a0T. Harley, D.\u00a0E. Fishkind, R.\u00a0J. Vogelstein, and C.\u00a0E. Priebe. Fast approximate quadratic programming for graph matching. PLOS ONE, 10(4):1\u201317, 2015.","journal-title":"PLOS ONE"},{"key":"9662_CR54","unstructured":"H.\u00a0Wang, Y.\u00a0Wu, J.\u00a0Xu, and I.\u00a0Yolou. Random graph matching in geometric models: the case of complete graphs. In Conference on Learning Theory (COLT), pages 3441\u20133488, PMLR, 2022."},{"issue":"6","key":"9662_CR55","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1214\/aop\/1176996815","volume":"1","author":"FT Wright","year":"1973","unstructured":"F.\u00a0T. Wright. A bound on tail probabilities for quadratic forms in independent random variables whose distributions are not necessarily symmetric. Annals of Probability, 1(6):1068\u20131070, 1973.","journal-title":"Annals of Probability"},{"issue":"8","key":"9662_CR56","doi-asserted-by":"publisher","first-page":"5391","DOI":"10.1109\/TIT.2022.3169005","volume":"68","author":"Y Wu","year":"2022","unstructured":"Y.\u00a0Wu, J.\u00a0Xu, and S.\u00a0H. Yu. Settling the sharp reconstruction thresholds of random graph matching. IEEE Transactions on Information Theory, 68(8):5391\u20135417, 2022.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9662_CR57","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1214\/22-AAP1786","volume":"33","author":"Y Wu","year":"2023","unstructured":"Y.\u00a0Wu, J.\u00a0Xu, and S.\u00a0H. Yu. Testing correlation of unlabeled random graphs. Annals of Applied Probability, 33(4): 2519\u20132558, 2023.","journal-title":"Annals of Applied Probability"},{"key":"9662_CR58","doi-asserted-by":"crossref","unstructured":"L.\u00a0Yartseva and M.\u00a0Grossglauser. On the performance of percolation graph matching. In Proceedings of the First ACM Conference on Online Social Networks, pages 119\u2013130, ACM, 2013.","DOI":"10.1145\/2512938.2512952"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-024-09662-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-024-09662-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-024-09662-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T21:12:06Z","timestamp":1757106726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-024-09662-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["9662"],"URL":"https:\/\/doi.org\/10.1007\/s10208-024-09662-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"25 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}