{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:19:50Z","timestamp":1781075990549,"version":"3.54.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031158384","type":"print"},{"value":"9783031158391","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":240,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Model checking infinite-state systems is one of the central challenges in automated verification. In this survey we focus on an important and fundamental subclass of infinite-state systems, namely discrete linear dynamical systems. While such systems are ubiquitous in mathematics, physics, engineering, etc., in the present context our motivation stems from their relevance to the formal analysis and verification of program loops, weighted automata, hybrid systems, and control systems, amongst many others. Our main object of study is the problem of model checking temporal properties on the infinite orbit of a linear dynamical system, and our principal contribution is to show that for a rich class of properties this problem can be reduced to certain classical decision problems on linear recurrence sequences, notably the Skolem Problem. This leads us to discuss recent advances on the latter and to highlight the prospects for further progress on charting the algorithmic landscape of linear recurrence sequences and linear dynamical systems.<\/jats:p>","DOI":"10.1007\/978-3-031-15839-1_1","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T18:02:38Z","timestamp":1661709758000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algebraic Model Checking for\u00a0Discrete Linear Dynamical Systems"],"prefix":"10.1007","author":[{"given":"Florian","family":"Luca","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Akshay, S., Genest, B., Thiagarajan, P.S.: Approximate verification of the symbolic dynamics of Markov chains. J. ACM 62(1), 2:1\u20132:34 (2015)","DOI":"10.1145\/2629417"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Almagor, S., Karimov, T., Kelmendi, E., Ouaknine, J., Worrell, J.: Deciding $$\\omega $$-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL), 1\u201324 (2021)","DOI":"10.1145\/3434329"},{"key":"1_CR3","unstructured":"Almagor, S., Ouaknine, J., Worrell, J.: The polytope-collision problem. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. LIPIcs, vol. 80, pp. 24:1\u201324:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"1_CR4","unstructured":"Almagor, S., Ouaknine, J., Worrell, J.: The semialgebraic orbit problem. In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019. LIPIcs, vol. 126, pp. 6:1\u20136:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00224-020-09976-7","volume":"65","author":"S Almagor","year":"2021","unstructured":"Almagor, S., Ouaknine, J., Worrell, J.: First-order orbit queries. Theory Comput. Syst. 65(4), 638\u2013661 (2021)","journal-title":"Theory Comput. Syst."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-030-32304-2_22","volume-title":"Static Analysis","author":"AM Ben-Amram","year":"2019","unstructured":"Ben-Amram, A.M., Dom\u00e9nech, J.J., Genaim, S.: Multiphase-linear ranking functions and their relation to recurrent sets. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 459\u2013480. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_22"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Genaim, S.: On the linear ranking problem for integer linear-constraint loops. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 51\u201362. ACM (2013)","DOI":"10.1145\/2480359.2429078"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Genaim, S.: Ranking functions for linear-constraint loops. J. ACM 61(4), 26:1\u201326:55 (2014)","DOI":"10.1145\/2629488"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-319-63390-9_32","volume-title":"Computer Aided Verification","author":"AM Ben-Amram","year":"2017","unstructured":"Ben-Amram, A.M., Genaim, S.: On multiphase-linear ranking functions. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 601\u2013620. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_32"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.24033\/bsmf.1823","volume":"104","author":"J Berstel","year":"1976","unstructured":"Berstel, J., Mignotte, M.: Deux propri\u00e9t\u00e9s d\u00e9cidables des suites r\u00e9currentes lin\u00e9aires. Bull. Soc. Math. France 104, 175\u2013184 (1976)","journal-title":"Bull. Soc. Math. France"},{"key":"1_CR11","unstructured":"Bilu, Y., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., Worrell, J.: Skolem meets Schanuel. In: Szeider, S., Ganian, R., Silva, A. (eds.) 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 22\u201326 August 2022, Vienna, Austria. LIPIcs, vol. 241, pp. 62:1\u201362:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"1_CR12","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic, Springer, Heidelberg (1997)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/11539452_37","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Termination analysis of integer linear loops. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 488\u2013502. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_37"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/11817963_34","volume-title":"Computer Aided Verification","author":"M Braverman","year":"2006","unstructured":"Braverman, M.: Termination of integer linear programs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 372\u2013385. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_34"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: Weak second order arithmetic and finite automata. Zeit. f\u00fcr Math. Logik und Grund. der Math. 6(1\u20136), 66\u201392 (1960)","DOI":"10.1002\/malq.19600060105"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10009-013-0288-8","volume":"17","author":"HY Chen","year":"2013","unstructured":"Chen, H.Y., Flur, S., Mukhopadhyay, S.: Termination proofs for linear simple loops. Int. J. Softw. Tools Technol. Transfer 17(1), 47\u201357 (2013). https:\/\/doi.org\/10.1007\/s10009-013-0288-8","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Chonev, V., Ouaknine, J., Worrell, J.: The orbit problem in higher dimensions. In: Symposium on Theory of Computing Conference, STOC 2013, pp. 941\u2013950. ACM (2013)","DOI":"10.1145\/2488608.2488728"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Chonev, V., Ouaknine, J., Worrell, J.: The polyhedron-hitting problem. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 940\u2013956. SIAM (2015)","DOI":"10.1137\/1.9781611973730.64"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Chonev, V., Ouaknine, J., Worrell, J.: On the complexity of the Orbit Problem. J. ACM 63(3), 23:1\u201323:18 (2016)","DOI":"10.1145\/2857050"},{"key":"1_CR20","unstructured":"Colcombet, T., Petri\u015fan, D.: Automata in the category of glued vector spaces. In: Larsen, K.G., Bodlaender, H.L., Raskin, J. (eds.) 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 21\u201325 August 2017, Aalborg, Denmark. LIPIcs, vol. 83, pp. 52:1\u201352:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45319-9_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MA Col\u00f3on","year":"2001","unstructured":"Col\u00f3on, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 67\u201381. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_6"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, pp. 415\u2013426. ACM (2006)","DOI":"10.1145\/1133255.1134029"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11817963_37","volume-title":"Computer Aided Verification","author":"B Cook","year":"2006","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Terminator: beyond safety. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 415\u2013418. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_37"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Everest, G., van der Poorten, A.J., Shparlinski, I.E., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol. 104. American Mathematical Society (2003)","DOI":"10.1090\/surv\/104"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.dam.2005.10.009","volume":"154","author":"V Halava","year":"2006","unstructured":"Halava, V., Harju, T., Hirvensalo, M.: Positivity of second order linear recurrent sequences. Discret. Appl. Math. 154(3), 447\u2013451 (2006)","journal-title":"Discret. Appl. Math."},{"key":"1_CR26","volume-title":"Lectures on Linear Sequential Machines","author":"MA Harrison","year":"1969","unstructured":"Harrison, M.A.: Lectures on Linear Sequential Machines. Academic Press, New York (1969)"},{"key":"1_CR27","unstructured":"Hosseini, M., Ouaknine, J., Worrell, J.: Termination of linear loops over the integers. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. LIPIcs, vol. 132, pp. 118:1\u2013118:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Kannan, R., Lipton, R.J.: The orbit problem is decidable. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing 1980, pp. 252\u2013261. ACM (1980)","DOI":"10.1145\/800141.804673"},{"issue":"4","key":"1_CR29","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1145\/6490.6496","volume":"33","author":"R Kannan","year":"1986","unstructured":"Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. J. ACM 33(4), 808\u2013821 (1986)","journal-title":"J. ACM"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Karimov, T., Kelmendi, E., Ouaknine, J., Worrell, J.: What\u2019s decidable about discrete linear dynamical systems? CoRR abs\/2206.11412 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.11412","DOI":"10.48550\/arXiv.2206.11412"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Karimov, T., et al.: What\u2019s decidable about linear loops? Proc. ACM Program. Lang. 6(POPL), 1\u201325 (2022)","DOI":"10.1145\/3498727"},{"key":"1_CR32","unstructured":"Karimov, T., Ouaknine, J., Worrell, J.: On LTL model checking for low-dimensional discrete linear dynamical systems. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. LIPIcs, vol. 170, pp. 54:1\u201354:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"15","key":"1_CR33","doi-asserted-by":"publisher","first-page":"3239","DOI":"10.1016\/j.dam.2009.06.021","volume":"157","author":"V Laohakosol","year":"2009","unstructured":"Laohakosol, V., Tangsupphathawat, P.: Positivity of third order linear recurrence sequences. Discret. Appl. Math. 157(15), 3239\u20133248 (2009)","journal-title":"Discret. Appl. Math."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Luca, F., Nieuwveld, J., Ouaknine, J., Worrell, D.P.J.: On the skolem problem and the skolem conjecture. In: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2022, Haifa, Israel, 2 August\u20135 August 2022. ACM (2022)","DOI":"10.1145\/3531130.3533328"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-662-43951-7_27","volume-title":"Automata, Languages, and Programming","author":"J Ouaknine","year":"2014","unstructured":"Ouaknine, J., Worrell, J.: On the positivity problem for simple linear recurrence sequences\u2019. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 318\u2013329. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_27"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Positivity problems for low-order linear recurrence sequences. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 366\u2013379. SIAM (2014)","DOI":"10.1137\/1.9781611973402.27"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-662-43951-7_28","volume-title":"Automata, Languages, and Programming","author":"J Ouaknine","year":"2014","unstructured":"Ouaknine, J., Worrell, J.: Ultimate positivity is decidable for simple linear recurrence sequences. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 330\u2013341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_28"},{"issue":"2","key":"1_CR39","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2766189.2766191","volume":"2","author":"J Ouaknine","year":"2015","unstructured":"Ouaknine, J., Worrell, J.: On linear recurrence sequences and loop termination. ACM SIGLOG News 2(2), 4\u201313 (2015)","journal-title":"ACM SIGLOG News"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239\u2013251. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_20"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: Transition invariants. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 32\u201341. IEEE Computer Society (2004)","DOI":"10.1109\/LICS.2004.1319598"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-20712-9_24","volume-title":"Computer Science \u2013 Theory and Applications","author":"S Tarasov","year":"2011","unstructured":"Tarasov, S., Vyalyi, M.: Orbits of linear maps and regular languages. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 305\u2013316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20712-9_24"},{"key":"1_CR43","first-page":"63","volume":"349","author":"R Tijdeman","year":"1984","unstructured":"Tijdeman, R., Mignotte, M., Shorey, T.N.: The distance between terms of an algebraic recurrence sequence. Journal f\u00fcr die reine und angewandte Mathematik 349, 63\u201376 (1984)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-27813-9_6","volume-title":"Computer Aided Verification","author":"A Tiwari","year":"2004","unstructured":"Tiwari, A.: Termination of linear programs. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 70\u201382. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_6"},{"issue":"2","key":"1_CR45","first-page":"609","volume":"38","author":"N Vereshchagin","year":"1985","unstructured":"Vereshchagin, N.: The problem of appearance of a zero in a linear recurrence sequence. Mat. Zametki 38(2), 609\u2013615 (1985)","journal-title":"Mat. Zametki"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15839-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:15:10Z","timestamp":1662074110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15839-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158384","9783031158391"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15839-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2022","order":10,"name":"conference_id","label":"Conference ID","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":"12","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":"2","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":"40% - 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":"3","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)"}}]}}