{"slug":"oip-catalogue-traversal","title":"The Catalogue: Traversal","body":"# Traversal\n\n7. Traversal: how the Venn points fall out\n\nYour convergence score, computable over the graph, operationalizes A₇:\n\n```\nconvergence(pattern) =\n      (number of distinct domains it recurs across)\n    × (weight for the LOWEST claim-tier present; T0 heavy, T5 ~zero)\n    × (derivation-independence of its recurs-with edges)\n    ÷ (1 + number of unanswered `contradicts` edges)\n```\n\n- **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).\n- **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.\n- **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.\n\n##\n\n---\n\n## Corpus map\n- Catalogue hub: [Convergence Catalogue — Public Article](/a/oip-convergence-public-article)\n- 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)\n- Edge series: [Convergence 1](/a/oip-convergence-edge-1) · [Disconfirming 1](/a/oip-disconfirming-edge-1)","register":"oip_protocol","tags":["philosophy","oip","catalogue","systems-theory"],"category":null,"style":{},"claims":[{"id":"c1","text":"The convergence score is computable over the graph and operationalizes A₇.","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Defines the core mechanism for ranking nodes in the convergence catalogue."},{"id":"c2","text":"convergence(pattern) equals (number of distinct domains it recurs across) multiplied by (weight for the LOWEST claim-tier present; T0 heavy, T5 ~zero) multiplied by (derivation-independence of its recurs-with edges) divided by (1 + number of unanswered `contradicts` edges).","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Provides the exact mathematical definition of the convergence score used for traversal and ranking."},{"id":"c3","text":"Nodes are ranked descending so that the top of the list forms the load-bearing spine consisting of sections §3.1, §3.2, §3.3–3.4, §3.5, §3.10 which are mostly T0–T1 and span every domain.","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Specifies the ranking procedure and identifies which nodes dominate the ordered list."},{"id":"c4","text":"T4/T5-heavy nodes such as the lineage in §4, teleology §3.22 and the anthropic node §3.21 sit lower by design because they represent meaning rather than proof.","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Explains the deliberate placement of interpretive nodes in the ranked output."},{"id":"c5","text":"A node with unanswered `contradicts` edges receives a penalty in the score but is not hidden.","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Describes the handling of disconfirming edges in the convergence calculation."},{"id":"c6","text":"The denominator term (1 + number of unanswered `contradicts` edges) makes the graph function as a truth instrument rather than a hall of mirrors.","section":"# Traversal","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"States the purpose of the penalty mechanism in ensuring graph integrity."},{"id":"c7","text":"The Convergence Catalogue hub is located at /a/oip-convergence-public-article.","section":"## Corpus map","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Identifies the central article for the catalogue."},{"id":"c8","text":"The catalogue contains at least the 25 nodes C01 through C06 (gradient dissipation far from equilibrium order, least action variational principles, symmetry conservation, symmetry breaking bifurcation, criticality edge of chaos power laws, information entropy compression) plus additional unspecified nodes.","section":"## Corpus map","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Enumerates the node structure of the convergence catalogue."},{"id":"c9","text":"The catalogue includes the edge series Convergence 1 at /a/oip-convergence-edge-1 and Disconfirming 1 at /a/oip-disconfirming-edge-1.","section":"## Corpus map","tier":"speculative","source_ids":[],"source_status":"unsourced","why_material":"Documents the explicit edge collections referenced in the corpus map."}],"sources":[],"prov":{"model":"Fable 5 (Claude Code)","action":"write"}}