START HERE → The Intelligent Graph is the bridgework. The movement it serves is The Collaboration Paradigm — read that first.
Ontology · relationships come first

First Citizen

In graphs today, a relationship is at best a first-class citizen — a real object beside the nodes. That isn't far enough. A relationship isn't one citizen among equals; it is the First Citizen — and it doesn't just describe the world, it executes it.

A cellular-sheaf diagram over a graph — structure carrying meaning on every node and edge.
Forty years on one conviction: relationships come first.

What it is

Collaborators cross bridges.

Nobody collaborates from their own bank. Two parties — a person and a model, an agent and a system, one world and another — stand on opposite sides, each with their own ground under them, and nothing happens until someone crosses.

That's why The Intelligent Graph is bridgework, not a building — the span that carries the Collaboration Paradigm into implementation. Architecture gives you a place to move into: rooms, walls, a platform you're then stuck on. A bridge is no destination at all. You connect to it, cross it, and extend it — relationship-first infrastructure your people, models, and agents traverse and build onward from.

And a bridge isn't built to be admired. It's built to be crossed. Crossing is an action — and in the graph, the crossing is a traversal. That's why execution isn't a feature bolted onto the bridge; it's what a bridge is for: to collaborate, you cross. To cross, you traverse. A traversal executes.

A bridge is a relationship made traversable — and collaboration is the crossing.

Begin with being

The First Citizen.

Relationships in graphs today are treated two ways. In the RDF stack, they're buried inside predicates. In Neo4j, they're promoted to first-class citizens: real objects, with identity and properties of their own.

Building from the original definition of ontology: nothing exists until the very concept of existence exists — something exists, OR it doesn't. You need the OR before the thing. To exist is to be an element of a set, and membership is that OR — in, or out. The distinction comes first, and a distinction is a relation.

So relationships are not just first-class citizens. They are the First Citizen.

Relationships realize entities. Realization is an action. A relationship isn't glue between two real things — it is what makes them real, and a thing that does. Reticulation, not reification.

More than declaring relationships, more than recording activities — relationships execute. Recording is history. Execution is now. A graph that remembers tells you why the agent failed, after it failed. A graph whose relationships execute keeps it from failing in the first place. Not the agent's memory. The agent itself.

Vector to the mathematics

From philosophy to a sheaf.

Inference — derive what follows from what's said — is only the first floor. An operation's order is the order of structure it reaches over:

order 1 · Infer
reaches over elementswhat follows.
order 2 · Compute
reaches over the whole topologywhat the structure reveals. Centrality, community, similarity: the graph reasons about itself.
order 3 · Reticulate
reaches over whole spaceswhat relates across worlds.
order ω · Interact
reaches over universes and the intelligences reading themwhat emerges in conversation.
The object that makes this rigorous

Model the graph as a cellular sheaf: data on every node and edge, with rules for how they must agree. A view becomes a section; consistency becomes cohomologyH⁰ is what holds together (knowledge), is the contradiction that can't (the obstruction). Grounding is driving H¹ toward zero.

The full consistency engine is the direction, not a shipped feature — we build toward it in the open. Read the math →

A graph whose nodes and edges carry fibers, with H⁰ and H¹ chalked — a cellular sheaf.
A view becomes a section; consistency becomes cohomology — H⁰ what holds, H¹ what doesn't.

What this lets us build

Your stack already has the relationships. Nothing runs them.

The field has caught up to the substrate: extractors, memory platforms, and context graphs now emit rich relationship layers natively. That layer is real — and it is fast becoming table stakes. But it only describes. Ask what any of it does and the answer is: it waits to be queried. The missing layer isn't the relationships — it's the execution model that makes them run.

The Intelligent Graph defines that layer. A relationship is a contract; a traversal is a computation; behavior binds to the Kind of relationship traversed. The first executable graph is defined — and the engine that runs it is being built in the open.

What it does

Connect, ground, execute.

01Connect

Attach read-only to your source's native relationship layer — the graph it already emits.

02Ground

Type each raw relationship into a traversable graph — keeping the original string, so re-typing later is a single traversal, not a re-import.

03Execute

Behavior binds to the Kind of relationship traversed. The execution model is defined; the engine that runs it is being built in the open.

Provenance is a property, not a supernode. Every step is reversible by construction. We attach to your graph; we never restructure it.

Why it's different

From a model to an engine.

Relationships first
Edges carry their own structure and behavior — no reification, no blank-node workarounds. The thing the semantic web couldn't do cleanly, done natively.
Executable traversal
Behavior binds to the kind of relationship you traverse. Inference becomes one behavior, not the whole paradigm.
Persistence
TIG carries structure and decisions across runs, so a re-import shows only what's new. Memory in service of action — not the agent reduced to its memory.
Reticulation
A two-way weave: TIG curates, then feeds interpretations back so the source's agents get smarter each cycle.

The register ladder

One idea, three registers — bridged.

The point of bridgework is that it connects. Every concept has a word an executive can use, a word the graph implements, and a word the mathematics proves — and they map cleanly onto one another. The Intelligent Graph is the middle rung: the representational bridge between the everyday and the formal.

Colloquial · Professional Representational · TIG Mathematical · Formal
ParticipantNode / EntityObject / Element
StewardCurator / GovernorObserver / Constraint
CommunitySector / ScopeGroup / Subspace
Collaboration SpaceGraph SpaceManifold / Topology
RelationshipEdge / ContractRelation / Morphism
BridgeTraversable EdgeMapping / Functor
RepresentativeView / ProjectionSection
FoldIdentity MergeQuotient / Equivalence
ReticulateStructure FormationSheaf Gluing
TraversalPathComposition

A bridge is a relationship made traversable; an edge, a relationship made representational; a morphism, a relationship made formal.

TIG + Solstone

Capture-to-graph, in a single self-contained stack.

The Intelligent Graph pairs with Solstone — Jeremie Miller's local-first memory platform — to turn a passive capture stream into a structured, queryable, annotatable graph. Sol emits a native relationship layer — one that TIG's structural findings helped shape. TIG grounds that layer into a formal, executable graph and feeds curated identity and interpretation back, so the source gets smarter each cycle. The loop runs both ways, on the record. Built for teams who want their own graph, on their own machine — not a hyperscale deployment.

Open core

An open core, with a commercial layer for the parts that act.

The core will be open source (Apache 2.0) — we're building it in the open. A commercial layer adds the operational and agentic capabilities teams pay for.

Who's behind it

One unbroken conviction: relationships come first.

Built by Michael Bauer — a 35-year through-line from rule-based expert systems to a billion-node production graph. → michaelbauer.com

Presenting at Neo4j NODES 2026 (Nov 12), featuring Solstone: "The Intelligent Graph."