---
slug: oip-catalogue-traversal
title: The Catalogue: Traversal
canonical: https://miscsubjects.com/a/oip-catalogue-traversal
---

# Traversal

7. Traversal: how the Venn points fall out

Your convergence score, computable over the graph, operationalizes A₇:

```
convergence(pattern) =
      (number of distinct domains it recurs across)
    × (weight for the LOWEST claim-tier present; T0 heavy, T5 ~zero)
    × (derivation-independence of its recurs-with edges)
    ÷ (1 + number of unanswered `contradicts` edges)
```

- **Rank descending.** The top of the list is your load-bearing spine (§3.1, §3.2, §3.3–3.4, §3.5, §3.10 will dominate — mostly T0–T1, spanning every domain).
- **The T4/T5-heavy nodes** (the lineage in §4, teleology §3.22, the anthropic node §3.21) sit lower by design. They are meaning, not proof. Keeping them *visible but low* is the whole discipline.
- **A node with unanswered `contradicts` edges is penalized, not hidden.** That denominator is what makes the graph a truth instrument rather than a hall of mirrors.

##

---

## Corpus map
- Catalogue hub: [Convergence Catalogue — Public Article](/a/oip-convergence-public-article)
- Nodes: [C01](/a/oip-node-c01-gradient-dissipation-far-from-equilibrium-order) · [C02](/a/oip-node-c02-least-action-variational-principles) · [C03](/a/oip-node-c03-symmetry-conservation) · [C04](/a/oip-node-c04-symmetry-breaking-bifurcation) · [C05](/a/oip-node-c05-criticality-edge-of-chaos-power-laws) · [C06](/a/oip-node-c06-information-entropy-compression) · … (25 nodes)
- Edge series: [Convergence 1](/a/oip-convergence-edge-1) · [Disconfirming 1](/a/oip-disconfirming-edge-1)
