{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:23:39Z","timestamp":1774520619144,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-24-CE48-4035"],"award-info":[{"award-number":["ANR-24-CE48-4035"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-24-CE48-4035"],"award-info":[{"award-number":["ANR-24-CE48-4035"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s11786-025-00619-z","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T09:10:01Z","timestamp":1774516201000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Validated Numerical Hensel Lifting"],"prefix":"10.1007","volume":"20","author":[{"given":"Florent","family":"Br\u00e9hard","sequence":"first","affiliation":[]},{"given":"Jasmin","family":"Kr\u00fcger","sequence":"additional","affiliation":[]},{"given":"Adrien","family":"Poteaux","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Vinciguerra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,26]]},"reference":[{"key":"619_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013). https:\/\/doi.org\/10.1017\/CBO9781139856065","edition":"3"},{"issue":"2","key":"619_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/321879.321890","volume":"22","author":"DR Musser","year":"1975","unstructured":"Musser, D.R.: Multivariate polynomial factorization. J. ACM 22(2), 291\u2013308 (1975). https:\/\/doi.org\/10.1145\/321879.321890","journal-title":"J. ACM"},{"key":"619_CR3","doi-asserted-by":"publisher","unstructured":"Poteaux, A., Rybowicz, M.: Improving complexity bounds for the computation of Puiseux series over finite fields. In: Proceedings of the 2015 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201915, pp. 299\u2013306. ACM, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2755996.2756650","DOI":"10.1145\/2755996.2756650"},{"key":"619_CR4","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.5802\/ahl.97","volume":"4","author":"A Poteaux","year":"2021","unstructured":"Poteaux, A., Weimann, M.: Computing Puiseux series: a fast divide and conquer algorithm. Ann. Henri Lebesgue 4, 1061\u20131102 (2021). https:\/\/doi.org\/10.5802\/ahl.97","journal-title":"Ann. Henri Lebesgue"},{"issue":"231","key":"619_CR5","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1090\/S0025-5718-00-01246-1","volume":"69","author":"P Walsh","year":"2000","unstructured":"Walsh, P.: A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function. Math. Comput. 69(231), 1167\u20131182 (2000). https:\/\/doi.org\/10.1090\/S0025-5718-00-01246-1","journal-title":"Math. Comput."},{"key":"619_CR6","doi-asserted-by":"publisher","unstructured":"Poteaux, A.: Computing monodromy groups defined by plane algebraic curves. In: Proceedings of the 2007 International Workshop on Symbolic-numeric Computation, pp. 36\u201345. ACM, New-York (2007). https:\/\/doi.org\/10.1145\/1277500.1277509","DOI":"10.1145\/1277500.1277509"},{"key":"619_CR7","unstructured":"Poteaux, A.: Calcul de d\u00e9veloppements de Puiseux et application au calcul de groupe de monodromie d\u2019une courbe alg\u00e9brique plane. PhD thesis, Universit\u00e9 de Limoges (2008). http:\/\/www.theses.fr\/2008LIMO4032"},{"issue":"1","key":"619_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jsc.2011.08.008","volume":"47","author":"A Poteaux","year":"2012","unstructured":"Poteaux, A., Rybowicz, M.: Good reduction of Puiseux series and applications. J. Symb. Comput. 47(1), 32\u201363 (2012). https:\/\/doi.org\/10.1016\/j.jsc.2011.08.008","journal-title":"J. Symb. Comput."},{"key":"619_CR9","doi-asserted-by":"publisher","unstructured":"Br\u00e9hard, F., Poteaux, A., Soudant, L.: Validated root enclosures for interval polynomials with multiplicities. In: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201923, pp. 90\u201399. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3597066.3597122","DOI":"10.1145\/3597066.3597122"},{"key":"619_CR10","doi-asserted-by":"publisher","unstructured":"Sasaki, T., Yamaguchi, S.: An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, pp. 1\u20138 (1998). https:\/\/doi.org\/10.1145\/281508.281521","DOI":"10.1145\/281508.281521"},{"key":"619_CR11","doi-asserted-by":"publisher","unstructured":"Inaba, D., Sasaki, T.: A numerical study of extended Hensel series. In: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation. SNC \u201907, pp. 103\u2013109. Association for Computing Machinery, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1277500.1277517","DOI":"10.1145\/1277500.1277517"},{"key":"619_CR12","doi-asserted-by":"publisher","unstructured":"Zeng, Z., Dayton, B.H.: The approximate GCD of inexact polynomials. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201904, pp. 320\u2013327. ACM, New York, NY, USA (2004). https:\/\/doi.org\/10.1145\/1005285.1005331","DOI":"10.1145\/1005285.1005331"},{"key":"619_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S096249291000005X","volume":"19","author":"SM Rump","year":"2010","unstructured":"Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer 19, 287\u2013449 (2010). https:\/\/doi.org\/10.1017\/S096249291000005X","journal-title":"Acta Numer"},{"key":"619_CR14","doi-asserted-by":"publisher","unstructured":"Tucker, W.: Validated Numerics: A Short Introduction to Rigorous Computations. Princeton University Press (2011). https:\/\/doi.org\/10.2307\/j.ctvcm4g18","DOI":"10.2307\/j.ctvcm4g18"},{"key":"619_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526473","volume-title":"Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications","author":"A Neumaier","year":"1991","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1991). https:\/\/doi.org\/10.1017\/CBO9780511526473"},{"key":"619_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. Society for Industrial and Applied Mathematics, Philadelphia (2009). https:\/\/doi.org\/10.1137\/1.9780898717716"},{"issue":"8","key":"619_CR17","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TC.2017.2690633","volume":"66","author":"F Johansson","year":"2017","unstructured":"Johansson, F.: Arb: efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Trans. Comput. 66(8), 1281\u20131292 (2017). https:\/\/doi.org\/10.1109\/TC.2017.2690633","journal-title":"IEEE Trans. Comput."},{"key":"619_CR18","doi-asserted-by":"publisher","unstructured":"Fieker, C., Hart, W., Hofmann, T., Johansson, F.: Nemo\/Hecke: computer algebra and number theory packages for the Julia programming language. In: Proceedings of the 2017 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201917, pp. 157\u2013164. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3087604.3087611","DOI":"10.1145\/3087604.3087611"},{"key":"619_CR19","unstructured":"van der Hoeven, J.: Reliable homotopy continuation. Technical report, HAL (2011). https:\/\/hal.science\/hal-00589948v4\/"},{"issue":"1","key":"619_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/42267.45069","volume":"35","author":"E Kaltofen","year":"1988","unstructured":"Kaltofen, E.: Greatest common divisors of polynomials given by straight-line programs. J. ACM 35(1), 231\u2013264 (1988). https:\/\/doi.org\/10.1145\/42267.45069","journal-title":"J. ACM"},{"issue":"2","key":"619_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1236463.1236468","volume":"33","author":"L Fousse","year":"2007","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2), 13 (2007). https:\/\/doi.org\/10.1145\/1236463.1236468","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"619_CR22","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s11155-005-6891-y","volume":"11","author":"N Revol","year":"2005","unstructured":"Revol, N., Rouillier, F.: Motivations for an arbitrary precision interval arithmetic and the MPFI library. Reliable Comput. 11(4), 275\u2013290 (2005). https:\/\/doi.org\/10.1007\/s11155-005-6891-y","journal-title":"Reliable Comput."},{"issue":"2","key":"619_CR23","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1137\/0702025","volume":"2","author":"E Hansen","year":"1965","unstructured":"Hansen, E.: Interval arithmetic in matrix computations, part I. J. Soc. Ind. Appl. Math. 2(2), 308\u2013320 (1965). https:\/\/doi.org\/10.1137\/0702025","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"619_CR24","doi-asserted-by":"publisher","unstructured":"Poteaux, A., Weimann, M.: Local polynomial factorisation: Improving the Montes algorithm. In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201922, pp. 149\u2013158. ACM, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3476446.3535487","DOI":"10.1145\/3476446.3535487"},{"key":"619_CR25","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1090\/S0002-9947-2011-05442-5","volume":"364","author":"J Gu\u00e0rdia","year":"2012","unstructured":"Gu\u00e0rdia, J., Montes, J., Nart, E.: Newton polygons of higher order in algebraic number theory. Trans. Am. Math. Soc. 364, 361\u2013416 (2012). https:\/\/doi.org\/10.1090\/S0002-9947-2011-05442-5","journal-title":"Trans. Am. Math. Soc."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-025-00619-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-025-00619-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-025-00619-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T09:10:05Z","timestamp":1774516205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-025-00619-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,26]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s11786-025-00619-z","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,26]]},"assertion":[{"value":"31 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}