The path from t's root to node σ L [1] is called the spine of t. • Every node of t not in the spine is a dependent of some node in the spine.
our novel dynamic oracle algorithms rely on arguably more complex structural properties of computations, which are computed through dynamic programming.