- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Existing memory pipelines still face two difficulties in addressing these challenges. First, they leave relationships among observations of the same event implicit, requiring the answering model to reconstruct these relationships from scattered evidence. Second, they retrieve multiple facts conveying the same information when selection relies primarily on similarity, leaving less of the retrieval budget for complementary evidence. The authors propose OpCtx, a memory architecture connecting online event organization with question-conditioned evidence reading to address the challenges .
Critical strengths
S1: The method has strong empirical results across 3 benchmarks. Consistent gains over baselines on multi-hop (73.76% vs Mem0's 69.50% on LoCoMo) and temporal (83.18% vs 78.82%) questions. S2: Clean ablation design. The ablation (Full/w-o Reader/w-o Selector/w-o Online) with shared frozen Writer facts enables clean attribution. The component isolation is convincing. S3: The paper is clearly written and easy to follow. The figures are well-presented, and the overall pipeline is clearly designed.
Critical weaknesses
W1: One of the issues raised in the paper is the limited retrieval budget and suboptimal reranking. However, the experiments do not compare different reranking methods. Instead, they compare many end-to-end approaches. There is no comparison of rerankers such as MMR, cross-encoder, and greedy under the same candidate pool, reader, and budget, nor are there any budget–performance curves. Therefore, it remains unclear whether min-max selection truly outperforms existing methods. A direct comparison under controlled conditions would help strengthen this claim. W2: The paper's proposed approach to "scattered memories and cross-session evidence organization" has already been extensively explored in existing solutions, such as episodic memory, temporal knowledge graphs (KGs), and multi-hop RAG. The lack of mechanism-level comparison makes the proposed method appear as a recombination of existing modules, which weakens the perceived novelty of the core contribution. W3:The claimed advantages of the proposed "online event view" are not substantiated. The paper lacks analysis of temporal evolution, update latency, and noise in event extraction. Furthermore, the fact that removing the Online component leads to better performance in certain ablation settings raises questions about whether the dynamic mechanism is truly necessary.
Questions for authors
Q1: How does the event view count scale with session count on MemEye? Q2: Why does w/o Online improve MemEye Y3? Q3: See in weakness.
4 comments
Follow-up on Our Rebuttal
Dear Reviewer,
Thank you again for your time and thoughtful review. We have responded to all your questions and concerns and provided additional experimental results. As the rebuttal period draws to a close, we would greatly appreciate your feedback and would be happy to clarify any remaining concerns. If our responses and additional results help resolve your concerns, we would be very grateful if you could reconsider your overall assessment.
We also noticed that “Flag for Ethics Review” was marked “Yes,” although no specific ethical concerns were mentioned in the review. Could you kindly double-check whether this selection was intended? If so, we would greatly appreciate further clarification so that we can address any concerns appropriately.
Dear Reviewer,
Thank you again for your time and consideration. With less than 30 hours remaining in the rebuttal period, we would be very grateful if you could review our responses and additional experimental results and share any further feedback. We would be happy to address any remaining concerns before the deadline.
Thanks for your response and additional experiments and I will keep my score.
Response to Reviewer mJaW: Controlled Comparisons and Event Organization
We sincerely thank the reviewer for the thoughtful comments and for recognizing our empirical results and controlled ablations. Your suggestions help us clarify the mechanism-level contribution and make the relevant experimental evidence easier to locate.
W1. Controlled selection comparisons and budget–performance curves
The main tables compare complete memory architectures. Appendix C.5, Table 11 compares selectors on MemEye with the same candidate pool, 30-fact limit, character ceiling, Reader, and QA settings, without model reranking:
This matched comparison gives OpCtx a 6.47-point advantage over MMR. Figure 3 and Appendix C.4 report budget–performance curves over final fact limits of 5–25 on LoCoMo and 10–50 on MemEye, without a reranker on MemEye. Both report QA performance and input tokens with memory, Reader rules, models, and prompts fixed.
Removing Qwen reranking on LoCoMo while keeping 20 final facts gives 80.06% accuracy with Selector and 77.40% without it, supporting Selector's independent contribution. We will highlight these controls and budget curves in the main text.
W2. Relationship to episodic memory, temporal KGs, and multi-hop RAG
We agree that structured, cross-session memory has substantial prior work. Our comparisons include HyperMem, HippoRAG 2, and Mem0. OpCtx couples evolving event views and evidence-preserving storage with budgeted selection and question-conditioned reading.
Event organization. HyperMem organizes topics, episodes, and facts in a hypergraph and updates topic summaries. OpCtx maintains typed event views over immutable source facts: members must describe the same occurrence, a continuing process, or an explicit state-update chain; a shared topic or entity is insufficient. Each view links claims to supporting fact IDs. Membership and claims evolve while original observations, including earlier and later visual states, remain unchanged.
Selection and reading. Visual observations may share an object or topic yet differ in relevant attributes or temporal states. OpCtx retains object anchors in attribute-specific queries, prioritizes query-term coverage, and balances normalized retrieval utilities within the evidence budget. Reader organizes selected facts, session summaries, and supported event claims for counting, temporal ordering, and comparison, including a claim only when all its supporting facts are selected.
Table 11 directly tests Reader: with identical facts, summaries, and event claims, OpCtx Reader scores 47.44%, versus 41.64% for a generic reasoning Reader. MemEye uses no model reranking. We will clarify the differences in grouping criteria, update units, selection objectives, and evidence construction.
W3 / Q2. Online event views and the Y3 result
The Y3 aggregate scores 44.79% with Online and 52.08% without it. Table 8 localizes this decline to X4Y3: Full scores 28.85%, versus 50.00% without Online. In the other three Y3 subcategories, Full matches or exceeds the corresponding scores without Online. Across all MemEye questions, Online improves the score from 37.47% to 47.44%.
Your observation about X4Y3 also helped us identify a limitation. We appreciate you pointing this out. These questions concern fine visual changes whose descriptions can be lengthy. Our inspection indicates that additional context introduced by Online competes with these descriptions within the evidence budget, displacing useful details. X4Y3 contains only 26 questions, so changes in a few answers noticeably affect the category score. We will clarify this limitation and prioritize detail preservation during selection and reading in future work.
Q1. How event-view count grows with session count
Section 3.2 and Appendix E.1 distinguish view count from evidence accumulated within a view. Create adds a view connecting current and historical evidence. Extend adds current evidence while retaining existing members, without increasing the view count. Repeated observations of the same event accumulate within a view; newly identified cross-session event relationships can create new views.
Updates retrieve historical facts and active views from the observed prefix and revise only the affected views and embeddings. Each update allows at most 8 operations, with at most 24 member facts per operation, so it can introduce at most eight new views. View growth depends on the mix of newly identified and continuing events, rather than a fixed number of views per session. Before committing an update, OpCtx checks source-reference visibility, claim-support membership, and operation validity. We will clarify these growth and update rules in the paper.