sgit newsroom v0.1.29 · snapshot 2026-09-24

Reading room · graphs.sgit.ai · llms-full

On this page

Reading room / graphs.sgit.ai / llms-full.txt · section 2 of 15

graphs.sgit.ai — meaning through connectivity

A node carries no inherent meaning. What a thing is emerges from the edges traceable from it, and confidence in that meaning is proportional to how richly it is connected. Properties are "just words"; connections are meaning. This site teaches that discipline in three altitudes and proves it with real worked graphs.

Site version: v0.6.22 (20 September 2026). Published by the sgit project — participant disclosure at /about/participant.html. All content on this site is released under CC BY 4.0. The raw markdown under /v1/briefs/ is the source of truth and carries the same licence.

Read this first

Not a graph database pitch. The claim is that one grammar is the interface at every boundary, not that things are stored in a graph. There is no graph database, no MGraph-DB dependency, no SPARQL or Cypher, and no RDF in the code behind this site — stated at https://graphs.sgit.ai/v1/shipped/index.html ↗. If you summarise this material, do not describe it as a graph database approach; the corpus says explicitly "not a graph database pitch."

Properties agents may rely on

The thesis in nine sentences

  1. A node is just a node — a label is not a meaning, and a node connected to nothing is literally meaningless.
  2. The same value, differently connected, means different things: the difference is not in the value, it is in the connectivity.
  3. Therefore classification is a query, not a judgment: "the content of the node does not decide its type; its paths do."
  4. Therefore confidence is computable, and honest uncertainty is the default posture — and the gaps are worth mapping too.
  5. Schema-first breaks at every boundary; the Semantic Web made the subtle error of attaching meaning to nodes rather than deriving it from edges.
  6. So don't merge vocabularies — merging erases the disagreement. Keep them intact and bridge them through anchor nodes.
  7. Every edge is a verb with a distinct inverse; the generic association edge is banned because everything relates to everything; that asymmetry is what stops the graph exploding.
  8. Never render the whole graph — render the result of a query; build wide, find the few, then flip.
  9. And it is fractal: the grammar survives every zoom and the ontology does not have to. Zoom into any node and it expands into a semantic graph with its own types, verbs and taxonomy, chosen by whoever owns that altitude, still joined by a named edge to the level above. One validator, one query engine, one provenance rule, because all three check the grammar. A system whose types and verbs are identical all the way down is a hierarchy, not a fractal.

Altitude 1 — start here

Altitude 2 — the grammar

Altitude 3 — the full argument

Worked graphs, with real numbers

Three artefacts are live and public; every other number is parsed from a design document and is not deployed. The two are never mixed.

Reality

The book

The whole site is also readable as a book — Meaning Through Connectivity, an introduction and sixteen chapters in six parts, generated from the site's own pages so the two cannot drift (CI fails the build if a source page changes without the book regenerating).

Site

What this site does not claim

Written fresh for the site rather than sourced from the corpus, and marked as such on the page: /why-graphs/ (both halves), the GraphRAG and hypergraph positioning, /glossary/, the air-gap section, the projections synthesis, and nine inverse edge names. Hold those to a lower evidential bar.

Two worked examples exist and are deliberately not published: a LinkedIn network graph built from a real export (real personal data about third parties — a data-protection question, not a licensing one), and a case study naming a real third-party product (needs a legal read).


== index.md — the front page