{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:24:24Z","timestamp":1767140664649,"version":"build-2238731810"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071399, 12171145"],"award-info":[{"award-number":["12071399, 12171145"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Project of Scientific Research Fund of Hunan Provincial Science and Technology Department","award":["2018WK4006"],"award-info":[{"award-number":["2018WK4006"]}]},{"name":"Project of Hunan National Center for Applied Mathematics","award":["2020ZYT003"],"award-info":[{"award-number":["2020ZYT003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10589-024-00602-7","type":"journal-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T06:02:12Z","timestamp":1724824932000},"page":"977-1003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust approximation of chance constrained optimization with polynomial perturbation"],"prefix":"10.1007","volume":"89","author":[{"given":"Bo","family":"Rao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2413-4559","authenticated-orcid":false,"given":"Liu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suhan","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Guangming","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"602_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11590-013-0624-7","volume":"8","author":"S Ahmed","year":"2014","unstructured":"Ahmed, S.: Convex relaxations of chance constrained optimization problems. Optim. Lett. 8, 1\u201312 (2014)","journal-title":"Optim. Lett."},{"key":"602_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88, 411\u2013424 (2000)","journal-title":"Math. Program."},{"key":"602_CR3","volume-title":"Convex Optimization Theory","author":"D Bertsekas","year":"2009","unstructured":"Bertsekas, D.: Convex Optimization Theory. Athena Scientific, Nashua (2009)"},{"key":"602_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-017-1125-8","volume":"167","author":"D Bertsimas","year":"2018","unstructured":"Bertsimas, D., Gupta, V., Kallus, N.: Data-driven robust optimization. Math. Program. 167, 235\u2013292 (2018)","journal-title":"Math. Program."},{"key":"602_CR5","doi-asserted-by":"crossref","first-page":"2893","DOI":"10.1137\/21M1390967","volume":"31","author":"D Bertsimas","year":"2021","unstructured":"Bertsimas, D., Hertog, D., Pauphilet, J.: Probabilistic guarantees in robust optimization. SIAM J. Optim. 31, 2893\u2013292 (2021)","journal-title":"SIAM J. Optim."},{"key":"602_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"602_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/130910312","volume":"56","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Chertkov, M., Harnett, S.: Chance-constrained optimal power flow: risk-aware network control under uncertainty. SIAM Rev. 56, 461\u2013495 (2014)","journal-title":"SIAM Rev."},{"key":"602_CR8","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51, 742\u2013753 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"602_CR9","unstructured":"Cao, Y., Victor, M.: A sigmoidal approximation for chance-constrained nonlinear programs. Preprint at https:\/\/arxiv.org\/abs\/2004.02402 (2020)"},{"key":"602_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4, 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"key":"602_CR11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s11590-018-1300-8","volume":"13","author":"J Cheng","year":"2019","unstructured":"Cheng, J., Gicquel, C., Lisser, A.: Partial sample average approximation method for chance constrained problems. Optim. Lett. 13, 657\u2013672 (2019)","journal-title":"Optim. Lett."},{"key":"602_CR12","first-page":"189","volume":"54","author":"R Curto","year":"2005","unstructured":"Curto, R., Fialkow, L.: Truncated $$K$$-moment problems in several variables. J. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"key":"602_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.sepro.2012.04.026","volume":"5","author":"C Deng","year":"2012","unstructured":"Deng, C., Yang, L.: Sample average approximation method for chance constrained stochastic programming in transportation model of emergency management. Syst. Eng. Procedia. 5, 137\u2013143 (2012)","journal-title":"Syst. Eng. Procedia."},{"key":"602_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/1.9781611976595.ch4","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"D Dentcheva","year":"2021","unstructured":"Dentcheva, D.: Optimization models with probabilistic constraints. In: Shapiro, A., Dentcheva, D., Ruszczy\u00e9ski, A. (eds.) Lectures on Stochastic Programming: Modeling and Theory, 3rd edn., pp. 81\u2013149. SIAM, Philadelphia (2021)","edition":"3"},{"key":"602_CR15","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1109\/TAC.2010.2099734","volume":"56","author":"C Feng","year":"2011","unstructured":"Feng, C., Dabbene, F., Lagoa, C.M.: A kinship function approach to robust and probabilistic optimization under polynomial uncertainty. IEEE Trans. Autom. Control 56, 1509\u20131523 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"602_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10957-013-0513-3","volume":"163","author":"C Feng","year":"2014","unstructured":"Feng, C., Dabbene, F., Lagoa, C.M.: A smoothing function approach to joint chance-constrained programs. J. Optim. Theory. Appl. 163, 181\u2013199 (2014)","journal-title":"J. Optim. Theory. Appl."},{"key":"602_CR17","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.compchemeng.2015.09.014","volume":"84","author":"Y Guzman","year":"2016","unstructured":"Guzman, Y., Matthews, L., Floudas, C.: New a priori and a posteriori probabilistic bounds for robust counterpart optimization: I. Unknown probability distributions. Comput. Chem. Eng. 84, 568\u2013598 (2016)","journal-title":"Comput. Chem. Eng."},{"key":"602_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.compchemeng.2016.07.002","volume":"101","author":"Y Guzman","year":"2017","unstructured":"Guzman, Y., Matthews, L., Floudas, C.: New a priori and a posteriori probabilistic bounds for robust counterpart optimization: II. A priori bounds for known symmetric and asymmetric probability distributions. Comput. Chem. Eng. 101, 279\u2013311 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"602_CR19","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.compchemeng.2017.03.001","volume":"103","author":"Y Guzman","year":"2017","unstructured":"Guzman, Y., Matthews, L., Floudas, C.: New a priori and a posteriori probabilistic bounds for robust counterpart optimization: III. Exact and near-exact a posteriori expressions for known probability distributions. Comput. Chem. Eng. 103, 116\u2013143 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"602_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton, J.W., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122, 21\u201364 (2010)","journal-title":"Math. Program."},{"key":"602_CR21","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., L\u00f6fberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Method Softw. 24, 761\u2013779 (2009)","journal-title":"Optim. Method Softw."},{"key":"602_CR22","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.1100.0910","volume":"59","author":"L Hong","year":"2011","unstructured":"Hong, L., Yang, Y., Zhang, L.: Sequential convex approximations to joint chance constrained programs: a Monte Carlo approach. Oper. Res. 59, 617\u2013630 (2011)","journal-title":"Oper. Res."},{"key":"602_CR23","doi-asserted-by":"crossref","first-page":"3447","DOI":"10.1287\/mnsc.2020.3640","volume":"67","author":"L Hong","year":"2021","unstructured":"Hong, L., Huang, Z., Lam, H.: Learning-based robust optimization: procedures and statistical guarantees. Manag. Sci. 67, 3447\u20133467 (2021)","journal-title":"Manag. Sci."},{"key":"602_CR24","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1007\/s12532-020-00199-y","volume":"13","author":"R Kannan","year":"2021","unstructured":"Kannan, R., Luedtke, J.R.: A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Math. Prog. Comput. 13, 705\u2013751 (2021)","journal-title":"Math. Prog. Comput."},{"key":"602_CR25","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1137\/S1052623403430099","volume":"15","author":"CM Lagoa","year":"2005","unstructured":"Lagoa, C.M., Li, X., Sznaier, M.: Probabilistically constrained linear programs and risk-adjusted controller design. SIAM J. Optim. 15, 938\u2013951 (2005)","journal-title":"SIAM J. Optim."},{"key":"602_CR26","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"602_CR27","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"J Lasserre","year":"2009","unstructured":"Lasserre, J.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"602_CR28","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/LCSYS.2017.2704295","volume":"1","author":"JB Lasserre","year":"2017","unstructured":"Lasserre, J.B.: Representation of chance-constraints with strong asymptotic guarantees. Control Syst. Lett. 1, 50\u201355 (2017)","journal-title":"Control Syst. Lett."},{"key":"602_CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York (2009)"},{"key":"602_CR30","doi-asserted-by":"crossref","first-page":"6769","DOI":"10.1021\/ie201651s","volume":"51","author":"Z Li","year":"2012","unstructured":"Li, Z., Tang, Q., Floudas, C.: A comparative theoretical and computational study on robust counterpart optimization: II. Probabilistic guarantees on constraint satisfaction. Ind. Eng. Chem. Res. 51, 6769\u20136788 (2012)","journal-title":"Ind. Eng. Chem. Res."},{"key":"602_CR31","doi-asserted-by":"crossref","first-page":"13112","DOI":"10.1021\/ie501898n","volume":"53","author":"Z Li","year":"2014","unstructured":"Li, Z., Tang, Q., Floudas, C.: A comparative theoretical and computational study on robust counterpart optimization: III. Improving the quality of robust solutions. Ind. Eng. Chem. Res. 53, 13112\u201313124 (2014)","journal-title":"Ind. Eng. Chem. Res."},{"key":"602_CR32","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508), 284\u2013289 (2005)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"602_CR33","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19, 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"602_CR34","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/140958736","volume":"25","author":"AM Jasour","year":"2015","unstructured":"Jasour, A.M., Aybat, N.S., Lagoa, C.M.: Semidefinite programming for chance constrained optimization over semialgebraic sets. SIAM J. Optim. 25, 1411\u20131440 (2015)","journal-title":"SIAM J. Optim."},{"key":"602_CR35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/1-84628-095-8_1","volume-title":"Probabilistic and Randomized Methods for Design under Uncertainty","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Scenario approximations of chance constraints. In: Calafiore, G., Dabbene, F. (eds.) Probabilistic and Randomized Methods for Design under Uncertainty, pp. 3\u201347. Springer, London (2006)"},{"key":"602_CR36","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2007","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17, 969\u2013996 (2007)","journal-title":"SIAM J. Optim."},{"key":"602_CR37","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The $${{\\cal{A} }}$$-truncated $$K$$-moment problem. Found. Comput. Math. 14, 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"key":"602_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. 146, 97\u2013121 (2014)","journal-title":"Math. Program."},{"key":"602_CR39","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-014-0797-6","volume":"153","author":"J Nie","year":"2015","unstructured":"Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program. 153, 247\u2013274 (2015)","journal-title":"Math. Program."},{"key":"602_CR40","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. 142, 485\u2013510 (2013)","journal-title":"Math. Program."},{"key":"602_CR41","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/080716670","volume":"20","author":"J Nie","year":"2009","unstructured":"Nie, J., Ranestad, K.: Algebraic degree of polynomial optimization. SIAM J. Optim. 20, 485\u2013502 (2009)","journal-title":"SIAM J. Optim."},{"key":"602_CR42","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J Nie","year":"2007","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s positivstellensatz. J. Complexity. 23, 135\u2013150 (2007)","journal-title":"J. Complexity."},{"key":"602_CR43","doi-asserted-by":"crossref","unstructured":"Nie, J.: Moment and Polynomial Optimization. SIAM (2023)","DOI":"10.1137\/1.9781611977608"},{"key":"602_CR44","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncell","year":"2009","unstructured":"Pagnoncell, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory. Appl. 142, 399\u2013416 (2009)","journal-title":"J. Optim. Theory. Appl."},{"key":"602_CR45","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa, A.: Probabilistic programming. In: Ruszczynski, A., Shapiro, A. (eds.) Handbooks in Operations Research and Management Science, 10, 267\u2013351. Elsevier (2003)","DOI":"10.1016\/S0927-0507(03)10005-9"},{"key":"602_CR46","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putin","year":"1993","unstructured":"Putin, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"602_CR47","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R Rockafellar","year":"2000","unstructured":"Rockafellar, R., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","journal-title":"J. Risk"},{"key":"602_CR48","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Method Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Method Softw."},{"key":"602_CR49","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10898-016-0438-0","volume":"67","author":"Y Yuan","year":"2017","unstructured":"Yuan, Y., Li, Z., Huang, B.: Robust optimization approximation for joint chance constrained optimization problem. J. Glob. Optim. 67, 805\u2013827 (2017)","journal-title":"J. Glob. Optim."}],"updated-by":[{"DOI":"10.1007\/s10589-024-00611-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00602-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00602-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00602-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T08:12:01Z","timestamp":1731658321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00602-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["602"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00602-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,28]]},"assertion":[{"value":"8 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-024-00611-6","URL":"https:\/\/doi.org\/10.1007\/s10589-024-00611-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}