<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Graphs for Hybrid LLM-Graph Reasoning on Vulnerabilities</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Julio Vizcarra</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuta Gempei</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yanan Wang</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Takamasa Isohara</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mori Kurokawa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>KDDI Research</string-name>
          <email>yu-genpei@kddi.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Japan</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <fpage>2</fpage>
      <lpage>6</lpage>
      <abstract>
        <p>In cybersecurity, the threat landscape is composed of complex relations among security data and constantly evolves. To address this challenge, this paper presents a framework for constructing and reasoning over cybersecurity knowledge graphs (KGs) derived from vulnerability reports. Our approach analyzes textual content and structured data sources. To enhance causal reasoning, we explicitly model key causal factors as structured entities and relationships. The resulting KG is further enriched through augmentation using DBpedia, integrating external knowledge to enhance connectivity and context. We evaluate the impact of this augmentation through a comparison, contrasting the content of the original and the augmented graphs. Experimental results demonstrate that the Graph-LLM approach, with augmentation, enhances link prediction and produces higher-quality Question Answering (QA) compared to using report descriptions alone. We demonstrate a hybrid reasoning setup integrating LLM-based language understanding with graph inference to answer cybersecurity queries.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge graph</kwd>
        <kwd>text mining</kwd>
        <kwd>causality</kwd>
        <kwd>LLM</kwd>
        <kwd>cybersecurity vulnerabilities</kwd>
        <kwd>DBpedia</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Cybersecurity is a specialized domain where analysts must interpret vast, evolving data to detect threats,
understand vulnerabilities, and respond appropriately [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Knowledge graphs (KGs) have emerged
as an efective tool for modeling this structured information, providing a semantic foundation for
threat analysis, attack attribution, and decision-making [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Despite their advantages, constructing and
maintaining cybersecurity knowledge graphs is resource-intensive, and automated methods are still in
development [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Large language models (LLMs) excel at natural language understanding and entity
extraction but struggle with precise symbolic reasoning and complex graph operations like multi-hop
inference and causal chaining [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In contrast, graph-based reasoning is highly efective at traversing
causal and semantic relationships, which are critical for cybersecurity tasks such as attack path analysis
and threat correlation [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The combination of LLMs’ natural language understanding with structured
graph reasoning can ofer a powerful hybrid solution, leveraging the strengths of both paradigms [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <sec id="sec-1-1">
        <title>1.1. Our Approach</title>
        <p>
          To address the challenges outlined above, we propose a hybrid framework that combines strong language
understanding of LLMs with the semantic expressiveness of knowledge graphs for cybersecurity threat
understanding. To this end, the KG is first constructed by analyzing structured and unstructured
data to discover associations in vulnerability reports CPE [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], CVE [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], and CWE [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], where CPE
identifies afected products and versions, CVE denotes specific vulnerabilities in software and hardware,
and CWE classifies the underlying weakness types. We also introduce a causal modeling schema
that explicitly represents causal elements, enhancing the ability of the graph to support cause-efect
reasoning. To improve coverage and semantic extension, we augment the KG using DBpedia [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ],
enriching it with background knowledge (DBpedia resources) and semantic relations (ontological terms).
This augmentation improves connectivity and enables higher-quality inference. Experiments show the
        </p>
        <p>CEUR</p>
        <p>ceur-ws.org
augmented Graph-LLM improves link prediction and Question Answering (QA) quality over report
descriptions alone. Finally, we present a hybrid pipeline that integrates LLM outputs with KG inference
to answer cybersecurity queries, thereby enhancing reasoning through knowledge graph retrieval.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>The methodology depicted in Fig. 1 comprises several steps grouped into pipelines: 1) text mining
extracts content from the text descriptions, 2) KG creation builds the KG combining structured data and
content from the text mining, and 3) KG exploitation performs reasoning on the KG created. For LLM
processing, we used LLaMA 3.3 70B instruct model [11].</p>
      <p>1. Text mining.
2. The KG construction.</p>
      <p>a) In pre-processing, vulnerability reports are retrieved, parsed, and cleaned.
b) Rule patterns and the syntactic tree. This process is used to identify concepts and
relationships. It is performed as a fallback option of LLM entity extraction.
c) Co-reference resolution is computed to extract the reference for the same entity in the text.
d) Entity extraction. This process is handled by the LLM, which identifies causal factors:
entities, relationships, states, actors, objects, and properties.
e) Acronym resolution is performed using specialized dictionaries and LLM knowledge.
f) The KG construction organizes the data collected through text mining into a raw graph (i.e.,
a graph without Resource Description Framework (RDF) notation [12]).
g) The KG reshaping converts the raw graph into an RDF graph [13], which is a foundational
data model for representing knowledge as triples. The KG is based on a schema (ontology).
h) The graph is augmented using concepts and relations from DBpedia. The LLM selects the
most appropriate concept during expansion to create coherent graph excerpts.</p>
      <p>i) The graph created is stored in a Virtuoso open-source triple store [14].
3. KG exploitation.</p>
      <p>j) In the KG retrieval step. SPARQL queries [15] retrieve content from the KG stored in the
triple store based on the user request using multi-hop expansion.
k) The graphs retrieved are encoded into text for the LLM’s processing.</p>
      <p>l) The LLM hybrid reasoning combines graph data and the user query to perform reasoning. .</p>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental results</title>
      <sec id="sec-3-1">
        <title>3.1. Knowledge Graph Creation and Augmentation</title>
        <p>An example of knowledge graph creation and augmentation is presented. A graph excerpt derived from
structured information and its augmentation is presented in Fig. 2. The main elements of the graph
created are highlighted.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. LLM-Graph Reasoning and Exploitation.</title>
        <p>A response generated by LLM–graph reasoning is shown in Table 1. In this hybrid approach, the LLM
analyzes the user query alongside the graph content retrieved based on terms from the question. The
ifrst row presents the result of the LLM reasoning using only plain text (i.e., the report description). In
contrast, the graph-LLM response includes versions connected to this report.</p>
        <p>Additionally, the visualization of the KG exploitation is depicted in Fig.3. Once the query is entered,
the user can select a specific vulnerability report (CWE, CVE, or CPE) to perform the reasoning. The
user can define the number of hops to expand the query and choose whether the expansion includes
conceptual relations or only directly related reports.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Evaluation</title>
        <p>We measured new relation discovery after KG augmentation using link prediction with AmpliGraph
[16]. On the CWE subgraph, TransE, ComplEx, and DistMult [13] were evaluated; ComplEx performed</p>
        <p>Reasoning result
Ground truth answer: In the Web GUI.</p>
        <p>Graph-LLM answer: Based on the graph data, the issue is located in the
Web GUI of Extreme Networks EXOS versions before v.22.7 and before v.30.2.</p>
        <p>The problem stems from the failure of the Web GUI to restrict URL access,
allowing attackers to access sensitive information or escalate privileges.
best, and the KG with text mining content (no DBpedia) achieved the highest results (Table 2). The
augmented KG showed low performance because the LLM struggled with KG excerpt selection; that
is, it chose an incorrect meaning for the expanded concept on DBpedia, adding noise and negatively
afecting link prediction. Using a diferent LLM that handles this task better might improve performance.</p>
        <p>In addition, the quality of the responses was measured by Gemma 3 27B model [17] with a multi-hop
expansion of 5 levels. LLM with ground truth refers to answers derived from the text descriptions in
vulnerability reports. In contrast, Graph LLM responses are generated using hybrid reasoning. In the
evaluation, Graph LLM produced showed the best performance (Table 3).</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions and Future Work</title>
      <p>This poster presents a hybrid framework for cybersecurity threat reasoning that combines automatically
constructed knowledge graphs with the reasoning capabilities of large language models (LLMs). The
framework created graphs that represent causal factors and was enriched through DBpedia
augmentation. To overcome LLM limitations in complex graph operations, we developed a dedicated subgraph
extraction process. This module lets LLMs handle language comprehension and logical reasoning, while
the graph module performs structured inference. Together, this hybrid pipeline provides a scalable
and interpretable solution for addressing complex cybersecurity queries, with potential applications
extending beyond this domain. As a practical application, the proposed visualization system provides a
tool for QA analysis. As part of our future work, we plan to evaluate additional queries and scenarios.</p>
    </sec>
    <sec id="sec-5">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used GPT-4 in order to: Grammar and spelling check.
After using these tool(s)/service(s), the author(s) reviewed and edited the content as needed and take(s)
full responsibility for the publication’s content.
[11] AI@Meta, Llama 3 model card (2024). URL: https://github.com/meta-llama/llama3/blob/main/</p>
      <p>MODEL_CARD.md.
[12] S. Decker, S. Melnik, F. Van Harmelen, D. Fensel, M. Klein, J. Broekstra, M. Erdmann, I. Horrocks,</p>
      <p>The semantic web: The roles of xml and rdf, IEEE Internet computing 4 (2000) 63–73.
[13] V. Bonstrom, A. Hinze, H. Schweppe, Storing rdf as a graph, in: 2003 First Latin American Web</p>
      <p>Congress, IEEE, 2003, pp. 27–36.
[14] OpenLink Software, Virtuoso Open-Source Edition, https://virtuoso.openlinksw.com/, 2024.
Accessed: 2025-05-01.
[15] B. DuCharme, Learning SPARQL: querying and updating with SPARQL 1.1, ” O’Reilly Media, Inc.”,
2013.
[16] L. Costabello, A. Bernardi, A. Janik, A. Creo, S. Pai, C. L. Van, R. McGrath, N. McCarthy, P. Tabacof,
AmpliGraph: a Library for Representation Learning on Knowledge Graphs, 2019. URL: https:
//doi.org/10.5281/zenodo.2595043. doi:10.5281/zenodo.2595043.
[17] G. Team, Gemma 3 (2025). URL: https://goo.gle/Gemma3Report.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Syafrizal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Selamat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Zakaria</surname>
          </string-name>
          ,
          <article-title>Analysis of cybersecurity standard and framework components</article-title>
          ,
          <source>International Journal of Communication Networks and Information Security</source>
          <volume>12</volume>
          (
          <year>2020</year>
          )
          <fpage>417</fpage>
          -
          <lpage>432</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L. F.</given-names>
            <surname>Sikos</surname>
          </string-name>
          ,
          <article-title>Cybersecurity knowledge graphs</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>65</volume>
          (
          <year>2023</year>
          )
          <fpage>3511</fpage>
          -
          <lpage>3531</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Obraczka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Saeedi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Köpcke</surname>
          </string-name>
          , E. Rahm,
          <article-title>Construction of knowledge graphs: Current state and challenges</article-title>
          ,
          <source>Information</source>
          <volume>15</volume>
          (
          <year>2024</year>
          )
          <fpage>509</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Patil</surname>
          </string-name>
          ,
          <article-title>Advancing reasoning in large language models: Promising methods and approaches</article-title>
          ,
          <source>arXiv preprint arXiv:2502.03671</source>
          (
          <year>2025</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yen</surname>
          </string-name>
          , P. Liu,
          <string-name>
            <given-names>R. F.</given-names>
            <surname>Erbacher</surname>
          </string-name>
          ,
          <article-title>Automate cybersecurity data triage by leveraging human analysts' cognitive process, in: 2016 IEEE 2nd International Conference on big data security on cloud (BigDataSecurity), IEEE International Conference on high performance and smart computing (HPSC), and IEEE International Conference on intelligent data and security (IDS)</article-title>
          , IEEE,
          <year>2016</year>
          , pp.
          <fpage>357</fpage>
          -
          <lpage>363</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          , Y. Liu,
          <article-title>Integrating graphs with large language models: Methods and prospects</article-title>
          ,
          <source>IEEE Intelligent Systems</source>
          <volume>39</volume>
          (
          <year>2024</year>
          )
          <fpage>64</fpage>
          -
          <lpage>68</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <article-title>[7] National Institute of Standards and Technology</article-title>
          , CPE: Common Platform Enumeration, https: //nvd.nist.gov/products/cpe,
          <year>2024</year>
          . Accessed:
          <fpage>2025</fpage>
          -05-15.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <article-title>[8] The MITRE Corporation, CVE: Common Vulnerabilities</article-title>
          and Exposures, https://cve.mitre.org,
          <year>2024</year>
          . Accessed:
          <fpage>2025</fpage>
          -05-15.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>The</surname>
            <given-names>MITRE Corporation</given-names>
          </string-name>
          , CWE: Common Weakness Enumeration, https://cwe.mitre.org,
          <year>2024</year>
          . Accessed:
          <fpage>2025</fpage>
          -05-15.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          , G. Kobilarov,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cyganiak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ives</surname>
          </string-name>
          ,
          <article-title>Dbpedia: A nucleus for a web of open data</article-title>
          , in: international semantic web conference, Springer,
          <year>2007</year>
          , pp.
          <fpage>722</fpage>
          -
          <lpage>735</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>