{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:11:20Z","timestamp":1743048680838,"version":"3.40.3"},"reference-count":26,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2025,4,3]]},"DOI":"10.1080\/00207160.2024.2439328","type":"journal-article","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:46:27Z","timestamp":1733982387000},"page":"577-594","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Computing\n            <i>p<\/i>\n            th root of a transition matrix with a deep unsupervised learning approach"],"prefix":"10.1080","volume":"102","author":[{"given":"Filippo","family":"Camellini","sequence":"first","affiliation":[{"name":"University of Modena and Reggio Emilia","place":["Modena, Italy"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9082-8087","authenticated-orcid":false,"given":"Giorgia","family":"Franchini","sequence":"additional","affiliation":[{"name":"University of Modena and Reggio Emilia","place":["Modena, Italy"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7327-3347","authenticated-orcid":false,"given":"Marco","family":"Prato","sequence":"additional","affiliation":[{"name":"University of Modena and Reggio Emilia","place":["Modena, Italy"]}]}],"member":"301","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v060.i03"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00392-w"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/sim.2970"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1177\/0272989X16656165"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1268641"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.03.039"},{"key":"e_1_3_3_10_1","unstructured":"Fitch Ratings 2022. Available at https:\/\/www.fitchratings.com\/research\/corporate-finance\/2021-transition-default-studies-31-03-2022."},{"key":"e_1_3_3_11_1","unstructured":"Fitch Ratings 2023. Available at https:\/\/www.fitchratings.com\/research\/fund-asset-managers\/rating-definitions-24-04-2023."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.04.007"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/10081232X"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.3390\/risks4030031"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00428-4"},{"key":"e_1_3_3_17_1","unstructured":"D.P. Kingma and J. Ba Adam: A method for stochastic optimization (2017). Available at https:\/\/arxiv.org\/abs\/1412.6980."},{"issue":"1","key":"e_1_3_3_18_1","first-page":"23","article-title":"Regularization algorithms for transition matrices","volume":"4","author":"Kreinin A.","year":"2001","unstructured":"A. Kreinin and M. Sidelnikova, Regularization algorithms for transition matrices, Algo Res. Q. 4(1\/2) (2001), pp. 23\u201340.","journal-title":"Algo Res. Q."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_3_20_1","unstructured":"L. Lin Roots of stochastic matrices and fractional matrix powers Ph.D. thesis The University of Manchester Manchester UK 2010."},{"key":"e_1_3_3_21_1","unstructured":"L. Merkoulovitch The projection on the standard simplex Algorithmics Inc. Working Paper 2000."},{"key":"e_1_3_3_22_1","unstructured":"Moody's 2023. Available at https:\/\/ratings.moodys.com\/api\/rmc-documents\/53954."},{"key":"e_1_3_3_23_1","unstructured":"Open risk guithub page. Available at https:\/\/github.com\/open-risk\/transitionMatrix."},{"key":"e_1_3_3_24_1","unstructured":"S.J. Reddi S. Kale and S. Kumar On the convergence of adam and beyond 2019. Available at https:\/\/arxiv.org\/abs\/1904.09237."},{"key":"e_1_3_3_25_1","unstructured":"Scipy Documentation. Available at https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.linalg.fractional_matrix_power.html."},{"key":"e_1_3_3_26_1","volume-title":"Rating Based Modeling of Credit Risk: Theory and Application of Migration Matrices","author":"Trueck S.","year":"2009","unstructured":"S. Trueck and R. Svetlozar, Rating Based Modeling of Credit Risk: Theory and Application of Migration Matrices, Academic Press, UK, 2009."},{"key":"e_1_3_3_27_1","doi-asserted-by":"crossref","unstructured":"D. Ulyanov A. Vedaldi and V. LempitskyDeep Image Prior in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Salt Lake City UT 2018 pp. 9446\u20139454.","DOI":"10.1109\/CVPR.2018.00984"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2024.2439328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:56:23Z","timestamp":1742982983000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2024.2439328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4,3]]}},"alternative-id":["10.1080\/00207160.2024.2439328"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2024.2439328","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"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=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-26","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}