{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:24:06Z","timestamp":1769905446330,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"7-9","license":[{"start":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:00:00Z","timestamp":1618358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T00:00:00Z","timestamp":1618358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["19-09967S"],"award-info":[{"award-number":["19-09967S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["19-09967S"],"award-info":[{"award-number":["19-09967S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Grant Agency of the Czech Technical University in Prague","award":["SGS19\/170\/OHK3\/3T\/13"],"award-info":[{"award-number":["SGS19\/170\/OHK3\/3T\/13"]}]},{"name":"Grant Agency of the Czech Technical University in Prague","award":["SGS19\/170\/OHK3\/3T\/13"],"award-info":[{"award-number":["SGS19\/170\/OHK3\/3T\/13"]}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["OP VVV project CZ.02.1.01\/0.0\/0.0\/16\u02d9019\/0000765"],"award-info":[{"award-number":["OP VVV project CZ.02.1.01\/0.0\/0.0\/16\u02d9019\/0000765"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10472-021-09731-9","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T05:55:47Z","timestamp":1618466147000},"page":"777-807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Classes of linear programs solvable by coordinate-wise minimization"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1944-6569","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Dlask","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-7157","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,14]]},"reference":[{"key":"9731_CR1","unstructured":"Ansotegui, C., Bacchus, F., J\u00e4rvisalo, M., Martins, R., et al.: MaxSAT Evaluation 2017. https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/233112\/mse17proc.pdf (2017)"},{"issue":"1","key":"9731_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3233\/SAT190119","volume":"11","author":"F Bacchus","year":"2019","unstructured":"Bacchus, F., J\u00e4rvisalo, M., Martins, R.: MaxSAT evaluation 2018: New developments and detailed results. Journal on Satisfiability, Boolean Modeling and Computation 11(1), 99\u2013131 (2019). Instances available at https:\/\/maxsat-evaluations.github.io\/","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9731_CR3","unstructured":"Bacchus, F., J\u00e4rvisalo, M.J., Martins, R., et al.: MaxSAT Evaluation 2018. https:\/\/helda.helsinki.fi\/bitstream\/handle\/10138\/237139\/mse18_proceedings.pdf (2018)"},{"key":"9731_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Belmont, Athena Scientific (1999)","edition":"2nd edn."},{"issue":"1","key":"9731_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine learning 3(1), 1\u2013122 (2011)","journal-title":"Foundations and Trends in Machine learning"},{"key":"9731_CR6","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Lempitsky, V.S.: From photohulls to photoflux optimization. In: Proceedings of the British Machine Conference, vol. 3, p 27. Citeseer (2006)","DOI":"10.5244\/C.20.117"},{"key":"9731_CR7","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No. 98CB36231), pp. 648\u2013655. IEEE (1998)"},{"key":"9731_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721182","volume-title":"Combinatorial Matrix Classes, vol. 13","author":"RA Brualdi","year":"2006","unstructured":"Brualdi, R.A.: Combinatorial Matrix Classes, vol. 13. Cambridge University Press, Cambridge (2006)"},{"issue":"2","key":"9731_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0166-218X(87)90016-3","volume":"18","author":"G Carpaneto","year":"1987","unstructured":"Carpaneto, G., Toth, P.: Primal-dual algrorithms for the assignment problem. Discret. Appl. Math. 18(2), 137\u2013153 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9731_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision 40(1), 120\u2013145 (2011)","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"5","key":"9731_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","volume":"25","author":"FA Chudak","year":"1999","unstructured":"Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25(5), 199\u2013204 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9731_CR12","doi-asserted-by":"crossref","unstructured":"Dechter, R.: Tractable structures for constraint satisfaction problems. In: Handbook of Constraint Programming, chap. 7. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80011-8"},{"issue":"1-2","key":"9731_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and codes for dense assignment problems: the state of the art. Discret. Appl. Math. 100(1-2), 17\u201348 (2000)","journal-title":"Discret. Appl. Math."},{"key":"9731_CR14","doi-asserted-by":"crossref","unstructured":"Dlask, T.: Unit propagation by means of coordinate-wise minimization. In: International Conference on Machine Learning, Optimization, and Data Science. Springer (2020)","DOI":"10.1007\/978-3-030-64583-0_60"},{"key":"9731_CR15","doi-asserted-by":"crossref","unstructured":"Dlask, T., Werner, T.: Bounding linear programs by constraint propagation: Application to Max-SAT. In: International Conference on Principles and Practice of Constraint Programming, pp. 177\u2013193. Springer (2020)","DOI":"10.1007\/978-3-030-58475-7_11"},{"key":"9731_CR16","doi-asserted-by":"crossref","unstructured":"Dlask, T., Werner, T.: A class of linear programs solvable by coordinate-wise minimization. In: Kotsireas, I.S., Pardalos, P.M. (eds.) Learning and Intelligent Optimization, pp. 52\u201367. Springer (2020)","DOI":"10.1007\/978-3-030-53552-0_8"},{"key":"9731_CR17","doi-asserted-by":"crossref","unstructured":"Dlask, T., Werner, T.: On relation between constraint propagation and block-coordinate descent in linear programs. In: International Conference on Principles and Practice of Constraint Programming, pp. 194\u2013210. Springer (2020)","DOI":"10.1007\/978-3-030-58475-7_12"},{"issue":"1","key":"9731_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. Journal of the ACM (JACM) 61(1), 1\u201323 (2014)","journal-title":"Journal of the ACM (JACM)"},{"issue":"125-130","key":"9731_CR19","first-page":"55","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bur. Stand. B 69(125-130), 55\u201356 (1965)","journal-title":"J. Res. Natl. Bur. Stand. B"},{"issue":"2","key":"9731_CR20","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM (JACM) 19(2), 248\u2013264 (1972)","journal-title":"Journal of the ACM (JACM)"},{"key":"9731_CR21","doi-asserted-by":"crossref","unstructured":"Ferdous, S., Pothen, A., Khan, A.: New approximation algorithms for minimum weighted edge cover. In: 2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, pp. 97\u2013108. SIAM (2018)","DOI":"10.1137\/1.9781611975215.10"},{"issue":"1","key":"9731_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of the ACM (JACM) 29(1), 24\u201332 (1982)","journal-title":"Journal of the ACM (JACM)"},{"key":"9731_CR23","volume-title":"Flows in Networks","author":"D Fulkerson","year":"1962","unstructured":"Fulkerson, D., Ford, L.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9731_CR24","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pp. 434\u2013443 (1990)"},{"key":"9731_CR25","unstructured":"Globerson, A., Jaakkola, T.: Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In: Neural Information Processing Systems, pp. 553\u2013560 (2008)"},{"issue":"2","key":"9731_CR26","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585996","volume":"71","author":"AV Goldberg","year":"1995","unstructured":"Goldberg, A.V., Kennedy, R.: An efficient cost scaling algorithm for the assignment problem. Math. Program. 71(2), 153\u2013177 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"9731_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0377-2217(02)00071-1","volume":"140","author":"DS Hochbaum","year":"2002","unstructured":"Hochbaum, D.S.: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Eur. J. Oper. Res. 140(2), 291\u2013321 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9731_CR28","first-page":"544","volume":"43","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Pathria, A.: Forest harvesting and minimum cuts: a new approach to handling spatial constraints. For. Sci. 43(4), 544\u2013554 (1997)","journal-title":"For. Sci."},{"issue":"1-3","key":"9731_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(00)00244-4","volume":"107","author":"DS Hochbaum","year":"2000","unstructured":"Hochbaum, D.S., Pathria, A.: Approximating a generalization of MAX 2SAT and MIN 2SAT. Discret. Appl. Math. 107(1-3), 41\u201359 (2000)","journal-title":"Discret. Appl. Math."},{"key":"9731_CR30","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Logic-based methods for optimization: combining optimization and constraint satisfaction. Wiley series in discrete mathematics and optimization. Wiley (2000)","DOI":"10.1002\/9781118033036"},{"issue":"2","key":"9731_CR31","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"JH Kappes","year":"2015","unstructured":"Kappes, J.H., Andres, B., Hamprecht, F.A., Schn\u00f6rr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B.X., Kr\u00f6ger, T., Lellmann, J., Komodakis, N., Savchynskyy, B., Rother, C.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Intl. J. Comput. Vis. 115(2), 155\u2013184 (2015)","journal-title":"Intl. J. Comput. Vis."},{"issue":"2","key":"9731_CR32","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S0895480191220836","volume":"7","author":"R Kohli","year":"1994","unstructured":"Kohli, R., Krishnamurti, R., Mirchandani, P.: The minimum satisfiability problem. SIAM J. Discret. Math. 7(2), 275\u2013283 (1994)","journal-title":"SIAM J. Discret. Math."},{"issue":"10","key":"9731_CR33","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9731_CR34","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: A new look at reweighted message passing. IEEE Trans. Pattern Anal. Mach. Intell. 37(5) (2015)","DOI":"10.1109\/TPAMI.2014.2363465"},{"key":"9731_CR35","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. Tech. rep., Cornell University (2001)"},{"key":"9731_CR36","unstructured":"Kovalevsky, V.A., Koval, V.K.: A diffusion algorithm for decreasing the energy of the max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR. Unpublished (approx.1975)"},{"issue":"1-2","key":"9731_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval research logistics quarterly 2(1-2), 83\u201397 (1955)","journal-title":"Naval research logistics quarterly"},{"key":"9731_CR38","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: 2007 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138. IEEE (2007)","DOI":"10.1109\/CVPR.2007.383293"},{"key":"9731_CR39","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Boykov, Y., Ivanov, D.: Oriented visibility for multiview reconstruction. In: European Conference on Computer Vision, pp. 226\u2013238. Springer (2006)","DOI":"10.1007\/11744078_18"},{"key":"9731_CR40","first-page":"613","volume":"185","author":"CM Li","year":"2009","unstructured":"Li, C.M., Manya, F.: Maxsat, hard and soft constraints. Handbook of satisfiability 185, 613\u2013631 (2009)","journal-title":"Handbook of satisfiability"},{"key":"9731_CR41","unstructured":"Matou\u0161ek, J., G\u00e4rtner, B.: Understanding and using linear programming (universitext). Springer (2006)"},{"key":"9731_CR42","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Courier Corporation (1998)"},{"issue":"7","key":"9731_CR43","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1109\/TPAMI.2016.2582165","volume":"39","author":"D Pr\u016f\u0161a","year":"2017","unstructured":"Pr\u016f\u0161a, D., Werner, T.: LP relaxation of the Potts labeling problem is as hard as any linear program. IEEE Trans. Pattern Anal. Mach. Intell. 39(7), 1469\u20131475 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9731_CR44","doi-asserted-by":"crossref","unstructured":"Pr\u016f\u0161a, D., Werner, T.: LP relaxations of some NP-hard problems are as hard as any LP. In: ACM-SIAM Symp. on Discrete Algorithm (SODA), pp. 1372\u20131382. SIAM (2017)","DOI":"10.1137\/1.9781611974782.89"},{"issue":"1-3","key":"9731_CR45","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D Scharstein","year":"2002","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Intl. J. Comput. Vis. 47(1-3), 7\u201342 (2002)","journal-title":"Intl. J. Comput. Vis."},{"key":"9731_CR46","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10559-011-9300-z","volume":"47","author":"MI Schlesinger","year":"2011","unstructured":"Schlesinger, M.I., Antoniuk, K.: Diffusion algorithms and structural recognition optimization problems. Cybern. Syst. Anal. 47, 175\u2013192 (2011)","journal-title":"Cybern. Syst. Anal."},{"issue":"6","key":"9731_CR47","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(6), 1068\u20131080 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9731_CR48","doi-asserted-by":"crossref","unstructured":"Tourani, S., Shekhovtsov, A., Rother, C., Savchynskyy, B.: MPLP++: Fast, parallel dual block-coordinate ascent for dense graphical models. In: Proceedings of the European Conference on Computer Vision, pp. 251\u2013267 (2018)","DOI":"10.1007\/978-3-030-01225-0_16"},{"key":"9731_CR49","unstructured":"Tourani, S., Shekhovtsov, A., Rother, C., Savchynskyy, B.: Taxonomy of dual block-coordinate ascent methods for discrete energy minimization. arXiv.org (2020)"},{"issue":"3","key":"9731_CR50","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"9731_CR51","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"},{"issue":"7","key":"9731_CR52","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: A review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1165\u20131179 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9731_CR53","doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D., Dlask, T.: Relative interior rule in block-coordinate descent. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 7559\u20137567 (2020)","DOI":"10.1109\/CVPR42600.2020.00758"},{"key":"9731_CR54","doi-asserted-by":"crossref","unstructured":"Werner, T., Pr\u016f\u0161a, D.: Relative interior rule in block-coordinate minimization. arXiv.org (2019)","DOI":"10.1109\/CVPR42600.2020.00758"},{"issue":"1","key":"9731_CR55","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151 (1), 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"9731_CR56","unstructured":"Xu, K., Li, W.: Many hard examples in exact phase transitions with application to generating hard satisfiable instances. arXiv.org. Instances available at http:\/\/sites.nlsde.buaa.edu.cn\/kexu\/benchmarks\/max-sat-benchmarks.htm (2003)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09731-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09731-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09731-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T02:10:02Z","timestamp":1660097402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09731-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,14]]},"references-count":56,"journal-issue":{"issue":"7-9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["9731"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09731-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,14]]},"assertion":[{"value":"7 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2021","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}