{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:14:35Z","timestamp":1743142475693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_29","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"398-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9711-698X","authenticated-orcid":false,"given":"Jonas","family":"Lingg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7798-7446","authenticated-orcid":false,"given":"Mateus","family":"de Oliveira Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3097-3906","authenticated-orcid":false,"given":"Petra","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods Syst. Des. 25(1), 39\u201365 (2004)","journal-title":"Formal Methods Syst. Des."},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D Angluin","year":"1978","unstructured":"Angluin, D.: On the complexity of minimum inference of regular sets. Inf. Control 39(3), 337\u2013350 (1978)","journal-title":"Inf. Control"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741\u2013765 (1982)","journal-title":"J. ACM"},{"issue":"6","key":"29_CR4","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s13042-015-0355-4","volume":"6","author":"N Bouhmala","year":"2015","unstructured":"Bouhmala, N.: A multilevel learning automata for MAX-SAT. Int. J. Mach. Learn. Cybern. 6(6), 911\u2013921 (2015)","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0022-0000(80)90003-3","volume":"20","author":"JA Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Fich, F.E.: Languages of R-trivial monoids. J. Comput. Syst. Sci. 20(1), 32\u201349 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/007.2","volume-title":"The Algebraic Theory of Semigroups, Volume II","author":"AH Clifford","year":"1967","unstructured":"Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, Volume II, vol. 2. American Mathematical Soc., Providence (1967)"},{"key":"29_CR7","unstructured":"Coste, F., Kerbellec, G.: Learning automata on protein sequences. In: JOBIM, pp. 199\u2013210 (2006)"},{"key":"29_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"29_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"29_CR10","unstructured":"Fernau, H.: Personal communication (2021)"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ic.2008.12.008","volume":"207","author":"H Fernau","year":"2009","unstructured":"Fernau, H.: Algorithms for learning regular expressions from positive data. Inf. Comput. 207(4), 521\u2013541 (2009)","journal-title":"Inf. Comput."},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.jcss.2014.12.027","volume":"81","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Heggernes, P., Villanger, Y.: A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81(4), 747\u2013765 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.3390\/a10010024","volume":"10","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Krebs, A.: Problems on finite automata and the exponential time hypothesis. Algorithms 10(1), 24 (2017)","journal-title":"Algorithms"},{"issue":"5","key":"29_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978)","journal-title":"Inf. Control"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Groce","year":"2002","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 357\u2013370. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46002-0_25"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-70583-3_4","volume-title":"Automata, Languages and Programming","author":"H Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 39\u201350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"41164","DOI":"10.1109\/ACCESS.2019.2907645","volume":"7","author":"H Guo","year":"2019","unstructured":"Guo, H., Wang, S., Fan, J., Li, S.: Learning automata based incremental learning method for deep neural networks. IEEE Access 7, 41164\u201341171 (2019)","journal-title":"IEEE Access"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.jocs.2017.09.008","volume":"24","author":"M Hasanzadeh-Mofrad","year":"2018","unstructured":"Hasanzadeh-Mofrad, M., Rezvanian, A.: Learning automata clustering. J. Comput. Sci. 24, 379\u2013388 (2018)","journal-title":"J. Comput. Sci."},{"key":"29_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C De la Higuera","year":"2010","unstructured":"De la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, Cambridge (2010)"},{"issue":"2","key":"29_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"29_CR22","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-31606-7_20","volume-title":"Implementation and Application of Automata","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: On the state and computational complexity of the reverse of acyclic minimal DFAs. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 229\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_20"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-38771-5_26","volume-title":"Developments in Language Theory","author":"O Kl\u00edma","year":"2013","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: Alternative automata characterization of piecewise testable languages. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 289\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_26"},{"issue":"105","key":"29_CR25","first-page":"41","volume":"3","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S., et al.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 3(105), 41\u201371 (2013)","journal-title":"Bull. EATCS"},{"issue":"2","key":"29_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10994-016-5565-9","volume":"105","author":"H Mao","year":"2016","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning deterministic probabilistic automata from a model checking perspective. Mach. Learn. 105(2), 255\u2013299 (2016). https:\/\/doi.org\/10.1007\/s10994-016-5565-9","journal-title":"Mach. Learn."},{"issue":"4","key":"29_CR27","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1137\/080743457","volume":"39","author":"W Martens","year":"2009","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for XML schemas and chain regular expressions. SIAM J. Comput. 39(4), 1486\u20131530 (2009)","journal-title":"SIAM J. Comput."},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-99740-7_25","volume-title":"Machine Learning and Knowledge Extraction","author":"F Mayr","year":"2018","unstructured":"Mayr, F., Yovine, S.: Regular inference on artificial neural networks. In: Holzinger, A., Kieseberg, P., Tjoa, A.M., Weippl, E. (eds.) CD-MAKE 2018. LNCS, vol. 11015, pp. 350\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99740-7_25"},{"issue":"01","key":"29_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S012906570200090X","volume":"12","author":"MR Meybodi","year":"2002","unstructured":"Meybodi, M.R., Beigy, H.: New learning automata based algorithms for adaptation of backpropagation algorithm parameters. Int. J. Neural Syst. 12(01), 45\u201367 (2002)","journal-title":"Int. J. Neural Syst."},{"key":"29_CR30","volume-title":"Bioinformatics: Sequence and Genome Analysis","author":"DW Mount","year":"2001","unstructured":"Mount, D.W., Mount, D.W.: Bioinformatics: Sequence and Genome Analysis, vol. 1. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY (2001)"},{"issue":"2","key":"29_CR31","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF00939452","volume":"64","author":"K Najim","year":"1990","unstructured":"Najim, K., Pibouleau, L., Le Lann, M.: Optimization technique based on learning automata. J. Optim. Theory Appl. 64(2), 331\u2013347 (1990)","journal-title":"J. Optim. Theory Appl."},{"key":"29_CR32","volume-title":"Learning Automata: Theory and Applications","author":"K Najim","year":"2014","unstructured":"Najim, K., Poznyak, A.S.: Learning Automata: Theory and Applications. Elsevier, Amsterdam (2014)"},{"key":"29_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11691839_3","volume-title":"Learning and Adaption in Multi-Agent Systems","author":"A Now\u00e9","year":"2006","unstructured":"Now\u00e9, A., Verbeeck, K., Peeters, M.: Learning automata as a basis for multi agent reinforcement learning. In: Tuyls, K., Hoen, P.J., Verbeeck, K., Sen, S. (eds.) LAMAS 2005. LNCS (LNAI), vol. 3898, pp. 71\u201385. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691839_3"},{"issue":"1","key":"29_CR34","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1010822518073","volume":"44","author":"R Parekh","year":"2001","unstructured":"Parekh, R., Honavar, V.: Learning DFA from simple examples. Mach. Learn. 44(1), 9\u201335 (2001)","journal-title":"Mach. Learn."},{"key":"29_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN 1992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023844"},{"key":"29_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference","author":"L Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS, vol. 397, pp. 18\u201344. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51734-0_50"},{"issue":"1","key":"29_CR37","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/138027.138042","volume":"40","author":"L Pitt","year":"1993","unstructured":"Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. J. ACM 40(1), 95\u2013142 (1993)","journal-title":"J. ACM"},{"issue":"1","key":"29_CR38","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"PJ Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control. Optim. 25(1), 206\u2013230 (1987)","journal-title":"SIAM J. Control. Optim."},{"key":"29_CR39","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72428-7","volume-title":"Recent Advances in Learning Automata","author":"A Rezvanian","year":"2018","unstructured":"Rezvanian, A., Saghiri, A.M., Vahidipour, S.M., Esnaashari, M., Meybodi, M.R.: Recent Advances in Learning Automata. SCI, vol. 754. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72428-7"},{"key":"29_CR40","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2018.12.026","volume":"787","author":"A Ryzhikov","year":"2019","unstructured":"Ryzhikov, A.: Synchronization problems in automata without non-trivial cycles. Theoret. Comput. Sci. 787, 77\u201388 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR41","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"29_CR42","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"29_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"},{"issue":"1","key":"29_CR44","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01691347","volume":"2","author":"G Thierrin","year":"1968","unstructured":"Thierrin, G.: Permutation automata. Mathem. Syst. Theory 2(1), 83\u201390 (1968)","journal-title":"Mathem. Syst. Theory"},{"issue":"9","key":"29_CR45","doi-asserted-by":"publisher","first-page":"2916","DOI":"10.1007\/s10489-020-01657-9","volume":"50","author":"A Yazidi","year":"2020","unstructured":"Yazidi, A., Bouhmala, N., Goodwin, M.: A team of pursuit learning automata for solving deterministic optimization problems. Appl. Intell. 50(9), 2916\u20132931 (2020)","journal-title":"Appl. Intell."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:29Z","timestamp":1653779249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}