{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:37Z","timestamp":1783576957696,"version":"3.55.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:00:00Z","timestamp":1704844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:00:00Z","timestamp":1704844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-8021-002498"],"award-info":[{"award-number":["DFF-8021-002498"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004836","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-8021-002498"],"award-info":[{"award-number":["DFF-8021-002498"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005192","name":"Technical University of Denmark","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005192","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the predecessor problem on the ultra-wide word RAM model of computation, which extends the word RAM model with <jats:italic>ultrawords<\/jats:italic> consisting of <jats:inline-formula><jats:alternatives><jats:tex-math>$$w^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>w<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> bits (TAMC, 2015). The model supports arithmetic and boolean operations on ultrawords, in addition to <jats:italic>scattered<\/jats:italic> memory operations that access or modify <jats:italic>w<\/jats:italic> (potentially non-contiguous) memory addresses simultaneously. The ultra-wide word RAM model captures (and idealizes) modern vector processor architectures. Our main result is a simple, linear space data structure that supports predecessor in constant time and updates in amortized, expected constant time. This improves the space of the previous constant time solution that uses space in the order of the size of the universe. Our result holds even in a weaker model where ultrawords consist of <jats:inline-formula><jats:alternatives><jats:tex-math>$$w^{1+\\epsilon }$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>w<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mi>\u03f5<\/mml:mi>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> bits for any <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon &gt; 0 $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03f5<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. It is based on a new implementation of the classic <jats:italic>x<\/jats:italic>-fast trie data structure of Willard (Inform Process Lett 17(2):81\u201384, <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"doi\" xlink:href=\"10.1016\/0020-0190(83)90075-3\">https:\/\/doi.org\/10.1016\/0020-0190(83)90075-3<\/jats:ext-link>, 1983) combined with a new dictionary data structure that supports fast parallel lookups.<\/jats:p>","DOI":"10.1007\/s00453-023-01193-1","type":"journal-article","created":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T19:01:55Z","timestamp":1704913315000},"page":"1578-1599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Predecessor on the Ultra-Wide Word RAM"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1120-5154","authenticated-orcid":false,"given":"Philip","family":"Bille","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8322-4952","authenticated-orcid":false,"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1525-0104","authenticated-orcid":false,"given":"Tord","family":"Stordalen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"key":"1193_CR1","doi-asserted-by":"publisher","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proceedings of the 38th STOC, pp. 232\u2013240 (2006). https:\/\/doi.org\/10.1145\/1132516.1132551","DOI":"10.1145\/1132516.1132551"},{"key":"1193_CR2","doi-asserted-by":"publisher","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Dynamic integer sets with optimal rank, select, and predecessor search. In: Proceedings of the 55th FOCS, pp. 166\u2013175 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.26","DOI":"10.1109\/FOCS.2014.26"},{"key":"1193_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P van Emde Boas","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99\u2013127 (1977). https:\/\/doi.org\/10.1007\/BF01683268","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"1193_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space $$\\Theta (N)$$. Inform. Process. Lett. 17(2), 81\u201384 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90075-3","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"1193_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"ML Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424\u2013436 (1993). https:\/\/doi.org\/10.1016\/0022-0000(93)90040-4","journal-title":"J. Comput. Syst. Sci."},{"key":"1193_CR6","doi-asserted-by":"publisher","unstructured":"Andersson, A.: Faster deterministic sorting and searching in linear space. In: Proceedings of the 37th FOCS, pp. 135\u2013141 (1996). https:\/\/doi.org\/10.1109\/SFCS.1996.548472","DOI":"10.1109\/SFCS.1996.548472"},{"issue":"1","key":"1193_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/jcss.2002.1822","volume":"65","author":"P Beame","year":"2002","unstructured":"Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65(1), 38\u201372 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1822","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1193_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P van Emde Boas","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett. 6(3), 80\u201382 (1977). https:\/\/doi.org\/10.1016\/0020-0190(77)90031-X","journal-title":"Inform. Process. Lett."},{"key":"1193_CR9","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Boldi, P., Vigna, S.: Dynamic z-fast tries. In: Proceedings of the 17th SPIRE, pp. 159\u2013172 (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_15","DOI":"10.1007\/978-3-642-16321-0_15"},{"key":"1193_CR10","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with $$O(1)$$ accesses. In: Proceedings of the 20th SODA, pp. 785\u2013794 (2009). http:\/\/dl.acm.org\/citation.cfm?id=1496770.1496856","DOI":"10.1137\/1.9781611973068.86"},{"issue":"3","key":"1193_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF02126797","volume":"8","author":"M Ajtai","year":"1988","unstructured":"Ajtai, M.: A lower bound for finding predecessors in Yao\u2019s cell probe model. Comb. 8(3), 235\u2013247 (1988). https:\/\/doi.org\/10.1007\/BF02126797","journal-title":"Comb."},{"key":"1193_CR12","doi-asserted-by":"publisher","unstructured":"Miltersen, P.B.: Lower bounds for union-split-find related problems on random access machines. In: Proceedings of the 26th STOC, pp. 625\u2013634 (1994). https:\/\/doi.org\/10.1145\/195058.195415","DOI":"10.1145\/195058.195415"},{"issue":"1","key":"1193_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"PB Miltersen","year":"1998","unstructured":"Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57(1), 37\u201349 (1998). https:\/\/doi.org\/10.1006\/jcss.1998.1577","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1193_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.jcss.2007.06.016","volume":"74","author":"P Sen","year":"2008","unstructured":"Sen, P., Venkatesh, S.: Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74(3), 364\u2013385 (2008). https:\/\/doi.org\/10.1016\/j.jcss.2007.06.016","journal-title":"J. Comput. Syst. Sci."},{"key":"1193_CR15","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Randomization does not help searching predecessors. In: Proceedings of the 18th SODA, pp. 555\u2013564 (2007). http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283443"},{"issue":"1","key":"1193_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/jcss.1998.1580","volume":"57","author":"A Andersson","year":"1998","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? J. Comput. Syst. Sci. 57(1), 74\u201393 (1998). https:\/\/doi.org\/10.1006\/jcss.1998.1580","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1193_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jalgor.2003.09.001","volume":"50","author":"Y Han","year":"2004","unstructured":"Han, Y.: Deterministic sorting in $$O(n\\log \\log n)$$ time and linear space. J. Algorithms 50(1), 96\u2013105 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2003.09.001","journal-title":"J. Algorithms"},{"key":"1193_CR18","doi-asserted-by":"publisher","unstructured":"Arge, L., Ferragina, P., Grossi, R., Vitter, J.S.: On sorting strings in external memory (extended abstract). In: Proceedings of the 29th STOC, pp. 540\u2013548 (1997). https:\/\/doi.org\/10.1145\/258533.258647","DOI":"10.1145\/258533.258647"},{"key":"1193_CR19","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string B-trees. In: Proceedings of the 25th PODS, pp. 233\u2013242 (2006). https:\/\/doi.org\/10.1145\/1142351.1142385","DOI":"10.1145\/1142351.1142385"},{"key":"1193_CR20","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th FOCS, pp. 137\u2013143 (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"key":"1193_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jda.2011.12.011","volume":"14","author":"D Belazzougui","year":"2012","unstructured":"Belazzougui, D.: Worst-case efficient single and multiple string matching on packed texts in the word-RAM model. J. Discrete Algorithms 14, 91\u2013106 (2012). https:\/\/doi.org\/10.1016\/j.jda.2011.12.011","journal-title":"J. Discrete Algorithms"},{"key":"1193_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2017.12.021","volume":"713","author":"P Bille","year":"2018","unstructured":"Bille, P., Ettienne, M.B., G\u00f8rtz, I.L., Vildh\u00f8j, H.W.: Time-space trade-offs for Lempel-Ziv compressed indexing. Theor. Comput. Sci. 713, 66\u201377 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.12.021","journal-title":"Theor. Comput. Sci."},{"key":"1193_CR23","doi-asserted-by":"publisher","unstructured":"Bille, P., G\u00f8rtz, I.L., Skjoldjensen, F.R.: Deterministic indexing for packed strings. In: Proceedings of the 28th CPM, pp. 6\u20131611 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.6","DOI":"10.4230\/LIPIcs.CPM.2017.6"},{"issue":"3","key":"1193_CR24","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015). https:\/\/doi.org\/10.1137\/130936889","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1193_CR25","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/3409371","volume":"53","author":"G Navarro","year":"2020","unstructured":"Navarro, G., Rojas-Ledesma, J.: Predecessor search. ACM Comput. Surv. 53(5), 105\u2013110535 (2020). https:\/\/doi.org\/10.1145\/3409371","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"1193_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jss.2004.09.002","volume":"78","author":"A Brodnik","year":"2005","unstructured":"Brodnik, A., Carlsson, S., Fredman, M.L., Karlsson, J., Munro, J.I.: Worst case constant time priority queue. J. Syst. Softw. 78(3), 249\u2013256 (2005). https:\/\/doi.org\/10.1016\/j.jss.2004.09.002","journal-title":"J. Syst. Softw."},{"key":"1193_CR27","unstructured":"Leben, R., Miletic, M., S\u0306pegel, M., Torst, A., Brodnik, A., Karlsson, K.: Design of high performance memory module on PC100. In: Proceedings of the Electrotechnical and Computer Science Conference (ERK), pp. 75\u201378 (1999)"},{"key":"1193_CR28","doi-asserted-by":"publisher","unstructured":"Farzan, A., L\u00f3pez-Ortiz, A., Nicholson, P.K., Salinger, A.: Algorithms in the ultra-wide word model. In: Proceedings of the 12th TAMC, pp. 335\u2013346 (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_29","DOI":"10.1007\/978-3-319-17142-5_29"},{"key":"1193_CR29","unstructured":"Reinders, J.: Intel\u00ae AVX-512 Instructions. Intel\u00ae Corporation (2013)"},{"issue":"2","key":"1193_CR30","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MM.2017.35","volume":"37","author":"N Stephens","year":"2017","unstructured":"Stephens, N., Biles, S., Boettcher, M., Eapen, J., Eyole, M., Gabrielli, G., Horsnell, M., Magklis, G., Martinez, A., Pr\u00e9millieu, N., Reid, A., Rico, A., Walker, P.: The ARM scalable vector extension. IEEE Micro 37(2), 26\u201339 (2017). https:\/\/doi.org\/10.1109\/MM.2017.35","journal-title":"IEEE Micro"},{"issue":"5","key":"1193_CR31","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1147\/rd.515.0559","volume":"51","author":"T Chen","year":"2007","unstructured":"Chen, T., Raghavan, R., Dale, J.N., Iwata, E.: Cell Broadband engine architecture and its first implementation\u2014a performance view. IBM J. Res. Dev. 51(5), 559\u2013572 (2007). https:\/\/doi.org\/10.1147\/rd.515.0559","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"1193_CR32","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., Aufder Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput. 23(4), 738\u2013761 (1994). https:\/\/doi.org\/10.1137\/S0097539791194094","journal-title":"SIAM J. Comput."},{"key":"1193_CR33","doi-asserted-by":"publisher","unstructured":"Bille, P., G\u00f8rtz, I.L., Stordalen, T.: Predecessor on the ultra-wide word RAM. In: Proceedings of the 18th SWAT, pp. 18\u201311815 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2022.18","DOI":"10.4230\/LIPIcs.SWAT.2022.18"},{"issue":"3","key":"1193_CR34","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with $$O(1)$$ worst case access time. J. ACM 31(3), 538\u2013544 (1984). https:\/\/doi.org\/10.1145\/828.1884","journal-title":"J. ACM"},{"key":"1193_CR35","doi-asserted-by":"publisher","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Proceedings of the 15th STACS, pp. 366\u2013398 (1998). https:\/\/doi.org\/10.1007\/BFb0028575","DOI":"10.1007\/BFb0028575"},{"key":"1193_CR36","doi-asserted-by":"publisher","unstructured":"Bille, P., G\u00f8rtz, I.L., Skjoldjensen, F.R.: Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. 905, 99\u2013105 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.01.002. Announced at TAMC 2020","DOI":"10.1016\/j.tcs.2022.01.002"},{"key":"1193_CR37","unstructured":"Corporation, I.: Intel\u00ae advanced vector extensions programming reference. Intel Corporation (2011)"},{"key":"1193_CR38","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Pagh, R.: I\/O-efficient data structures for colored range and prefix reporting. In: Proceedings of the 23rd SODA, pp. 583\u2013592 (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.49","DOI":"10.1137\/1.9781611973099.49"},{"issue":"1","key":"1193_CR39","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M Dietzfelbinger","year":"1997","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25(1), 19\u201351 (1997). https:\/\/doi.org\/10.1006\/jagm.1997.0873","journal-title":"J. Algorithms"},{"key":"1193_CR40","doi-asserted-by":"publisher","unstructured":"Dietzfelbinger, M., auf\u00a0der Heide, F.M.: A new universal class of hash functions and dynamic hashing in real time. In: Proceedings of the 17th ICALP, pp. 6\u201319 (1990). https:\/\/doi.org\/10.1007\/BFb0032018","DOI":"10.1007\/BFb0032018"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01193-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01193-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01193-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,21]],"date-time":"2024-04-21T03:04:20Z","timestamp":1713668660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01193-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,10]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1193"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01193-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,10]]},"assertion":[{"value":"16 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"There are no other competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}