{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T11:46:14Z","timestamp":1783079174287,"version":"3.54.6"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10957-024-02452-z","type":"journal-article","created":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T06:01:26Z","timestamp":1719122486000},"page":"146-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Use of Quantum Linear System Algorithms in Inexact Infeasible IPMs for Linear Optimization"],"prefix":"10.1007","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4046-0672","authenticated-orcid":false,"given":"Mohammadhossein","family":"Mohammadisiahroudi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramin","family":"Fakhimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,23]]},"reference":[{"key":"2452_CR1","doi-asserted-by":"publisher","unstructured":"Al-Jeiroudi, G., Gondzio, J.: Convergence analysis of the inexact infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 141(2), 231\u2013247 (2009). https:\/\/doi.org\/10.1007\/s10957-008-9500-5","DOI":"10.1007\/s10957-008-9500-5"},{"key":"2452_CR2","unstructured":"Ambainis, A.: Variable time amplitude amplification and quantum algorithms for linear algebra problems. In: STACS\u201912 (29th Symposium on Theoretical Aspects of Computer Science), vol.\u00a014, pp.\u00a0636\u2013647. LIPIcs (2012). https:\/\/bit.ly\/3IldDGR"},{"key":"2452_CR3","unstructured":"Andersen, E.D., Roos, C., Terlaky, T., Trafalis, T., Warners, J.P.: The use of low-rank updates in interior-point methods. In: Yuan, Y. (ed) Numerical Linear Algebra and Optimization, pp.\u00a01\u201312. Science Press, Beijing, China (2004)"},{"key":"2452_CR4","doi-asserted-by":"publisher","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012). https:\/\/doi.org\/10.4086\/toc.2012.v008a006","DOI":"10.4086\/toc.2012.v008a006"},{"key":"2452_CR5","doi-asserted-by":"publisher","unstructured":"Augustino, B., Nannicini, G., Terlaky, T., Zuluaga, L.F.: Quantum interior point methods for semidefinite optimization. Quantum 7, 1110 (2023). https:\/\/doi.org\/10.22331\/q-2023-09-11-1110","DOI":"10.22331\/q-2023-09-11-1110"},{"key":"2452_CR6","doi-asserted-by":"publisher","unstructured":"Baryamureeba, V., Steihaug, T.: On the convergence of an inexact primal-dual interior point method for linear programming. In: Lirkov, I., Margenov, S., Wa\u015bniewski, J. (eds.) The Large-Scale Scientific Computing, Berlin, Heidelberg, Springer Berlin Heidelberg, pp.\u00a0629\u2013637 (2006). https:\/\/doi.org\/10.1007\/11666806_72","DOI":"10.1007\/11666806_72"},{"key":"2452_CR7","doi-asserted-by":"publisher","unstructured":"Bellavia, S.: Inexact interior-point method. J. Optim. Theory Appl. 96(1), 109\u2013121 (1998). https:\/\/doi.org\/10.1023\/A:1022663100715","DOI":"10.1023\/A:1022663100715"},{"key":"2452_CR8","doi-asserted-by":"publisher","unstructured":"Bellavia, S., Pieraccini, S.: Convergence analysis of an inexact infeasible interior point method for semidefinite programming. Comput. Optim. Appl. 29(3), 289\u2013313 (2004). https:\/\/doi.org\/10.1023\/B:COAP.0000044183.43473.34","DOI":"10.1023\/B:COAP.0000044183.43473.34"},{"key":"2452_CR9","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, F.G.S.L., Kalev, A., Li, T., Yen-Yu L., Cedric, S., Krysta M., Wu, X.: Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning. arXiv preprint (2017). https:\/\/doi.org\/10.48550\/arXiv.1710.02581","DOI":"10.48550\/arXiv.1710.02581"},{"key":"2452_CR10","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, F.G.S.L., Svore, K.M..: Quantum speed-ups for solving semidefinite programs. In: IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), vol. 2017, pp. 415\u2013426. IEEE (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.45","DOI":"10.1109\/FOCS.2017.45"},{"key":"2452_CR11","doi-asserted-by":"publisher","unstructured":"Casares, P.A.M., Martin-Delgado, M.A.: A quantum interior-point predictor-corrector algorithm for linear programming. J. Phys. A Math. Theor. 53(44), 445305 (2020). https:\/\/doi.org\/10.1088\/1751-8121\/abb439\/meta","DOI":"10.1088\/1751-8121\/abb439\/meta"},{"key":"2452_CR12","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Gily\u00e9n, A., Jeffery, S.: The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation. arXiv preprint (2018). https:\/\/doi.org\/10.48550\/arXiv.1804.01973","DOI":"10.48550\/arXiv.1804.01973"},{"issue":"6","key":"2452_CR13","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1137\/16m1087072","volume":"46","author":"AM Childs","year":"2017","unstructured":"Childs, A.M., Kothari, R., Somma, R.D.: Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comput. 46(6), 1920\u20131950 (2017). https:\/\/doi.org\/10.1137\/16m1087072","journal-title":"SIAM J. Comput."},{"key":"2452_CR14","doi-asserted-by":"publisher","DOI":"10.1145\/3424305","author":"MB Cohen","year":"2021","unstructured":"Cohen, M.B., Lee, Y.T., Song, Z.: Solving linear programs in the current matrix multiplication time. J. ACM (2021). https:\/\/doi.org\/10.1145\/3424305","journal-title":"J. ACM"},{"key":"2452_CR15","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton, Princeton University Press (1963). https:\/\/doi.org\/10.1515\/9781400884179"},{"key":"2452_CR16","doi-asserted-by":"publisher","unstructured":"Dervovic, D., Herbster, M., Mountney, P., Severini, S., Usher, N., Wossnig, L.: Quantum linear systems algorithms: a primer. arXiv preprint (2018). https:\/\/doi.org\/10.48550\/arXiv.1802.08227","DOI":"10.48550\/arXiv.1802.08227"},{"issue":"1818","key":"2452_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church\u2013Turing principle and the universal quantum computer. Proc. R. Soc. A Math. Phys. Eng. Sci. 400(1818), 97\u2013117 (1985). https:\/\/doi.org\/10.1098\/rspa.1985.0070","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"issue":"1907","key":"2452_CR18","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. A Math. Phys. Eng. Sci. 439(1907), 553\u2013558 (1992). https:\/\/doi.org\/10.1098\/rspa.1992.0167","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"issue":"1","key":"2452_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.24.1.50","volume":"24","author":"RW Freund","year":"1999","unstructured":"Freund, R.W., Jarre, F., Mizuno, S.: Convergence of a class of inexact interior-point algorithms for linear programs. Math. Oper. Res. 24(1), 50\u201371 (1999). https:\/\/doi.org\/10.1287\/moor.24.1.50","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2452_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10107-019-01444-6","volume":"183","author":"A Gleixner","year":"2020","unstructured":"Gleixner, A., Steffy, D.E.: Linear programming using limited-precision oracles. Math. Program. 183(1), 525\u2013554 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01444-6","journal-title":"Math. Program."},{"issue":"3","key":"2452_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/ijoc.2016.0692","volume":"28","author":"AM Gleixner","year":"2016","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Iterative refinement for linear programming. INFORMS J. Comput. 28(3), 449\u2013464 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0692","journal-title":"INFORMS J. Comput."},{"key":"2452_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., den Hertog, D., Roos, C., Terlaky, T., Tsuchiya, T.: Degeneracy in interior point methods for linear programming: a survey. Ann. Oper. Res. 46, 107\u2013138 (1993)","journal-title":"Ann. Oper. Res."},{"key":"2452_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.103.150502","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. (2009). https:\/\/doi.org\/10.1103\/physrevlett.103.150502","journal-title":"Phys. Rev. Lett."},{"key":"2452_CR24","doi-asserted-by":"publisher","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing. STOC \u201984. Association for Computing Machinery, New York, NY, USA, pp. 302\u2013311 (1984). https:\/\/doi.org\/10.1145\/800057.808695","DOI":"10.1145\/800057.808695"},{"issue":"1","key":"2452_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3406306","volume":"1","author":"I Kerenidis","year":"2020","unstructured":"Kerenidis, I., Prakash, A.: A quantum interior point method for LPs and SDPs. ACM Trans. Quantum Comput. 1(1), 1\u201332 (2020). https:\/\/doi.org\/10.1145\/3406306","journal-title":"ACM Trans. Quantum Comput."},{"key":"2452_CR26","doi-asserted-by":"publisher","unstructured":"Kerenidis, I., Prakash, A.: Quantum recommendation systems. arXiv preprint (2016). https:\/\/doi.org\/10.48550\/arXiv.1603.08675","DOI":"10.48550\/arXiv.1603.08675"},{"key":"2452_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.22331\/q-2021-04-08-427","volume":"5","author":"I Kerenidis","year":"2021","unstructured":"Kerenidis, I., Prakash, A., Szil\u00e1gyi, D.: Quantum algorithms for second-order cone programming and support vector machines. Quantum 5, 427 (2021). https:\/\/doi.org\/10.22331\/q-2021-04-08-427","journal-title":"Quantum"},{"key":"2452_CR28","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. In: Doklady Akademii Nauk, vol. 244.5. Reports of the Russian Academy of Sciences, pp. 1093\u20131096 (1979). http:\/\/mi.mathnet.ru\/eng\/dan42319"},{"issue":"1","key":"2452_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal\u2013dual infeasible-interior-point algorithm for linear programming. Math. Program. 61(1), 263\u2013280 (1993). https:\/\/doi.org\/10.1007\/BF01582151","journal-title":"Math. Program."},{"issue":"1","key":"2452_CR30","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S1052623497329993","volume":"11","author":"J Korzak","year":"2000","unstructured":"Korzak, J.: Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM J. Optim. 11(1), 133\u2013148 (2000). https:\/\/doi.org\/10.1137\/S1052623497329993","journal-title":"SIAM J. Optim."},{"key":"2452_CR31","doi-asserted-by":"publisher","unstructured":"Lee, Y.T., Sidford, A.: Efficient inverse maintenance and faster algorithms for linear programming. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.\u00a0230\u2013249 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.23","DOI":"10.1109\/FOCS.2015.23"},{"key":"2452_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.22331\/q-2019-07-12-163","volume":"3","author":"GH Low","year":"2019","unstructured":"Low, G.H., Chuang, I.L.: Hamiltonian simulation by qubitization. Quantum 3, 163 (2019). https:\/\/doi.org\/10.22331\/q-2019-07-12-163","journal-title":"Quantum"},{"issue":"1","key":"2452_CR33","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107980020a","volume":"84","author":"S Mizuno","year":"1999","unstructured":"Mizuno, S., Jarre, F.: Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. Math. Program. 84(1), 105\u2013122 (1999). https:\/\/doi.org\/10.1007\/s10107980020a","journal-title":"Math. Program."},{"key":"2452_CR34","unstructured":"Mohammadisiahroudi, M., Augustino, B., Sampourmahani, P., Terlaky, T.: Quantum computing inspired iterative refinement for semidefinite optimization. arXiv preprint arXiv:2312.11253 (2023)"},{"key":"2452_CR35","doi-asserted-by":"crossref","unstructured":"Mohammadisiahroudi, M., Fakhimi, R., Augustino, B., Terlaky, T.: Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments. arXiv preprint arXiv:2302.00711 (2023)","DOI":"10.1080\/10556788.2024.2308677"},{"key":"2452_CR36","unstructured":"Mohammadisiahroudi, M., Fakhimi, R., Augustino, B., Terlaky, T., Nannicini, G.: Accurately solving linear systems with quantum oracles. Bull. Am. Phys. Soc. (2023)"},{"key":"2452_CR37","unstructured":"Mohammadisiahroudi, M., Fakhimi, R., Wu, Z., Terlaky, T.: An inexact feasible interior point method for linear optimization with high adaptability to quantum computers. arXiv preprint arXiv:2307.14445 (2023)"},{"key":"2452_CR38","unstructured":"Monteiro, R., O\u2019Neal, J.W.: Convergence analysis of a long-step primal\u2013dual infeasible interior-point LP algorithm based on iterative linear solvers. Georgia Institute of Technology (2003). https:\/\/bit.ly\/3ss0kg1"},{"key":"2452_CR39","doi-asserted-by":"crossref","unstructured":"Nannicini, G.: Fast quantum subroutines for the simplex method. Oper. Res. (2022)","DOI":"10.1007\/978-3-030-73879-2_22"},{"issue":"4","key":"2452_CR40","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step $$O(n)$$ infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"2452_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/b100325","volume-title":"Interior Point Methods for Linear Optimization","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Interior Point Methods for Linear Optimization. Springer (2005). https:\/\/doi.org\/10.1007\/b100325"},{"key":"2452_CR42","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative Methods for Sparse Systems. SIAM (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","DOI":"10.1137\/1.9780898718003"},{"issue":"1","key":"2452_CR43","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1214\/aoms\/1177729893","volume":"21","author":"J Sherman","year":"1950","unstructured":"Sherman, J., Morrison, W.J.: Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. Ann. Math. Stat. 21(1), 124\u2013127 (1950)","journal-title":"Ann. Math. Stat."},{"issue":"5","key":"2452_CR44","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/s0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/s0097539796298637","journal-title":"SIAM J. Comput."},{"key":"2452_CR45","series-title":"Applied Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3449-1","volume-title":"Interior Point Methods of Mathematical Programming","author":"T Terlaky","year":"1996","unstructured":"Terlaky, T.: Interior Point Methods of Mathematical Programming. Applied Optimization, vol. 5. Kluwer Academic Publisher (1996). https:\/\/doi.org\/10.1007\/978-1-4613-3449-1"},{"key":"2452_CR46","doi-asserted-by":"publisher","unstructured":"van Apeldoorn, J., Cornelissen, A., Gily\u00e9n, A., Nannicini, G.: Quantum tomography using state-preparation unitaries. arXiv preprint (2022). https:\/\/doi.org\/10.48550\/arXiv.2207.08800","DOI":"10.48550\/arXiv.2207.08800"},{"key":"2452_CR47","doi-asserted-by":"publisher","first-page":"230","DOI":"10.22331\/q-2020-02-14-230","volume":"4","author":"J van Apeldoorn","year":"2020","unstructured":"van Apeldoorn, J., Gily\u00e9n, A., Gribling, S., de Wolf, R.: Quantum SDP-solvers: better upper and lower bounds. Quantum 4, 230 (2020)","journal-title":"Quantum"},{"key":"2452_CR48","doi-asserted-by":"publisher","unstructured":"van Apeldoorn, J., Gily\u00e9n, A.: Improvements in quantum SDP-solving with applications. arXiv preprint (2018). https:\/\/doi.org\/10.48550\/arXiv.1804.05058","DOI":"10.48550\/arXiv.1804.05058"},{"key":"2452_CR49","doi-asserted-by":"publisher","unstructured":"van Apeldoorn, J., Gily\u00e9n, A.: Quantum algorithms for zero-sum games. arXiv preprint (2019). https:\/\/doi.org\/10.48550\/arXiv.1904.03180","DOI":"10.48550\/arXiv.1904.03180"},{"key":"2452_CR50","doi-asserted-by":"publisher","unstructured":"van den Brand, J.: A deterministic linear program solver in current matrix multiplication time. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0259\u2013278. https:\/\/doi.org\/10.1137\/1.9781611975994.16. https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611975994.16. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611975994.16","DOI":"10.1137\/1.9781611975994.16"},{"issue":"1","key":"2452_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3490631","volume":"3","author":"AC Vazquez","year":"2022","unstructured":"Vazquez, A.C., Hiptmair, R., Woerner, S.: Enhancing the quantum linear systems algorithm using Richardson extrapolation. ACM Trans. Quantum Comput. 3(1), 1\u201337 (2022). https:\/\/doi.org\/10.1145\/3490631","journal-title":"ACM Trans. Quantum Comput."},{"key":"2452_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.120.050502","author":"L Wossnig","year":"2018","unstructured":"Wossnig, L., Zhao, Z., Prakash, A.: Quantum linear system algorithm for dense matrices. Phys. Rev. Lett. (2018). https:\/\/doi.org\/10.1103\/physrevlett.120.050502","journal-title":"Phys. Rev. Lett."},{"key":"2452_CR53","doi-asserted-by":"publisher","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods. SIAM 2, 2 (1997). https:\/\/doi.org\/10.1137\/1.9781611971453","DOI":"10.1137\/1.9781611971453"},{"key":"2452_CR54","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis, Wiley, London (2011)"},{"issue":"1","key":"2452_CR55","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$O(\\sqrt{n}L)$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994). https:\/\/doi.org\/10.1287\/moor.19.1.53","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2452_CR56","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-003-0431-5","volume":"99","author":"G Zhou","year":"2004","unstructured":"Zhou, G., Toh, K.-C.: Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming. Math. Program. 99(2), 261\u2013282 (2004). https:\/\/doi.org\/10.1007\/s10107-003-0431-5","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02452-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:04:43Z","timestamp":1721549083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02452-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2452"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02452-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"30 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}