Adversarial Test Case Complexity and DeepSeek R1 Code Robustness on MBXP
Description
This report synthesises findings from 10 peer-reviewed papers addressing the following research question: How does the cyclomatic complexity of adversarial test cases impact the robustness of Deepseek R1's generated code when evaluated using the MBXP benchmark, and can this be quantified by comparing. 6 claims were extracted from source literature; 6 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.5/10. This report is a machine-generated literature synthesis and does not constitute original research.
Research goal: How does the cyclomatic complexity of adversarial test cases impact the robustness of Deepseek R1's generated code when evaluated using the MBXP benchmark, and can this be quantified by comparing pass rates across different complexity thresholds?
Autonomous literature synthesis. Automated review score: 8.5/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(78.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:1ea12ec930ce08b70d76058fbeb66395
|
78.3 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)