{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:17:55Z","timestamp":1783577875537,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032306982","type":"print"},{"value":"9783032306999","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:00:00Z","timestamp":1783641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:00:00Z","timestamp":1783641600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-30699-9_11","type":"book-chapter","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T05:43:15Z","timestamp":1783575795000},"page":"121-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SafeTune: Search-based Harmfulness Minimisation for Large Language Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7388-890X","authenticated-orcid":false,"given":"Giordano","family":"d\u2019Aloisio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9828-2639","authenticated-orcid":false,"given":"David","family":"Williams","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0742-7261","authenticated-orcid":false,"given":"Giusy","family":"Annunziata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3166-8525","authenticated-orcid":false,"given":"Zhiwei","family":"Fei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7214-9945","authenticated-orcid":false,"given":"Antinisca","family":"Di Marco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9146-442X","authenticated-orcid":false,"given":"Federica","family":"Sarro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,10]]},"reference":[{"key":"11_CR1","unstructured":"Yang, L., et al.: Harmmetric eval: benchmarking metrics and judges for LLM harmfulness assessment. arXiv preprint arXiv:2509.24384 (2025)"},{"key":"11_CR2","unstructured":"d\u2019Aloisio, G., Fadahunsi, T., Choy, J., Moussa, R., Sarro, F.: SustainDiffusion: optimising the social and environmental sustainability of stable diffusion models. In: ACM\/IEEE ICSE (2026)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"d\u2019Alosio, G., Hort, M., Moussa, R., Sarro, F.: FairRF: multi-objective search for single and intersectional software fairness. In: ACM\/IEEE ICSE-SEIS (2026)","DOI":"10.1145\/3786581.3786922"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Gong, J., et al.: Greenstableyolo: optimizing inference time and image quality of text-to-image generation. In: SSBSE (2024)","DOI":"10.1007\/978-3-031-64573-0_7"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Sarro, F.: Search-based software engineering in the era of modern software systems. In: IEEE RE (2023). https:\/\/doi.org\/10.1109\/RE57278.2023.00010","DOI":"10.1109\/RE57278.2023.00010"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Corbo, S., Bancale, L., Gennaro, V.D., Lestingi, L., Scotti, V., Camilli, M.: How toxic can you get? Search-based toxicity testing for large language models. In: IEEE TSE (2025)","DOI":"10.1109\/TSE.2025.3607625"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Zhuo, T.Y., Huang, Y., Chen, C., Du, X., Xing, Z.: Bypassing guardrails: lessons learned from red teaming ChatGPT. ACM TOSEM (2025). https:\/\/doi.org\/10.1145\/3747288","DOI":"10.1145\/3747288"},{"key":"11_CR8","unstructured":"Mazeika, M., et al.: Harmbench: a standardized evaluation framework for automated red teaming and robust refusal. In: ICML (2024)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: sentence embeddings using siamese BERT-networks. In: EMNLP (2019)","DOI":"10.18653\/v1\/D19-1410"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. ACM Trans. Evol. Comp. (2002)","DOI":"10.1109\/4235.996017"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Cochran, W.G.: Some methods for strengthening the common $$\\chi ^2$$ tests. Biometrics (1954)","DOI":"10.2307\/3001616"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: The hypervolume indicator: Computational problems and algorithms. ACM Comput. Surv. (2021)","DOI":"10.1145\/3453474"}],"container-title":["Lecture Notes in Computer Science","Search-Based Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30699-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T05:43:17Z","timestamp":1783575797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30699-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,10]]},"ISBN":["9783032306982","9783032306999"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30699-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,10]]},"assertion":[{"value":"10 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSBSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Search Based Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssbse2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ssbse-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}