{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:19:02Z","timestamp":1782789542023,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T00:00:00Z","timestamp":1663200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T00:00:00Z","timestamp":1663200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S033483\/2"],"award-info":[{"award-number":["EP\/S033483\/2"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S033483\/1"],"award-info":[{"award-number":["EP\/S033483\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S033483\/1"],"award-info":[{"award-number":["EP\/S033483\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In computing with explorable uncertainty, one considers problems where the values of some input elements are uncertain, typically represented as intervals, but can be obtained using queries. Previous work has considered query minimization in the settings where queries are asked sequentially (adaptive model) or all at once (non-adaptive model). We introduce a new model where\u00a0<jats:italic>k<\/jats:italic> queries can be made in parallel in each round, and the goal is to minimize the number of query rounds. Using competitive analysis, we present upper and lower bounds on the number of query rounds required by any algorithm in comparison with the optimal number of query rounds for the given instance. Given a set of uncertain elements and a family of\u00a0<jats:italic>m<\/jats:italic> subsets of that set, we study the problems of sorting all <jats:italic>m<\/jats:italic> subsets and of determining the minimum value (or the minimum element(s)) of each subset. We also study the selection problem, i.e., the problem of determining the <jats:italic>i<\/jats:italic>-th smallest value and identifying all elements with that value in a given set of uncertain elements. Our results include 2-round-competitive algorithms for sorting and selection and an algorithm for the minimum value problem that uses at most <jats:inline-formula><jats:alternatives><jats:tex-math>$$(2+\\varepsilon ) \\cdot \\mathrm {opt}_k+\\mathrm {O}\\left( \\frac{1}{\\varepsilon } \\cdot \\lg m\\right) $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mi>\u03b5<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u00b7<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>opt<\/mml:mi>\n                      <mml:mi>k<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mfenced>\n                      <mml:mfrac>\n                        <mml:mn>1<\/mml:mn>\n                        <mml:mi>\u03b5<\/mml:mi>\n                      <\/mml:mfrac>\n                      <mml:mo>\u00b7<\/mml:mo>\n                      <mml:mo>lg<\/mml:mo>\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:mfenced>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> query rounds for every <jats:inline-formula><jats:alternatives><jats:tex-math>$$0&lt;\\varepsilon &lt;1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>0<\/mml:mn>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathrm {opt}_k$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>opt<\/mml:mi>\n                    <mml:mi>k<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is the optimal number of query rounds.<\/jats:p>","DOI":"10.1007\/s00453-022-01035-6","type":"journal-article","created":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T20:02:51Z","timestamp":1663272171000},"page":"406-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4470-5868","authenticated-orcid":false,"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2297-811X","authenticated-orcid":false,"given":"Murilo Santos","family":"de Lima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,15]]},"reference":[{"issue":"2","key":"1035_CR1","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2701427","volume":"12","author":"M Ajtai","year":"2016","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12(2), 19:1-19:19 (2016). https:\/\/doi.org\/10.1145\/2701427","journal-title":"ACM Trans. Algorithms"},{"key":"1035_CR2","doi-asserted-by":"publisher","unstructured":"Albers, S., Eckl, A.: Explorable uncertainty in scheduling with non-uniform testing times. In: Kaklamanis, C., Levin, A. (eds.) WAOA 2020: 18th International Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 12806, pp. 127\u2013142. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-80879-2_9","DOI":"10.1007\/978-3-030-80879-2_9"},{"key":"1035_CR3","doi-asserted-by":"publisher","unstructured":"Arantes, L., Bampis, E., Kononov, A.V., Letsios, M., Lucarelli, G., Sens, P.: Scheduling under uncertainty: a query-based approach. In: IJCAI 2018: 27th International Joint Conference on Artificial Intelligence, pp. 4646\u20134652 (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/646","DOI":"10.24963\/ijcai.2018\/646"},{"issue":"12","key":"1035_CR4","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal\u00e1k, M., Ram, L.S.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168\u20132181 (2006). https:\/\/doi.org\/10.1109\/JSAC.2006.884015","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1035_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"1035_CR6","unstructured":"Braverman, M., Mossel, E.: Sorting from noisy information (2009). arXiv:0910.1191"},{"issue":"4","key":"1035_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-004-1180-4","volume":"38","author":"R Bruce","year":"2005","unstructured":"Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theory Comput. Syst. 38(4), 411\u2013423 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1180-4","journal-title":"Theory Comput. Syst."},{"key":"1035_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00037-018-0168-4","volume":"27","author":"CL Canonne","year":"2018","unstructured":"Canonne, C.L., Gur, T.: An adaptivity hierarchy theorem for property testing. Comput. Complex. 27, 671\u2013716 (2018). https:\/\/doi.org\/10.1007\/s00037-018-0168-4","journal-title":"Comput. Complex."},{"key":"1035_CR9","doi-asserted-by":"publisher","unstructured":"Charalambous, G., Hoffmann, M.: Verification problem of maximal points under uncertainty. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013: 24th International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science, vol. 8288, pp. 94\u2013105. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-45278-9_9","DOI":"10.1007\/978-3-642-45278-9_9"},{"key":"1035_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00742-2","author":"C D\u00fcrr","year":"2020","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: An adversarial model for scheduling with testing. Algorithmica (2020). https:\/\/doi.org\/10.1007\/s00453-020-00742-2","journal-title":"Algorithmica"},{"key":"1035_CR11","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Hoffmann, M.: Minimum spanning tree verification under uncertainty. In: Kratsch, D., Todinca, I. (eds.) WG 2014: International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 8747, pp. 164\u2013175. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_14","DOI":"10.1007\/978-3-319-12340-0_14"},{"key":"1035_CR12","first-page":"22","volume":"116","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. EATCS 116, 22\u201339 (2015)","journal-title":"Bull. EATCS"},{"key":"1035_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.11.025","volume":"613","author":"T Erlebach","year":"2016","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: Query-competitive algorithms for cheapest set problems under uncertainty. Theoret. Comput. Sci. 613, 51\u201364 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.11.025","journal-title":"Theoret. Comput. Sci."},{"key":"1035_CR14","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Hoffmann, M., Krizanc, D., Mihal\u2019\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Albers, S., Weil, P. (eds.) STACS\u201908: 25th International Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics, vol.\u00a01, pp. 277\u2013288. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2008). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2008.1358","DOI":"10.4230\/LIPIcs.STACS.2008.1358"},{"key":"1035_CR15","unstructured":"Erlebach, T., Hoffmann, M., de\u00a0Lima, M.S., Megow, N., Schl\u00f6ter, J.: Untrusted predictions improve trustable query policies (2020). arXiv:2011.07385"},{"issue":"1","key":"1035_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.005","volume":"62","author":"T Feder","year":"2007","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62(1), 1\u201318 (2007). https:\/\/doi.org\/10.1016\/j.jalgor.2004.07.005","journal-title":"J. Algorithms"},{"issue":"2","key":"1035_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S0097539701395668","volume":"32","author":"T Feder","year":"2003","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. SIAM J. Comput. 32(2), 538\u2013547 (2003). https:\/\/doi.org\/10.1137\/S0097539701395668","journal-title":"SIAM J. Comput."},{"key":"1035_CR18","doi-asserted-by":"publisher","unstructured":"Focke, J., Megow, N., Mei\u00dfner, J.: Minimum spanning tree under explorable uncertainty in theory and experiments. In: Iliopoulos, C.S., Pissis, S.P., Puglisi, S.J., Raman, R. (eds.) SEA 2017: 16th International Symposium on Experimental Algorithms, Leibniz International Proceedings in Informatics, vol.\u00a075, pp. 22:1\u201322:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2017.22","DOI":"10.4230\/LIPIcs.SEA.2017.22"},{"issue":"2","key":"1035_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972). https:\/\/doi.org\/10.1137\/0201013","journal-title":"SIAM J. Comput."},{"key":"1035_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2014.09.010","volume":"55","author":"M Goerigk","year":"2015","unstructured":"Goerigk, M., Gupta, M., Ide, J., Sch\u00f6bel, A., Sen, S.: The robust knapsack problem with queries. Comput. Oper. Res. 55, 12\u201322 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.09.010","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1035_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s00224-015-9664-y","volume":"59","author":"M Gupta","year":"2016","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. Theory Comput. Syst. 59(1), 112\u2013132 (2016). https:\/\/doi.org\/10.1007\/s00224-015-9664-y","journal-title":"Theory Comput. Syst."},{"key":"1035_CR22","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., de\u00a0Lima, M.S.: Query-competitive sorting with uncertainty. In: Rossmanith, P., Heggernes, P., Katoen, J.P. (eds.) MFCS 2019: 44th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics, vol. 138, pp. 7:1\u20137:15. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.7","DOI":"10.4230\/LIPIcs.MFCS.2019.7"},{"issue":"2","key":"1035_CR23","first-page":"51:1","volume":"9","author":"A Hoorfar","year":"2008","unstructured":"Hoorfar, A., Hassani, M.: Inequalities on the Lambert $$W$$ function and hyperpower function. J. Inequal. Pure Appl. Math. 9(2), 51:1-51:5 (2008)","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"1035_CR24","doi-asserted-by":"publisher","unstructured":"Kahan, S.: A model for data in motion. In: STOC\u201991: 23rd Annual ACM Symposium on Theory of Computing, pp. 265\u2013277 (1991). https:\/\/doi.org\/10.1145\/103418.103449","DOI":"10.1145\/103418.103449"},{"key":"1035_CR25","doi-asserted-by":"publisher","unstructured":"Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: PODS\u201901: 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 171\u2013182 (2001). https:\/\/doi.org\/10.1145\/375551.375577","DOI":"10.1145\/375551.375577"},{"issue":"1","key":"1035_CR26","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51(1), 45\u201364 (1962)","journal-title":"Fundamenta Mathematicae"},{"key":"1035_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-019-01388-x","volume":"182","author":"T Maehara","year":"2020","unstructured":"Maehara, T., Yamaguchi, Y.: Stochastic packing integer programs with few queries. Math. Program. 182, 141\u2013174 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01388-x","journal-title":"Math. Program."},{"issue":"4","key":"1035_CR28","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1088375","volume":"46","author":"N Megow","year":"2017","unstructured":"Megow, N., Mei\u00dfner, J., Skutella, M.: Randomization helps computing a minimum spanning tree under uncertainty. SIAM J. Comput. 46(4), 1217\u20131240 (2017). https:\/\/doi.org\/10.1137\/16M1088375","journal-title":"SIAM J. Comput."},{"key":"1035_CR29","doi-asserted-by":"publisher","unstructured":"Mei\u00dfner, J.: Uncertainty exploration: algorithms, competitive analysis, and computational experiments. Ph.D. thesis, Technische Universit\u00e4t Berlin (2018). https:\/\/doi.org\/10.14279\/depositonce-7327","DOI":"10.14279\/depositonce-7327"},{"key":"1035_CR30","doi-asserted-by":"publisher","unstructured":"Merino, A.I., Soto, J.A.: The minimum cost query problem on matroids with uncertainty areas. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) ICALP 2019: 46th International Colloquium on Automata, Languages, and Programming, Leibniz International Proceedings in Informatics, vol. 132, pp. 83:1\u201383:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.83","DOI":"10.4230\/LIPIcs.ICALP.2019.83"},{"key":"1035_CR31","unstructured":"Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: VLDB 2000: 26th International Conference on Very Large Data Bases, pp. 144\u2013155 (2000). http:\/\/ilpubs.stanford.edu:8090\/714\/"},{"issue":"4","key":"1035_CR32","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1137\/12086279X","volume":"22","author":"IO Ryzhov","year":"2012","unstructured":"Ryzhov, I.O., Powell, W.B.: Information collection for linear programs with uncertain objective coefficients. SIAM J. Optim. 22(4), 1344\u20131368 (2012). https:\/\/doi.org\/10.1137\/12086279X","journal-title":"SIAM J. Optim."},{"key":"1035_CR33","doi-asserted-by":"publisher","unstructured":"van\u00a0der Hoog, I., Kostitsyna, I., L\u00f6ffler, M., Speckmann, B.: Preprocessing ambiguous imprecise points. In: Barequet, G., Wang, Y. (eds.) SoCG 2019: 35th International Symposium on Computational Geometry, Leibniz International Proceedings in Informatics, vol. 129, pp. 42:1\u201342:16. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.42","DOI":"10.4230\/LIPIcs.SoCG.2019.42"},{"key":"1035_CR34","unstructured":"Welz, W.A.: Robot tour planning with high determination costs. Ph.D. thesis, Technische Universit\u00e4t Berlin (2014). https:\/\/www.depositonce.tu-berlin.de\/handle\/11303\/4597"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01035-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01035-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01035-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T09:18:03Z","timestamp":1674811083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01035-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,15]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1035"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01035-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,15]]},"assertion":[{"value":"18 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}