{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:48:23Z","timestamp":1743151703622,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_10","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"142-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Definable Subsets of Polynomial-Time Algebraic Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-94418-0_2","volume-title":"Sailing Routes in the World of Computation","author":"P Alaev","year":"2018","unstructured":"Alaev, P., Selivanov, V.: Polynomial-time presentations of algebraic number fields. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 20\u201329. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94418-0_2"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10469-017-9416-y","volume":"55","author":"PE Alaev","year":"2017","unstructured":"Alaev, P.E.: Structures computable in polynomial time. I. Algebra Log. 55(6), 421\u2013435 (2017). \nhttps:\/\/doi.org\/10.1007\/s10469-017-9416-y","journal-title":"Algebra Log."},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10469-018-9465-x","volume":"56","author":"PE Alaev","year":"2018","unstructured":"Alaev, P.E.: Structures computable in polynomial time. II. Algebra Log. 56(6), 429\u2013442 (2018). \nhttps:\/\/doi.org\/10.1007\/s10469-018-9465-x","journal-title":"Algebra Log."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1134\/S1064562418050137","volume":"98","author":"PE Alaev","year":"2018","unstructured":"Alaev, P.E., Selivanov, V.L.: Polynomial computability of fields of algebraic numbers. Dokl. Math. 98(1), 341\u2013343 (2018). \nhttps:\/\/doi.org\/10.1134\/S1064562418050137","journal-title":"Dokl. Math."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10469-014-9266-9","volume":"53","author":"SA Aleksandrova","year":"2014","unstructured":"Aleksandrova, S.A.: The uniformization problem for $$\\varSigma $$-predicates in a hereditarily finite list superstructure over the real exponential field. Algebra and Logic 53(1), 1\u20138 (2014). \nhttps:\/\/doi.org\/10.1007\/s10469-014-9266-9","journal-title":"Algebra and Logic"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"673","DOI":"10.2307\/2274709","volume":"56","author":"CJ Ash","year":"1991","unstructured":"Ash, C.J.: A construction for recursive linear orderings. J. Symb. Log. 56(2), 673\u2013683 (1991). \nhttps:\/\/doi.org\/10.2307\/2274709","journal-title":"J. Symb. Log."},{"key":"10_CR7","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144. Elsevier Science B.V, Amsterdam (2000)"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets And Structures","author":"J Barwise","year":"1975","unstructured":"Barwise, J.: Admissible Sets And Structures. Springer, Berlin (1975)"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/bsl.2019.20","volume":"25","author":"N Bazhenov","year":"2019","unstructured":"Bazhenov, N., Downey, R., Kalimullin, I., Melnikov, A.: Foundations of online structure theory. Bull. Symb. Log. 25(2), 141\u2013181 (2019). \nhttps:\/\/doi.org\/10.1017\/bsl.2019.20","journal-title":"Bull. Symb. Log."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1017\/jsl.2019.26","volume":"84","author":"N Bazhenov","year":"2019","unstructured":"Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.: Automatic and polynomial-time algebraic structures. J. Symb. Log. 84(4), 1630\u20131669 (2019). \nhttps:\/\/doi.org\/10.1017\/jsl.2019.26","journal-title":"J. Symb. Log."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"D Cenzer","year":"1991","unstructured":"Cenzer, D., Remmel, J.: Polynomial-time versus recursive models. Ann. Pure Appl. Log. 54(1), 17\u201358 (1991). \nhttps:\/\/doi.org\/10.1016\/0168-0072(91)90008-A","journal-title":"Ann. Pure Appl. Log."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Cenzer, D., Remmel, J.B.: Complexity theoretic model theory and algebra. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics: Volume 1: Studies in Logic and the Foundations of Mathematics, vol. 138, pp. 381\u2013513. North-Holland, Amsterdam (1998). \nhttps:\/\/doi.org\/10.1016\/S0049-237X(98)80011-6","DOI":"10.1016\/S0049-237X(98)80011-6"},{"issue":"1\u20133","key":"10_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"DA Cenzer","year":"1992","unstructured":"Cenzer, D.A., Remmel, J.B.: Polynomial-time Abelian groups. Ann. Pure Appl. Log. 56(1\u20133), 313\u2013363 (1992). \nhttps:\/\/doi.org\/10.1016\/0168-0072(92)90076-C","journal-title":"Ann. Pure Appl. Log."},{"key":"10_CR14","volume-title":"Definability and Computability","author":"YL Ershov","year":"1996","unstructured":"Ershov, Y.L.: Definability and Computability. Consultants Bureau, New York (1996)"},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4305-3","volume-title":"Constructive Models","author":"YL Ershov","year":"2000","unstructured":"Ershov, Y.L., Goncharov, S.S.: Constructive Models. Kluwer Academic\/Plenum Publishers, New York (2000)"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Ershov, Y.L., Puzarenko, V.G., Stukachev, A.I.: $$HF$$-computability. In: Cooper, S.B., Sorbi, A. (eds.) Computability in Context, pp. 169\u2013242. Imperial College Press, London (2011). \nhttps:\/\/doi.org\/10.1142\/9781848162778_0006","DOI":"10.1142\/9781848162778_0006"},{"issue":"950","key":"10_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1098\/rsta.1956.0003","volume":"248","author":"A Fr\u00f6hlich","year":"1956","unstructured":"Fr\u00f6hlich, A., Shepherdson, J.C.: Effective procedures in field theory. Philos. Trans. Roy. Soc. Lond. Ser. A 248(950), 407\u2013432 (1956). \nhttps:\/\/doi.org\/10.1098\/rsta.1956.0003","journal-title":"Philos. Trans. Roy. Soc. Lond. Ser. A"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"380","DOI":"10.33048\/semi.2020.17.024","volume":"17","author":"S Goncharov","year":"2020","unstructured":"Goncharov, S., Ospichev, S., Ponomaryov, D., Sviridenko, D.: The expressiveness of looping terms in the semantic programming. Sib. Elektron. Mat. Izv. 17, 380\u2013394 (2020). \nhttps:\/\/doi.org\/10.33048\/semi.2020.17.024","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"10_CR19","volume-title":"Countable Boolean Algebras and Decidability","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S.: Countable Boolean Algebras and Decidability. Consultants Bureau, New York (1997)"},{"issue":"5","key":"10_CR20","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1134\/S0037446617050068","volume":"58","author":"SS Goncharov","year":"2017","unstructured":"Goncharov, S.S.: Conditional terms in semantic programming. Sib. Math. J. 58(5), 794\u2013800 (2017). \nhttps:\/\/doi.org\/10.1134\/S0037446617050068","journal-title":"Sib. Math. J."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-16444-8_13","volume-title":"Mathematical Methods of Specification and Synthesis of Software Systems 1985","author":"SS Goncharov","year":"1986","unstructured":"Goncharov, S.S., Sviridenko, D.I.: Theoretical aspects of $$\\varSigma $$-programming. In: Bibel, W., Jantke, K.P. (eds.) MMSSS 1985. LNCS, vol. 215, pp. 169\u2013179. Springer, Heidelberg (1986). \nhttps:\/\/doi.org\/10.1007\/3-540-16444-8_13"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1090\/trans2\/142\/10","volume":"142","author":"SS Goncharov","year":"1989","unstructured":"Goncharov, S.S., Sviridenko, D.I.: $$\\varSigma $$-programming. Am. Math. Soc. Transl. Ser. 2 142, 101\u2013121 (1989). \nhttps:\/\/doi.org\/10.1090\/trans2\/142\/10","journal-title":"Am. Math. Soc. Transl. Ser. 2"},{"issue":"6","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1134\/S0037446618060058","volume":"59","author":"SS Goncharov","year":"2018","unstructured":"Goncharov, S.S., Sviridenko, D.I.: Recursive terms in semantic programming. Sib. Math. J. 59(6), 1014\u20131023 (2018). \nhttps:\/\/doi.org\/10.1134\/S0037446618060058","journal-title":"Sib. Math. J."},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1134\/S1064562419020030","volume":"99","author":"SS Goncharov","year":"2019","unstructured":"Goncharov, S.S., Sviridenko, D.I.: Logical language of description of polynomial computing. Dokl. Math. 99(2), 121\u2013124 (2019). \nhttps:\/\/doi.org\/10.1134\/S1064562419020030","journal-title":"Dokl. Math."},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"260","DOI":"10.2307\/2274966","volume":"55","author":"S Grigorieff","year":"1990","unstructured":"Grigorieff, S.: Every recursive linear ordering has a copy in DTIME-SPACE$$(n,\\rm log(n))$$. J. Symb. Log. 55(1), 260\u2013276 (1990). \nhttps:\/\/doi.org\/10.2307\/2274966","journal-title":"J. Symb. Log."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2017.01.029","volume":"674","author":"I Kalimullin","year":"2017","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: Algebraic structures computable without delay. Theor. Comput. Sci. 674, 73\u201398 (2017). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2017.01.029","journal-title":"Theor. Comput. Sci."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-40189-8_30","volume-title":"Pursuit of the Universal","author":"A Konovalov","year":"2016","unstructured":"Konovalov, A., Selivanov, V.: The Boolean algebra of piecewise testable languages. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 292\u2013301. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40189-8_30"},{"issue":"4","key":"10_CR28","first-page":"85","volume":"2","author":"MV Korovina","year":"1992","unstructured":"Korovina, M.V.: Generalized computability of real functions. Sib. Adv. Math. 2(4), 85\u2013103 (1992)","journal-title":"Sib. Adv. Math."},{"issue":"3","key":"10_CR29","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"AI Mal\u2019tsev","year":"1961","unstructured":"Mal\u2019tsev, A.I.: Constructive algebras. I. Russ. Math. Surv. 16(3), 77\u2013129 (1961). \nhttps:\/\/doi.org\/10.1070\/RM1961v016n03ABEH001120","journal-title":"Russ. Math. Surv."},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-58741-7_8","volume-title":"Unveiling Dynamics and Complexity","author":"AG Melnikov","year":"2017","unstructured":"Melnikov, A.G.: Eliminating unbounded search in computable algebra. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 77\u201387. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-58741-7_8"},{"issue":"2","key":"10_CR31","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s11856-019-1948-5","volume":"234","author":"AG Melnikov","year":"2019","unstructured":"Melnikov, A.G., Ng, K.M.: The back-and-forth method and computability without delay. Isr. J. Math. 234(2), 959\u20131000 (2019). \nhttps:\/\/doi.org\/10.1007\/s11856-019-1948-5","journal-title":"Isr. J. Math."},{"key":"10_CR32","unstructured":"Montalb\u00e1n, A.: Computable structure theory: within the arithmetic. \nhttps:\/\/math.berkeley.edu\/~antonio\/CSTpart1.pdf"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Nerode, A., Remmel, J.B.: Polynomial time equivalence types. In: Sieg, W. (ed.) Logic and Computation, Contemporary Mathematics, vol. 106, pp. 221\u2013249. American Mathematical Society, Providence (1990). \nhttps:\/\/doi.org\/10.1090\/conm\/106\/1057825","DOI":"10.1090\/conm\/106\/1057825"},{"issue":"6","key":"10_CR34","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1007\/BF00970918","volume":"30","author":"SP Odintsov","year":"1989","unstructured":"Odintsov, S.P., Selivanov, V.L.: Arithmetic hierarchy and ideals of enumerated Boolean algebras. Sib. Math. J. 30(6), 952\u2013960 (1989). \nhttps:\/\/doi.org\/10.1007\/BF00970918","journal-title":"Sib. Math. J."},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"987","DOI":"10.17377\/semi.2018.15.083","volume":"15","author":"S Ospichev","year":"2018","unstructured":"Ospichev, S., Ponomarev, D.: On the complexity of formulas in semantic programming. Sib. Elektron. Mat. Izv. 15, 987\u2013995 (2018). \nhttps:\/\/doi.org\/10.17377\/semi.2018.15.083","journal-title":"Sib. Elektron. Mat. Izv."},{"issue":"2","key":"10_CR36","doi-asserted-by":"publisher","first-page":"341","DOI":"10.2307\/1993295","volume":"95","author":"MO Rabin","year":"1960","unstructured":"Rabin, M.O.: Computable algebra, general theory and theory of computable fields. Trans. Am. Math. Soc. 95(2), 341\u2013360 (1960). \nhttps:\/\/doi.org\/10.2307\/1993295","journal-title":"Trans. Am. Math. Soc."},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-22321-1_33","volume-title":"Developments in Language Theory","author":"V Selivanov","year":"2011","unstructured":"Selivanov, V., Konovalov, A.: Boolean algebras of regular languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 386\u2013396. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22321-1_33"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-37064-9_44","volume-title":"Language and Automata Theory and Applications","author":"V Selivanov","year":"2013","unstructured":"Selivanov, V., Konovalov, A.: Boolean algebras of regular $$\\omega $$-languages. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 504\u2013515. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37064-9_44"},{"key":"10_CR39","first-page":"21","volume":"6","author":"R Vajtsenavichyus","year":"1989","unstructured":"Vajtsenavichyus, R.: On necessary conditions for the existence of a universal function on an admissible set. Mat. Logika Primen. 6, 21\u201337 (1989). in Russian","journal-title":"Mat. Logika Primen."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:06:20Z","timestamp":1592780780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}