{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T08:55:28Z","timestamp":1769936128061,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156341","type":"print"},{"value":"9783032156358","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15635-8_20","type":"book-chapter","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:07:18Z","timestamp":1769850438000},"page":"311-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Cartesian Genetic Programming via\u00a0Iterative Subgraph Assessment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5483-5079","authenticated-orcid":false,"given":"Henning","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2354-5702","authenticated-orcid":false,"given":"Camilo","family":"De La Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1360-1932","authenticated-orcid":false,"given":"Sylvain","family":"Cussat-Blanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8675-197X","authenticated-orcid":false,"given":"Herv\u00e9","family":"Luga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2414-0051","authenticated-orcid":false,"given":"Dennis G.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0107-264X","authenticated-orcid":false,"given":"J\u00f6rg","family":"H\u00e4hner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,1]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/TCYB.2020.2964566","volume":"51","author":"Y Bi","year":"2021","unstructured":"Bi, Y., Xue, B., Zhang, M.: Genetic programming with a new representation to automatically learn features and evolve ensembles for image classification. IEEE Trans. Cybern. 51(4), 1769\u20131783 (2021). https:\/\/doi.org\/10.1109\/TCYB.2020.2964566","journal-title":"IEEE Trans. Cybern."},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Cai, X., Smith, S.L., Tyrrell, A.M.: Positional independence and recombination in cartesian genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 351\u2013360. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11729976_32","DOI":"10.1007\/11729976_32"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Calvo, B., Ceberio, J., Lozano, J.A.: Bayesian inference for algorithm ranking analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 324\u2013325. GECCO \u201918, Association for Computing Machinery, New York, NY, USA (2018).https:\/\/doi.org\/10.1145\/3205651.3205658","DOI":"10.1145\/3205651.3205658"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"7112","DOI":"10.1038\/s41467-023-42664-x","volume":"14","author":"K Cortacero","year":"2023","unstructured":"Cortacero, K., et al.: Evolutionary design of explainable algorithms for biomedical image segmentation. Nat. Commun. 14(1), 7112 (2023). https:\/\/doi.org\/10.1038\/s41467-023-42664-x","journal-title":"Nat. Commun."},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Cui, H., Heider, M., H\u00e4hner, J.: Positional bias does not influence cartesian genetic programming with crossover. In: Affenzeller, M., Winkler, S.M., Kononova, A.V., Trautmann, H., Tu\u0161ar, T., Machado, P., B\u00e4ck, T. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XVIII, pp. 151\u2013167. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-70055-2_10","DOI":"10.1007\/978-3-031-70055-2_10"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Cui, H., Margraf, A., H\u00e4hner, J.: Equidistant reorder operator for cartesian genetic programming. In: van Stein, N., Marcelloni, F., Lam, H.K., Cottrell, M., Filipe, J. (eds.) Proceedings of the 15th International Joint Conference on Computational Intelligence - ECTA, November 13-15, 2023, in Rome, Italy. pp. 64 \u2013 74 (2023).https:\/\/doi.org\/10.5220\/0012174100003595","DOI":"10.5220\/0012174100003595"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-031-70055-2_19","volume-title":"Parallel Problem Solving from Nature - PPSN XVIII","author":"C De La Torre","year":"2024","unstructured":"De La Torre, C., Lavinas, Y., Cortacero, K., Luga, H., Wilson, D.G., Cussat-Blanc, S.: Multimodal adaptive graph evolution for program synthesis. In: Affenzeller, M., Winkler, S.M., Kononova, A.V., Trautmann, H., Tu\u0161ar, T., Machado, P., B\u00e4ck, T. (eds.) Parallel Problem Solving from Nature - PPSN XVIII, pp. 306\u2013321. Springer Nature Switzerland, Cham (2024)"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Goldman, B.W., Punch, W.F.: Length bias and search limitations in cartesian genetic programming. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 933\u2013940. GECCO \u201913, Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2463372.2463482","DOI":"10.1145\/2463372.2463482"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Goldman, B.W., Punch, W.F.: Reducing wasted evaluations in cartesian genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e, Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 61\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37207-0_6","DOI":"10.1007\/978-3-642-37207-0_6"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TEVC.2014.2324539","volume":"19","author":"BW Goldman","year":"2015","unstructured":"Goldman, B.W., Punch, W.F.: Analysis of cartesian genetic programming\u2019s evolutionary mechanisms 19(3), 359\u2013373 (2015). https:\/\/doi.org\/10.1109\/TEVC.2014.2324539","journal-title":"Analysis of cartesian genetic programming\u2019s evolutionary mechanisms"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Harding, S., Graziano, V., Leitner, J., Schmidhuber, J.: Mt-CGP: Mixed type cartesian genetic programming. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 751\u2013758 (2012)","DOI":"10.1145\/2330163.2330268"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Kalkreuth, R.: A comprehensive study on subgraph crossover in cartesian genetic programming. In: Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020) - ECTA, pp. 59\u201370. INSTICC, SciTePress (2020). https:\/\/doi.org\/10.5220\/0010110700590070","DOI":"10.5220\/0010110700590070"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Kalkreuth, R., Rudolph, G., Droschinsky, A.: A new subgraph crossover for cartesian genetic programming. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 294\u2013310. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_19","DOI":"10.1007\/978-3-319-55696-3_19"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Kaufmann, P., Kalkreuth, R.: Parametrizing cartesian genetic programming: an empirical study. In: Kern-Isberner, G., F\u00fcrnkranz, J., Thimm, M. (eds.) KI 2017. LNCS (LNAI), vol. 10505, pp. 316\u2013322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67190-1_26","DOI":"10.1007\/978-3-319-67190-1_26"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Kocherovsky, M., Banzhaf, W.: Crossover destructiveness in cartesian versus linear genetic programming. In: Artificial Life Conference Proceedings, vol. ALIFE 2024: Proceedings of the 2024 Artificial Life Conference, p.\u00a020 (2024). https:\/\/doi.org\/10.1162\/isal_a_00735","DOI":"10.1162\/isal_a_00735"},{"key":"20_CR16","unstructured":"Koza, J.: Genetic programming: on the programming of computers by means of natural selection (1992)"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1037\/a0029146","volume":"142","author":"JK Kruschke","year":"2013","unstructured":"Kruschke, J.K.: Bayesian estimation supersedes the t test. J. Experimental Psychol. General 142(2), 573\u2013603 (2013). https:\/\/doi.org\/10.1037\/a0029146","journal-title":"J. Experimental Psychol. General"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"J Miller","year":"2006","unstructured":"Miller, J., Smith, S.: Redundancy and computational efficiency in cartesian genetic programming. IEEE Trans. Evolutionary Comput. 10(2), 167\u2013174 (2006). https:\/\/doi.org\/10.1109\/TEVC.2006.871253","journal-title":"IEEE Trans. Evolutionary Comput."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Miller, J., Thomson, P.: Cartesian genetic programming. In: Proc. European Conference on Genetic Programming. vol.\u00a01802, pp. 121\u2013132. Springer (2000)","DOI":"10.1007\/978-3-540-46239-2_9"},{"key":"20_CR20","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - vol. 2, pp. 1135\u20131142. GECCO\u201999, Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Miller, J.F.: Cartesian Genetic Programming. Springer Berlin Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3_2","DOI":"10.1007\/978-3-642-17310-3_2"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Miller, J.F.: Cartesian genetic programming: its status and future. Genet. Program Evolvable Mach., 129\u2013168 (2019). https:\/\/doi.org\/10.1007\/s10710-019-09360-6","DOI":"10.1007\/s10710-019-09360-6"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Muntean, O., Diosan, L., Oltean, M.: Best subtree genetic programming. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1667\u20131673 (2007)","DOI":"10.1145\/1276958.1277287"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Orzechowski, P., La\u00a0Cava, W., Moore, J.H.: Where are we now? a large benchmark study of recent symbolic regression methods. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1183\u20131190. GECCO \u201918, Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3205455.3205539","DOI":"10.1145\/3205455.3205539"},{"key":"20_CR25","unstructured":"P\u00e4tzel, D.: cmpbayes. https:\/\/github.com\/dpaetzel\/cmpbayes (2023)"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Turner, A.J., Miller, J.F.: Neutral genetic drift: an investigation using cartesian genetic programming. Genet. Program Evolvable Mach. 16(4), 531\u2013558 (2015). https:\/\/doi.org\/10.1007\/s10710-015-9244-6","DOI":"10.1007\/s10710-015-9244-6"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Udrescu, S.M., Tegmark, M.: AI feynman: a physics-inspired method for symbolic regression (2020). https:\/\/arxiv.org\/abs\/1905.11481","DOI":"10.1126\/sciadv.aay2631"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Walker, J.A., Miller, J.F., Kaufmann, P., Platzner, M.: Problem decomposition in cartesian genetic programming. In: Cartesian Genetic Programming, pp. 35\u201399. Springer (2011)","DOI":"10.1007\/978-3-642-17310-3_3"},{"key":"20_CR29","first-page":"3","volume":"14","author":"D White","year":"2013","unstructured":"White, D., et al.: Better GP benchmarks: community survey results and proposals 14, 3\u201329 (2013)","journal-title":"Better GP benchmarks: community survey results and proposals"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15635-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:07:19Z","timestamp":1769850439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15635-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156341","9783032156358"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15635-8_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Computational Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marbella","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcci.scitevents.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}