- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Executable Memory with Authenticated Runtime Admission (EMARA), which is an architecture for using persistent, authority-bearing rules in tool-using agents. The motivation is that an LLM often nominates a bounded set of registered program handles, while a trusted runtime checks current state and produces authenticated certificates specifying permitted effects. The authors introduce MemBind-Bench. Additional experiments examine nomination, execution, verification, credential protection, and authority lifetime.
Critical strengths
S1. The paper addresses a relevant practical problem. Honestly, distinguishing retrieved information from permission to execute an action is important for agents.
S2. The paper is well written to some extent, though it is too concise to be a main track submission.
Critical weaknesses
W1. The introduction moves quickly from the general problem to the proposed architecture and headline results, without sufficiently discussing what existing executable-memory and runtime-security approaches cannot already provide. Section 2 talks about some related work, but the distinction is mostly stated rather than demonstrated.
W2. The evaluation is varied within one construction, but its external validity remains limited. Although MemBind-Bench includes five families and three dialogue sources, the policies and final requests are controlled interventions, every case has a 16-candidate bank, and the required program set contains only one or two targets.
W3. Several material details remain unresolved in the supplied manuscript. The presentation is way too much compressed in places where more specificity is needed. The abstract also claims controlled studies of request wording and backbone choice, but those results are not presented in the submitted main text.
Questions for authors
-
What capability or guarantee does EMARA add beyond a simpler runtime using the same registered policies, authenticated state, deterministic action construction, and complete request-time authorization?
-
How are registered programs and state adapters produced and audited? Please provide one end-to-end example distinguishing general runtime logic, family-specific implementation, and benchmark-specific construction.
-
Other questions please refer to the weaknesses.