# Reading guide

Read the two complexity directions separately. Identify the input encoding,
the branching-surface reduction, the normal-coordinate certificate and each
operation performed on interval pairings. Track whether the running time is
measured in the interval size or its binary length.

For each elementary move, record its domain, its effect on orbit equivalence and
which endpoint coordinates it retains. For the weighted extension, specify the
output representation and the weight invariant. In the normal-surface
applications, record the boundary and orientability hypotheses.

The roadmap indexes the complete supplied TeX. Only its explicitly curated
proof-dependency edges have a classified role; other references remain candidates.
The paper uses custom proof macros, so this is not an exhaustive proof graph.
The source is arXiv v2 of 10 July 2004. Its dynamic PDF date does not identify the
submission date. The journal edition has not been fully collated.
