- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
RootCert limits each authenticated writer to one bounded contribution during answer aggregation. Under its selection assumptions, it certifies that an answer remains unchanged after appends from a bounded number of writers.
Critical strengths
- Counting writers addresses a practical weakness of record-based attack budgets. Splitting one malicious submission into many records does not increase the declared budget.
- The paper explains why grouping after passage-level retrieval can invalidate the guarantee. The stable-selection result connects the threat model to the final certificate.
- The replication experiment separates record volume from principal count. The adaptive attack also examines behavior outside the certified set.
Critical weaknesses
- RobustRAG [1] already establishes the isolate-then-aggregate framework. Could a simpler variant retain one record per principal before applying the same bounded aggregation rule? Compare this variant with convex pooling.
- The main experiments freeze the candidate buffer, while corpus-wide certification requires an exposure bound that holds for every allowed append. How can this bound be computed for a mutable retrieval index? Please demonstrate a full-corpus implementation that retains a useful certificate.
- The main experiment treats Wikipedia pages as immutable anchors and assigns synthetic IDs to attack records. Could the authors evaluate a corpus where benign records are also grouped by their actual contributors? This would test whether certification remains useful when many relevant passages come from one writer.
[1] Certifiably Robust RAG against Retrieval Corruption.
Questions for authors
See Weaknesses.