{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T06:32:07Z","timestamp":1775802727327,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s11424-019-8357-z","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T05:53:25Z","timestamp":1550123605000},"page":"234-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Survey on Algorithms for Computing Comprehensive Gr\u00f6bner Systems and Comprehensive Gr\u00f6bner Bases"],"prefix":"10.1007","volume":"32","author":[{"given":"Dong","family":"Lu","sequence":"first","affiliation":[]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"8357_CR1","first-page":"52","volume-title":"Computational Mathematics and Applications","author":"B R Donald","year":"1992","unstructured":"Donald B R, Kapur D, and Mundy J L, Symbolic and numerical computation for artificial intelligence, Computational Mathematics and Applications, Academic Press, Orlando, Florida, 1992, 52\u201355."},{"key":"8357_CR2","first-page":"335","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"X S Gao","year":"1992","unstructured":"Gao X S and Chou S C, Solving parametric algebraic systems, Proceedings of International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 1992, 335\u2013341."},{"issue":"4","key":"8357_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0747-7171(08)80104-6","volume":"13","author":"Y S William","year":"1992","unstructured":"William Y S, An algorithm for solving parametric linear systems, Journal of Symbolic Computation, 1992, 13(4): 353\u2013394.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-75187-8_7","volume-title":"International Workshop on Computer Algebra in Scientific Computing","author":"C Chen","year":"2007","unstructured":"Chen C, Golubitsky O, Lemaire F, et al., Comprehensive triangular decomposition, International Workshop on Computer Algebra in Scientific Computing, Springer, Berlin, 2007, 73\u2013101."},{"issue":"6","key":"8357_CR5","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.jsc.2007.01.007","volume":"42","author":"D Lazard","year":"2007","unstructured":"Lazard D and Rouillier F, Solving parametric polynomial systems, Journal of Symbolic Computation, 2007, 42(6): 636\u2013667.","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"8357_CR6","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s11424-012-0168-4","volume":"25","author":"Z Huang","year":"2012","unstructured":"Huang Z, Parametric equation solving and quantifier elimination in finite fields with the characteristic set method, Journal of Systems Science and Complexity, 2012, 25(4): 778\u2013791.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"5","key":"8357_CR7","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1007\/s11424-015-3015-6","volume":"28","author":"Z H Chen","year":"2015","unstructured":"Chen Z H, Tang X X, and Xia B C, Generic regular decompositions for parametric polynomial systems, Journal of Systems Science and Complexity, 2015, 28(5): 1194\u20131211.","journal-title":"Journal of Systems Science and Complexity"},{"key":"8357_CR8","first-page":"34","volume-title":"International Workshop on Automated Deduction in Geometry","author":"X F Chen","year":"2004","unstructured":"Chen X F, Li P, Lin L, et al., Proving geometric theorems by partitioned-parametric Gr\u00f6bner bases, International Workshop on Automated Deduction in Geometry, 2004, 34\u201343."},{"key":"8357_CR9","volume-title":"Automated geometric theorem proving and parametric polynomial equations solving","author":"L Lin","year":"2006","unstructured":"Lin L, Automated geometric theorem proving and parametric polynomial equations solving, Master Degree Thesis, Institute of Systems Science, CAS, Beijing, 2006."},{"key":"8357_CR10","volume-title":"The 11th Internatinal Conference on Applications of Computer Algebra","author":"D K Wang","year":"2005","unstructured":"Wang D K and Lin L, Automatic discovering of geometric theorems by computing Gr\u00f6bner bases with parameters. The 11th Internatinal Conference on Applications of Computer Algebra, 2005."},{"key":"8357_CR11","first-page":"113","volume-title":"International Workshop on Automated Deduction in Geometry","author":"A Montes","year":"2006","unstructured":"Montes A and Recio T, Automatic discovery of geometry theorems using minimal canonical comprehensive Gr\u00f6bner systems, International Workshop on Automated Deduction in Geometry, 2006, 113\u2013138."},{"issue":"3","key":"8357_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10817-016-9395-z","volume":"59","author":"J Zhou","year":"2017","unstructured":"Zhou J, Wang D K, and Sun Y, Automated reducible geometric theorem proving and discovery by Gr\u00f6bner basis method, Journal of Autotamed Reasoning, 2017, 59(3): 331\u2013344.","journal-title":"Journal of Autotamed Reasoning"},{"key":"8357_CR13","first-page":"53","volume-title":"International Workshop on Automated Deduction in Geometry","author":"F Botana","year":"2012","unstructured":"Botana F, Montes A, and Recio T, An algorithm for automatic discovery of algebraic loci, International Workshop on Automated Deduction in Geometry, 2012, 53\u201359."},{"issue":"8","key":"8357_CR14","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/TPAMI.2003.1217599","volume":"25","author":"X S Gao","year":"2003","unstructured":"Gao X S, Hou X, Tang J, et al., Complete solution classification for the perspective-three-point problem, IEEE Trans. Pattern Anal. Mach. Intell., 2003, 25(8): 930\u2013943.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"8357_CR15","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.1007\/s11424-015-4310-y","volume":"29","author":"J Zhou","year":"2016","unstructured":"Zhou J and Wang D K, Solving the perspective-three-point problem using comprehensive Gr\u00f6bner systems, Journal of Systems Science and Complexity, 2016, 29(5): 1446\u20131471.","journal-title":"Journal of Systems Science and Complexity"},{"key":"8357_CR16","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-7091-9459-1_20","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"V Weispfenning","year":"1998","unstructured":"Weispfenning V, A new approach to quantifier elimination for real algebra, Quantifier Elimination and Cylindrical Algebraic Decomposition, Springer, 1998, 376\u2013392."},{"issue":"3","key":"8357_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11424-006-0307-x","volume":"19","author":"D Kapur","year":"2006","unstructured":"Kapur D, A quantifier-elimination based heuristic for automatically generating inductive assertions for programs, Journal of Systems Science and Complexity, 2006, 19(3): 307\u2013330.","journal-title":"Journal of Systems Science and Complexity"},{"key":"8357_CR18","first-page":"173","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"R Fukasaku","year":"2015","unstructured":"Fukasaku R, Iwane H, and Sato Y, Real quantifier elimination by computation of comprehensive Gr\u00f6bner systems, Proceedings of International Symposium on Symbolic and Algebraic Computation, ACM Press, Bath, 2015, 173\u2013180."},{"issue":"3","key":"8357_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11786-015-0237-x","volume":"9","author":"R Fukasaku","year":"2015","unstructured":"Fukasaku R, Inoue S, and Sato Y, On QE algorithms over an algebraically closed field based on comprehensive Gr\u00f6bner systems, Mathematics in Computer Science, 2015, 9(3): 267\u2013281.","journal-title":"Mathematics in Computer Science"},{"key":"8357_CR20","first-page":"231","volume-title":"Revised Selected Papers of the International Conference on Mathematical Aspects of Computer and Information Sciences","author":"R Fukasaku","year":"2015","unstructured":"Fukasaku R, Iwane H, and Sato Y, Improving a CGS-QE algorithm, Revised Selected Papers of the International Conference on Mathematical Aspects of Computer and Information Sciences, Springer-Verlag, New York, 2015, 231\u2013235."},{"key":"8357_CR21","first-page":"165","volume-title":"International Congress on Mathematical Software","author":"R Fukasaku","year":"2016","unstructured":"Fukasaku R, Iwane H, and Sato Y, On the implementation of CGS real QE, International Congress on Mathematical Software, Springer International Publishing, 2016, 165\u2013172."},{"issue":"1","key":"8357_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0747-7171(92)90023-W","volume":"14","author":"V Weispfenning","year":"1992","unstructured":"Weispfenning V, Comprehensive Gr\u00f6bner bases, Journal of Symbolic Computation, 1992, 14(1): 1\u201329.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR23","volume-title":"Computing comprehensive Gr\u00f6bner bases using MAS","author":"M Pesh","year":"1994","unstructured":"Pesh M, Computing comprehensive Gr\u00f6bner bases using MAS, User Manual, 1994."},{"key":"8357_CR24","first-page":"217","volume-title":"Principles and Practice of Constraint Programming","author":"D Kapur","year":"1995","unstructured":"Kapur D, An approach for solving systems of parametric polynomial equations, Principles and Practice of Constraint Programming, MIT Press, Cambridge, Massachusetts, 1995, 217\u2013224."},{"issue":"2","key":"8357_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jsco.2001.0504","volume":"33","author":"A Montes","year":"2002","unstructured":"Montes A, A new algorithm for discussing Gr\u00f6bner bases with parameters, Journal of Symbolic Computation, 2002, 33(2): 183\u2013208.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR26","first-page":"270","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"V Weispfenning","year":"2002","unstructured":"Weispfenning V, Canonical comprehensive Gr\u00f6bner bases, Proceedings of International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, 2002, 270\u2013276."},{"issue":"3","key":"8357_CR27","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0747-7171(03)00099-3","volume":"36","author":"V Weispfenning","year":"2003","unstructured":"Weispfenning V, Canonical comprehensive Gr\u00f6bner bases, Journal of Symbolic Computation, 2003, 36(3): 669\u2013683.","journal-title":"Journal of Symbolic Computation"},{"issue":"11","key":"8357_CR28","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.jsc.2005.09.013","volume":"41","author":"M Manubens","year":"2006","unstructured":"Manubens M and Montes A, Improving DISPGB algorithm using the discriminant ideal, J. Symbolic. Comput., 2006, 41(11): 1245\u20131263.","journal-title":"J. Symbolic. Comput."},{"issue":"3\u20134","key":"8357_CR29","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0747-7171(03)00098-1","volume":"36","author":"A Suzuki","year":"2003","unstructured":"Suzuki A and Sato Y, An alternative approach to comprehensive Gr\u00f6bner bases, J. Symbolic. Comput., 2003, 36(3\u20134): 649\u2013667.","journal-title":"J. Symbolic. Comput."},{"key":"8357_CR30","first-page":"65","volume-title":"The 10th Internatinal Conference on Applications of Computer Algebra","author":"A Suzuki","year":"2004","unstructured":"Suzuki A and Sato Y, Comprehensive Gr\u00f6bner bases via ACGB, The 10th Internatinal Conference on Applications of Computer Algebra, 2004, 65\u201373."},{"issue":"8","key":"8357_CR31","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jsc.2007.05.001","volume":"42","author":"M Wibmer","year":"2007","unstructured":"Wibmer M, Gr\u00f6bner bases for families of affine or projective schemes, J. Symbolic. Comput., 2007, 42(8): 803\u2013834.","journal-title":"J. Symbolic. Comput."},{"issue":"5","key":"8357_CR32","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.jsc.2007.07.022","volume":"44","author":"M Manubens","year":"2009","unstructured":"Manubens M and Montes A, Minimal canonical comprehensive Gr\u00f6bner system, J. Symbolic. Comput., 2009, 44(5): 463\u2013478.","journal-title":"J. Symbolic. Comput."},{"issue":"12","key":"8357_CR33","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1016\/j.jsc.2010.06.017","volume":"45","author":"A Montes","year":"2010","unstructured":"Montes A and Wibmer M, Gr\u00f6bner bases for polynomial systems with parameters, J. Symbolic. Comput., 2010, 45(12): 1391\u20131425.","journal-title":"J. Symbolic. Comput."},{"key":"8357_CR34","first-page":"326","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"A Suzuki","year":"2006","unstructured":"Suzuki A and Sato Y, A simple algorithm to compute comprehensive Gr\u00f6bner bases using Gr\u00f6bner bases, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2006, 326\u2013331."},{"issue":"1","key":"8357_CR35","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jsco.1997.0113","volume":"24","author":"M Kalkbrener","year":"1997","unstructured":"Kalkbrener M, On the stability of Gr\u00f6bner bases under specializations, Journal of Symbolic Computation, 1997, 24(1): 51\u201358.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR36","first-page":"299","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"K Nabeshima","year":"2007","unstructured":"Nabeshima K, A speed-up of the algorithm for computing comprehensive Gr\u00f6bner systems, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2007, 299\u2013306."},{"key":"8357_CR37","first-page":"29","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"D Kapur","year":"2010","unstructured":"Kapur D, Sun Y, and Wang D K, A new algorithm for computing comprehensive Gr\u00f6bner systems, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2010, 29\u201336."},{"key":"8357_CR38","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jsc.2011.12.015","volume":"49","author":"D Kapur","year":"2010","unstructured":"Kapur D, Sun Y, and Wang D K, An efficient algorithm for computing a comprehensive Gr\u00f6bner system of a parametric polynomial systems, Journal of Symbolic Computation, 2010, 49: 27\u201344.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR39","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/1993886.1993918","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"D Kapur","year":"2011","unstructured":"Kapur D, Sun Y, and Wang D K, Computing comprehensive Gr\u00f6bner systems and comprehensive Gr\u00f6bner bases simultaneously, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2011, 193\u2013200."},{"key":"8357_CR40","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jsc.2012.05.015","volume":"52","author":"D Kapur","year":"2013","unstructured":"Kapur D, Sun Y, and Wang D K, An efficient method for computing comprehensive Gr\u00f6bner bases, Journal of Symbolic Computation, 2013, 52: 124\u2013142.","journal-title":"Journal of Symbolic Computation"},{"key":"8357_CR41","first-page":"21","volume-title":"Proceedings of Conference Encuentros de Algebra Comptacionaly Aplicaciones (EACA)","author":"D Kapur","year":"2014","unstructured":"Kapur D and Yang Y, An algorithm for computing a minimal comprehensive Gr\u00f6bner basis of a parametric polynomial system, Proceedings of Conference Encuentros de Algebra Comptacionaly Aplicaciones (EACA), Invited Talk, Barcelona, Spain, 2014, 21\u201325."},{"key":"8357_CR42","first-page":"243","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"D Kapur","year":"2015","unstructured":"Kapur D and Yang Y, An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gr\u00f6bner basis and the associated completion algorithm, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2015, 243\u2013250."},{"issue":"1","key":"8357_CR43","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s11424-017-6337-8","volume":"30","author":"D Kapur","year":"2017","unstructured":"Kapur D, Comprehensive Gr\u00f6bner basis theory for a parametric polynomial ideal and the associated completion algorithm, Journal of Systems Science and Complexity, 2017, 30(1): 196\u2013233.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"1","key":"8357_CR44","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11786-017-0295-3","volume":"11","author":"A Hashemi","year":"2017","unstructured":"Hashemi A, Darmian M D, and Barkhordar M, Gr\u00f6bner systems conversion, Mathematics in Computer Science, 2017, 11(1): 61\u201377.","journal-title":"Mathematics in Computer Science"},{"issue":"3","key":"8357_CR45","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.jsc.2006.09.004","volume":"42","author":"K Fukuda","year":"2007","unstructured":"Fukuda K, Jensen A, Lauritzen N, et al., The generic Gr\u00f6bner walk, J. Symb. Comput., 2007, 42(3): 298\u2013312.","journal-title":"J. Symb. Comput."},{"key":"8357_CR46","first-page":"191","volume-title":"The International Congress on Mathematical Software","author":"A Hashemi","year":"2018","unstructured":"Hashemi A, Darmian M D, and Barkhordar M, Universal Gr\u00f6bner basis for parametric polynomial ideals, The International Congress on Mathematical Software, Springer, Cham, 2018, 191\u2013199."},{"key":"8357_CR47","first-page":"39","volume":"1","author":"Y Kurata","year":"2011","unstructured":"Kurata Y, Improving Suzuki-Sato\u2019s CGS algorithm by using stability of Gr\u00f6bner bases and basic manipulations for efficient implementation, Communications of the Japan Society for Symbolic and Algebraic Computation, 2011, 1: 39\u201366.","journal-title":"Communications of the Japan Society for Symbolic and Algebraic Computation"},{"key":"8357_CR48","first-page":"159","volume":"21","author":"W T Wu","year":"1978","unstructured":"Wu W T, On the decision problem and the mechanization of theorem proving in elementary geometry, Sci. Sin., 1978, 21: 159\u2013172.","journal-title":"Sci. Sin."},{"issue":"3","key":"8357_CR49","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02328447","volume":"2","author":"W T Wu","year":"1986","unstructured":"Wu W T, Basic principles of mechanical theorem proving in elementary geometries, J. Autom. Reason, 1986, 2(3): 221\u2013252.","journal-title":"J. Autom. Reason"},{"key":"8357_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"1992","unstructured":"Cox D, Little J, and O\u2019shea D, Ideals, Varieties, and Algorithms, Springer, New York, 1992."},{"key":"8357_CR51","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"B F Caviness","year":"2012","unstructured":"Caviness B F and Johnson J R, Quantifier Elimination and Cylindrical Algebraic Decomposition, Springer Science and Business Media, New York, 2012."},{"key":"8357_CR52","first-page":"134","volume-title":"Automata Theory and Formal Languages","author":"G E Collins","year":"1975","unstructured":"Collins G E, Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Automata Theory and Formal Languages (Second GI Conf., Kaiserslautern), 1975, 134\u2013183."},{"key":"8357_CR53","volume-title":"Mechanical proving of a group of space geometric theorem","author":"D K Wang","year":"1990","unstructured":"Wang D K, Mechanical proving of a group of space geometric theorem, Master Degree Thesis, Institute of Systems Science, CAS, Beijing, 1990."},{"key":"8357_CR54","first-page":"236","volume-title":"Proceedings of the International Workshop on Mathematics Mechanization","author":"D K Wang","year":"1992","unstructured":"Wang D K, A mechanical solution to a group of space geometry problem, Proceedings of the International Workshop on Mathematics Mechanization, 1992, 236\u2013243."},{"issue":"476","key":"8357_CR55","doi-asserted-by":"publisher","first-page":"251","DOI":"10.2307\/3619134","volume":"76","author":"M A B Deakin","year":"1992","unstructured":"Deakin M A B, A simple proof of the Beijing theorem, The Mathematical Gazette, 1992, 76(476): 251\u2013254.","journal-title":"The Mathematical Gazette"},{"key":"8357_CR56","first-page":"341","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"K Nagasaka","year":"2017","unstructured":"Nagasaka K, Parametric greatest common divisors using comprehensive Gr\u00f6bner systems, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2017, 341\u2013348."},{"key":"8357_CR57","first-page":"239","volume-title":"Proceedings of International Symposium on Symbolic and Algebraic Computation","author":"D Kapur","year":"2018","unstructured":"Kapur D, Lu D, Monagan M, et al., An efficient algorithm for computing parametric multivariate polynomial GCD, Proceedings of International Symposium on Symbolic and Algebraic Computation, 2018, 239\u2013246."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-8357-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T21:21:54Z","timestamp":1662931314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-8357-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["8357"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-8357-z","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"12 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}