Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2025
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2025
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2025
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2025
License: CC BY
Data sources: Datacite
https://dx.doi.org/10.48550/ar...
Article . 2025
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2025
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2025
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2025
License: CC BY
Data sources: Datacite
DBLP
Preprint . 2025
Data sources: DBLP
versions View all 7 versions
addClaim

Hound: Relation-First Knowledge Graphs for Complex-System Reasoning in Security Audits

Authors: Bernhard Mueller;

Hound: Relation-First Knowledge Graphs for Complex-System Reasoning in Security Audits

Abstract

Hound is a graph-based audit agent that improves system-level reasoning across interrelated components in complex codebases. Instead of relying on broad file chunks or language-specific tooling, Hound builds flexible, analyst-defined knowledge graphs (e.g., monetary/value flows, authentication/authorization roles, call graphs, invariants) with compact annotations. Investigations are planned in two phases: a Coverage sweep to quickly map components, then an Intuition/Saliency phase that targets high-impact, contradiction-rich leads. A persistent belief system tracks hypotheses with explicit evidence and confidence, while a QA Finalizer reviews high-confidence items over full source context to confirm or reject findings. On a five-project subset of ScaBench, Hound raises micro recall and F1 over a baseline LLM analyzer (recall 31.2% vs. 8.3%; F1 14.2% vs. 9.8%) at a modest precision trade-off typical of exploratory audits. Gains stem from relation-first graphs that enable exact, cross-component retrieval and a disciplined hypothesis lifecycle. The artifact includes code, graph builders, benchmark harnesses, and scripts to reproduce tables and HTML reports.

Keywords

FOS: Computer and information sciences, Cryptography and Security, security, Machine Learning (cs.LG), Machine Learning, Artificial Intelligence (cs.AI), Artificial Intelligence, Computer security, Machine learning, Knowledge graphs, Security, Programming Languages, Code analysis, Cryptography and Security (cs.CR), Computer Security, Programming Languages (cs.PL)

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green