{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:27:42Z","timestamp":1781018862651,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3779834","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"892-899","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating Knowledge Preferences in Question Answering via Bloom\u2019s Taxonomy"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5168-4399","authenticated-orcid":false,"given":"Ruben","family":"Bimberg","sequence":"first","affiliation":[{"name":"THM, University of Applied Sciences, Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5067-6660","authenticated-orcid":false,"given":"Maximilian","family":"Huber","sequence":"additional","affiliation":[{"name":"THM, University of Applied Sciences, Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2662-3471","authenticated-orcid":false,"given":"Frank","family":"Kammer","sequence":"additional","affiliation":[{"name":"THM, University of Applied Sciences, Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4001-1153","authenticated-orcid":false,"given":"Johannes","family":"Meintrup","sequence":"additional","affiliation":[{"name":"THM, University of Applied Sciences, Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5626-9725","authenticated-orcid":false,"given":"Markus","family":"Siepermann","sequence":"additional","affiliation":[{"name":"THM, University of Applied Sciences, Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.3163\/1536-5050.103.3.010"},{"key":"e_1_3_2_1_2_1","unstructured":"Ruben Bimberg Maximilian Huber Frank Kammer Johannes Meintrup and Markus Siepermann. 2025. Plm-knowledge-eval-bloom. GitHub-Repository. https:\/\/github.com\/thm-mni-ii\/PLM-Knowledge-Eval-Bloom."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1224"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2410.08414"},{"key":"e_1_3_2_1_5_1","unstructured":"Michael Han Daniel Han and Unsloth team. 2023. Unsloth. (2023). http:\/\/github.com\/unslothai\/unsloth."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2404.16130"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2502.13595"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.eacl-demo.16"},{"key":"e_1_3_2_1_9_1","volume-title":"Ragas: Supercharge Your LLM Application Evaluations.","year":"2025","unstructured":"ExplodingGradients. 2025. Ragas: Supercharge Your LLM Application Evaluations. (2025). Retrieved Oct. 2, 2025 from https:\/\/github.com\/explodinggradients\/ragas."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.emnlp-main.943"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Yunfan Gao et al. 2024. Retrieval-Augmented Generation for Large Language Models: A Survey. (Mar. 2024). 10.48550\/arXiv.2312.10997","DOI":"10.48550\/arXiv.2312.10997"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2410.05779"},{"key":"e_1_3_2_1_13_1","volume-title":"Retrieved","author":"Guti\u00e9rrez Bernal J.","year":"2024","unstructured":"Bernal J. Guti\u00e9rrez, Yiheng Shu, Yu Gu, Michihiro Yasunaga, and Yu Su. 2024. HippoRAG: Neurobiologically Inspired Long-Term Memory for Large Language Models. Advances in Neural Information Processing Systems, 37, (Dec. 2024), 59532\u201359569. Retrieved Aug. 25, 2025 from https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2024\/hash\/6ddc001d07ca4f319af96a3024f6dbd1-Abstract-Conference.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3703155"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 31st International Conference on Computational Linguistics","author":"Huber Thomas","year":"2025","unstructured":"Thomas Huber and Christina Niklaus. 2025. LLMs meet Bloom's Taxonomy: A Cognitive View on Large Language Model Evaluations. In Proceedings of the 31st International Conference on Computational Linguistics. Association for Computational Linguistics, (Jan. 2025), 5211\u20135246. Retrieved Oct. 7, 2025 from https:\/\/aclanthology.org\/2025.coling-main.350\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2412.12527"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2502.13648"},{"key":"e_1_3_2_1_19_1","volume-title":"A Revision of Bloom's Taxonomy: An Overview, 212\u2013218. Retrieved","author":"Krathwohl David R.","year":"2025","unstructured":"David R. Krathwohl. 2002. A Revision of Bloom's Taxonomy: An Overview, 212\u2013218. Retrieved Apr. 9, 2025 from https:\/\/www.jstor.org\/stable\/1477405."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2403.06789"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems. (Dec. 2020","author":"Patrick","year":"2025","unstructured":"Patrick Lewis et al. 2020. Retrieval-augmented generation for knowledge-intensive NLP tasks. In Proceedings of the 34th International Conference on Neural Information Processing Systems. (Dec. 2020), 9459\u20139474. isbn: 978-1-7138-2954-6. Retrieved Aug. 25, 2025 from."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2412.05579"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3649449"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.565"},{"key":"e_1_3_2_1_25_1","volume-title":"Understanding Bloom's Taxonomy. (Aug","author":"Lynne Patricia","year":"2024","unstructured":"Patricia Lynne. 2024. Understanding Bloom's Taxonomy. (Aug. 2024). Retrieved Oct. 7, 2025 from https:\/\/rotel.pressbooks.pub\/readwritesuccess\/chapter\/understanding-blooms-taxonomy\/."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.546"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.316"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1310.4546"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605943"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.741"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.559"},{"key":"e_1_3_2_1_32_1","volume-title":"Retrieved","author":"Nogueira Rodrigo","year":"2019","unstructured":"Rodrigo Nogueira and Kyunghyun Cho. 2019. Passage Re-ranking with BERT. CoRR, abs\/1901.04085. Retrieved Aug. 25, 2025 from http:\/\/arxiv.org\/abs\/1901.04085."},{"key":"e_1_3_2_1_33_1","unstructured":"Qdrant. 2024. BM42: New Baseline for Hybrid Search. (2024). https:\/\/qdrant.tech\/articles\/bm42\/."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5121\/ijnlc.2024.13103"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2407.12873"},{"key":"e_1_3_2_1_37_1","unstructured":"Yutaka Sasaki. 2007. The Truth of the F-measure. Technical Report. https:\/\/www.cs.odu.edu\/mukka\/cs795sum09dm\/Lecturenotes\/Day3\/F-measure-YS-26Oct07.pdf."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-64299-9_12"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.emnlp-main.234"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 4th International Conference on Natural Language and Speech Processing (ICNLSP 2021","author":"Ullrich Sabine","year":"2021","unstructured":"Sabine Ullrich and Michaela Geierhos. 2021. Using Bloom's Taxonomy to Classify Question Complexity. In Proceedings of the 4th International Conference on Natural Language and Speech Processing (ICNLSP 2021). Association for Computational Linguistics, Trento, Italy, 285\u2013289. Retrieved Feb. 13, 2025 from https:\/\/aclanthology.org\/2021.icnlsp-1.34\/."},{"key":"e_1_3_2_1_41_1","volume-title":"Database Design -","author":"Watt Adrienne","unstructured":"Adrienne Watt and Nelson Eng. 2014. Database Design - 2nd Edition. BCcampus, Victoria, B.C. https:\/\/opentextbc.ca\/dbdesign01\/.","edition":"2"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-emnlp.759"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2508.05509"},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of the 38th International Conference on Neural Information Processing Systems. (June 2025","author":"Yadkori Yasin Abbasi","year":"2025","unstructured":"Yasin Abbasi Yadkori, Ilja Kuzborskij, Andr\u00e1s Gy\u00f6rgy, and Csaba Szepesv\u00e1ri. 2025. To believe or not to believe your LLM: iterative prompting for estimating epistemic uncertainty. In Proceedings of the 38th International Conference on Neural Information Processing Systems. (June 2025), 58077\u201358117. isbn: 979-8-3313-1438-5. Retrieved Sept. 11, 2025 from."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","unstructured":"An Yang et al. 2025. Qwen3 Technical Report. (May 2025). 10.48550\/arXiv.2505.09388","DOI":"10.48550\/arXiv.2505.09388"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","unstructured":"Ori Yoran Tomer Wolfson Ori Ram and Jonathan Berant. 2023. Making Retrieval-Augmented Language Models Robust to Irrelevant Context. CoRR. 10.48550\/ARXIV.2310.01558","DOI":"10.48550\/ARXIV.2310.01558"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.findings-emnlp.246"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.naacl-long.237"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","unstructured":"Sizhe Zhou Sha Li Yu Meng Yizhu Jiao Heng Ji and Jiawei Han. 2024. Establishing Knowledge Preference in Language Models. CoRR. 10.48550\/ARXIV.2407.13048","DOI":"10.48550\/ARXIV.2407.13048"}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3779834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:45:23Z","timestamp":1781016323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3779834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":49,"alternative-id":["10.1145\/3748522.3779834","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3779834","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}