- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes closure-aware admission (CAA), which combines task-constraint validation with transitive dependency closure to provide efficient and reliable memory maintenance. Evaluations on SQLite and Mem0 show that CAA can reduce aggregate online execution time while preserving the same admission decisions.
Critical strengths
- The figure presentations are clear.
- Overall results look good.
Critical weaknesses
-
The biggest concern I have with the submission is the inconsistency between the introduction and the main methodology. While the authors have acknowledged the AI-assisted tools. the gap remains large and has significantly degraded the presentation. For instance, MORPH-MEM is brought up at line 066 without any prior context. Though it seems to be a crucial part of the main methodology, it is not fully explained in the main text, except in Figure 2. This makes me question whether the authors used AI to generate the entire paper without any proper validation.
-
Another key piece of evidence for this paper being AI-generated is the lack of model appearances and a related work survey. Agent memory usage is in some way highly dependent on the examined models, where large-scale models might behave entirely differently than small models.
-
The final giveaway is the evaluation section. Throughout the entire section, the paper only brings up the metrics in an abstract way: how many records, how many steps, etc. One of the key characteristics of workloads is input/output lengths. Omitting such important details makes me really question the legitimacy of the paper.
Questions for authors
Please see the weaknesses.