- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper asks whether a finite window of conformal scores can certify the dependence quantity used in block-conformal coverage bounds. It gives two-point constructions of stationary ergodic processes whose calibration windows have identical laws, but whose dependence functionals or rank-miss probabilities differ (Theorems 2.4–2.7, A.6.8). It also gives a conservative positive route under observed finite-state Markov structure (Theorems A.1–A.2). The constructions are explicit, but the paper has serious problems.
Critical strengths
None
Critical weaknesses
- The authors seem to have used AI irresponsibly. The manuscript contains revision history (“a previous theorem … is withdrawn,” “an earlier version of this statement … is corrected here,” “the retained V3 simulation”). Internal file paths appear in theorem statements and proofs. It uses software-test language (“Nine regressions cover…,” “48 cells … with zero failures”) and includes build notes about the LaTeX style. This suggests the text was generated and revised with little careful human editing. It reduces confidence that the authors have checked the arguments themselves. There was no AI use declaration.
- Very poor clarity. The central results are stated or proved only in the appendix, including the coverage bound (A.4) and the mixing-robust obstruction (A.6.8). The main text is mostly positioning tables, disclaimers and undefined jargon (“information contract,” “premise-matched,” “fail-closed,” “named-data diagnostics certify no premise”). Notation is inconsistent (O_B vs O_n; blocks vs raw scores), and cross-references are broken (two sections numbered A.2; “Proposition A.6.7 in Appendix A.5”).
Questions for authors
None