{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:13:09Z","timestamp":1766733189325,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1440140"],"award-info":[{"award-number":["1440140"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1522158"],"award-info":[{"award-number":["1522158"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1818969"],"award-info":[{"award-number":["1818969"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1348721"],"award-info":[{"award-number":["1348721"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1740325"],"award-info":[{"award-number":["1740325"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1934568"],"award-info":[{"award-number":["1934568"]}],"id":[{"id":"10.13039\/100000086","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":[[2021,7]]},"DOI":"10.1007\/s10472-020-09717-z","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T01:02:32Z","timestamp":1605142952000},"page":"711-735","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data-driven algorithm selection and tuning in optimization and signal processing"],"prefix":"10.1007","volume":"89","author":[{"given":"Jes\u00fas A.","family":"De Loera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1449-2574","authenticated-orcid":false,"given":"Jamie","family":"Haddock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deanna","family":"Needell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,12]]},"reference":[{"issue":"1","key":"9717_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"key":"9717_CR2","unstructured":"Andrychowicz, M., Denil, M., Gomez, S., Hoffman, M.W., Pfau, D., Schaul, T., Shillingford, B., De Freitas, N.: Learning to learn by gradient descent by gradient descent. In: Adv. Neur. In., pp. 3981\u20133989 (2016)"},{"key":"9717_CR3","unstructured":"Balcan, M., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: Int. Conf. Mach. Learn., pp. 353\u2013362 (2018)"},{"key":"9717_CR4","unstructured":"Balcan, M., Nagarajan, V., Vitercik, E., White, C.: Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems. In: Proc. Conf. Learn. Th., pp. 213\u2013274 (2017)"},{"key":"9717_CR5","unstructured":"Balte, A., Pise, N., Kulkarni, P.: Meta-learning with landmarking: A survey. Int. J. Comput. Appl. 105(8) (2014)"},{"key":"9717_CR6","unstructured":"Bardenet, R., Brendel, M., K\u00e9gl, B., Sebag, M.: Collaborative hyperparameter tuning. In: International conference on machine learning, pp. 199\u2013207 (2013)"},{"key":"9717_CR7","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. arXiv:1811.06128(2018)"},{"issue":"1","key":"9717_CR8","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13(1), 281\u2013305 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9717_CR9","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Stellato, B.: The voice of optimization. Mach. Learn., 1\u201329 (2020)","DOI":"10.1007\/s10994-020-05893-5"},{"key":"9717_CR10","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Berlin (2006)"},{"issue":"2","key":"9717_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1002\/nla.1948","volume":"22","author":"JD Blanchard","year":"2015","unstructured":"Blanchard, J.D., Tanner, J.: Performance comparisons of greedy algorithms in compressed sensing. Numer. Linear Algebr. 22(2), 254\u2013282 (2015)","journal-title":"Numer. Linear Algebr."},{"issue":"2","key":"9717_CR12","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M.E.: Normalized iterative hard thresholding: Guaranteed stability and performance. IEEE J. Sel. Top. Signa. 4(2), 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signa."},{"key":"9717_CR13","doi-asserted-by":"crossref","unstructured":"Bonami, P., Lodi, A., Zarpellon, G.: Learning a classification of mixed-integer quadratic programming problems. In: van Hoeve, W. J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018. The Netherlands, June 26-29 Proceedings, volume 10848 of Lecture Notes in Computer Science, pp. 595\u2013604. Springer, Delft (2018)","DOI":"10.1007\/978-3-319-93031-2_43"},{"issue":"6","key":"9717_CR14","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Candes","year":"2010","unstructured":"Candes, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925\u2013936 (2010)","journal-title":"Proc. IEEE"},{"issue":"6","key":"9717_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009)","journal-title":"Found. Comput. Math."},{"key":"9717_CR16","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE T. Inform. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE T. Inform. Theory"},{"issue":"10","key":"9717_CR17","doi-asserted-by":"publisher","first-page":"6820","DOI":"10.1109\/TIT.2013.2273491","volume":"59","author":"M Davenport","year":"2012","unstructured":"Davenport, M., Needell, D., Wakin, M.B.: Signal cosa space MP for sparse recovery with redundant dictionaries. IEEE T. Inform. Theory 59(10), 6820 (2012)","journal-title":"IEEE T. Inform. Theory"},{"key":"9717_CR18","unstructured":"De, S., Yadav, A., Jacobs, D., Goldstein, T.: Big batch SGD: Automated inference using adaptive batch sizes. arXiv:1610.05792 (2017)"},{"key":"9717_CR19","unstructured":"D\u00e9fossez, A., Bach, F.: Adabatch: Efficient gradient aggregation rules for sequential and parallel stochastic gradient methods. arXiv:1711.01761 (2017)"},{"issue":"7","key":"9717_CR20","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9717_CR21","doi-asserted-by":"crossref","unstructured":"Eggensperger, K., Lindauer, M., Hutter, F.: Neural networks for predicting algorithm runtime distributions. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018. ijcai.org, pp 1442\u20131448. Stockholm, Sweden (2018)","DOI":"10.24963\/ijcai.2018\/200"},{"key":"9717_CR22","doi-asserted-by":"crossref","unstructured":"Eldar, Y.C., Kutyniok, G.: Compressed Sensing: Theory and Applications. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511794308"},{"key":"9717_CR23","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: Adv. Neur. In., pp. 2962\u20132970 (2015)"},{"issue":"6","key":"9717_CR24","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"9717_CR25","doi-asserted-by":"crossref","unstructured":"Foucart, S., Rauhut, H.: A mathematical introduction to compressive sensing, vol. 1. Birkh\u00e4user, Basel (2013)","DOI":"10.1007\/978-0-8176-4948-7_1"},{"key":"9717_CR26","first-page":"422","volume":"9","author":"X Gu","year":"2016","unstructured":"Gu, X., Needell, D., Tu, S.: On practical approximate projection schemes in signal space methods. SIAM Undergraduate Research Online 9, 422\u2013434 (2016)","journal-title":"SIAM Undergraduate Research Online"},{"key":"9717_CR27","unstructured":"Goyal, P., Doll\u00e1r, P., Girshick, R., Noordhuis, P., Wesolowski, L., Kyrola, A., Tulloch, A., Jia, Y., He, K.: Accurate, large minibatch SGD: training imagenet in 1 hour. arXiv:1706.02677 (2017)"},{"issue":"3","key":"9717_CR28","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1137\/15M1050276","volume":"46","author":"R Gupta","year":"2017","unstructured":"Gupta, R., Roughgarden, T.: A PAC approach to application-specific algorithm selection. SIAM J. Comput. 46(3), 992\u20131017 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9717_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02149761","volume":"6","author":"PC Hansen","year":"1994","unstructured":"Hansen, P.C.: Regularization tools: a MATLAB package for analysis and solution of discrete ill-posed problems. Numer. Algorithm. 6(1), 1\u201335 (1994)","journal-title":"Numer. Algorithm."},{"key":"9717_CR30","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proc. CVPR IEEE, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"9717_CR31","doi-asserted-by":"crossref","unstructured":"He, Y., Yuen, S.Y.: Black box algorithm selection by convolutional neural network. arXiv:2001.01685 (2019)","DOI":"10.1007\/978-3-030-64580-9_23"},{"key":"9717_CR32","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K. Q.: Densely connected convolutional networks. In: Proceedings if CVPR IEEE, pp. 4700\u20134708 (2017)","DOI":"10.1109\/CVPR.2017.243"},{"key":"9717_CR33","unstructured":"Khalil, E.B., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Guyon, I.I., von Luxburg, U., Bengio, S., Wallach, H.M., Fergus, R., Vishwanathan, S.V.N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, pp 6348\u20136358, Long Beach (2017)"},{"key":"9717_CR34","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G.L., Ahmed, S., Shao, Y.: Learning to run heuristics in tree search. In: Proceedings Int Joint Conf. Artif., pp. 659\u2013666 (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"key":"9717_CR35","unstructured":"Kingma, D.P., Adam, J.B.a.: A method for stochastic optimization. arXiv:1412.6980 (2014)"},{"key":"9717_CR36","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Adv. Neur. In., pp. 1097\u20131105 (2012)"},{"key":"9717_CR37","doi-asserted-by":"crossref","unstructured":"Kruber, M., Lu\u0307bbecke, M.E., Parmentier, A.: Learning when to use a decomposition. In: Salvagnin, D., Lombardi, M. (eds.) Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017. Proceedings, volume 10335 of Lecture Notes in Computer Science, pp. 202\u2013210. Springer, Padua (2017)","DOI":"10.1007\/978-3-319-59776-8_16"},{"key":"9717_CR38","unstructured":"Lagoudakis, M.G., Littman, M.L.: Algorithm selection using reinforcement learning. In: Int. Conf. Mach. Learn., pp. 511\u2013518 (2000)"},{"key":"9717_CR39","unstructured":"LeCun, Y., Cortes, C., Burges, C.: The MNIST database of handwritten digits. Available at http:\/\/yann.lecun.com\/exdb\/mnist\/, Accessed: 21 Dec 2018 (2010)"},{"issue":"5","key":"9717_CR40","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H.H., Hutter, F., Xu, L.: Understanding the empirical hardness of NP-complete problems. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Commun. ACM"},{"issue":"185","key":"9717_CR41","first-page":"1","volume":"18","author":"L Li","year":"2018","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: A novel bandit-based approach to hyperparameter optimization. J. Mach. Learn. Res. 18(185), 1\u201352 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"9717_CR42","unstructured":"Mahsereci, M., Hennig, P.: Probabilistic line searches for stochastic optimization. In: Adv. Neur. In., pp. 181\u2013189 (2015)"},{"issue":"2","key":"9717_CR43","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/JSTSP.2009.2039176","volume":"4","author":"A Maleki","year":"2010","unstructured":"Maleki, A., Donoho, D.L.: Optimally tuned iterative reconstruction algorithms for compressed sensing. IEEE J. Sel. Top Signa. 4(2), 330\u2013341 (2010)","journal-title":"IEEE J. Sel. Top Signa."},{"key":"9717_CR44","unstructured":"Mass\u00e9, P.-Y., Ollivier, Y.: Speed learning on the fly. arXiv:1511.02540 (2015)"},{"key":"9717_CR45","unstructured":"Moulines, E., Bach, F.R.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Adv. Neur. In., pp. 451\u2013459 (2011)"},{"issue":"3","key":"9717_CR46","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.: CosaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. A. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. A."},{"key":"9717_CR47","unstructured":"Needell, D., Ward, R., Srebro, N.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. In: Adv. Neur. In., pp. 1017\u20131025 (2014)"},{"key":"9717_CR48","unstructured":"Pfahringer, B., Bensusan, H., Giraud-Carrier, C.G.: Meta-learning by landmarking various learning algorithms. In: ICML, pp. 743\u2013750 (2000)"},{"key":"9717_CR49","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9717_CR50","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1002\/cpa.20227","volume":"61","author":"M Rudelson","year":"2008","unstructured":"Rudelson, M., Vershynin, R.: On sparse reconstruction from Fourier and Gaussian measurements. Comm. Pure Appl. Math. 61, 1025\u20131045 (2008)","journal-title":"Comm. Pure Appl. Math."},{"key":"9717_CR51","unstructured":"Schaul, T., Zhang, S., LeCun, Y.: No more pesky learning rates. In: Int. Conf. Mach. Learn., pp. 343\u2013351 (2013)"},{"key":"9717_CR52","unstructured":"Shamir, O., Zhang, T.: Stochastic gradient descent for non-smooth optimization Convergence results and optimal averaging schemes. In: Int. Conf. Mach. Learn., pp. 71\u201379 (2013)"},{"issue":"1","key":"9717_CR53","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9717_CR54","doi-asserted-by":"crossref","unstructured":"Szegedy, C., Liu, W., Jia, Y., Sermanet, P., Reed, S., Anguelov, D., Erhan, D., Vanhoucke, V., Rabinovich, A.: Going deeper with convolutions. In: Proceedings of CVPR IEEE, pp. 1\u20139 (2015)","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"9717_CR55","unstructured":"Tan, C., Ma, S., Dai, Y.-H., Qian, Y.: Barzilai-Borwein step size for stochastic gradient descent. In: Adv. Neur. In., pp. 685\u2013693 (2016)"},{"key":"9717_CR56","doi-asserted-by":"crossref","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. In: Measures of Complexity, pp. 11\u201330. Springer (2015)","DOI":"10.1007\/978-3-319-21852-6_3"},{"key":"9717_CR57","unstructured":"Wu, X., Ward, R., Bottou, L.: WNGrad Learn the learning rate in gradient descent. arXiv:1803.02865 (2018)"},{"key":"9717_CR58","doi-asserted-by":"crossref","unstructured":"Yang, C., Akimoto, Y., Kim, D.W., Udell, M.: OBOE: Collaborative filtering for AutoML initialization. In: Proceedings of 25th ACM SIGKDD International Conf. Knowledge Discovery & Data Mining, pp. 1173\u20131183 (2019)","DOI":"10.1145\/3292500.3330909"},{"key":"9717_CR59","doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhong, Z., Shen, T., Lin, Z.: Convolutional neural networks with alternately updated clique. In: Proceedings of CVPR IEEE, pp. 2413\u20132422 (2018)","DOI":"10.1109\/CVPR.2018.00256"},{"key":"9717_CR60","unstructured":"Yao, Q., Wang, M., Chen, Y., Dai, W., Yi-Qi, H., Yu-Feng, L., Wei-Wei, T., Qiang, Y., Yang, Y.: Taking human out of learning applications A survey on automated machine learning. arXiv:1810.13306 (2018)"},{"key":"9717_CR61","unstructured":"Zeiler, M.D.: ADADELTA: an adaptive learning rate method. arXiv:1212.5701 (2012)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09717-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-020-09717-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09717-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T19:37:41Z","timestamp":1669577861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-020-09717-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,12]]},"references-count":61,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9717"],"URL":"https:\/\/doi.org\/10.1007\/s10472-020-09717-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2020,11,12]]},"assertion":[{"value":"27 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}