consists of: • a finite set D (the documents), • a subset A ⊆ D (the active documents), • a forest (D, →) (the child relationship), • a total order (D, ≤) (the chronological order), and • an equivalence relation (D, ∼) (the same-session equivalence). such that: • for every d there is a unique d′ ∈ A such that d ∼ d′, • for every d → e ∼ e′ we have d → e′, and • for every d → e, we have d ≤ e. Definition of Navigation History (1)