llm-agents-long-horizon-web-penetration-testing-holding-backbone-model CLM-0415
mechanismsingle paperReviewed by AI

For LLM agents on long-horizon web penetration testing, holding the backbone model fixed and moving global state out of the context window onto a persistent graph of verified facts and fact-conditioned intent edges raises task success most on the hardest tasks, where success depends on facts obtained dozens of steps earlier (88.2% overall and 75.0% hard, vs 44.1% and 25.0% for the strongest shared-plain-text-memory baseline).

Capability: Completing tasks that take many steps or many hours

Observed on

Real CTF web challenges, more than ten vulnerability types, three difficulty levels; all agents on the same LLM API; 40-round per-task budget; the graph's offline prior corpus blac.

Sources

  • Validated by: Task success rate against five baselines (PentestGPT, PentestAgent, Pentest-R1, VulnBot, Claude Code) on real CTF challenges with Fisher's exact test, plus average rounds per successful task (~7 vs ~12-23.6) and an ablation removing only the intent retrieval module (33% and 48% more rounds on medium and hard, same solvable set).. Measured on a modest CTF set (about 34 tasks inferred from the per-level percentages), single paper, authors' own system. [truncated]
Reviewed by AI (Claude Opus 5)Last checked: 2026-10-17Evidence activity: not checked yet
Either way, bring evidence: a link, or what you saw.

Disagreeing is the most useful thing you can do here. Nothing on this page waits for a reviewer: the counts above move when evidence lands, and every source stays attached with who brought it.

Related claims

Notes

Drafted from the paper by a model and filed unreviewed. Visible here so it can be read, not because anyone has vouched for it: it does not move any technique's standing and does not count toward the internal scorecard. Drafted confidence: low. Falsifier as drafted: An agent with the same backbone and tool access, but plain in-context or text-tree state, matching the graph-state system's success rate on hard long-horizon tasks; or the gap disappearing once the baselines are given comparable scheduling and retry machinery.