{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:03:29Z","timestamp":1783109009875,"version":"3.54.6"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031295720","type":"print"},{"value":"9783031295737","type":"electronic"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-29573-7_16","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T13:03:02Z","timestamp":1680008582000},"page":"244-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Genetic Improvement of\u00a0LLVM Intermediate Representation"],"prefix":"10.1007","author":[{"given":"William B.","family":"Langdon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Afnan","family":"Al-Subaihin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aymeric","family":"Blot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Clark","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TEVC.2017.2693219","volume":"22","author":"J Petke","year":"2018","unstructured":"Petke, J., et al.: Genetic improvement of software: a comprehensive survey. IEEE TEVC 22(3), 415\u2013432 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2693219","journal-title":"IEEE TEVC"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Langdon, W.B., Harman, M.: Evolving a CUDA kernel from an nVidia template. In: Sobrevilla, P. (ed.) WCCI, pp. 2376\u20132383 (2010). https:\/\/doi.org\/10.1109\/CEC.2010.5585922","DOI":"10.1109\/CEC.2010.5585922"},{"issue":"14","key":"16_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0950-5849(01)00189-6","volume":"43","author":"M Harman","year":"2001","unstructured":"Harman, M., Jones, B.F.: Search based software engineering. Inf. Softw. Technol. 43(14), 833\u2013839 (2001). https:\/\/doi.org\/10.1016\/S0950-5849(01)00189-6","journal-title":"Inf. Softw. Technol."},{"key":"16_CR4","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk (2008). http:\/\/www.gp-field-guide.org.uk"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-22183-0_21","volume-title":"Search-Based Software Engineering","author":"A Marginean","year":"2015","unstructured":"Marginean, A., Barr, E.T., Harman, M., Jia, Y.: Automated transplantation of call graph and layout features into Kate. In: Barros, M., Labiche, Y. (eds.) SSBSE 2015. LNCS, vol. 9275, pp. 262\u2013268. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22183-0_21"},{"key":"16_CR6","unstructured":"Marginean, A.: Automated software transplantation. Ph.D. thesis, University College London (2021). https:\/\/discovery.ucl.ac.uk\/id\/eprint\/10137954\/1\/Marginean_10137954_thesis_redacted.pdf"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/TEVC.2013.2281544","volume":"19","author":"WB Langdon","year":"2015","unstructured":"Langdon, W.B., Harman, M.: Optimising existing software with genetic programming. IEEE TEVC 19(1), 118\u2013135 (2015). https:\/\/doi.org\/10.1109\/TEVC.2013.2281544","journal-title":"IEEE TEVC"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Weimer, W., Nguyen, T., Le Goues, C., Forrest, S.: Automatically finding patches using genetic programming. In: Fickas, S. (ed.) ICSE, pp. 364\u2013374 (2009). https:\/\/doi.org\/10.1109\/ICSE.2009.5070536","DOI":"10.1109\/ICSE.2009.5070536"},{"issue":"5","key":"16_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1735223.1735249","volume":"53","author":"W Weimer","year":"2010","unstructured":"Weimer, W., Forrest, S., Le Goues, C., Nguyen, T.: Automatic program repair with evolutionary computation. Commun. ACM 53(5), 109\u2013116 (2010). https:\/\/doi.org\/10.1145\/1735223.1735249","journal-title":"Commun. ACM"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Haraldsson, S.O., Woodward, J.R., Brownlee, A.E.I., Siggeirsdottir, K.: Fixing bugs in your sleep: how genetic improvement became an overnight success. In: Petke, J., White, D.R., Langdon, W.B., Weimer, W. (eds.) GI-2017, pp. 1513\u20131520 (2017). https:\/\/doi.org\/10.1145\/3067695.3082517","DOI":"10.1145\/3067695.3082517"},{"issue":"12","key":"16_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/3318162","volume":"62","author":"C Le Goues","year":"2019","unstructured":"Le Goues, C., Pradel, M., Roychoudhury, A.: Automated program repair. Commun. ACM 62(12), 56\u201365 (2019). https:\/\/doi.org\/10.1145\/3318162","journal-title":"Commun. ACM"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Monperrus, M.: Automatic software repair: a bibliography. ACM Comput. Surv. 51(1), Article no. 17 (2018). https:\/\/doi.org\/10.1145\/3105906","DOI":"10.1145\/3105906"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Alshahwan, N.: Industrial experience of genetic improvement in Facebook. In: Petke, J., Tan, S.H., Langdon, W.B., Weimer, W. (eds.) GI-2019, ICSE Workshops Proceedings, p. 1 (2019). https:\/\/doi.org\/10.1109\/GI.2019.00010","DOI":"10.1109\/GI.2019.00010"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Harman, M.: Scaling genetic improvement and automated program repair. In: Kechagia, M., Tan, S.H., Mechtaev, S., Tan, L. (eds.) International Workshop on Automated Program Repair (APR 2022) (2022). https:\/\/doi.org\/10.1145\/3524459.3527353","DOI":"10.1145\/3524459.3527353"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MS.2021.3071086","volume":"38","author":"S Kirbas","year":"2021","unstructured":"Kirbas, S., et al.: On the introduction of automatic program repair in Bloomberg. IEEE Softw. 38(4), 43\u201351 (2021). https:\/\/doi.org\/10.1109\/MS.2021.3071086","journal-title":"IEEE Softw."},{"key":"16_CR16","unstructured":"Kechagia, M., Tan, S.H., Mechtaev, S., Tan, L. (eds.): 2022 IEEE\/ACM International Workshop on Automated Program Repair (APR) (2022). https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/9474454\/proceeding"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Callan, J., Krauss, O., Petke, J., Sarro, F.: How do Android developers improve non-functional properties of software? Empr. Soft. Eng. 27, Article no. 113 (2022). https:\/\/doi.org\/10.1007\/s10664-022-10137-2","DOI":"10.1007\/s10664-022-10137-2"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-662-44303-3_8","volume-title":"Genetic Programming","author":"WB Langdon","year":"2014","unstructured":"Langdon, W.B., Harman, M.: Genetically improved CUDA C++ software. In: Nicolau, M., et al. (eds.) EuroGP 2014. LNCS, vol. 8599, pp. 87\u201399. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44303-3_8"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Langdon, W.B., Modat, M., Petke, J., Harman, M.: Improving 3D medical image registration CUDA software with genetic programming. In: Igel, C., et al. (eds.) GECCO, pp. 951\u2013958 (2014). https:\/\/doi.org\/10.1145\/2576768.2598244","DOI":"10.1145\/2576768.2598244"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Langdon, W.B., Harman, M.: Grow and graft a better CUDA pknotsRG for RNA pseudoknot free energy calculation. In: Langdon, W.B., Petke, J., White, D.R. (eds.) GI, pp. 805\u2013810 (2015). https:\/\/doi.org\/10.1145\/2739482.2768418","DOI":"10.1145\/2739482.2768418"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10710-016-9273-9","volume":"18","author":"WB Langdon","year":"2016","unstructured":"Langdon, W.B., Lam, B.Y.H., Modat, M., Petke, J., Harman, M.: Genetic improvement of GPU software. Genet. Program Evolvable Mach. 18(1), 5\u201344 (2016). https:\/\/doi.org\/10.1007\/s10710-016-9273-9","journal-title":"Genet. Program Evolvable Mach."},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Klus, P., et al.: BarraCUDA - a fast short read sequence aligner using graphics processing units. BMC Res. Notes 5(27) (2012). https:\/\/doi.org\/10.1186\/1756-0500-5-27","DOI":"10.1186\/1756-0500-5-27"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Langdon, W.B., Lam, B.Y.H.: Genetically improved BarraCUDA. BioData Min. 20(28) (2017). https:\/\/doi.org\/10.1186\/s13040-017-0149-1","DOI":"10.1186\/s13040-017-0149-1"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-16670-0_16","volume-title":"Genetic Programming","author":"WB Langdon","year":"2019","unstructured":"Langdon, W.B., Lorenz, R.: Evolving AVX512 parallel C code using GP. In: Sekanina, L., Hu, T., Louren\u00e7o, N., Richter, H., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2019. LNCS, vol. 11451, pp. 245\u2013261. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16670-0_16"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Lorenz, R., et al.: ViennaRNA package 2.0. Algorithms Mol. Biol. 6(1) (2011). https:\/\/doi.org\/10.1186\/1748-7188-6-26","DOI":"10.1186\/1748-7188-6-26"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Andrews, R.J., et al.: A map of the SARS-CoV-2 RNA structurome. NAR Genom. Bioinform. 3(2), lqab043 (2021). https:\/\/doi.org\/10.1093\/nargab\/lqab043","DOI":"10.1093\/nargab\/lqab043"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Lewis, T.E., Magoulas, G.D.: TMBL kernels for CUDA GPUs compile faster using PTX. In: Harding, S., et al. (eds.) GECCO, pp. 455\u2013462 (2011). https:\/\/doi.org\/10.1145\/2001858.2002033","DOI":"10.1145\/2001858.2002033"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Liou, J.Y., Forrest, S., Wu, C.-J.: Genetic improvement of GPU code. In: Petke, J., Tan, S.H., Langdon, W.B., Weimer, W. (eds.) GI-2019, ICSE Workshops Proceedings, pp. 20\u201327 (2019). https:\/\/doi.org\/10.1109\/GI.2019.00014","DOI":"10.1109\/GI.2019.00014"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Liou, J.Y., Wang, X., Forrest, S., Wu, C.J.: GEVO: GPU code optimization using evolutionary computation. ACM Trans. Archit. Code Optim. 17(4), Article no. 33 (2020). https:\/\/doi.org\/10.1145\/3418055","DOI":"10.1145\/3418055"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Liou, J.Y., et al.: Understanding the power of evolutionary computation for GPU code optimization. arXiv (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.12350","DOI":"10.48550\/ARXIV.2208.12350"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0055930","volume-title":"Genetic Programming","author":"C Ryan","year":"1998","unstructured":"Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83\u201396. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055930"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Li, S.S., et al.: Genetic improvement in the Shackleton framework for optimizing LLVM pass sequences. In: Bruce, B.R., et al. (eds.) GECCO, pp. 1938\u20131939. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3520304.3534000","DOI":"10.1145\/3520304.3534000"},{"key":"16_CR33","doi-asserted-by":"publisher","unstructured":"Peeler, H., et al.: Optimizing LLVM pass sequences with Shackleton: a linear genetic programming framework. In: Trautmann, H., et al. (eds.) GECCO Comp, GECCO 2022, pp. 578\u2013581. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3520304.3528945","DOI":"10.1145\/3520304.3528945"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Peeler, H., et al.: Optimizing LLVM pass sequences with Shackleton: a linear genetic programming framework. arXiv (2022). https:\/\/arxiv.org\/abs\/2201.13305","DOI":"10.1145\/3520304.3528945"},{"key":"16_CR35","doi-asserted-by":"publisher","unstructured":"Brameier, M., Banzhaf, W.: Linear Genetic Programming. No. XVI in Genetic and Evolutionary Computation (2007). https:\/\/doi.org\/10.1007\/978-0-387-31030-5","DOI":"10.1007\/978-0-387-31030-5"},{"key":"16_CR36","doi-asserted-by":"publisher","unstructured":"Petke, J., et al.: A survey of genetic improvement search spaces. In: Alexander, B., Haraldsson, S.O., Wagner, M., Woodward, J.R. (eds.) GECCO, pp. 1715\u20131721 (2019). https:\/\/doi.org\/10.1145\/3319619.3326870","DOI":"10.1145\/3319619.3326870"},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Rainford, P., Porter, B.: Using phylogenetic analysis to enhance genetic improvement. In: Rahat, A., et al. (eds.) GECCO, GECCO 2022, pp. 849\u2013857. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3512290.3528789","DOI":"10.1145\/3512290.3528789"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Langdon, W.B.: Genetic improvement of genetic programming. In: Brownlee, A.S., Haraldsson, S.O., Petke, J., Woodward, J.R. (eds.) GI @ CEC 2020 Special Session (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185771","DOI":"10.1109\/CEC48606.2020.9185771"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Jia, Y., Harman, M., Le Traon, Y.: Trivial compiler equivalence: a large scale empirical study of a simple fast and effective equivalent mutant detection technique. In: ICSE (2015). https:\/\/pages.cs.aueb.gr\/~mpapad\/papers\/ICSE15B.pdf","DOI":"10.1109\/ICSE.2015.103"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-45823-6_23","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"WB Langdon","year":"2016","unstructured":"Langdon, W.B., Petke, J., Bruce, B.R.: Optimising quantisation noise in energy measurement. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 249\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_23"},{"key":"16_CR41","unstructured":"Blot, A., Petke, J.: Using genetic improvement to optimise optimisation algorithm implementations. In: Hadj-Hamou, K. (ed.) ROADEF 2022. INSA Lyon (2022). https:\/\/www.cs.ucl.ac.uk\/staff\/a.blot\/files\/blot_roadef_2022.pdf"},{"key":"16_CR42","doi-asserted-by":"publisher","unstructured":"Harman, M., Jia, Y., Langdon, W.B.: A manifesto for higher order mutation testing. In: du Bousquet, L., Bradbury, J., Fraser, G. (eds.) Mutation 2010, pp. 80\u201389 (2010). https:\/\/doi.org\/10.1109\/ICSTW.2010.13","DOI":"10.1109\/ICSTW.2010.13"},{"key":"16_CR43","doi-asserted-by":"publisher","unstructured":"Sitthi-amorn, P., Modly, N., Weimer, W., Lawrence, J.: Genetic programming for shader simplification. ACM Trans. Graph. 30(6), Article no. 152 (2011). https:\/\/doi.org\/10.1145\/2070781.2024186","DOI":"10.1145\/2070781.2024186"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-55696-3_7","volume-title":"Genetic Programming","author":"WB Langdon","year":"2017","unstructured":"Langdon, W.B., Veerapen, N., Ochoa, G.: Visualising the search landscape of the triangle program. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 96\u2013113. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_7"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29573-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:35:18Z","timestamp":1710358518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29573-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031295720","9783031295737"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29573-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/eurogp\/","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":"38","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":"14","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":"8","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":"37% - 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":"2.95","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.9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}