{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:25:58Z","timestamp":1769923558930,"version":"3.49.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031037887","type":"print"},{"value":"9783031037894","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-03789-4_4","type":"book-chapter","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T23:02:49Z","timestamp":1649977369000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Painting with\u00a0Evolutionary Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8185-1293","authenticated-orcid":false,"given":"Danny","family":"Dijkzeul","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-1722","authenticated-orcid":false,"given":"Nielis","family":"Brouwer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7551-1679","authenticated-orcid":false,"given":"Iris","family":"Pijning","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2356-184X","authenticated-orcid":false,"given":"Levi","family":"Koppenhol","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5060-3342","authenticated-orcid":false,"given":"Daan","family":"van den Berg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"4_CR1","unstructured":"Anastasia opara\u2019s \u201cGenetic Drawing\u201d. https:\/\/github.com\/anopara\/genetic-drawing. Accessed 21 Feb 2022"},{"key":"4_CR2","unstructured":"Animated brush stroke optimization from this paper. https:\/\/drive.google.com\/file\/d\/12IvkBGig7xCrSivJsgusunCeRRJe8G4Q\/view. Accessed 21 Feb 2022"},{"key":"4_CR3","unstructured":"Scipy package. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.optimize.curve_fit.html. Accessed 21 Feb 2022"},{"key":"4_CR4","unstructured":"Source code belonging to this study. https:\/\/github.com\/paintingbrushstroke\/paintings. Accessed 21 Feb 2022"},{"issue":"11","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.3390\/e22111284","volume":"22","author":"D de Andrade","year":"2020","unstructured":"de Andrade, D., Fachada, N., Fernandes, C.M., Rosa, A.C.: Generative art with swarm landscapes. Entropy 22(11), 1284 (2020)","journal-title":"Entropy"},{"key":"4_CR6","unstructured":"van den Berg, D.: Simplified paintings-from-polygons is NP-hard. In: Evo* LBA\u2019s 2020, pp. 15\u201318. Springer, Cham (2020)"},{"key":"4_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-35664-4_1","volume-title":"Nordic Artificial Intelligence Research and Development","author":"J Berg","year":"2019","unstructured":"Berg, J., Berggren, N.G.A., Borgeteien, S.A., Jahren, C.R.A., Sajid, A., Nichele, S.: Evolved art with transparent, overlapping, and geometric shapes. In: Bach, K., Ruocco, M. (eds.) NAIS 2019. CCIS, vol. 1056, pp. 3\u201315. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35664-4_1"},{"key":"4_CR8","unstructured":"Brouwer, N.: Survivor selection in the plant propagation algorithm. Master thesis (2021). https:\/\/scripties.uba.uva.nl\/search?id=723225"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Chopard, B., Tomassini, M.: An Introduction to Metaheuristics for Optimization. Natural Computing Series, 1st edn. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93073-2","DOI":"10.1007\/978-3-319-93073-2"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Colton, S., Lopez de Mantaras, R., Stock, O.: Computational creativity: coming of age. AI Mag. 30(3), 11 (2009). https:\/\/doi.org\/10.1609\/aimag.v30i3.2257","DOI":"10.1609\/aimag.v30i3.2257"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1061\/(ASCE)0733-9496(1999)125:4(215)","volume":"125","author":"MDC Cunha","year":"1999","unstructured":"Cunha, M.D.C., Sousa, J.: Water distribution network design optimization: simulated annealing approach. J. Water Resour. Plann. Manag. 125(4), 215\u2013221 (1999)","journal-title":"J. Water Resour. Plann. Manag."},{"key":"4_CR12","unstructured":"Dahmani, R., Boogmans, S., Meijs, A., Van den Berg, D.: Paintings-from-polygons: simulated annealing. In: International Conference on Computational Creativity (ICCC 2020) (2020)"},{"key":"4_CR13","unstructured":"De Jonge, M., Van den Berg, D.: Plant propagation parameterization: offspring & population size. In: Evo* LBA\u2019s 2020, vol. 2, pp. 1\u20134. Springer, Cham (2020)"},{"key":"4_CR14","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1470\u20131477. IEEE (1999)"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Smith, J.E.: Working with Evolutionary Algorithms, p. 152. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-05094-1_14","DOI":"10.1007\/978-3-662-05094-1_14"},{"key":"4_CR16","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-11271-8_5","volume-title":"Computational Intelligence","author":"CM Fernandes","year":"2015","unstructured":"Fernandes, C.M., Mora, A.M., Merelo, J.J., Rosa, A.C.: Photorealistic rendering with an ant algorithm. In: Madani, K., Correia, A.D., Rosa, A., Filipe, J. (eds.) Computational Intelligence. SCI, vol. 577, pp. 63\u201377. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-11271-8_5"},{"key":"4_CR17","unstructured":"Fernandes, C., Mora, A.M., Merelo, J.J., Ramos, V., Laredo, J.L.J.: KohonAnts: a self-organizing ant algorithm for clustering and pattern classification. arXiv preprint arXiv:0803.2695 (2008). Accessed 21 Feb 2022"},{"key":"4_CR18","first-page":"601","volume":"74","author":"ES Fraga","year":"2019","unstructured":"Fraga, E.S.: An example of multi-objective optimization for dynamic processes. Chem. Eng. Trans. (AIDIC) 74, 601\u2013606 (2019)","journal-title":"Chem. Eng. Trans. (AIDIC)"},{"key":"4_CR19","unstructured":"Fraga, E.S.: Multiple simultaneous solution representations in a population based evolutionary algorithm. arXiv preprint arXiv:2106.05096 (2021). Accessed 21 Feb 2022"},{"issue":"4","key":"4_CR20","first-page":"110","volume":"2","author":"E Fraga","year":"2021","unstructured":"Fraga, E.: Fresa: a plant propagation algorithm for black-box single and multiple objective optimization. Int. J. Eng. Technol. Inform. 2(4), 110\u2013111 (2021)","journal-title":"Int. J. Eng. Technol. Inform."},{"key":"4_CR21","unstructured":"Geleijn, R., van der Meer, M., van der Post, Q., van den Berg, D.: The plant propagation algorithm on timetables: first results. In: EVO* LBA\u2019s 2019, p. 2. Springer, Cham (2019)"},{"issue":"6","key":"4_CR22","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. PAMI 6(6), 721\u2013741 (1984). https:\/\/doi.org\/10.1109\/TPAMI.1984.4767596","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. PAMI"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1162\/ARTL_a_00170","volume":"21","author":"G Greenfield","year":"2015","unstructured":"Greenfield, G., Machado, P.: Ant-and ant-colony-inspired alife visual art. Artif. Life 21(3), 293\u2013306 (2015)","journal-title":"Artif. Life"},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1504\/IJICA.2020.111229","volume":"11","author":"S Haddadi","year":"2020","unstructured":"Haddadi, S.: Plant propagation algorithm for nurse rostering. Int. J. Innov. Comput. Appl. 11(4), 204\u2013215 (2020)","journal-title":"Int. J. Innov. Comput. Appl."},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, Languages and Programming","author":"DS Johnson","year":"1990","unstructured":"Johnson, D.S.: Local optimization and the traveling salesman problem. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 446\u2013461. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032050"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"de Jonge, M., van den Berg, D.: Parameter sensitivity patterns in the plant propagation algorithm. In: Proceedings of the 12th International Joint Conference on Computational Intelligence (2020), IJCCI 2020, April 2020. https:\/\/doi.org\/10.5220\/0010134300920099","DOI":"10.5220\/0010134300920099"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"8","key":"4_CR28","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1057\/palgrave.jors.2601902","volume":"56","author":"M Kumral","year":"2005","unstructured":"Kumral, M., Dowd, P.: A simulated annealing approach to mine production scheduling. J. Oper. Res. Soc. 56(8), 922\u2013930 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR29","unstructured":"Lehman, J., Risi, S., Clune, J.: Creative generation of 3D objects with deep learning and innovation engines. In: Proceedings of the 7th International Conference on Computational Creativity, pp. 180\u2013187. Citeseer (2016)"},{"issue":"30","key":"4_CR30","doi-asserted-by":"publisher","first-page":"12081","DOI":"10.1073\/pnas.1203182109","volume":"109","author":"RM MacCallum","year":"2012","unstructured":"MacCallum, R.M., Mauch, M., Burt, A., Leroi, A.M.: Evolution of music by public choice. Proc. Natl. Acad. Sci. 109(30), 12081\u201312086 (2012). https:\/\/doi.org\/10.1073\/pnas.1203182109","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-319-55750-2_16","volume-title":"Computational Intelligence in Music, Sound, Art and Design","author":"A Neumann","year":"2017","unstructured":"Neumann, A., Alexander, B., Neumann, F.: Evolutionary image transition using random walks. In: Correia, J., Ciesielski, V., Liapis, A. (eds.) EvoMUSART 2017. LNCS, vol. 10198, pp. 230\u2013245. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55750-2_16"},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1162\/evco_a_00270","volume":"28","author":"A Neumann","year":"2020","unstructured":"Neumann, A., Alexander, B., Neumann, F.: Evolutionary image transition and painting using random walks. Evol. Comput. 28(4), 643\u2013675 (2020)","journal-title":"Evol. Comput."},{"key":"4_CR33","series-title":"Atlantis Thinking Machines","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2991\/978-94-6239-085-0_12","volume-title":"Computational Creativity Research: Towards Creative Machines","author":"H Gon\u00e7alo Oliveira","year":"2015","unstructured":"Gon\u00e7alo Oliveira, H., Cardoso, A.: Poetry generation with PoeTryMe. In: Besold, T.R., Schorlemmer, M., Smaill, A. (eds.) Computational Creativity Research: Towards Creative Machines. ATM, vol. 7, pp. 243\u2013266. Atlantis Press, Paris (2015). https:\/\/doi.org\/10.2991\/978-94-6239-085-0_12"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cogsys.2018.11.012","volume":"54","author":"HG Oliveira","year":"2019","unstructured":"Oliveira, H.G., Mendes, T., Boavida, A., Nakamura, A., Ackerman, M.: Co-PoeTryMe: interactive poetry generation. Cogn. Syst. Res. 54, 199\u2013216 (2019)","journal-title":"Cogn. Syst. Res."},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-16667-0_6","volume-title":"Computational Intelligence in Music, Sound, Art and Design","author":"M Paauw","year":"2019","unstructured":"Paauw, M., van den Berg, D.: Paintings, polygons and plant propagation. In: Ek\u00e1rt, A., Liapis, A., Castro Pena, M.L. (eds.) EvoMUSART 2019. LNCS, vol. 11453, pp. 84\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16667-0_6"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-77583-8_1","volume-title":"Computational Intelligence in Music, Sound, Art and Design","author":"H Richter","year":"2018","unstructured":"Richter, H.: Visual art inspired by the collective feeding behavior of sand-bubbler crabs. In: Liapis, A., Romero Cardalda, J.J., Ek\u00e1rt, A. (eds.) EvoMUSART 2018. LNCS, vol. 10783, pp. 1\u201317. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77583-8_1"},{"issue":"16","key":"4_CR37","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.3390\/math9161882","volume":"9","author":"H Richter","year":"2021","unstructured":"Richter, H.: Designing color symmetry in stigmergic art. Mathematics 9(16), 1882 (2021)","journal-title":"Mathematics"},{"key":"4_CR38","unstructured":"Salhi, A., Fraga, E.S.: Nature-inspired optimisation approaches and the new plant propagation algorithm. In: Proceeding of The International Conference on Numerical Analysis and Optimization (ICeMATH2011), pp. K21\u2013K28 (2011)"},{"key":"4_CR39","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-30235-5_3","volume-title":"Nature-Inspired Computation in Engineering","author":"B\u0130 Selamo\u011flu","year":"2016","unstructured":"Selamo\u011flu, B.\u0130, Salhi, A.: The plant propagation algorithm for discrete optimisation: the case of the travelling salesman problem. In: Yang, X.-S. (ed.) Nature-Inspired Computation in Engineering. SCI, vol. 637, pp. 43\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30235-5_3"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24854-5_17","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"Y Semet","year":"2004","unstructured":"Semet, Y., O\u2019Reilly, U.-M., Durand, F.: An interactive artificial ant approach to non-photorealistic rendering. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 188\u2013200. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24854-5_17"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Sleegers, J., van den Berg, D.: Looking for the hardest Hamiltonian cycle problem instances. In: IJCCI, pp. 40\u201348 (2020)","DOI":"10.5220\/0010066900400048"},{"key":"4_CR42","unstructured":"Sleegers, J., van den Berg, D.: Plant propagation & hard Hamiltonian graphs. In: Evo* LBA\u2019s 2020, pp. 10\u201313. Springer, Cham (2020)"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-20520-0_42","volume-title":"Applications of Evolutionary Computation","author":"P Urbano","year":"2011","unstructured":"Urbano, P.: The T. albipennis sand painting artists. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 414\u2013423. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20520-0_42"},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"Van Laarhoven, P.J., Aarts, E.H.: Simulated annealing. In: Simulated Annealing: Theory and Applications, pp. 7\u201315. Springer, Cham (1987). https:\/\/doi.org\/10.1007\/978-94-015-7744-1_2","DOI":"10.1007\/978-94-015-7744-1_2"},{"issue":"1","key":"4_CR45","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJ Van Laarhoven","year":"1992","unstructured":"Van Laarhoven, P.J., Aarts, E.H., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113\u2013125 (1992)","journal-title":"Oper. Res."},{"key":"4_CR46","doi-asserted-by":"publisher","unstructured":"Vrielink, W., Van den Berg, D.: Fireworks algorithm versus plant propagation algorithm. In: IJCCI 2019 - Proceedings of the 11th International Joint Conference on Computational Intelligence (February), pp. 101\u2013112 (2019). https:\/\/doi.org\/10.5220\/0008169401010112","DOI":"10.5220\/0008169401010112"},{"key":"4_CR47","unstructured":"Vrielink, W., Van den Berg, D.: A dynamic parameter for the plant propagation algorithm. In: Evo* LBA\u2019s 2021, no. March, pp. 5\u20139. Springer, Cham (2021)"},{"key":"4_CR48","unstructured":"Vrielink, W., Van den Berg, D.: Parameter control for the plant propagation algorithm. In: Evo* LBA\u2019s 2021, no. March, pp. 1\u20134. Springer, Cham (2021)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence in Music, Sound, Art and Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-03789-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T08:04:30Z","timestamp":1726992270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-03789-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031037887","9783031037894"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-03789-4_4","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":"15 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoMUSART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Intelligence in Music, Sound, Art and Design (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evomusart2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","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":"51","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":"6","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":"39% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}