{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:25:06Z","timestamp":1776356706425,"version":"3.51.2"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 876 - C4"],"award-info":[{"award-number":["SFB 876 - C4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Merge &amp; Reduce<\/jats:italic>is a general algorithmic scheme in the theory of data structures. Its main purpose is to transform static data structures\u2014that support only queries\u2014into dynamic data structures\u2014that allow insertions of new elements\u2014with as little overhead as possible. This can be used to turn classic offline algorithms for summarizing and analyzing data into streaming algorithms. We transfer these ideas to the setting of statistical data analysis in streaming environments. Our approach is conceptually different from previous settings where Merge &amp; Reduce has been employed. Instead of summarizing the data, we combine the Merge &amp; Reduce framework directly with statistical models. This enables performing computationally demanding data analysis tasks on massive data sets. The computations are divided into small tractable batches whose size is independent of the total number of observations<jats:italic>n<\/jats:italic>. The results are combined in a structured way at the cost of a bounded<jats:inline-formula><jats:alternatives><jats:tex-math>$$O(\\log n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>(<\/mml:mo><mml:mo>log<\/mml:mo><mml:mi>n<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>factor in their memory requirements. It is only necessary, though nontrivial, to choose an appropriate statistical model and design<jats:italic>merge<\/jats:italic>and<jats:italic>reduce<\/jats:italic>operations on a casewise basis for the specific type of model. We illustrate our Merge &amp; Reduce schemes on simulated and real-world data employing (Bayesian) linear regression models, Gaussian mixture models and generalized linear models.<\/jats:p>","DOI":"10.1007\/s41060-020-00226-0","type":"journal-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T22:02:38Z","timestamp":1591999358000},"page":"331-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Streaming statistical models via Merge &amp; Reduce"],"prefix":"10.1007","volume":"10","author":[{"given":"Leo N.","family":"Geppert","sequence":"first","affiliation":[]},{"given":"Katja","family":"Ickstadt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Munteanu","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"issue":"1","key":"226_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00453-013-9846-4","volume":"72","author":"PK Agarwal","year":"2015","unstructured":"Agarwal, P.K., Sharathkumar, R.: Streaming algorithms for extent problems in high dimensions. Algorithmica 72(1), 83\u201398 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"226_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"226_CR3","unstructured":"Badoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: Proceedings of SODA, pp. 801\u2013802 (2003)"},{"issue":"1","key":"226_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2007.04.002","volume":"40","author":"M Badoiu","year":"2008","unstructured":"Badoiu, M., Clarkson, K.L.: Optimal core-sets for balls. Comput. Geom. 40(1), 14\u201322 (2008)","journal-title":"Comput. Geom."},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of STOC, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"issue":"2","key":"226_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1214\/06-BA112","volume":"1","author":"S Balakrishnan","year":"2006","unstructured":"Balakrishnan, S., Madigan, D.: A one-pass sequential Monte Carlo method for Bayesian analysis of massive datasets. Bayesian Anal. 1(2), 345\u2013361 (2006)","journal-title":"Bayesian Anal."},{"key":"226_CR7","unstructured":"Bansal, T., Bhattacharyya, C., Kannan, R.: A provable SVD-based algorithm for learning topics in dominant admixture corpus. In: Proceedings of NeurIPS, pp. 1997\u20132005 (2014)"},{"issue":"4","key":"226_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms 1(4), 301\u2013358 (1980)","journal-title":"J. Algorithms"},{"issue":"4","key":"226_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1292609.1292618","volume":"32","author":"N Bruno","year":"2007","unstructured":"Bruno, N., Chaudhuri, S.: Physical design refinement: the \u2018merge-reduce\u2019 approach. ACM Trans. Database Syst. 32(4), 28 (2007)","journal-title":"ACM Trans. Database Syst."},{"key":"226_CR10","unstructured":"Clarkson, K.L.: Subgradient and sampling algorithms for $$\\ell _1$$ regression. In: Proceedings of SODA, pp. 257\u2013266 (2005)"},{"key":"226_CR11","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Input sparsity and hardness for robust subspace approximation. In: Proceedings of FOCS, pp. 310\u2013329 (2015)","DOI":"10.1109\/FOCS.2015.27"},{"key":"226_CR12","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Sketching for M-estimators: a unified approach to robust regression. In: Proceedings of SODA, pp. 921\u2013939 (2015)","DOI":"10.1137\/1.9781611973730.63"},{"issue":"3","key":"226_CR13","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/140963698","volume":"45","author":"KL Clarkson","year":"2016","unstructured":"Clarkson, K.L., Drineas, P., Magdon-Ismail, M., Mahoney, M.W., Meng, X., Woodruff, D.P.: The fast Cauchy transform and faster robust linear regression. SIAM J. Comput. 45(3), 763\u2013810 (2016)","journal-title":"SIAM J. Comput."},{"key":"226_CR14","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Lee, Y.T., Musco, C., Musco, C., Peng, R., Sidford, A.: Uniform sampling for matrix approximation. In: Proceedings of ITCS, pp. 181\u2013190 (2015)","DOI":"10.1145\/2688073.2688113"},{"issue":"5","key":"226_CR15","doi-asserted-by":"crossref","first-page":"2060","DOI":"10.1137\/070696507","volume":"38","author":"A Dasgupta","year":"2009","unstructured":"Dasgupta, A., Drineas, P., Harb, B., Kumar, R., Mahoney, M.W.: Sampling algorithms and coresets for $$\\ell _p$$ regression. SIAM J. Comput. 38(5), 2060\u20132078 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"226_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: MapReduce: a flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"issue":"522","key":"226_CR17","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1080\/01621459.2017.1281813","volume":"113","author":"H Dette","year":"2018","unstructured":"Dette, H., M\u00f6llenhoff, K., Volgushev, S., Bretz, F.: Equivalence of regression curves. J. Am. Stat. Assoc. 113(522), 711\u2013729 (2018). https:\/\/doi.org\/10.1080\/01621459.2017.1281813","journal-title":"J. Am. Stat. Assoc."},{"key":"226_CR18","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Sampling algorithms for $$\\ell _{2}$$ regression and applications. In: Proceedings of SODA, pp. 1127\u20131136 (2006)","DOI":"10.1145\/1109557.1109682"},{"issue":"2","key":"226_CR19","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30(2), 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2\u20133","key":"226_CR20","first-page":"113","volume":"2","author":"H Fanaee-T","year":"2014","unstructured":"Fanaee-T, H., Gama, J.: Event labeling combining ensemble detectors and background knowledge. Prog. AI 2(2\u20133), 113\u2013127 (2014)","journal-title":"Prog. AI"},{"key":"226_CR21","unstructured":"Feldman, D., Faulkner, M., Krause, A.: Scalable training of mixture models via coresets. In: Proceedings of NeurIPS, pp. 2142\u20132150 (2011)"},{"key":"226_CR22","doi-asserted-by":"crossref","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning Big Data into tiny data: constant-size coresets for k-means, PCA and projective clustering. In: Proceedings of SODA, pp. 1434\u20131453 (2013)","DOI":"10.1137\/1.9781611973105.103"},{"key":"226_CR23","doi-asserted-by":"crossref","unstructured":"Feldman, D., Munteanu, A., Sohler, C.: Smallest enclosing ball for probabilistic data. In: Proceedings of SoCG, pp. 214\u2013223 (2014)","DOI":"10.1145\/2582112.2582114"},{"issue":"1","key":"226_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s11222-015-9608-z","volume":"27","author":"LN Geppert","year":"2017","unstructured":"Geppert, L.N., Ickstadt, K., Munteanu, A., Quedenfeld, J., Sohler, C.: Random projections for Bayesian regression. Stat. Comput. 27(1), 79\u2013101 (2017)","journal-title":"Stat. Comput."},{"key":"226_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55864-1","volume-title":"Linear Regression","author":"J Gro\u00df","year":"2003","unstructured":"Gro\u00df, J.: Linear Regression. Springer, Berlin (2003)"},{"key":"226_CR26","unstructured":"Har-Peled, S.: A simple algorithm for maximum margin classification, revisited. CoRR abs\/1507.01563 (2015)"},{"key":"226_CR27","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for $$k$$-means and $$k$$-median clustering. In: Proceedings of STOC, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"226_CR28","unstructured":"Har-Peled, S., Roth, D., Zimak, D.: Maximum margin coresets for active and noise tolerant learning. In: Proceedings of IJCAI, pp. 836\u2013841 (2007)"},{"key":"226_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3462-1","volume-title":"Regression Modeling Strategies","author":"FE Harrell Jr","year":"2001","unstructured":"Harrell Jr., F.E.: Regression Modeling Strategies. Springer, New York (2001)"},{"issue":"1","key":"226_CR30","first-page":"1593","volume":"15","author":"MD Hoffman","year":"2014","unstructured":"Hoffman, M.D., Gelman, A.: The No-U-Turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. J. Mach. Learn. Res. 15(1), 1593\u20131623 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"226_CR31","unstructured":"Huggins, J.H., Campbell, T., Broderick, T.: Coresets for scalable Bayesian logistic regression. In: Proceedings of NeurIPS, pp. 4080\u20134088 (2016)"},{"issue":"6","key":"226_CR32","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s11222-017-9783-1","volume":"28","author":"J Law","year":"2018","unstructured":"Law, J., Wilkinson, D.J.: Composable models for online Bayesian analysis of streaming data. Stat. Comput. 28(6), 1119\u20131137 (2018)","journal-title":"Stat. Comput."},{"key":"226_CR33","doi-asserted-by":"crossref","unstructured":"Li, M., Miller, G.L., Peng, R.: Iterative row sampling. In: Proceedings of FOCS, pp. 127\u2013136 (2013)","DOI":"10.1109\/FOCS.2013.22"},{"issue":"4","key":"226_CR34","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1111\/j.1541-0420.2008.01192.x","volume":"65","author":"W Liu","year":"2009","unstructured":"Liu, W., Bretz, F., Hayter, A.J., Wynn, H.P.: Assessing nonsuperiority, noninferiority, or equivalence when comparing two regression models over a restricted covariate region. Biometrics 65(4), 1279\u20131287 (2009). https:\/\/doi.org\/10.1111\/j.1541-0420.2008.01192.x","journal-title":"Biometrics"},{"key":"226_CR35","unstructured":"Lucic, M., Bachem, O., Krause, A.: Strong coresets for hard and soft Bregman clustering with applications to exponential family mixtures. In: Proceedings of AISTATS, pp. 1\u20139 (2016)"},{"key":"226_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6","volume-title":"Generalized Linear Models","author":"P McCullagh","year":"1989","unstructured":"McCullagh, P., Nelder, J.A.: Generalized Linear Models. Chapman & Hall, London (1989)"},{"key":"226_CR37","doi-asserted-by":"crossref","unstructured":"Molina, A., Munteanu, A., Kersting, K.: Core dependency networks. In: Proceedings of AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11726"},{"issue":"1","key":"226_CR38","first-page":"37","volume":"32","author":"A Munteanu","year":"2018","unstructured":"Munteanu, A., Schwiegelshohn, C.: Coresets-methods and history: a theoreticians design pattern for approximation and streaming algorithms. KI 32(1), 37\u201353 (2018)","journal-title":"KI"},{"key":"226_CR39","unstructured":"Munteanu, A., Schwiegelshohn, C., Sohler, C., Woodruff, D.P.: On coresets for logistic regression. In: Proceedings of NeurIPS, pp. 6562\u20136571 (2018)"},{"issue":"2","key":"226_CR40","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found Trends Theor. Comput. Sci."},{"issue":"3","key":"226_CR41","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s41060-017-0070-1","volume":"4","author":"A Naik","year":"2017","unstructured":"Naik, A., Rangwala, H.: Hierflat: flattened hierarchies for improving top-down hierarchical classification. Int. J. Data Sci. Anal. 4(3), 191\u2013208 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"key":"226_CR42","first-page":"1269","volume-title":"Handbook of Discrete and Computational Geometry","author":"JM Phillips","year":"2017","unstructured":"Phillips, J.M.: Coresets and sketches. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn, pp. 1269\u20131288. CRC, Boca Raton (2017)","edition":"3"},{"key":"226_CR43","unstructured":"R Core Team.: R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. https:\/\/www.R-project.org (2014, 2017, 2018)"},{"key":"226_CR44","unstructured":"Reddi, S.J., P\u00f3czos, B., Smola, A.J.: Communication efficient coresets for empirical loss minimization. In: Proceedings of UAI, pp. 752\u2013761 (2015)"},{"issue":"4","key":"226_CR45","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s41060-018-0146-6","volume":"7","author":"R Sambasivan","year":"2019","unstructured":"Sambasivan, R., Das, S.: Classification and regression using augmented trees. Int. J. Data Sci. Anal. 7(4), 259\u2013276 (2019)","journal-title":"Int. J. Data Sci. Anal."},{"key":"226_CR46","doi-asserted-by":"crossref","unstructured":"Sohler, C., Woodruff, D.P.: Subspace embeddings for the $$L_1$$-norm with applications. In: Proceedings of STOC, pp. 755\u2013764 (2011)","DOI":"10.1145\/1993636.1993736"},{"issue":"1","key":"226_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41060-017-0087-5","volume":"5","author":"M Sokolova","year":"2018","unstructured":"Sokolova, M.: Big text advantages and challenges: classification perspective. Int. J. Data Sci. Anal. 5(1), 1\u201310 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"key":"226_CR48","unstructured":"Stan Development Team.: RStan: the R interface to Stan. http:\/\/mc-stan.org\/. R package version 2.14.1 (2016)"},{"issue":"3","key":"226_CR49","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-018-0145-7","volume":"8","author":"D Teffer","year":"2019","unstructured":"Teffer, D., Srinivasan, R., Ghosh, J.: Adahash: hashing-based scalable, adaptive hierarchical clustering of streaming data on mapreduce frameworks. Int. J. Data Sci. Anal. 8(3), 257\u2013267 (2019)","journal-title":"Int. J. Data Sci. Anal."},{"key":"226_CR50","unstructured":"Tolochinsky, E., Feldman, D.: Coresets for monotonic functions with applications to deep learning. CoRR abs\/1802.07382 (2018)"},{"issue":"3","key":"226_CR51","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s41060-018-0102-5","volume":"6","author":"C Weihs","year":"2018","unstructured":"Weihs, C., Ickstadt, K.: Data science: the impact of statistics. Int. J. Data Sci. Anal. 6(3), 189\u2013194 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"4","key":"226_CR52","first-page":"8","volume":"21","author":"M Welling","year":"2014","unstructured":"Welling, M., Teh, Y.W., Andrieu, C., Kominiarczuk, J., Meeds, T., Shahbaba, B., Vollmer, S.: Bayesian inference & big data: a snapshot from a workshop. ISBA Bull. 21(4), 8\u201311 (2014)","journal-title":"ISBA Bull."},{"issue":"1\u20132","key":"226_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found Trends Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)","journal-title":"Found Trends Theor. Comput. Sci."},{"key":"226_CR54","unstructured":"Woodruff, D.P., Zhang, Q.: Subspace embeddings and $$\\ell _p$$-regression using exponential random variables. In: Proceedings of COLT, pp. 546\u2013567 (2013)"},{"issue":"1\u20132","key":"226_CR55","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/s0167-9473(03)00030-6","volume":"44","author":"A Zeileis","year":"2003","unstructured":"Zeileis, A., Kleiber, C., Kr\u00e4mer, W., Hornik, K.: Testing and dating of structural changes in practice. Comput. Stat. Data Anal. 44(1\u20132), 109\u2013123 (2003). https:\/\/doi.org\/10.1016\/s0167-9473(03)00030-6","journal-title":"Comput. Stat. Data Anal."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-020-00226-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T05:24:42Z","timestamp":1666934682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-020-00226-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s41060-020-00226-0","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,12]]},"assertion":[{"value":"9 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}