[{"_id":"61123","department":[{"_id":"574"}],"user_id":"83392","article_type":"original","article_number":"3749838","file_date_updated":"2025-09-11T09:26:29Z","type":"journal_article","popular_science":"1","status":"public","oa":"1","date_updated":"2025-09-11T09:30:28Z","volume":58,"author":[{"last_name":"Qudus","orcid":"0000-0001-6714-8729","id":"83392","full_name":"Qudus, Umair","first_name":"Umair"},{"last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","full_name":"Röder, Michael","id":"67199","first_name":"Michael"},{"first_name":"Muhammad","full_name":"Saleem, Muhammad","last_name":"Saleem"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"doi":"10.1145/3749838","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3749838","open_access":"1"}],"has_accepted_license":"1","publication_identifier":{"issn":["0360-0300","1557-7341"]},"publication_status":"published","intvolume":"        58","citation":{"apa":"Qudus, U., Röder, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2025). Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>, <i>58</i>, Article 3749838. <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>","bibtex":"@article{Qudus_Röder_Saleem_Ngonga Ngomo_2025, title={Fact Checking Knowledge Graphs -- A Survey}, volume={58}, DOI={<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>}, number={3749838}, journal={ACM Computing Surveys}, publisher={Association for Computing Machinery (ACM)}, author={Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","short":"U. Qudus, M. Röder, M. Saleem, A.-C. Ngonga Ngomo, ACM Computing Surveys 58 (2025).","mla":"Qudus, Umair, et al. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i>, vol. 58, 3749838, Association for Computing Machinery (ACM), 2025, doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>.","ama":"Qudus U, Röder M, Saleem M, Ngonga Ngomo A-C. Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>. 2025;58. doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>","ieee":"U. Qudus, M. Röder, M. Saleem, and A.-C. Ngonga Ngomo, “Fact Checking Knowledge Graphs -- A Survey,” <i>ACM Computing Surveys</i>, vol. 58, Art. no. 3749838, 2025, doi: <a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>.","chicago":"Qudus, Umair, Michael Röder, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i> 58 (2025). <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>."},"external_id":{"unknown":["10.1145/3749838"]},"keyword":["fact checking","knowledge graphs","fact-checkers","check worthiness","evidence retrieval","trust","veracity."],"ddc":["006"],"language":[{"iso":"eng"}],"publication":"ACM Computing Surveys","abstract":[{"text":"<jats:p>Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.</jats:p>","lang":"eng"}],"file":[{"file_name":"3749838.pdf","access_level":"closed","file_id":"61195","file_size":1062387,"creator":"uqudus","date_created":"2025-09-11T09:26:29Z","date_updated":"2025-09-11T09:26:29Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publisher":"Association for Computing Machinery (ACM)","date_created":"2025-09-03T15:46:43Z","title":"Fact Checking Knowledge Graphs -- A Survey","quality_controlled":"1","year":"2025"},{"date_updated":"2025-07-14T12:40:08Z","volume":45,"author":[{"full_name":"Attene, Marco","last_name":"Attene","first_name":"Marco"},{"last_name":"Campen","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel","id":"114904","first_name":"Marcel"},{"first_name":"Leif","full_name":"Kobbelt, Leif","last_name":"Kobbelt"}],"doi":"10.1145/2431211.2431214","publication_identifier":{"issn":["0360-0300","1557-7341"]},"publication_status":"published","intvolume":"        45","page":"1-33","citation":{"chicago":"Attene, Marco, Marcel Campen, and Leif Kobbelt. “Polygon Mesh Repairing.” <i>ACM Computing Surveys</i> 45, no. 2 (2013): 1–33. <a href=\"https://doi.org/10.1145/2431211.2431214\">https://doi.org/10.1145/2431211.2431214</a>.","ieee":"M. Attene, M. Campen, and L. Kobbelt, “Polygon mesh repairing,” <i>ACM Computing Surveys</i>, vol. 45, no. 2, pp. 1–33, 2013, doi: <a href=\"https://doi.org/10.1145/2431211.2431214\">10.1145/2431211.2431214</a>.","ama":"Attene M, Campen M, Kobbelt L. Polygon mesh repairing. <i>ACM Computing Surveys</i>. 2013;45(2):1-33. doi:<a href=\"https://doi.org/10.1145/2431211.2431214\">10.1145/2431211.2431214</a>","bibtex":"@article{Attene_Campen_Kobbelt_2013, title={Polygon mesh repairing}, volume={45}, DOI={<a href=\"https://doi.org/10.1145/2431211.2431214\">10.1145/2431211.2431214</a>}, number={2}, journal={ACM Computing Surveys}, publisher={Association for Computing Machinery (ACM)}, author={Attene, Marco and Campen, Marcel and Kobbelt, Leif}, year={2013}, pages={1–33} }","short":"M. Attene, M. Campen, L. Kobbelt, ACM Computing Surveys 45 (2013) 1–33.","mla":"Attene, Marco, et al. “Polygon Mesh Repairing.” <i>ACM Computing Surveys</i>, vol. 45, no. 2, Association for Computing Machinery (ACM), 2013, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/2431211.2431214\">10.1145/2431211.2431214</a>.","apa":"Attene, M., Campen, M., &#38; Kobbelt, L. (2013). Polygon mesh repairing. <i>ACM Computing Surveys</i>, <i>45</i>(2), 1–33. <a href=\"https://doi.org/10.1145/2431211.2431214\">https://doi.org/10.1145/2431211.2431214</a>"},"_id":"60451","department":[{"_id":"969"}],"user_id":"114904","extern":"1","alternative_title":["An application perspective"],"type":"journal_article","status":"public","publisher":"Association for Computing Machinery (ACM)","date_created":"2025-06-30T07:05:12Z","title":"Polygon mesh repairing","issue":"2","year":"2013","language":[{"iso":"eng"}],"publication":"ACM Computing Surveys","abstract":[{"lang":"eng","text":"<jats:p>Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that process, repair, and improve its structure, geometry, and topology to make it appropriate to case-by-case requirements.</jats:p>\r\n          <jats:p>The analysis is focused on polygon meshes, which constitute by far the most common 3D object representation. In particular, this article provides a structured overview of mesh repairing techniques from the point of view of the application context. Different types of mesh defects are classified according to the upstream application that produced the mesh, whereas mesh quality requirements are grouped by representative sets of downstream applications where the mesh is to be used. The numerous mesh repair methods that have been proposed during the last two decades are analyzed and classified in terms of their capabilities, properties, and guarantees. Based on these classifications, guidelines can be derived to support the identification of repairing algorithms best-suited to bridge the compatibility gap between the quality provided by the upstream process and the quality required by the downstream applications in a given geometry processing scenario.</jats:p>"}]}]