MétaCan
Menu
Back to cohort
Record W4411436444 · doi:10.1007/978-3-031-87496-3_13

ExploitabilityBirthMark: An Early Predictor of the Likelihood of Exploitation

2025· book-chapter· en· W4411436444 on OpenAlexaff
Kobra Khanmohammadi, Zakeya Namrud, François Labrèche, Raphaël Khoury

Bibliographic record

VenueLecture notes in computer science · 2025
Typebook-chapter
Languageen
FieldComputer Science
TopicSoftware Reliability and Analysis Research
Canadian institutionsUniversité du Québec en OutaouaisSheridan College
Fundersnot available
KeywordsExploitComputer scienceVulnerability (computing)WorkloadComputer securityENCODEData scienceRisk analysis (engineering)Machine learning

Abstract

fetched live from OpenAlex

Abstract In recent years, there has been a steady increase in the number of reported vulnerabilities (CVEs), increasing the workload of organizations trying to update their systems promptly. This underscores the need to prioritize specific critical vulnerabilities over others to effectively prevent cyberattacks. Unfortunately, the current methods available for assessing the exploitability of vulnerabilities have substantial shortcomings. In particular, they often consist in prediction models that encode data that may not be immediately available at the time a vulnerability is first reported. In this paper, we introduce an innovative exploitability prediction method that exclusively uses information accessible at the time of a CVE’s initial publication. Our approach outperforms the most widely used vulnerability exploit prediction algorithms in scenarios where data is subject to the aforementioned limitations.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.013
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0040.002
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.261
Teacher spread0.245 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueLecture notes in computer scienceSame topicSoftware Reliability and Analysis ResearchFrench-language works237,207