{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:43:11Z","timestamp":1770295391403,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223075","type":"print"},{"value":"9783031223082","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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22308-2_13","type":"book-chapter","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T19:55:03Z","timestamp":1669924503000},"page":"272-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bootstrapping Library-Based Synthesis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4553-2281","authenticated-orcid":false,"given":"Kangjing","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9476-7349","authenticated-orcid":false,"given":"Xiaokang","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.R.: Mining specifications. In: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2002. ACM (2002). https:\/\/doi.org\/10.1145\/503272.503275","DOI":"10.1145\/503272.503275"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Astorga, A., Madhusudan, P., Saha, S., Wang, S., Xie, T.: Learning stateful preconditions modulo a test generator. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2019. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314641","DOI":"10.1145\/3314221.3314641"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Babi\u0107, D., et al.: Fudge: fuzz driver generation at scale. In: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. ESEC\/FSE 2019. ACM (2019). https:\/\/doi.org\/10.1145\/3338906.3340456","DOI":"10.1145\/3338906.3340456"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bastani, O., Anand, S., Aiken, A.: Specification inference using context-free language reachability. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2015. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676977","DOI":"10.1145\/2676726.2676977"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bastani, O., Sharma, R., Aiken, A., Liang, P.: Active learning of points-to specifications. In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2018. ACM (2018). https:\/\/doi.org\/10.1145\/3192366.3192383","DOI":"10.1145\/3192366.3192383"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bodik, R., Chandra, S., Galenson, J., Kimelman, D., Tung, N., Barman, S., Rodarmor, C.: Programming with angelic nondeterminism. In: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL 2010. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706339","DOI":"10.1145\/1706299.1706339"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bornholt, J., Torlak, E.: Finding code that explodes under symbolic evaluation. In: Proc. of the ACM on Programming Languages. OOPSLA 2018, vol. 2. ACM, October 2018. https:\/\/doi.org\/10.1145\/3276519","DOI":"10.1145\/3276519"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-96145-3_10","volume-title":"Computer Aided Verification","author":"L Cordeiro","year":"2018","unstructured":"Cordeiro, L., Kesseli, P., Kroening, D., Schrammel, P., Trtik, M.: JBMC: a bounded model checking tool for verifying Java bytecode. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 183\u2013190. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_10"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Delaware, B., Pit-Claudel, C., Gross, J., Chlipala, A.: Fiat: deductive synthesis of abstract data types in a proof assistant. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2015. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2677006","DOI":"10.1145\/2676726.2677006"},{"key":"13_CR10","unstructured":"Doughty-White, P., Quick, M.: Codebases: millions of lines of code (2015). https:\/\/informationisbeautiful.net\/visualizations\/million-lines-of-code\/"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Ernst, M.D., et al.: The daikon system for dynamic detection of likely invariants. Science of Computer Programming 69(1), 35\u201345 (2007). https:\/\/doi.org\/10.1016\/j.scico.2007.01.015, special issue on Experimental Software and Toolkits","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Feng, Y., Martins, R., Wang, Y., Dillig, I., Reps, T.W.: Component-based synthesis for complex APIs. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. POPL 2017. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009851","DOI":"10.1145\/3009837.3009851"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1145\/321420.321422","volume":"14","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Nondeterministic algorithms. J. ACM (JACM) 14(4), 636\u2013644 (1967). https:\/\/doi.org\/10.1145\/321420.321422","journal-title":"J. ACM (JACM)"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Galenson, J., Reames, P., Bodik, R., Hartmann, B., Sen, K.: CodeHint: dynamic and interactive synthesis of code snippets. In: Proceedings of the 36th International Conference on Software Engineering. ICSE 2014. ACM (2014). https:\/\/doi.org\/10.1145\/2568225.2568250","DOI":"10.1145\/2568225.2568250"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-63390-9_5","volume-title":"Computer Aided Verification","author":"A Gasc\u00f3n","year":"2017","unstructured":"Gasc\u00f3n, A., Tiwari, A., Carmer, B., Mathur, U.: Look for the proof to find the program: decorated-component-based program synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 86\u2013103. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_5"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Heule, S., Sridharan, M., Chandra, S.: Mimic: computing models for opaque code. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC\/FSE 2015 (2015). https:\/\/doi.org\/10.1145\/2786805.2786875","DOI":"10.1145\/2786805.2786875"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-32304-2_17","volume-title":"Static Analysis","author":"Q Hu","year":"2019","unstructured":"Hu, Q., Samanta, R., Singh, R., D\u2019Antoni, L.: Direct manipulation for imperative programs. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 347\u2013367. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_17"},{"key":"13_CR18","unstructured":"JDial Debugger (2021). https:\/\/github.com\/JDial-Debugger\/backend\/tree\/master\/SkechObject\/benchmarks"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Jeon, J., Qiu, X., Fetter-Degges, J., Foster, J.S., Solar-Lezama, A.: Synthesizing framework models for symbolic execution. In: ICSE 2016. ACM (2016). https:\/\/doi.org\/10.1145\/2884781.2884856","DOI":"10.1145\/2884781.2884856"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Jeon, J., Qiu, X., Foster, J.S., Solar-Lezama, A.: Jsketch: sketching for Java. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering. ESEC\/FSE 2015. ACM (2015). https:\/\/doi.org\/10.1145\/2786805.2803189","DOI":"10.1145\/2786805.2803189"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided component-based program synthesis. In: Proceedings of the 32nd ACM\/IEEE International Conf. on Software Engineering. ICSE 2010, vol. 1. ACM (2010). https:\/\/doi.org\/10.1145\/1806799.1806833","DOI":"10.1145\/1806799.1806833"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-35632-2_9","volume-title":"Runtime Verification","author":"W Li","year":"2013","unstructured":"Li, W., Seshia, S.A.: Sparse coding for specification mining and error localization. In: Qadeer, S., Tasiran, S. (eds.) RV 2012. LNCS, vol. 7687, pp. 64\u201381. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35632-2_9"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. Int. J. Softw. Tools Technol. Transf. 603\u2013618 (2012). https:\/\/doi.org\/10.1007\/s10009-012-0236-z","DOI":"10.1007\/s10009-012-0236-z"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Mandelin, D., Xu, L., Bod\u00edk, R., Kimelman, D.: Jungloid mining: helping to navigate the API jungle. In: Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2005. ACM (2005). https:\/\/doi.org\/10.1145\/1065010.1065018","DOI":"10.1145\/1065010.1065018"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Mariano, B., et al.: Program synthesis with algebraic library specifications. In: Proceedings of the ACM on Programming Languages. OOPSLA 2019, vol. 3. ACM (Oct 2019). https:\/\/doi.org\/10.1145\/3360558","DOI":"10.1145\/3360558"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Miltner, A., Nu\u00f1ez, A.T., Brendel, A., Chaudhuri, S., Dillig, I.: Bottom-up synthesis of recursive functional programs using angelic execution. In: Proceedings of the ACM on Programming Languages. POPL 2022, vol. 6. ACM, January 2022. https:\/\/doi.org\/10.1145\/3498682","DOI":"10.1145\/3498682"},{"key":"13_CR27","unstructured":"Murali, V., Qi, L., Chaudhuri, S., Jermaine, C.: Neural sketch learning for conditional program generation. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=HkfXMz-Ab"},{"key":"13_CR28","unstructured":"OpenJDK (2014). https:\/\/hg.openjdk.java.net\/jdk8\/jdk8\/jdk\/file\/tip\/src\/share\/classes\/java\/util\/ArrayList.java"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Pacheco, C., Lahiri, S.K., Ernst, M.D., Ball, T.: Feedback-directed random test generation. In: 29th International Conference on Software Engineering (ICSE 2007), May 2007. https:\/\/doi.org\/10.1109\/ICSE.2007.37","DOI":"10.1109\/ICSE.2007.37"},{"issue":"5","key":"13_CR30","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/TSE.2014.2312918","volume":"40","author":"Y Pei","year":"2014","unstructured":"Pei, Y., Furia, C.A., Nordio, M., Wei, Y., Meyer, B., Zeller, A.: Automated fixing of programs with contracts. IEEE Trans. Softw. Eng. 40(5), 427\u2013449 (2014). https:\/\/doi.org\/10.1109\/TSE.2014.2312918","journal-title":"IEEE Trans. Softw. Eng."},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-94583-1_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Polgreen","year":"2022","unstructured":"Polgreen, E., Reynolds, A., Seshia, S.A.: Satisfiability and\u00a0synthesis modulo oracles. In: Finkbeiner, B., Wies, T. (eds.) VMCAI 2022. LNCS, vol. 13182, pp. 263\u2013284. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94583-1_13"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Raychev, V., Bielik, P., Vechev, M., Krause, A.: Learning programs from noisy data. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2016. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837671","DOI":"10.1145\/2837614.2837671"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Shi, K., Steinhardt, J., Liang, P.: Frangel: component-based synthesis with control structures. In: Proceedings of the ACM on Programming Languages. POPL 2019, vol. 3. ACM, January 2019. https:\/\/doi.org\/10.1145\/3290386","DOI":"10.1145\/3290386"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Singh, R., Gulwani, S., Solar-Lezama, A.: Automated feedback generation for introductory programming assignments. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2013. ACM (2013). https:\/\/doi.org\/10.1145\/2491956.2462195","DOI":"10.1145\/2491956.2462195"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-54013-4_22","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Singh","year":"2014","unstructured":"Singh, R., Singh, R., Xu, Z., Krosnick, R., Solar-Lezama, A.: Modular synthesis of sketches using models. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 395\u2013414. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54013-4_22"},{"key":"13_CR36","unstructured":"Sketch (2021). https:\/\/github.com\/asolarlez\/sketch-frontend\/blob\/master\/src\/experiments\/sk\/models\/"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Skrupsky, N., Monshizadeh, M., Bisht, P., Hinrichs, T., Venkatakrishnan, V.N., Zuck, L.: Waves: automatic synthesis of client-side validation code for web applications. In: 2012 International Conference on Cyber Security, December 2012. https:\/\/doi.org\/10.1109\/CyberSecurity.2012.13","DOI":"10.1109\/CyberSecurity.2012.13"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-11245-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"C Smith","year":"2019","unstructured":"Smith, C., Albarghouthi, A.: Program synthesis with equivalence reduction. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 24\u201347. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_2"},{"key":"13_CR39","unstructured":"Solar-Lezama, A.: The sketch programmers manual (2020). https:\/\/people.csail.mit.edu\/asolar\/manual.pdf, version 1.7.6"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., Saraswat, V.: Combinatorial sketching for finite programs. In: Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems. ACM (2006). https:\/\/doi.org\/10.1145\/1168857.1168907","DOI":"10.1145\/1168857.1168907"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Srivastava, S., Gulwani, S., Chaudhuri, S., Foster, J.S.: Path-based inductive synthesis for program inversion. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2011. ACM (2011). https:\/\/doi.org\/10.1145\/1993498.1993557","DOI":"10.1145\/1993498.1993557"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Torlak, E., Bodik, R.: A lightweight symbolic virtual machine for solver-aided host languages. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2014. ACM (2014). https:\/\/doi.org\/10.1145\/2594291.2594340","DOI":"10.1145\/2594291.2594340"},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Yang, Z., Hua, J., Wang, K., Khurshid, S.: EdSynth: synthesizing API sequences with conditionals and loops. In: 2018 IEEE 11th International Conference on Software Testing, Verification and Validation. ICST 2018, April 2018. https:\/\/doi.org\/10.1109\/ICST.2018.00025","DOI":"10.1109\/ICST.2018.00025"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22308-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T19:56:34Z","timestamp":1669924594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22308-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223075","9783031223082"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22308-2_13","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":"2 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","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":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.staticanalysis.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","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":"18","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":"42% - 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.2","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":"6.1","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)"}}]}}