{"author":[{"id":"83392","full_name":"Qudus, Umair","orcid":"0000-0001-6714-8729","last_name":"Qudus","first_name":"Umair"},{"full_name":"Pokharel, Neha","first_name":"Neha","last_name":"Pokharel"},{"id":"67199","first_name":"Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","full_name":"Röder, Michael"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}],"publication_identifier":{"isbn":["9783032251558","9783032251565"],"issn":["0302-9743","1611-3349"]},"title":"No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge","year":"2026","status":"public","date_updated":"2026-05-21T11:55:29Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"65670","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-032-25156-5_23","user_id":"83392","citation":{"chicago":"Qudus, Umair, Neha Pokharel, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2026. <a href=\"https://doi.org/10.1007/978-3-032-25156-5_23\">https://doi.org/10.1007/978-3-032-25156-5_23</a>.","short":"U. Qudus, N. Pokharel, M. Röder, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2026.","apa":"Qudus, U., Pokharel, N., Röder, M., &#38; Ngonga Ngomo, A.-C. (2026). No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-032-25156-5_23\">https://doi.org/10.1007/978-3-032-25156-5_23</a>","ieee":"U. Qudus, N. Pokharel, M. Röder, and A.-C. Ngonga Ngomo, “No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2026.","ama":"Qudus U, Pokharel N, Röder M, Ngonga Ngomo A-C. No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2026. doi:<a href=\"https://doi.org/10.1007/978-3-032-25156-5_23\">10.1007/978-3-032-25156-5_23</a>","bibtex":"@inbook{Qudus_Pokharel_Röder_Ngonga Ngomo_2026, place={Cham}, title={No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-25156-5_23\">10.1007/978-3-032-25156-5_23</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Qudus, Umair and Pokharel, Neha and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2026} }","mla":"Qudus, Umair, et al. “No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2026, doi:<a href=\"https://doi.org/10.1007/978-3-032-25156-5_23\">10.1007/978-3-032-25156-5_23</a>."},"publication":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"Ensuring the veracity of assertions is {vital for building reliable and consistent knowledge graphs}. \r\nA variety of automatic fact-checking approaches have been proposed over the past decade. Among these, path-based fact-checking approaches are particularly attractive due to their independence of supplementary external knowledge and their faster runtimes compared to methods reliant on external corpora or embeddings.  \r\nHowever, the effectiveness of these approaches is fundamentally limited by the incompleteness of existing knowledge graphs, which often lack the paths necessary to support or refute assertions. \r\nTo address this limitation, we propose \\system{}, a framework that supplements the knowledge graph with shallow knowledge---automatically extracted RDF assertions from external unstructured sources---even if this additional knowledge may not always fit a well-defined ontology nor be fully verified. By appending such shallow knowledge, we enhance the graph’s coverage and increase the chances of finding relevant evidence for fact checking. Comprehensive experiments on three widely used benchmark datasets demonstrate that integrating \\system{} consistently and significantly enhances the performance of {state-of-the-art path-based fact-checking approaches}, yielding improvements of up to 0.24 in Area Under the Receiver Operating Characteristic Curve (AUROC). These results establish \\system{} as a broadly applicable auxiliary component for improving the reliability and coverage of automatic fact checking in knowledge graphs. Our code is open-source and can be found at \\url{https://github.com/dice-group/ShallKnow}."}],"place":"Cham","date_created":"2026-05-21T11:45:24Z","department":[{"_id":"574"}],"type":"book_chapter","keyword":["fact checking"]}