{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T11:03:35Z","timestamp":1778238215663,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:00:00Z","timestamp":1703030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["18-11-00100"],"award-info":[{"award-number":["18-11-00100"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["18-11-00100"],"award-info":[{"award-number":["18-11-00100"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["18-11-00100"],"award-info":[{"award-number":["18-11-00100"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00224-023-10159-3","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T04:02:25Z","timestamp":1703044945000},"page":"487-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1577-8347","authenticated-orcid":false,"given":"Ekaterina","family":"Shemetova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7966-0698","authenticated-orcid":false,"given":"Semyon","family":"Grigorev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"key":"10159_CR1","doi-asserted-by":"publisher","unstructured":"Alpoge, L., Ang, T., Schaeffer, L., Shallit, J.O.: Decidability and shortest strings in formal languages. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) Descriptional Complexity of Formal Systems\u201313th International Workshop, DCFS 2011, Gie\u00dfen\/Limburg, Germany, July 25-27, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6808, pp. 55\u201367. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22600-7_5","DOI":"10.1007\/978-3-642-22600-7_5"},{"key":"10159_CR2","doi-asserted-by":"crossref","unstructured":"Autebert, J.M., Berstel, J., Boasson, L.: Context-Free Languages and Pushdown Automata, pp. 111\u2013174. Springer Berlin Heidelberg, Berlin, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_3"},{"issue":"1\u20134","key":"10159_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1524\/stuf.1961.14.14.143","volume":"14","author":"Y Bar-Hillel","year":"1961","unstructured":"Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phreise structure grammars. STUF - Language Typology and Universals 14(1\u20134), 143\u2013172 (1961). https:\/\/doi.org\/10.1524\/stuf.1961.14.14.143","journal-title":"STUF - Language Typology and Universals"},{"issue":"2","key":"10159_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1137\/0210020","volume":"10","author":"L Boasson","year":"1981","unstructured":"Boasson, L., Courcelle, B., Nivat, M.: The rational index: A complexity measure for languages. SIAM J. Comput. 10(2), 284\u2013296 (1981). https:\/\/doi.org\/10.1137\/0210020","journal-title":"SIAM J. Comput."},{"key":"10159_CR5","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.A.: Regular-like expressions for some irregular languages. In: 9th Annual Symposium on Switching and Automata Theory, Schenectady, New York, USA, October 15\u201318, 1968. pp. 278\u2013286. IEEE Computer Society (1968). https:\/\/doi.org\/10.1109\/SWAT.1968.24","DOI":"10.1109\/SWAT.1968.24"},{"key":"10159_CR6","doi-asserted-by":"publisher","unstructured":"Chistikov, D., Czerwinski, W., Hofman, P., Pilipczuk, M., Wehar, M.: Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15(1) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(1:19)2019","DOI":"10.23638\/LMCS-15(1:19)2019"},{"key":"10159_CR7","doi-asserted-by":"publisher","unstructured":"Chytil, M., Monien, B.: Caterpillars and context-free languages. In: Choffrut, C., Lengauer, T. (eds.) STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22\u201324, 1990, Proceedings. Lecture Notes in Computer Science, vol. 415, pp. 70\u201381. Springer (1990). https:\/\/doi.org\/10.1007\/3-540-52282-4_33","DOI":"10.1007\/3-540-52282-4_33"},{"issue":"4","key":"10159_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3233\/FI-2021-2044","volume":"180","author":"E Dobronravov","year":"2021","unstructured":"Dobronravov, E., Dobronravov, N., Okhotin, A.: On the length of shortest strings accepted by two-way finite automata. Fundam. Informaticae 180(4), 315\u2013331 (2021). https:\/\/doi.org\/10.3233\/FI-2021-2044","journal-title":"Fundam. Informaticae"},{"key":"10159_CR9","doi-asserted-by":"publisher","unstructured":"Ellul, K., Krawetz, B., Shallit, J.O., Wang, M.: Regular expressions: New results and open problems. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005). https:\/\/doi.org\/10.25596\/jalc-2005-407","DOI":"10.25596\/jalc-2005-407"},{"key":"10159_CR10","doi-asserted-by":"publisher","unstructured":"Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Volume 3: Beyond Words, pp. 125\u2013213. Springer (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_3","DOI":"10.1007\/978-3-642-59126-6_3"},{"key":"10159_CR11","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh\u2019s theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12), 614\u2013619 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.03.019","DOI":"10.1016\/j.ipl.2011.03.019"},{"key":"10159_CR12","doi-asserted-by":"publisher","unstructured":"Esparza, J., Luttenberger, M., Schlund, M.: A brief history of Strahler numbers. In: Dediu, A., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.L., Truthe, B. (eds.) Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8370, pp. 1\u201313. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-04921-2_1","DOI":"10.1007\/978-3-319-04921-2_1"},{"key":"10159_CR13","doi-asserted-by":"publisher","unstructured":"Ganty, P., Valput, D.: Bounded-oscillation pushdown automata. In: Cantone, D., Delzanno, G. (eds.) Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14\u201316 September 2016. EPTCS, vol. 226, pp. 178\u2013197 (2016). https:\/\/doi.org\/10.4204\/EPTCS.226.13","DOI":"10.4204\/EPTCS.226.13"},{"key":"10159_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jcss.2022.02.003","volume":"127","author":"K Gebhardt","year":"2022","unstructured":"Gebhardt, K., Meunier, F., Salvati, S.: On is an n-MCFL. J. Comput. Syst. Sci. 127, 41\u201352 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2022.02.003","journal-title":"J. Comput. Syst. Sci."},{"key":"10159_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-completeness Theory. Oxford University Press Inc, New York, NY, USA (1995)"},{"key":"10159_CR16","doi-asserted-by":"publisher","unstructured":"Hellings, J.: Explaining results of path queries on graphs-single-path results for context-free path queries. In: Qin, L., Zhang, W., Zhang, Y., Peng, Y., Kato, H., Wang, W., Xiao, C. (eds.) Software Foundations for Data Interoperability and Large Scale Graph Data Analytics - 4th International Workshop, SFDI 2020, and 2nd International Workshop, LSGDA 2020, held in Conjunction with VLDB 2020, Tokyo, Japan, September 4, 2020, Proceedings. Communications in Computer and Information Science, vol. 1281, pp. 84\u201398. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-61133-0_7","DOI":"10.1007\/978-3-030-61133-0_7"},{"key":"10159_CR17","doi-asserted-by":"publisher","unstructured":"Holzer, M., Kutrib, M., Leiter, U.: Nodes connected by path languages. In: Mauri, G., Leporati, A. (eds.) Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6795, pp. 276\u2013287. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_24","DOI":"10.1007\/978-3-642-22321-1_24"},{"key":"10159_CR18","doi-asserted-by":"publisher","unstructured":"Kanazawa, M.: Ogden\u2019s lemma, multiple context-free grammars, and the control language hierarchy. Inf. Comput. 269 (2019). https:\/\/doi.org\/10.1016\/j.ic.2019.104449","DOI":"10.1016\/j.ic.2019.104449"},{"key":"10159_CR19","doi-asserted-by":"publisher","unstructured":"Komarath, B., Sarma, J., Sunil, K.S.: On the complexity of l-reachability. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) Descriptional Complexity of Formal Systems-16th International Workshop, DCFS 2014, Turku, Finland, August 5\u20138, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8614, pp. 258\u2013269. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-09704-6_23","DOI":"10.1007\/978-3-319-09704-6_23"},{"key":"10159_CR20","doi-asserted-by":"publisher","unstructured":"Krymski, S., Okhotin, A.: Longer shortest strings in two-way finite automata. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) Descriptional Complexity of Formal Systems-22nd International Conference, DCFS 2020, Vienna, Austria, August 24\u201326, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12442, pp. 104\u2013116. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_9","DOI":"10.1007\/978-3-030-62536-8_9"},{"key":"10159_CR21","doi-asserted-by":"publisher","unstructured":"Lohrey, M., Rosowski, A., Zetzsche, G.: Membership problems in finite groups. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. LIPIcs, vol. 241, pp. 71:1\u201371:16. Schloss Dagstuhl\u2013Leibniz\u2013Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2022.71","DOI":"10.4230\/LIPIcs.MFCS.2022.71"},{"key":"10159_CR22","doi-asserted-by":"publisher","unstructured":"Luttenberger, M., Schlund, M.: Convergence of Newton\u2019s method over commutative semirings. In: Dediu, A., Mart\u00edn\u2013Vide, C., Truthe, B. (eds.) Language and Automata Theory and Applications\u20137th International Conference, LATA 2013, Bilbao, Spain, April 2\u20135, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7810, pp. 407\u2013418. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-37064-9_36","DOI":"10.1007\/978-3-642-37064-9_36"},{"key":"10159_CR23","doi-asserted-by":"publisher","unstructured":"Martynova, O., Okhotin, A.: Shortest accepted strings for two-way finite automata: Approaching the $$2^{n}$$ lower bound 13918, 134\u2013145 (2023). https:\/\/doi.org\/10.1007\/978-3-031-34326-1_10","DOI":"10.1007\/978-3-031-34326-1_10"},{"key":"10159_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","volume":"9","author":"A Okhotin","year":"2013","unstructured":"Okhotin, A.: Conjunctive and Boolean grammars: The true general case of the context-free grammars. Comput. Sci. Rev. 9, 27\u201359 (2013). https:\/\/doi.org\/10.1016\/j.cosrev.2013.06.001","journal-title":"Comput. Sci. Rev."},{"key":"10159_CR25","doi-asserted-by":"publisher","unstructured":"Okhotin, A.: A tale of conjunctive grammars. In: Hoshi, M., Seki, S. (eds.) Developments in Language Theory\u201322nd International Conference, DLT 2018, Tokyo, Japan, September 10\u201314, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11088, pp. 36\u201359. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_4","DOI":"10.1007\/978-3-319-98654-8_4"},{"issue":"2","key":"10159_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(92)90269-L","volume":"95","author":"L Pierre","year":"1992","unstructured":"Pierre, L.: Rational indexes of generators of the cone of context-free languages. Theor. Comput. Sci. 95(2), 279\u2013305 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90269-L","journal-title":"Theor. Comput. Sci."},{"key":"10159_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1051\/ita\/1990240302751","volume":"24","author":"L Pierre","year":"1990","unstructured":"Pierre, L., Farinone, J.: Context-free languages with rational index in $$\\theta (n \\lambda )$$ for algebraic numbers $$\\lambda $$. RAIRO Theor. Informatics Appl. 24, 275\u2013322 (1990). https:\/\/doi.org\/10.1051\/ita\/1990240302751","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"10159_CR28","unstructured":"Ramanujan, S.: A proof of Bertrand\u2019s postulate. Journal of the Indian Mathematical Society 11(181\u2013182), 27 (1919)"},{"issue":"11\u201312","key":"10159_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"TW Reps","year":"1998","unstructured":"Reps, T.W.: Program analysis via graph reachability. Inf. Softw. Technol. 40(11\u201312), 701\u2013726 (1998). https:\/\/doi.org\/10.1016\/S0950-5849(98)00093-7","journal-title":"Inf. Softw. Technol."},{"issue":"1","key":"10159_CR30","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/345099.345137","volume":"22","author":"TW Reps","year":"2000","unstructured":"Reps, T.W.: Undecidability of context-sensitive data-independence analysis. ACM Trans. Program. Lang. Syst. 22(1), 162\u2013186 (2000). https:\/\/doi.org\/10.1145\/345099.345137","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10159_CR31","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-19225-3_22","volume-title":"Descriptional Complexity of Formal Systems","author":"A Rubtsov","year":"2015","unstructured":"Rubtsov, A., Vyalyi, M.: Regular realizability problems and context-free languages. In: Shallit, J., Okhotin, A. (eds.) Descriptional Complexity of Formal Systems, pp. 256\u2013267. Springer International Publishing, Cham (2015)"},{"issue":"5","key":"10159_CR32","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","volume":"14","author":"A Salomaa","year":"1969","unstructured":"Salomaa, A.: On the index of a context-free grammar and language. Inf. Control 14(5), 474\u2013477 (1969). https:\/\/doi.org\/10.1016\/S0019-9958(69)90164-8","journal-title":"Inf. Control"},{"issue":"2","key":"10159_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90374-B","journal-title":"Theor. Comput. Sci."},{"key":"10159_CR34","doi-asserted-by":"crossref","unstructured":"Sondow, J.: Ramanujan primes and Bertrand\u2019s postulate. Am. Math. Mon. 116(7),630\u2013635 (2009). http:\/\/www.jstor.org\/stable\/40391170","DOI":"10.4169\/193009709X458609"},{"key":"10159_CR35","doi-asserted-by":"publisher","unstructured":"Sp\u00e4th, J., Ali, K., Bodden, E.: Context-, flow-, and field-sensitive data-flow analysis using synchronized pushdown systems. Proc. ACM Program. Lang. 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290361","DOI":"10.1145\/3290361"},{"key":"10159_CR36","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01762108","volume":"3","author":"JD Ullman","year":"1988","unstructured":"Ullman, J.D., Gelder, A.V.: Parallel complexity of logical query programs. Algorithmica 3, 5\u201342 (1988). https:\/\/doi.org\/10.1007\/BF01762108","journal-title":"Algorithmica"},{"key":"10159_CR37","doi-asserted-by":"publisher","unstructured":"Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Sidner, C.L. (ed.) 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Stanford, California, USA, July 6\u20139, 1987. pp. 104\u2013111. ACL (1987). https:\/\/doi.org\/10.3115\/981175.981190","DOI":"10.3115\/981175.981190"},{"key":"10159_CR38","unstructured":"Wechsung, G.: The oscillation complexity and a hierarchy of context-free languages. In: Budach, L. (ed.) Fundamentals of Computation Theory, FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin\/Wendisch-Rietz, Germany, September 17\u201321, 1979. pp. 508\u2013515. Akademie-Verlag, Berlin (1979)"},{"key":"10159_CR39","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: Rosenkrantz, D.J., Sagiv, Y. (eds.) Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2\u20134, 1990, Nashville, Tennessee, USA. pp. 230\u2013242. ACM Press (1990). https:\/\/doi.org\/10.1145\/298514.298576","DOI":"10.1145\/298514.298576"},{"key":"10159_CR40","doi-asserted-by":"publisher","unstructured":"Zhang, Q., Su, Z.: Context-sensitive data-dependence analysis via linear conjunctive language reachability. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18\u201320, 2017. pp. 344\u2013358. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009848","DOI":"10.1145\/3009837.3009848"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10159-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10159-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10159-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:03:44Z","timestamp":1718921024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10159-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,20]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["10159"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10159-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2338487\/v1","asserted-by":"object"}]},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,20]]},"assertion":[{"value":"29 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}