Example: A late event without freshness

Let $\Lambda$ be a fair bit known to the encoder. The encoder stores $X_{1+\Lambda }$. Later the query generator outputs $J=1+\Lambda$.

There is no arrow from the query event back to encoding, yet one retained classical bit succeeds with probability one. The common cause $\Lambda$ makes the query predictable. This violates Assumption ass:fresh, not Theorem thm:schedule.