Athena is a graph-based system that identifies affected libraries for software vulnerabilities by modeling vulnerability databases as a knowledge graph and applying knowledge graph completion. It integrates CVEs, libraries, CWE types, CPE products, and software ecosystems, then predicts missing affected libraries using link prediction and refines results with a fine‑tuned LLM that incorporates graph embeddings. Experiments on the VulLib dataset show Athena outperforms four state‑of‑the‑art baselines, achieving a 32% higher average F1 score and demonstrating that a smaller KGC backbone can surpass larger LLM‑only approaches.
By Phong Trinh Duy, Trang Dang Yen, Hung Nguyen-Huu, Bach Le, Quyet-Thang Huynh, Dieu Hoang Vu, David Lo, Thanh Le-Cong
arXiv:2604. 17948v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have demonstrated remarkable capabilities across various cybersecurity tasks, including vulnerability classification, detection, and patching.
By Parteek Jamwal, Minghao Shao, Boyuan Chen, Achyuta Muthuvelan, Asini Subanya, Boubacar Ballo, Kashish Satija, Mariam Shafey, Mohamed Mahmoud, Moncif Dahaji Bouffi, Pasindu Wickramasinghe, Siyona Goel, Yaakulya Sabbani, Hakim Hacid, Mthandazo Ndhlovu, Eleanna Kafeza, Sanjay Rawat, Muhammad Shafique
JudgeStealer is a query‑efficient framework that extracts the judging capabilities of large language models across pointwise scoring, pairwise comparison, and listwise ranking protocols. It leverages cross‑protocol agreement to convert pointwise scores into higher‑order supervision, dynamically selects informative inputs, and applies score smoothing and multi‑protocol review to preserve ordinal structure and avoid catastrophic forgetting. Experiments show it outperforms existing baselines, achieving up to 73.3% accuracy on pointwise, 87.0% on pairwise, and 71.6% on listwise evaluation, while remaining robust against common extraction defenses.
By Chen Chen, Yaolin Chen, Xuehan Sun, Juan Lin, Xueluan Gong, Yuhang Zheng, Qian Wang, Kwok-Yan Lam
arXiv:2510. 06732v2 Announce Type: replace-cross Abstract: Large language models (LLMs) are increasingly used as rerankers in information retrieval, yet their ranking behavior can be steered by small, natural-sounding prompts.
By Tiancheng Xing, Jerry Li, Yixuan Du, Xiyang Hu
arXiv:2606. 15123v1 Announce Type: cross Abstract: We study the task of CVE-conditioned exploit generation, where a model drafts proof-of-concept (PoC) exploits given software vulnerability context.
By Yiwei Chen, Lichi Li, Kai Cheung, Vinny Parla, Ganesh Sundaram
The paper presents a framework for translating natural‑language queries into Kusto Query Language (KQL) using small language models (SLMs). It introduces lightweight retrieval, error‑aware prompting, LoRA fine‑tuning with rationale distillation, and a two‑stage architecture that pairs an SLM drafter with a low‑cost LLM judge. Evaluations on Microsoft’s NL2KQL Defender dataset show the two‑stage approach achieving high syntax and schema‑valid accuracy while dramatically reducing cost compared to larger LLM baselines.
By Saleha Muzammil, Rahul Reddy, Vishal Kamalakrishnan, Hadi Ahmadi, Wajih Ul Hassan