{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:04:09Z","timestamp":1760101449947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031377051"},{"type":"electronic","value":"9783031377068"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":197,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game\u2019s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions.<\/jats:p><jats:p>In contrast to previous works, we (i)\u00a0reflect the highly structured logical information in game\u2019s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii)\u00a0learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning.<\/jats:p>","DOI":"10.1007\/978-3-031-37706-8_20","type":"book-chapter","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:01:21Z","timestamp":1689501681000},"page":"390-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Guessing Winning Policies in\u00a0LTL Synthesis by\u00a0Semantic Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8122-2881","authenticated-orcid":false,"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1712-2165","authenticated-orcid":false,"given":"Tobias","family":"Meggendorfer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6512-8693","authenticated-orcid":false,"given":"Maximilian","family":"Prokop","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6397-3100","authenticated-orcid":false,"given":"Sabine","family":"Rieder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Artifact for \u201cGuessing Winning Policies in LTL Synthesis by Semantic Learning\u201d. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.7876095","key":"20_CR1","DOI":"10.5281\/zenodo.7876095"},{"doi-asserted-by":"publisher","unstructured":"Artifact for \u201cGuessing Winning Policies in LTL Synthesis by Semantic Learning\u201d. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.7876096","key":"20_CR2","DOI":"10.5281\/zenodo.7876096"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1051\/ita:2002013","volume":"36","author":"J Bernet","year":"2002","unstructured":"Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. RAIRO Theor. Inform. Appl. 36(3), 261\u2013275 (2002). https:\/\/doi.org\/10.1051\/ita:2002013","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/17m1145288","volume":"51","author":"CS Calude","year":"2022","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasi-polynomial time. SIAM J. Comput. 51(2), 17\u2013152 (2022). https:\/\/doi.org\/10.1137\/17m1145288","journal-title":"SIAM J. Comput."},{"unstructured":"Cosler, M., Schmitt, F., Hahn, C., Finkbeiner, B.: Iterative circuit repair against formal specifications. arXiv preprint arXiv:2303.01158 (2023)","key":"20_CR5"},{"doi-asserted-by":"publisher","unstructured":"Dijk, T.: Oink: an implementation and evaluation of modern parity game solvers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 291\u2013308. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_16","key":"20_CR6","DOI":"10.1007\/978-3-319-89960-2_16"},{"doi-asserted-by":"publisher","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0 \u2014 a framework for LTL and $$\\omega $$-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8","key":"20_CR7","DOI":"10.1007\/978-3-319-46520-3_8"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J.: From LTL to deterministic automata: a safraless compositional approach. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 192\u2013208. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_13","key":"20_CR8","DOI":"10.1007\/978-3-319-08867-9_13"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., K\u0159et\u00ednsk\u00fd, J., Raskin, J.-F., Sickert, S.: From LTL and limit-deterministic b\u00fcchi automata to deterministic parity automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 426\u2013442. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_25","key":"20_CR9","DOI":"10.1007\/978-3-662-54577-5_25"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10009-022-00663-1","volume":"24","author":"J Esparza","year":"2022","unstructured":"Esparza, J., Kret\u00ednsk\u00fd, J., Raskin, J., Sickert, S.: From linear temporal logic and limit-deterministic b\u00fcchi automata to deterministic parity automata. Int. J. Softw. Tools Technol. Transf. 24(4), 635\u2013659 (2022). https:\/\/doi.org\/10.1007\/s10009-022-00663-1","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kret\u00ednsk\u00fd, J., Sickert, S.: One theorem to rule them all: a unified translation of LTL into $$\\omega $$-automata. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, 09\u201312 July 2018, pp. 384\u2013393. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209161","key":"20_CR11","DOI":"10.1145\/3209108.3209161"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/3417995","volume":"67","author":"J Esparza","year":"2020","unstructured":"Esparza, J., Kret\u00ednsk\u00fd, J., Sickert, S.: A unified translation of linear temporal logic to $$\\omega $$-automata. J. ACM 67(6), 33:1-33:61 (2020). https:\/\/doi.org\/10.1145\/3417995","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Fearnley, J.: Efficient parallel strategy improvement for parity games. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 137\u2013154. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_8","key":"20_CR13","DOI":"10.1007\/978-3-319-63390-9_8"},{"doi-asserted-by":"publisher","unstructured":"Fearnley, J., Jain, S., Schewe, S., Stephan, F., Wojtczak, D.: An ordered approach to solving parity games in quasi polynomial time and quasi linear space. In: Erdogmus, H., Havelund, K. (eds.) Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Santa Barbara, 10\u201314 July 2017, pp. 112\u2013121. ACM (2017). https:\/\/doi.org\/10.1145\/3092282.3092286","key":"20_CR14","DOI":"10.1145\/3092282.3092286"},{"doi-asserted-by":"publisher","unstructured":"Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 182\u2013196. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04761-9_15","key":"20_CR15","DOI":"10.1007\/978-3-642-04761-9_15"},{"doi-asserted-by":"publisher","unstructured":"Gaiser, A., K\u0159et\u00ednsk\u00fd, J., Esparza, J.: Rabinizer: small deterministic automata for LTL(F,G). In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 72\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_7","key":"20_CR16","DOI":"10.1007\/978-3-642-33386-6_7"},{"doi-asserted-by":"publisher","unstructured":"Hoffmann, P., Luttenberger, M.: Solving parity games on the GPU. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 455\u2013459. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_34","key":"20_CR17","DOI":"10.1007\/978-3-319-02444-8_34"},{"unstructured":"Jacobs, S., et al.: The reactive synthesis competition (SYNTCOMP): 2018\u20132021. arXiv preprint arXiv:2206.00251 (2022)","key":"20_CR18"},{"doi-asserted-by":"publisher","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP $$\\backslash $$cap co-up. Inf. Process. Lett. 68(3), 119\u2013124 (1998). https:\/\/doi.org\/10.1016\/S0020-0190(98)00150-1","key":"20_CR19","DOI":"10.1016\/S0020-0190(98)00150-1"},{"doi-asserted-by":"publisher","unstructured":"Kom\u00e1rkov\u00e1, Z., K\u0159et\u00ednsk\u00fd, J.: Rabinizer 3: safraless translation of LTL to small deterministic automata. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 235\u2013241. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11936-6_17","key":"20_CR20","DOI":"10.1007\/978-3-319-11936-6_17"},{"doi-asserted-by":"publisher","unstructured":"K\u0159et\u00ednsk\u00fd, J., Garza, R.L.: Rabinizer 2: small Deterministic Automata for LTL\/GL. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 446\u2013450. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_32","key":"20_CR21","DOI":"10.1007\/978-3-319-02444-8_32"},{"doi-asserted-by":"publisher","unstructured":"K\u0159et\u00ednsk\u00fd, J., Manta, A., Meggendorfer, T.: Semantic labelling and learning for parity game solving in LTL synthesis. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 404\u2013422. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_24","key":"20_CR22","DOI":"10.1007\/978-3-030-31784-3_24"},{"doi-asserted-by":"crossref","unstructured":"Kretinsky, J., Meggendorfer, T., Prokop, M., Rieder, S.: Guessing winning policies in LTL synthesis by semantic learning (2023)","key":"20_CR23","DOI":"10.1007\/978-3-031-37706-8_20"},{"doi-asserted-by":"publisher","unstructured":"K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T., Sickert, S.: Owl: a library for $$\\omega $$-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543\u2013550. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_34","key":"20_CR24","DOI":"10.1007\/978-3-030-01090-4_34"},{"doi-asserted-by":"publisher","unstructured":"K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T., Sickert, S., Ziegler, C.: Rabinizer 4: from LTL to your favourite deterministic automaton. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 567\u2013577. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_30","key":"20_CR25","DOI":"10.1007\/978-3-319-96145-3_30"},{"doi-asserted-by":"publisher","unstructured":"Kret\u00ednsk\u00fd, J., Meggendorfer, T., Waldmann, C., Weininger, M.: Index appearance record with preorders. Acta Inform. 59(5), 585\u2013618 (2022). https:\/\/doi.org\/10.1007\/s00236-021-00412-y","key":"20_CR26","DOI":"10.1007\/s00236-021-00412-y"},{"doi-asserted-by":"publisher","unstructured":"Kupferman, O., Rosenberg, A.: The blow-up in translating LTL to deterministic automata. In: van der Meyden, R., Smaus, J.-G. (eds.) MoChArt 2010. LNCS (LNAI), vol. 6572, pp. 85\u201394. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20674-0_6","key":"20_CR27","DOI":"10.1007\/978-3-642-20674-0_6"},{"doi-asserted-by":"publisher","unstructured":"Lehtinen, K., Parys, P., Schewe, S., Wojtczak, D.: A recursive approach to solving parity games in quasipolynomial time. Log. Methods Comput. Sci. 18(1) (2022). https:\/\/doi.org\/10.46298\/lmcs-18(1:8)2022","key":"20_CR28","DOI":"10.46298\/lmcs-18(1:8)2022"},{"doi-asserted-by":"publisher","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL satisfiability checking revisited. In: S\u00e1nchez, C., Venable, K.B., Zim\u00e1nyi, E. (eds.) 2013 20th International Symposium on Temporal Representation and Reasoning, Pensacola, 26\u201328 September 2013, pp. 91\u201398. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/TIME.2013.19","key":"20_CR29","DOI":"10.1109\/TIME.2013.19"},{"issue":"3","key":"20_CR30","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"T Liu","year":"2009","unstructured":"Liu, T.: Learning to rank for information retrieval. Found. Trends Inf. Retr. 3(3), 225\u2013331 (2009). https:\/\/doi.org\/10.1561\/1500000016","journal-title":"Found. Trends Inf. Retr."},{"doi-asserted-by":"publisher","unstructured":"Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games. Acta Inform. 3\u201336 (2019). https:\/\/doi.org\/10.1007\/s00236-019-00349-3","key":"20_CR31","DOI":"10.1007\/s00236-019-00349-3"},{"doi-asserted-by":"publisher","unstructured":"Meyer, P.J., Luttenberger, M.: Solving mean-payoff games on the GPU. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 262\u2013267. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_17","key":"20_CR32","DOI":"10.1007\/978-3-319-46520-3_17"},{"doi-asserted-by":"publisher","unstructured":"Meyer, P.J., Sickert, S., Luttenberger, M.: Strix: explicit reactive synthesis strikes back! In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 578\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_31","key":"20_CR33","DOI":"10.1007\/978-3-319-96145-3_31"},{"doi-asserted-by":"crossref","unstructured":"Osborne, M.J.: An introduction to game theory (2004)","key":"20_CR34","DOI":"10.1093\/actrade\/9780192840943.003.0001"},{"unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","key":"20_CR35"},{"doi-asserted-by":"publisher","unstructured":"Piterman, N.: From nondeterministic buchi and streett automata to deterministic parity automata. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12\u201315 August 2006, Seattle, pp. 255\u2013264. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/LICS.2006.28","key":"20_CR36","DOI":"10.1109\/LICS.2006.28"},{"doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977, pp. 46\u201357. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","key":"20_CR37","DOI":"10.1109\/SFCS.1977.32"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035790"},{"doi-asserted-by":"publisher","unstructured":"Safra, S.: On the complexity of omega-automata. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, 24\u201326 October 1988, pp. 319\u2013327. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21948","key":"20_CR39","DOI":"10.1109\/SFCS.1988.21948"},{"doi-asserted-by":"publisher","unstructured":"Schewe, S.: Tighter bounds for the determinisation of B\u00fcchi automata. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 167\u2013181. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_13","key":"20_CR40","DOI":"10.1007\/978-3-642-00596-1_13"},{"unstructured":"Schmitt, F., Hahn, C., Rabe, M.N., Finkbeiner, B.: Neural circuit synthesis from specification patterns. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, 6\u201314 December 2021, Virtual, pp. 15408\u201315420 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/8230bea7d54bcdf99cdfe85cb07313d5-Abstract.html","key":"20_CR41"},{"doi-asserted-by":"publisher","unstructured":"Sickert, S., Esparza, J., Jaax, S., K\u0159et\u00ednsk\u00fd, J.: Limit-deterministic B\u00fcchi automata for linear temporal logic. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 312\u2013332. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_17","key":"20_CR42","DOI":"10.1007\/978-3-319-41540-6_17"},{"unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the Symposium on Logic in Computer Science (LICS 1986), Cambridge, Massachusetts, 16\u201318 June 1986, pp. 332\u2013344. IEEE Computer Society (1986)","key":"20_CR43"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37706-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T11:06:56Z","timestamp":1704452816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37706-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377051","9783031377068"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37706-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"261","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":"67","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":"26% - 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":"11","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)"}}]}}