{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:57:07Z","timestamp":1726037827022},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_4","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"59-73","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices"],"prefix":"10.1007","author":[{"given":"Umer","family":"Azfar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costanza","family":"Catalano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Charlier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s10958-013-1295-8","volume":"191","author":"YA Al\u2019pin","year":"2013","unstructured":"Al\u2019pin, Y.A., Al\u2019pina, V.S.: Combinatorial properties of irreducible semigroups of nonnegative matrices. J. Math. Sci. 191(1), 4\u20139 (2013)","journal-title":"J. Math. Sci."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3233\/FI-2016-1357","volume":"145","author":"DS Ananichev","year":"2016","unstructured":"Ananichev, D.S., Gusev, V.V.: Approximation of reset thresholds with greedy algorithms. Fundam. Inform. 145(3), 221\u2013227 (2016)","journal-title":"Fundam. Inform."},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10958-013-1392-8","volume":"192","author":"DS Ananichev","year":"2013","unstructured":"Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263\u2013278 (2013)","journal-title":"J. Math. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.automatica.2015.07.026","volume":"61","author":"V Blondel","year":"2015","unstructured":"Blondel, V., Jungers, R.M., Olshevsky, A.: On primitivity of sets of matrices. Automatica 61, 80\u201388 (2015)","journal-title":"Automatica"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-62809-7_8","volume-title":"Developments in Language Theory","author":"M Bondt de","year":"2017","unstructured":"de Bondt, M., Don, H., Zantema, H.: DFAs and PFAs with long shortest synchronizing word length. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 122\u2013133. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-62809-7_8"},{"key":"4_CR6","unstructured":"Catalano, C., Jungers, R.M.: On randomized generation of slowly synchronizing automata. In: Mathematical Foundations of Computer Science, pp. 48:1\u201348:21 (2018)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-98654-8_16","volume-title":"Developments in Language Theory","author":"C Catalano","year":"2018","unstructured":"Catalano, C., Jungers, R.M.: The synchronizing probability function for primitive sets of matrices. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 194\u2013205. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-98654-8_16"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01192046","volume":"14","author":"YB Chen","year":"1995","unstructured":"Chen, Y.B., Ierardi, D.J.: The complexity of oblivious plans for orienting and distinguishing polygonal parts. Algorithmica 14(5), 367\u2013397 (1995)","journal-title":"Algorithmica"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chevalier, P.Y., Hendrickx, J.M., Jungers, R.M.: Reachability of consensus and synchronizing automata. In: IEEE Conference in Decision and Control, pp. 4139\u20134144 (2015)","DOI":"10.1109\/CDC.2015.7402864"},{"key":"4_CR10","unstructured":"Dzyga, M., Ferens, R., Gusev, V.V., Szyku\u0142a, M.: Attainable values of reset thresholds. In: Mathematical Foundations of Computer Science, vol. 83, pp. 40:1\u201340:14 (2017)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19(3), 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1134\/S1990478918030067","volume":"12","author":"VM Fomichev","year":"2018","unstructured":"Fomichev, V.M., Avezova, Y.E., Koreneva, A.M., Kyazhin, S.N.: Primitivity and local primitivity of digraphs and nonnegative matrices. J. Appl. Ind. Math. 12(3), 453\u2013469 (2018)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3(3), 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-662-48057-1_19","volume-title":"Mathematical Foundations of Computer Science 2015","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Straszak, D.: Strong inapproximability of the shortest reset word. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 243\u2013255. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48057-1_19"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/16M1094099","volume":"39","author":"B Gerencs\u00e9r","year":"2018","unstructured":"Gerencs\u00e9r, B., Gusev, V.V., Jungers, R.M.: Primitive sets of nonnegative matrices and synchronizing automata. SIAM J. Matrix Anal. Appl. 39(1), 83\u201398 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-62809-7_13","volume-title":"Developments in Language Theory","author":"F Gonze","year":"2017","unstructured":"Gonze, F., Gusev, V.V., Gerencs\u00e9r, B., Jungers, R.M., Volkov, M.V.: On the interplay between babai and \u010cern\u00fd\u2019s conjectures. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 185\u2013197. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-62809-7_13"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-15579-1_16","volume-title":"Language and Automata Theory and Applications","author":"F Gonze","year":"2015","unstructured":"Gonze, F., Jungers, R.M.: On the synchronizing probability function and the triple Rendezvous time. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 212\u2013223. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-15579-1_16"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S030500410005252X","volume":"79","author":"J Hajnal","year":"1976","unstructured":"Hajnal, J.: On products of non-negative matrices. Math. Proc. Cambr. Philos. Soc. 79(3), 521\u2013530 (1976)","journal-title":"Math. Proc. Cambr. Philos. Soc."},{"key":"4_CR19","volume-title":"Nonhomogeneous Matrix Products","author":"DJ Hartfiel","year":"2002","unstructured":"Hartfiel, D.J.: Nonhomogeneous Matrix Products. World Scientific Publishing, London (2002)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1214\/aop\/1023481103","volume":"25","author":"H Hennion","year":"1997","unstructured":"Hennion, H.: Limit theorems for products of positive random matrices. Ann. Prob. 25(4), 1545\u20131587 (1997)","journal-title":"Ann. Prob."},{"key":"4_CR21","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. Bull. EATCS 73, 146 (2001)","journal-title":"Bull. EATCS"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on eulerian digraphs. Theor. Comput. Sci. 295(1), 223\u2013232 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-662-48057-1_26","volume-title":"Mathematical Foundations of Computer Science 2015","author":"A Kisielewicz","year":"2015","unstructured":"Kisielewicz, A., Szyku\u0142a, M.: Synchronizing automata with extremal properties. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 331\u2013343. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48057-1_26"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-40946-7_15","volume-title":"Implementation and Application of Automata","author":"A Kisielewicz","year":"2016","unstructured":"Kisielewicz, A., Kowalski, J., Szyku\u0142a, M.: Experiments with synchronizing automata. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 176\u2013188. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40946-7_15"},{"key":"4_CR25","unstructured":"Mateescu, A., Salomaa, A.: Many-valued truth functions, \u010cern\u00fd\u2019s conjecture and road coloring. In: EATCS Bulletin, pp. 134\u2013150 (1999)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: SFCS, pp. 132\u2013142 (1986)","DOI":"10.1109\/SFCS.1986.5"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/sapm1970491105","volume":"49","author":"M Paterson","year":"1996","unstructured":"Paterson, M.: Unsolvability in \n                      \n                        \n                      \n                      $$3\\times 3$$\n                     matrices. Stud. Appl. Math. 49(1), 105\u2013107 (1996)","journal-title":"Stud. Appl. Math."},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0304-0208(08)73432-7","volume-title":"Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. In: International Colloquium on Graph Theory and Combinatorics, vol. 75, pp. 535\u2013548 (1983)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Potapov, I., Semukhin, P.: Decidability of the membership problem for \n                      \n                        \n                      \n                      $$2\\times 2$$\n                     integer matrices. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 170\u2013186 (2017)","DOI":"10.1137\/1.9781611974782.12"},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1070\/SM2011v202n01ABEH004139","volume":"202","author":"VY Protasov","year":"2011","unstructured":"Protasov, V.Y.: Invariant functions for the Lyapunov exponents of random matrices. Sbornik Math. 202(1), 101 (2011)","journal-title":"Sbornik Math."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.laa.2012.02.029","volume":"437","author":"VY Protasov","year":"2012","unstructured":"Protasov, V.Y., Voynov, A.S.: Sets of nonnegative matrices without positive products. Linear Algebra Appl. 437, 749\u2013765 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"IK Rystsov","year":"1997","unstructured":"Rystsov, I.K.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172(1), 273\u2013279 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(64)90232-3","volume":"7","author":"M Sch\u00fctzenberger","year":"1964","unstructured":"Sch\u00fctzenberger, M.: On the synchronizing properties of certain prefix codes. Inf. Control 7(1), 23\u201336 (1964)","journal-title":"Inf. Control"},{"key":"4_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-32792-4","volume-title":"Non-Negative Matrices and Markov Chains","author":"E Seneta","year":"1981","unstructured":"Seneta, E.: Non-Negative Matrices and Markov Chains, 2nd edn. Springer, New York (1981). \n                      https:\/\/doi.org\/10.1007\/0-387-32792-4","edition":"2"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-14455-4_38","volume-title":"Developments in Language Theory","author":"B Steinberg","year":"2010","unstructured":"Steinberg, B.: The averaging trick and the \u010cern\u00fd conjecture. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 423\u2013431. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14455-4_38"},{"key":"4_CR36","unstructured":"Szyku\u0142a, M.: Improving the upper bound the length of the shortest reset words. In: Symposium on Theoretical Aspects of Computer Science, vol. 96, pp. 56:1\u201356:16 (2018)"},{"key":"4_CR37","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1016\/j.tcs.2009.06.005","volume":"410","author":"MT Biskup","year":"2009","unstructured":"Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410, 3925\u20133941 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2006.06.072","volume":"25","author":"A Trahtman","year":"2006","unstructured":"Trahtman, A.: Notable trends concerning the synchronization of graphs and automata. Electron. Notes Discrete Math. 25, 173\u2013175 (2006)","journal-title":"Electron. Notes Discrete Math."},{"issue":"14","key":"4_CR39","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matematicko-fysikalny Casopis SAV 14(14), 208\u2013216 (1964)","journal-title":"Matematicko-fysikalny Casopis SAV"},{"key":"4_CR40","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Piricka, A., Rosenaueriva, B.: On directable automata. Kybernetika 7, 289\u2013298 (1971)","journal-title":"Kybernetika"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-76336-9_5","volume-title":"Implementation and Application of Automata","author":"MV Volkov","year":"2007","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 27\u201337. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-76336-9_5"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:03:22Z","timestamp":1563923002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"67% - 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":"2","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)"}}]}}