- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper investigates what authorization state an agent system must retain under revocable delegation. Its core observation is that two delegation histories can produce identical current permissions and reachability while requiring opposite decisions after the same revocation. The authors formalize this with Myhill–Nerode residual classes, give a rate–distortion lower bound on error under an information constraint, and introduce a paired benchmark ResidualAuth.
Critical strengths
The motivating example in Figure 1 is clear and the underlying point is meaningful. The pair-complete accuracy metric is a good design choice and the statistical testing rigor is good.
Critical weaknesses
The main text is extremely difficult to follow. Nearly every result is qualified with disclaimers about what it does not show. Several distinct protocols are introduced with little setup, relying on a "contract" in Appendix F which breaks self-containment of the main text, and important definitions (the selected-lineage contract, the deletion-sensitive design) are used as defined terms throughout but only summarized weakly in main text. From the main text alone it is hard to identify the primary empirical claim or how the studies fit together.
My below weaknesses are based off of my best interpretation of the main text.
The headline empirical results seem tautological. When a security layer supplies the correct Allow/Deny decision in context the model yields near-perfect accuracy. This reduces to either a study of whether the model trusts the security layer (potentially interesting and unexplored in main text) or whether the model can properly manage its context to recite the in-context answer (seemingly trivial). The hard gate is defined as E = A·Y, so its blocking every unauthorized effect follows by definition. Much of Figure 2 and the abstract is devoted to these outcomes.
The theory and experiments are disconnected. The paper states that token caps do not correspond to the information budget in Theorem 3, so the experiments do not test any of the bounds. The theoretical contribution itself relies on fairly standard tools and the main text does not make clear what is technically new beyond applying these to delegation graphs.
The empirical scale is small, with 16 pairs per cell for the main interface results and single seeded runs. When considering that the pairs come from fixed constructions the effective sample size is probably even smaller.
In general the figures are overly AI-styled. Figure 2 panel c is a whole quadrant of the figure that displays exactly two numbers. As noted above part d derives from the definition. Spacing of the legend and the titles would benefit readability. It's also not clear why certain figures only show certain models but not others, e.g. Figure 2 vs Figure 3.
Questions for authors
What do the authors consider the main technical contribution and how does it go beyond prior work on delegation and revocation?
In what ways is the empirical result counterintuitive or surprising beyond enacting the policy of a security layer?