Whether the event at a position belongs in the output at a given complexity.
The test is at(...path) < complexity, and because the draw is fixed by the
position, the selected set grows monotonically with complexity: for any
c1 < c2 the events at c1 are a subset of the events at c2 over the same
seed and the same path space. Complexity 0 selects nothing and complexity 1
selects everything.
Whether the event at a position belongs in the output at a given complexity.
The test is
at(...path) < complexity, and because the draw is fixed by the position, the selected set grows monotonically with complexity: for anyc1 < c2the events atc1are a subset of the events atc2over the same seed and the same path space. Complexity 0 selects nothing and complexity 1 selects everything.