Unexecuted graph and classical benchmark checks

A common-cause query as in Example ex:predictablequery can pass the late-query graph check. That is intentional: the code does not confuse absence of backwards reachability with statistical freshness.

Likewise, Example ex:dense can pass a path-separator test while invalidating a one-qubit resource description. The graph checker does not certify the state factorization.