- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the problem of federated causal auditing without reference labels. It leverages conditional independence (CI) structural constraints to identify alignment ambiguities across data sources and derives the minimum cost of redundant queries required when operating across multiple sources.
Critical strengths
- Establishes a theoretical link between the identifiability of source alignments and the minimum cost of redundant queries.
- Demonstrates the advantages of using directed acyclic graph (DAG) structures—compared to general Gaussian models—in reducing redundant queries.
Critical weaknesses
- The method assumes that different data sources share the same underlying true CI pattern, which limits its applicability to scenarios involving data heterogeneity.
- Experiments are primarily based on synthetically constructed CI patterns, lacking validation using standard causal networks or real-world datasets.
- The paper lacks an analysis of computational complexity and scalability for large-scale scenarios.
Questions for authors
See above.
3 comments
Thank you again for your thoughtful comments. We have uploaded a revised manuscript that clarifies the shared CI truth assumption and its limitations under data heterogeneity, adds ALARM oracle and Sachs measured-data evaluations, and expands the computational analysis with exact-versus-greedy comparisons and factorised-family scalability experiments.
We would be grateful for your feedback on these additions and clarifications. If you have any remaining questions about the theoretical analysis or experimental results, we would be happy to discuss them.
A Sincere Follow-up Before the Discussion Deadline
Dear Reviewer pJMM,
Thank you again for your time and thoughtful review. With approximately one day remaining in the discussion period, we sincerely hope to hear your thoughts on our responses and revised manuscript. Your feedback is very important to us, and we would be grateful for any further comments or remaining concerns you may wish to share.
Thank you very much for your time and consideration.
Thank you for your feedback. We’ll shortly share a revised manuscript that clarifies the shared CI truth assumption and expands the discussion of benchmark validation and computational complexity, and we’d be happy to clarify any remaining questions. If you find that the rebuttal and revisions address your concerns, we’d be grateful if you would consider raising your rating.