DeepSeek R1 Computational Efficiency for Vulnerability Detection in High-Complexity Code

Abstract

Abstract: This report synthesises findings from 3 peer-reviewed papers addressing the following research question: What is the computational efficiency (inference time and memory usage) of Deepseek R1 when detecting vulnerabilities in high-cyclomatic-complexity code versus low-complexity code, as measured on the. 7 claims were extracted from source literature; 7 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.1/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research Question

What is the computational efficiency (inference time and memory usage) of Deepseek R1 when detecting vulnerabilities in high-cyclomatic-complexity code versus low-complexity code, as measured on the Big-Vul benchmark?

Verification Level

Descriptive public verification status only; aggregate claim counts are public, but individual claim records are not exposed here.

Quality Tier

Descriptive public triage only; this tier does not alter current publication or DOI behavior.

Quality Dimensions

Automated triage signals derived from public fields; not human peer review or independent validation.

Correction Record

Public corrections are additive records. Current status does not claim the synthesis is error-free.

Provenance