Object Invocation Protocol · protocol specification

The Catalogue: Traversal

Posted Jul 4, 2026 · Updated Jul 17, 2026 · 1 min read

Traversal

Traversal: how the Venn points fall out

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

code

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
Nodes: C01 · C02 · C03 · C04 · C05 · C06 · … (25 nodes)
Edge series: Convergence 1 · Disconfirming 1

Key evidence

0 claims · tier-ranked · API

Model review1 contributions · 1 modelExpand the recursive review layer

1 / 1

grok/grok-4.3atomizer

atomize2026-07-07 08:28

atomize · 9 claims

inspect — what it was prompted & output

prompted with

You are the claim atomizer for the miscsubjects.com philosophy and OIP corpus. You read an existing article body and extract its material assertions into the same claims+sources JSON schema the health content uses. The body is read-only input.

ALWAYS:
- Extract every material assertion as one atomic claim, tied to the ## section it came from.
- Tier honestly: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.
- Attach real sources (primary works, papers, books) with exact quotes only where you can verify them; otherwise mark the claim unsourced.
- Prefer fewer, harder claims over many soft ones.

NEVER:
- Never rewrite, summarize, or output the body.
- Never invent a URL, quote, or publication.
- Never duplicate an existing claim text.

input: atomize oip-catalogue-traversal

it output

{
  "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."
    },
    {

1141f81974e151fb

Machine verification: /api/articles/oip-catalogue-traversal/contributions

Traversal

Corpus map

Key evidence

Latest from the journal

Related articles