Athea, the first graph-based approach for vulnerability affected library identification, is proposed, which models vulnerability databases as a knowledge graph and reformulates the identification problem as knowledge graph completion (KGC).
Abstract
A single vulnerability in a widely used library can cascade through millions of dependent applications, yet more than half of vulnerability database entries contain missing or incorrect affected-library information. Existing automated approaches neglect the relational structure of vulnerability databases, treating identification as an isolated text retrieval problem. In this paper, we propose Athena, the first graph-based approach for vulnerability affected library identification. Athena models vulnerability databases as a knowledge graph and reformulates the identification problem as knowledge graph completion (KGC). It comprises three key modules: a Modeling module that constructs a security knowledge graph integrating CVEs, libraries, CWE weakness types, CPE products, and software ecosystems; a Completion module that applies a modular KGC backbone to predict missing affected libraries for a given CVE via link prediction; and a Re-ranking module that retrieves KGC candidates and rescores them using a fine-tuned LLM augmented with knowledge graph embeddings, jointly leveraging structural and textual information. Our experiments on VulLib demonstrate that Athena significantly outperforms four state-of-the-art baselines, achieving a 32% improvement in Avg. F1 over the best baseline (i.e., VulLibGen). Notably, our KGC backbone with only 110M parameters already surpasses VulLibGen's best configuration at 7B parameters, demonstrating the effectiveness of graph-based modeling; the re-ranking module then provides substantial further gains, consistently outperforming the best baseline across all evaluated LLM backbones.
LibXSub introduces an explainable subgraph generation mechanism that identifies critical call relationships through edge masks and characterizes the contribution of different function feature dimensions to region similarity prediction through node feature masks, demonstrating the effectiveness of the proposed framework...
Dan Yu, Lu Miao, Rong-Sheng Li et al.· Electronics· 0 citations
Results indicate that VulSCG improves detection effectiveness while maintaining scalability, since it complements inter-procedural semantics through compact SummaryNodes rather than full callee graph expansion.
Rui-Guo Hu, Dong-Qi Wang, Shu-Jin Yang et al.· Companion Proceedings of the...· 0 citations
Software vulnerabilities represent an enduring threat to modern cyberspace. Effective vulnerability detection increasingly relies on reasoning about complex program semantics, structural dependencies, and execution behaviors. Consequently, extracting vulnerability-relevant features from code efficiently has become a pr...
Jun-Jie Wang, Tong Yu, Ming Li et al.· Transactions on Graph Intell...· 0 citations
To separate component effects from matcher rewards, CTIForge is built, whose deterministic validation layer can vary while extraction is held byte-identical, and which coincides with a roughly 2.8-fold increase in actions explicitly disputing entity type.
Sensitive attributes such as age, income, and occupation can be inferred from user-generated content by aggregating indirect cues across many ordinary posts. LLM-based profilers can perform this aggregation automatically and with high accuracy, which makes large-scale personal attribute inference a major privacy threat...
Ahmed Sohair Khan, Estrid He, Chenglong Ma et al.· 0 citations
Cybersecurity vulnerability information is distributed across numerous platforms and databases, making it difficult for researchers and practitioners to obtain a unified and structured understanding of existing threats. This is a critical issue in cybersecurity, where timely access to accurate vulnerability information...
Ines Ben Brahim, Mohamed-Amine El Mortaji, Nadav Haddad et al.· 0 citations