Compute-Bounded Security Assurance - Coverage, Verification, and Response under Resource Constraints
Read the original on arXiv AI →The paper introduces a resource‑constrained framework that distinguishes between repeated success, unique coverage, accepted evidence, and operational protection in security assurance tasks. It derives formulas for coverage under repeated, conditionally independent attempts, shows that pairwise outcome correlation does not necessarily limit coverage, and links coverage to evidence checking, scoring, resource accounting, and response modeling. The authors propose a defensive architecture separating evidence analysis, adjudication, and operational authority, and outline an evaluation protocol with held‑out tasks and uncertainty reporting.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.