{
 "version": "v0.5.16",
 "layer": 1,
 "sources": [
  {
   "slug": "thinking-in-graphs",
   "title": "Thinking in Graphs: Meaning Through Connectivity",
   "source": "v1/docs/sources/thinking-in-graphs.md",
   "sha256": "9d23354fc9a674ae34ddcc01095afbc2c7c3831e52e7bf5da7ae02df244a561a",
   "dated": "2026-02-05",
   "extracted": "2026-08-23",
   "n_concepts": 22,
   "n_undefined": 3,
   "n_claims": 27,
   "n_hyp": 3,
   "n_obj": 1,
   "n_ex": 4,
   "n_edges": 8,
   "n_refs": 8,
   "pdf_pages": 14,
   "folder": "v2/universe/docs/thinking-in-graphs",
   "source_copy_sha256": "9d23354fc9a674ae34ddcc01095afbc2c7c3831e52e7bf5da7ae02df244a561a",
   "crossrefs": [
    {
     "id": "book-thesis",
     "where": "v1/book/index.html",
     "what": [
      "meaning-through-connectivity",
      "node"
     ],
     "how": "derivation",
     "rating": "aligned",
     "note": "The first edition's thesis and its subtitle are this document's central claim and subtitle. The book argues up to what the document states in Part 1.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "front-page-claim",
     "where": "index.html",
     "what": [
      "meaning-through-connectivity",
      "connectivity"
     ],
     "how": "paraphrase",
     "rating": "aligned",
     "note": "The site's lead sentence is a faithful compression of the central claim.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "concept-layer",
     "where": "v1/altitudes/data/altitudes.json",
     "what": [
      "meaning-through-connectivity",
      "confidence-spectrum",
      "enrichment",
      "anchor-node",
      "compatibility",
      "honest-uncertainty"
     ],
     "how": "derivation",
     "rating": "aligned",
     "note": "Six of the first edition's twenty-four concepts compress ideas this document defines; the lexicon's mappings record which.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "v1-fractal-definition",
     "where": "v1/altitudes/data/altitudes.json",
     "what": [
      "fractal-principle",
      "local-vocabulary"
     ],
     "how": "derivation",
     "rating": "stretched",
     "note": "The first edition defined fractal as one grammar at every level: uniformity. This document's Part 3 and Part 7 license local vocabulary and override, which is composition, not uniformity. Caught by the founder (brief 20), corrected in the lexicon at v0.4.6 with the superseded definition kept visible. The current book definition is aligned; this entry records the stretched one because history stays in the ledger.",
     "superseded": "the lexicon's fractal entry carries the corrected definition since v0.4.6",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "lexicon-adoption",
     "where": "v2/lexicon/scopes/00__book.json",
     "what": [
      "lexicon",
      "local-vocabulary"
     ],
     "how": "definition",
     "rating": "aligned",
     "note": "The book scope adopts this document's negative definition of the Lexicon verbatim in spirit: not a dictionary, not a schema registry.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "issues-fs-site",
     "where": "https://issues-fs.sgit.ai/concepts/index.html",
     "what": [
      "meaning-through-connectivity"
     ],
     "how": "citation",
     "rating": "aligned",
     "note": "The sibling site cites this document as the foundational one, with its word count and date, and paraphrases the claim faithfully.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "docs-measured",
     "where": "v1/docs/data/docs.json",
     "what": [
      "meaning-through-connectivity"
     ],
     "how": "measured",
     "rating": "aligned",
     "note": "The measured concept-by-document matrix counts this document's phrase hits; mechanical, no interpretation to misalign.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    },
    {
     "id": "universe-extraction",
     "where": "v2/universe/docs/thinking-in-graphs/extraction.json",
     "what": [
      "meaning-through-connectivity",
      "node",
      "connectivity"
     ],
     "how": "quote",
     "rating": "aligned",
     "note": "The layer 1 extraction quotes the document at recorded byte offsets and the build fails if any quote is not at its bytes: aligned by construction.",
     "rated_by": "agent",
     "rated": "2026-08-24"
    }
   ],
   "nodes": [
    {
     "id": "node",
     "family": "concept",
     "defined": true,
     "label": "node",
     "statement": "A node carries local properties but has no obligation to declare what it is, how it is used, or what it means.",
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "A node in a graph is just a node. It may carry some local properties — a title, a value, a timestamp — but it has no inherent obligation to declare what it \"is,\" how it should be used, or what it means.",
      "chars": [
       1208,
       1414
      ],
      "para": 1
     }
    },
    {
     "id": "meaning-through-connectivity",
     "family": "concept",
     "defined": true,
     "label": "meaning through connectivity",
     "statement": "What a thing is emerges from the edges traceable from it.",
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "In a graph-first model, what something \"is\" emerges from the edges you can trace from it.",
      "chars": [
       1657,
       1746
      ],
      "para": 2
     }
    },
    {
     "id": "connectivity",
     "family": "concept",
     "defined": true,
     "label": "connectivity",
     "statement": "A node is meaningful in proportion to how richly it is connected.",
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "A node connected to a rich web of other nodes is meaningful in proportion to that connectivity.",
      "chars": [
       1805,
       1900
      ],
      "para": 2
     }
    },
    {
     "id": "schema-first",
     "family": "concept",
     "defined": true,
     "label": "schema-first",
     "statement": "The type system tells you what something is before you encounter it.",
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "schema-first thinking, where the type system tells you what something is before you encounter it",
      "chars": [
       1559,
       1655
      ],
      "para": 2
     }
    },
    {
     "id": "declared-meaning",
     "family": "concept",
     "defined": true,
     "label": "declared meaning",
     "statement": "Meaning asserted by a schema, which instances conform to or fail.",
     "anchor": {
      "section": "Meaning Is Not Declared — It Is Discovered",
      "quote": "In a schema-first system, meaning is declared: \"This object IS a Task. It HAS these fields. Its status MUST be one of these values.\" The schema is the authority, and instances conform or fail validation.",
      "chars": [
       5312,
       5515
      ],
      "para": 1
     }
    },
    {
     "id": "discovered-meaning",
     "family": "concept",
     "defined": true,
     "label": "discovered meaning",
     "statement": "Meaning determined by traversing a node's edges.",
     "anchor": {
      "section": "Meaning Is Not Declared — It Is Discovered",
      "quote": "In a graph-first system, meaning is discovered: \"This node has edges to other nodes. By traversing those edges, we can determine what this node relates to, what constraints apply, and how confidently we can characterise it.\"",
      "chars": [
       5517,
       5741
      ],
      "para": 2
     }
    },
    {
     "id": "compatibility",
     "family": "concept",
     "defined": true,
     "label": "compatibility",
     "statement": "The degree to which two nodes' subgraphs overlap when traced toward common reference points.",
     "anchor": {
      "section": "Compatibility Is a Graph Computation",
      "quote": "Two nodes are not compatible because they share a type declaration. They are compatible to the degree that their subgraphs overlap when traced toward common reference points.",
      "chars": [
       10939,
       11113
      ],
      "para": 1
     }
    },
    {
     "id": "fractal-principle",
     "family": "concept",
     "defined": true,
     "label": "the fractal principle",
     "statement": "The same structural pattern, nodes with edges and meaning through connectivity, repeats at every level of zoom.",
     "anchor": {
      "section": "Every Scope Defines Its Own Vocabulary",
      "quote": "the same structural pattern — nodes with edges, meaning through connectivity — repeats at every level of zoom",
      "chars": [
       12184,
       12297
      ],
      "para": 3
     }
    },
    {
     "id": "local-vocabulary",
     "family": "concept",
     "defined": true,
     "label": "local vocabulary",
     "statement": "Every level of the scope hierarchy can introduce its own nodes, edges, types and definitions.",
     "anchor": {
      "section": "Every Scope Defines Its Own Vocabulary",
      "quote": "Every level in this hierarchy can introduce its own nodes, edges, types, and definitions.",
      "chars": [
       12063,
       12152
      ],
      "para": 3
     }
    },
    {
     "id": "name-clash",
     "family": "concept",
     "defined": true,
     "label": "name clash",
     "statement": "Label collisions between scopes, expected and resolved structurally rather than by name.",
     "anchor": {
      "section": "Name Clashes Are Normal",
      "quote": "In a fractal system, name clashes are inevitable and non-problematic.",
      "chars": [
       13537,
       13606
      ],
      "para": 1
     }
    },
    {
     "id": "semantic-web",
     "family": "concept",
     "defined": true,
     "label": "the Semantic Web",
     "statement": "The community that identified the right problem: exchanging meaning without agreeing on everything upfront.",
     "anchor": {
      "section": "The Semantic Web's Insight (and Mistake)",
      "quote": "The Semantic Web community identified the right problem: how do independent parties exchange meaning without agreeing on everything upfront?",
      "chars": [
       15758,
       15898
      ],
      "para": 1
     }
    },
    {
     "id": "anchor-node",
     "family": "concept",
     "defined": true,
     "label": "anchor node",
     "statement": "A node that is well-connected, well-maintained and well-known, with no special authority.",
     "anchor": {
      "section": "What Anchor Nodes Actually Are",
      "quote": "An anchor node is simply a node that:",
      "chars": [
       18377,
       18414
      ],
      "para": 1
     }
    },
    {
     "id": "confidence-spectrum",
     "family": "concept",
     "defined": true,
     "label": "the confidence spectrum",
     "statement": "Every assertion about a node sits on a spectrum from no edges to rich multi-hop connectivity.",
     "anchor": {
      "section": "The Confidence Spectrum",
      "quote": "Every assertion the system makes about a node sits on a confidence spectrum:",
      "chars": [
       19501,
       19577
      ],
      "para": 1
     }
    },
    {
     "id": "honest-uncertainty",
     "family": "concept",
     "defined": true,
     "label": "honest uncertainty",
     "statement": "The default posture: report what the edges support, what is missing, and what that does to confidence.",
     "anchor": {
      "section": "Honest Uncertainty Is the Default",
      "quote": "The system's default posture is honest uncertainty",
      "chars": [
       20837,
       20887
      ],
      "para": 1
     }
    },
    {
     "id": "enrichment",
     "family": "concept",
     "defined": true,
     "label": "enrichment",
     "statement": "The response to low confidence: add edges rather than fail validation.",
     "anchor": {
      "section": "Enrichment, Not Enforcement",
      "quote": "the response is not validation failure. It is an opportunity for enrichment",
      "chars": [
       21804,
       21879
      ],
      "para": 1
     }
    },
    {
     "id": "graphs-of-graphs",
     "family": "concept",
     "defined": true,
     "label": "graphs of graphs",
     "statement": "The ecosystem is not one flat graph; it is a graph of graphs, recursively.",
     "anchor": {
      "section": "The Recursive Structure",
      "quote": "It is a graph of graphs, recursively",
      "chars": [
       22519,
       22555
      ],
      "para": 1
     }
    },
    {
     "id": "cross-graph-edge",
     "family": "concept",
     "defined": true,
     "label": "cross-graph edge",
     "statement": "An edge that crosses from one sovereign graph into another, carrying meaning between them.",
     "anchor": {
      "section": "Cross-Graph References",
      "quote": "it creates an edge that crosses from the Issues-FS graph into the osbot-utils Type_Safe graph",
      "chars": [
       23681,
       23774
      ],
      "para": 1
     }
    },
    {
     "id": "version-pinning",
     "family": "concept",
     "defined": true,
     "label": "version pinning",
     "statement": "A cross-graph edge may pin meaning to a version or float with the latest; the graph records the choice.",
     "anchor": {
      "section": "Versioning and Temporal Graphs",
      "quote": "If the edge points to `osbot-utils@3.63.4`, then the meaning is pinned to that version's definition.",
      "chars": [
       24745,
       24845
      ],
      "para": 2
     }
    },
    {
     "id": "lexicon",
     "family": "concept",
     "defined": true,
     "label": "the Lexicon",
     "statement": "Not a dictionary or a schema registry: curated anchor nodes, cross-graph edges, traversal tools and overridable bootstrap definitions.",
     "anchor": {
      "section": "What the Lexicon Actually Provides",
      "quote": "the Issues-FS Lexicon is not a dictionary or a schema registry",
      "chars": [
       25576,
       25638
      ],
      "para": 1
     }
    },
    {
     "id": "librarian",
     "family": "concept",
     "defined": false,
     "label": "the Librarian",
     "statement": "Used twice as the agent who adds or arbitrates edges; never defined in this document.",
     "anchor": {
      "section": "Name Clashes Are Normal",
      "quote": "A human or a Librarian agent can then decide",
      "chars": [
       14471,
       14515
      ],
      "para": 3
     }
    },
    {
     "id": "type-safe",
     "family": "concept",
     "defined": false,
     "label": "Type_Safe",
     "statement": "The runtime type framework the port example leans on; assumed, not defined here.",
     "anchor": {
      "section": "The Safe_UInt__Port Example",
      "quote": "Consider a concrete example from the osbot-utils Type_Safe framework:",
      "chars": [
       1998,
       2067
      ],
      "para": 1
     }
    },
    {
     "id": "role-md",
     "family": "concept",
     "defined": false,
     "label": "ROLE.md",
     "statement": "Used as the thing that makes a role meaningful; its own format is never defined here.",
     "anchor": {
      "section": "This Applies to Everything",
      "quote": "If it links to a ROLE.md definition, to a set of issue types it can create, to handoff protocols — then we know what this QA role does.",
      "chars": [
       4596,
       4733
      ],
      "para": 3
     }
    },
    {
     "id": "c-central",
     "family": "claim",
     "support": "demonstrated",
     "label": "the central claim",
     "statement": "Everything is a graph; meaning is discovered through relationships, not declared; confidence is proportional to connectivity.",
     "about": [
      "meaning-through-connectivity",
      "connectivity"
     ],
     "anchor": {
      "section": "What This Document Is",
      "quote": "everything is a graph, meaning is not declared but discovered through graph relationships, and confidence in that meaning is proportional to how richly connected a node is to other nodes that provide context",
      "chars": [
       655,
       862
      ],
      "para": 2
     }
    },
    {
     "id": "c-literal",
     "family": "claim",
     "support": "declared",
     "label": "not a metaphor",
     "statement": "The claim is a literal architectural principle, not a metaphor.",
     "about": [
      "meaning-through-connectivity"
     ],
     "anchor": {
      "section": "What This Document Is",
      "quote": "This is not a metaphor. It is a literal architectural principle",
      "chars": [
       867,
       930
      ],
      "para": 3
     }
    },
    {
     "id": "c-no-edges-no-meaning",
     "family": "claim",
     "support": "declared",
     "label": "no edges, no meaning",
     "statement": "A node connected to nothing is, literally, meaningless.",
     "about": [
      "node",
      "connectivity"
     ],
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "A node connected to nothing is meaningless — literally.",
      "chars": [
       1747,
       1804
      ],
      "para": 2
     }
    },
    {
     "id": "c-difference-is-connectivity",
     "family": "claim",
     "support": "demonstrated",
     "label": "the difference is connectivity",
     "statement": "Two identical values differ radically in meaning when their connectivity differs.",
     "about": [
      "connectivity",
      "meaning-through-connectivity"
     ],
     "anchor": {
      "section": "The Safe_UInt__Port Example",
      "quote": "**The difference is not in the value.** Both scenarios have `8080`. The difference is in the **connectivity**.",
      "chars": [
       3836,
       3946
      ],
      "para": 11
     }
    },
    {
     "id": "c-evidence-or-not",
     "family": "claim",
     "support": "argued",
     "label": "the graph provides the evidence or it does not",
     "statement": "The system reports what it can and cannot confirm rather than assuming meaning.",
     "about": [
      "honest-uncertainty"
     ],
     "anchor": {
      "section": "This Applies to Everything",
      "quote": "The graph either provides the evidence or it doesn't. The system's job is to report what it can and can't confirm, not to assume meaning where the edges don't support it.",
      "chars": [
       5044,
       5214
      ],
      "para": 5
     }
    },
    {
     "id": "c-brittle-vs-resilient",
     "family": "claim",
     "support": "argued",
     "label": "declared is brittle, discovered is resilient",
     "statement": "Declared meaning breaks at boundaries; discovered meaning thins but composes.",
     "about": [
      "declared-meaning",
      "discovered-meaning"
     ],
     "anchor": {
      "section": "Meaning Is Not Declared — It Is Discovered",
      "quote": "declared meaning is brittle and local",
      "chars": [
       5775,
       5812
      ],
      "para": 3
     }
    },
    {
     "id": "c-common-ground-discovered",
     "family": "claim",
     "support": "demonstrated",
     "label": "common ground is discovered, not imposed",
     "statement": "Structural overlap can be found across five different review processes without any team conforming to a shared schema.",
     "about": [
      "compatibility"
     ],
     "anchor": {
      "section": "Finding Common Ground Through Graph Analysis",
      "quote": "The common ground was *discovered* in the graph, not *imposed* on it.",
      "chars": [
       10783,
       10852
      ],
      "para": 10
     }
    },
    {
     "id": "c-compat-spectrum",
     "family": "claim",
     "support": "argued",
     "label": "compatibility is a spectrum",
     "statement": "Compatibility is not binary, not symmetric, not global, and it is computable.",
     "about": [
      "compatibility"
     ],
     "anchor": {
      "section": "Compatibility Is a Graph Computation",
      "quote": "**Not binary** — it's a spectrum (Team A and Team C are more compatible than Team A and Team B)",
      "chars": [
       11135,
       11232
      ],
      "para": 2
     }
    },
    {
     "id": "c-no-registration",
     "family": "claim",
     "support": "argued",
     "label": "no registration with the parent",
     "statement": "A child scope never needs to register its vocabulary with a parent scope.",
     "about": [
      "local-vocabulary",
      "fractal-principle"
     ],
     "anchor": {
      "section": "Every Scope Defines Its Own Vocabulary",
      "quote": "At no level does a child scope need to \"register\" its vocabulary with a parent scope.",
      "chars": [
       13110,
       13195
      ],
      "para": 8
     }
    },
    {
     "id": "c-structural-resolution",
     "family": "claim",
     "support": "argued",
     "label": "resolution is structural",
     "statement": "Name clashes resolve by graph identity and traversal path, not by the label.",
     "about": [
      "name-clash"
     ],
     "anchor": {
      "section": "Name Clashes Are Normal",
      "quote": "Resolution is structural, not nominal.",
      "chars": [
       13784,
       13822
      ],
      "para": 2
     }
    },
    {
     "id": "c-observations-not-errors",
     "family": "claim",
     "support": "argued",
     "label": "observations, not errors",
     "statement": "Gaps, partial mappings and contradictions are surfaced for judgement, not rejected as failures.",
     "about": [
      "honest-uncertainty"
     ],
     "anchor": {
      "section": "Incompatibility and Missing Pieces Are Expected",
      "quote": "None of these are errors. They are observations that the graph analysis can make, surfacing them for human (or agent) judgment.",
      "chars": [
       15417,
       15544
      ],
      "para": 5
     }
    },
    {
     "id": "c-semweb-mistake",
     "family": "claim",
     "support": "argued",
     "label": "the Semantic Web's mistake",
     "statement": "The mistake was attaching meaning to nodes rather than deriving it from edges.",
     "about": [
      "semantic-web"
     ],
     "anchor": {
      "section": "The Semantic Web's Insight (and Mistake)",
      "quote": "They ended up attaching meaning *to nodes* rather than deriving meaning *from edges*.",
      "chars": [
       16155,
       16240
      ],
      "para": 2
     }
    },
    {
     "id": "c-dressed-in-graph-syntax",
     "family": "claim",
     "support": "declared",
     "label": "schema-first in graph syntax",
     "statement": "Self-describing nodes are schema-first thinking wearing graph syntax.",
     "about": [
      "semantic-web",
      "schema-first"
     ],
     "anchor": {
      "section": "The Semantic Web's Insight (and Mistake)",
      "quote": "This is schema-first thinking dressed in graph syntax. The node knows what it is.",
      "chars": [
       16559,
       16640
      ],
      "para": 5
     }
    },
    {
     "id": "c-mappings-by-anyone",
     "family": "claim",
     "support": "argued",
     "label": "mappings can come from anyone",
     "statement": "Cross-reference edges may be added by the team, an agent, an analysis or a third party, without touching the original node.",
     "about": [
      "anchor-node",
      "cross-graph-edge"
     ],
     "anchor": {
      "section": "The Graph-First Correction",
      "quote": "the mappings might have been added by anyone: the team itself, a Librarian agent, an automated analysis, or a third party doing an integration",
      "chars": [
       17960,
       18102
      ],
      "para": 4
     }
    },
    {
     "id": "c-no-special-authority",
     "family": "claim",
     "support": "argued",
     "label": "anchors have no special authority",
     "statement": "An anchor node enables discovery; it does not force conformity.",
     "about": [
      "anchor-node"
     ],
     "anchor": {
      "section": "What Anchor Nodes Actually Are",
      "quote": "**Has no special authority** — it does not force conformity; it enables discovery",
      "chars": [
       18665,
       18748
      ],
      "para": 2
     }
    },
    {
     "id": "c-confidence-computable",
     "family": "claim",
     "support": "argued",
     "label": "confidence is computable",
     "statement": "How confident the system is about a node is always computable from the graph.",
     "about": [
      "confidence-spectrum",
      "connectivity"
     ],
     "anchor": {
      "section": "The Confidence Spectrum",
      "quote": "the answer is always computable from the graph: count the edges, measure the depth of traversal to anchor nodes, assess the authority of the nodes reached",
      "chars": [
       20517,
       20671
      ],
      "para": 3
     }
    },
    {
     "id": "c-never-assumes",
     "family": "claim",
     "support": "declared",
     "label": "gaps are never filled with assumptions",
     "statement": "The system reports found and missing edges and never fills gaps by assuming.",
     "about": [
      "honest-uncertainty"
     ],
     "anchor": {
      "section": "Honest Uncertainty Is the Default",
      "quote": "It never fills in the gaps with assumptions.",
      "chars": [
       21676,
       21720
      ],
      "para": 5
     }
    },
    {
     "id": "c-grow-not-constrain",
     "family": "claim",
     "support": "argued",
     "label": "grow the graph, do not tighten the schema",
     "statement": "The ecosystem improves by adding edges, not by imposing stricter schemas.",
     "about": [
      "enrichment"
     ],
     "anchor": {
      "section": "Enrichment, Not Enforcement",
      "quote": "not by imposing stricter schemas, but by growing the graph",
      "chars": [
       22264,
       22322
      ],
      "para": 3
     }
    },
    {
     "id": "c-sovereign-graphs",
     "family": "claim",
     "support": "argued",
     "label": "each graph is sovereign",
     "statement": "Cross-graph edges give interoperability across teams, languages, cultures and agendas without any graph changing internally.",
     "about": [
      "cross-graph-edge"
     ],
     "anchor": {
      "section": "Cross-Graph References",
      "quote": "This is what makes the graph model scale across teams, languages, cultures, and agendas. Each graph is sovereign.",
      "chars": [
       24253,
       24366
      ],
      "para": 3
     }
    },
    {
     "id": "c-pin-or-float",
     "family": "claim",
     "support": "argued",
     "label": "pin or float, but say which",
     "statement": "Pinned and floating version edges are both valid; the graph makes the choice explicit and traceable.",
     "about": [
      "version-pinning"
     ],
     "anchor": {
      "section": "Versioning and Temporal Graphs",
      "quote": "Both are valid choices. The graph makes the choice explicit and traceable.",
      "chars": [
       24939,
       25013
      ],
      "para": 2
     }
    },
    {
     "id": "c-override",
     "family": "claim",
     "support": "argued",
     "label": "local override is a capability",
     "statement": "Any scope may override or specialise bootstrap definitions by creating local nodes with different subgraphs.",
     "about": [
      "local-vocabulary",
      "lexicon"
     ],
     "anchor": {
      "section": "What Every Repo Can Do",
      "quote": "**Override or specialise** bootstrap definitions by creating local nodes with different subgraphs",
      "chars": [
       26681,
       26778
      ],
      "para": 2
     }
    },
    {
     "id": "c-honest-assessments",
     "family": "claim",
     "support": "argued",
     "label": "we know, we think, we cannot confirm",
     "statement": "The system's observations end in a three-state honest assessment.",
     "about": [
      "honest-uncertainty",
      "confidence-spectrum"
     ],
     "anchor": {
      "section": "What the System Can Observe",
      "quote": "**Generate honest assessments**: \"We know X. We think Y. We cannot confirm Z.\"",
      "chars": [
       27393,
       27471
      ],
      "para": 2
     }
    },
    {
     "id": "c-authority-from-connectivity",
     "family": "claim",
     "support": "declared",
     "label": "authority is not identity",
     "statement": "Authority is a property of connectivity, provenance and governance, not of identity.",
     "about": [
      "anchor-node",
      "connectivity"
     ],
     "anchor": {
      "section": "What the System Never Does",
      "quote": "authority is a property of connectivity, provenance, and governance, not of identity",
      "chars": [
       27855,
       27939
      ],
      "para": 2
     }
    },
    {
     "id": "c-structural-not-nominal",
     "family": "claim",
     "support": "demonstrated",
     "label": "connection is structural, not nominal",
     "statement": "A Japanese-labelled process connects to an English-labelled anchor through edges, with no shared label needed.",
     "about": [
      "compatibility",
      "name-clash"
     ],
     "anchor": {
      "section": "The QA Engineer in Tokyo",
      "quote": "The connection is structural (via graph edges), not nominal (via shared label).",
      "chars": [
       31997,
       32076
      ],
      "para": 4
     }
    },
    {
     "id": "c-traceable-chain",
     "family": "claim",
     "support": "demonstrated",
     "label": "the review chain is traceable",
     "statement": "A three-city review chain in three languages is traceable end to end through the graph.",
     "about": [
      "cross-graph-edge",
      "compatibility"
     ],
     "anchor": {
      "section": "The Compliance Officer in Frankfurt",
      "quote": "The review chain is traceable through the graph.",
      "chars": [
       33087,
       33135
      ],
      "para": 4
     }
    },
    {
     "id": "c-absence-reported",
     "family": "claim",
     "support": "demonstrated",
     "label": "absence is reported, not papered over",
     "statement": "The system does not pretend a GitHub issue is a Feature_Request; it reports the missing edge and what adding it would enable.",
     "about": [
      "honest-uncertainty"
     ],
     "anchor": {
      "section": "The Open Source Contributor in Nairobi",
      "quote": "The system doesn't pretend the GitHub issue is a Feature_Request just because a human would make that inference.",
      "chars": [
       34629,
       34741
      ],
      "para": 5
     }
    },
    {
     "id": "c-ten-principles",
     "family": "claim",
     "support": "demonstrated",
     "label": "the document compresses itself to ten principles",
     "statement": "The summary lists ten core principles. The first edition distilled five ideas from this source; the gap is ladder finding 3.",
     "about": [
      "meaning-through-connectivity"
     ],
     "anchor": {
      "section": "Summary: Core Principles",
      "quote": "1. **Everything is a node.** Nodes carry local properties but have no obligation to declare what they are or how they should be used.",
      "chars": [
       34869,
       35002
      ],
      "para": 1
     }
    },
    {
     "id": "h-inevitable-mess",
     "family": "hypothesis",
     "label": "distributed vocabulary produces gaps",
     "statement": "A fractal system with distributed vocabulary will inevitably produce gaps, partial mappings and contradictions.",
     "about": [
      "fractal-principle",
      "local-vocabulary"
     ],
     "anchor": {
      "section": "Incompatibility and Missing Pieces Are Expected",
      "quote": "A fractal system with distributed vocabulary will inevitably produce:",
      "chars": [
       14652,
       14721
      ],
      "para": 1
     }
    },
    {
     "id": "h-thinner-across-boundaries",
     "family": "hypothesis",
     "label": "meaning thins measurably at boundaries",
     "statement": "Crossing a boundary thins meaning rather than breaking it, and the system can report exactly how thin.",
     "about": [
      "discovered-meaning",
      "confidence-spectrum"
     ],
     "anchor": {
      "section": "Meaning Is Not Declared — It Is Discovered",
      "quote": "it just means some edges don't extend across that boundary, and the meaning becomes thinner (less confident) on the other side",
      "chars": [
       6206,
       6332
      ],
      "para": 4
     }
    },
    {
     "id": "h-self-understanding",
     "family": "hypothesis",
     "label": "every edge grows self-understanding",
     "statement": "Each added edge increments the system's understanding of itself; the ecosystem improves this way over time.",
     "about": [
      "enrichment"
     ],
     "anchor": {
      "section": "Enrichment, Not Enforcement",
      "quote": "Every edge added is a small increment in the system's understanding of itself.",
      "chars": [
       22324,
       22402
      ],
      "para": 3
     }
    },
    {
     "id": "o-foundation",
     "family": "objective",
     "label": "be the foundation",
     "statement": "Underpin every other document in the ecosystem: the philosophy everything else is built on.",
     "about": [],
     "anchor": {
      "section": "What This Document Is",
      "quote": "This is the foundational document for the Issues-FS ecosystem.",
      "chars": [
       290,
       352
      ],
      "para": 1
     }
    },
    {
     "id": "ex-port",
     "family": "example",
     "label": "the Safe_UInt__Port example",
     "statement": "Two scenarios with the identical value 8080, differing only in connectivity, yield radically different meaning.",
     "demonstrates": [
      "c-difference-is-connectivity",
      "c-central"
     ],
     "anchor": {
      "section": "The Safe_UInt__Port Example",
      "quote": "class Safe_UInt__Port(Safe_UInt):",
      "chars": [
       2079,
       2112
      ],
      "para": 2
     }
    },
    {
     "id": "ex-five-reviews",
     "family": "example",
     "label": "the five Reviews",
     "statement": "Five teams' Review processes, none aware of the others, analysed for structural overlap without any conforming.",
     "demonstrates": [
      "c-common-ground-discovered",
      "c-compat-spectrum"
     ],
     "anchor": {
      "section": "The Review Example",
      "quote": "Consider five different teams, each with a process they call \"Review\":",
      "chars": [
       6559,
       6629
      ],
      "para": 1
     }
    },
    {
     "id": "ex-preflabel",
     "family": "example",
     "label": "the prefLabel counter-example",
     "statement": "A SKOS prefLabel declaration shown as meaning encoded on the node itself: the mistake, in six lines.",
     "demonstrates": [
      "c-semweb-mistake",
      "c-dressed-in-graph-syntax"
     ],
     "anchor": {
      "section": "The Semantic Web's Insight (and Mistake)",
      "quote": "skos:prefLabel  \"Review\"@en",
      "chars": [
       16280,
       16307
      ],
      "para": 3
     }
    },
    {
     "id": "ex-end-to-end",
     "family": "example",
     "label": "the end-to-end scenario",
     "statement": "London, Tokyo, Frankfurt and Nairobi: one task, three review vocabularies, one unmapped proposal, every confidence statement computed.",
     "demonstrates": [
      "c-traceable-chain",
      "c-structural-not-nominal",
      "c-absence-reported"
     ],
     "anchor": {
      "section": "The Graph",
      "quote": "Task-42 (in Project: Issues-FS__Service)",
      "chars": [
       28552,
       28592
      ],
      "para": 2
     }
    }
   ],
   "edges": [
    {
     "from": "meaning-through-connectivity",
     "verb": "departs-from",
     "to": "schema-first",
     "anchor": {
      "section": "Nodes Have No Obligation to Explain Themselves",
      "quote": "This is a deliberate departure from schema-first thinking",
      "chars": [
       1523,
       1580
      ],
      "para": 2
     },
     "inverse": "departed-from-by"
    },
    {
     "from": "connectivity",
     "verb": "determines",
     "to": "confidence-spectrum",
     "anchor": {
      "section": "What This Document Is",
      "quote": "confidence in that meaning is proportional to how richly connected a node is",
      "chars": [
       750,
       826
      ],
      "para": 2
     },
     "inverse": "determined-by"
    },
    {
     "from": "lexicon",
     "verb": "provides",
     "to": "anchor-node",
     "anchor": {
      "section": "What the Lexicon Actually Provides",
      "quote": "**A curated set of well-connected anchor nodes** for the issues domain",
      "chars": [
       25651,
       25721
      ],
      "para": 2
     },
     "inverse": "provided-by"
    },
    {
     "from": "anchor-node",
     "verb": "enables",
     "to": "compatibility",
     "anchor": {
      "section": "What Anchor Nodes Actually Are",
      "quote": "A node in a child scope that links to a Lexicon anchor node gains meaning by association.",
      "chars": [
       19091,
       19180
      ],
      "para": 4
     },
     "inverse": "enabled-by"
    },
    {
     "from": "cross-graph-edge",
     "verb": "enables",
     "to": "compatibility",
     "anchor": {
      "section": "Cross-Graph References",
      "quote": "Cross-graph edges create interoperability without requiring any graph to change its internal structure.",
      "chars": [
       24367,
       24470
      ],
      "para": 3
     },
     "inverse": "enabled-by"
    },
    {
     "from": "enrichment",
     "verb": "remedies",
     "to": "confidence-spectrum",
     "anchor": {
      "section": "Enrichment, Not Enforcement",
      "quote": "When the system identifies low-confidence nodes, the response is not validation failure.",
      "chars": [
       21755,
       21843
      ],
      "para": 1
     },
     "inverse": "remedied-by"
    },
    {
     "from": "fractal-principle",
     "verb": "licenses",
     "to": "local-vocabulary",
     "anchor": {
      "section": "Every Scope Defines Its Own Vocabulary",
      "quote": "Every level in this hierarchy can introduce its own nodes, edges, types, and definitions.",
      "chars": [
       12063,
       12152
      ],
      "para": 3
     },
     "inverse": "licensed-by"
    },
    {
     "from": "graphs-of-graphs",
     "verb": "exhibits",
     "to": "fractal-principle",
     "anchor": {
      "section": "The Recursive Structure",
      "quote": "At every level, the same principles apply",
      "chars": [
       23340,
       23381
      ],
      "para": 7
     },
     "inverse": "exhibited-by"
    }
   ],
   "near_but_not": [
    {
     "this": "anchor-node",
     "not": "a schema other nodes must conform to",
     "anchor": {
      "section": "The Graph-First Correction",
      "quote": "It is not a schema that other nodes must conform to. It is a reference point that other nodes may link to.",
      "chars": [
       17075,
       17181
      ],
      "para": 1
     }
    },
    {
     "this": "lexicon",
     "not": "a dictionary or a schema registry",
     "anchor": {
      "section": "What the Lexicon Actually Provides",
      "quote": "the Issues-FS Lexicon is not a dictionary or a schema registry",
      "chars": [
       25576,
       25638
      ],
      "para": 1
     }
    },
    {
     "this": "compatibility",
     "not": "a shared type declaration",
     "anchor": {
      "section": "Compatibility Is a Graph Computation",
      "quote": "Two nodes are not compatible because they share a type declaration.",
      "chars": [
       10939,
       11006
      ],
      "para": 1
     }
    },
    {
     "this": "discovered-meaning",
     "not": "conformity imposed by analysis",
     "anchor": {
      "section": "Finding Common Ground Through Graph Analysis",
      "quote": "This analysis happened without any team changing their process, learning a shared vocabulary, or conforming to a schema.",
      "chars": [
       10662,
       10782
      ],
      "para": 10
     }
    },
    {
     "this": "graphs-of-graphs",
     "not": "graph syntax over self-describing nodes",
     "anchor": {
      "section": "The Semantic Web's Insight (and Mistake)",
      "quote": "This is schema-first thinking dressed in graph syntax.",
      "chars": [
       16559,
       16613
      ],
      "para": 5
     }
    }
   ],
   "aliases": [
    {
     "a": "meaning-through-connectivity",
     "b": "meaning comes from edges",
     "anchor": {
      "section": "Summary: Core Principles",
      "quote": "**Meaning comes from edges.** What a node \"is\" emerges from the graph relationships that can be traced from it.",
      "chars": [
       35007,
       35118
      ],
      "para": 2
     }
    },
    {
     "a": "fractal-principle",
     "b": "graphs of graphs of graphs",
     "anchor": {
      "section": "Every Scope Defines Its Own Vocabulary",
      "quote": "It is graphs of graphs of graphs, at every level of scope",
      "chars": [
       11752,
       11809
      ],
      "para": 1
     }
    }
   ],
   "taxonomy": [
    {
     "title": "Thinking in Graphs: Meaning Through Connectivity",
     "level": 1
    },
    {
     "title": "What This Document Is",
     "level": 2
    },
    {
     "title": "Part 1: Everything Is a Node",
     "level": 2
    },
    {
     "title": "Nodes Have No Obligation to Explain Themselves",
     "level": 3
    },
    {
     "title": "The Safe_UInt__Port Example",
     "level": 3
    },
    {
     "title": "This Applies to Everything",
     "level": 3
    },
    {
     "title": "Part 2: Meaning Through Connectivity",
     "level": 2
    },
    {
     "title": "Meaning Is Not Declared — It Is Discovered",
     "level": 3
    },
    {
     "title": "The Review Example",
     "level": 3
    },
    {
     "title": "Finding Common Ground Through Graph Analysis",
     "level": 3
    },
    {
     "title": "Compatibility Is a Graph Computation",
     "level": 3
    },
    {
     "title": "Part 3: The Fractal Principle",
     "level": 2
    },
    {
     "title": "Every Scope Defines Its Own Vocabulary",
     "level": 3
    },
    {
     "title": "Name Clashes Are Normal",
     "level": 3
    },
    {
     "title": "Incompatibility and Missing Pieces Are Expected",
     "level": 3
    },
    {
     "title": "Part 4: Anchor Nodes and Reference Graphs",
     "level": 2
    },
    {
     "title": "The Semantic Web's Insight (and Mistake)",
     "level": 3
    },
    {
     "title": "The Graph-First Correction",
     "level": 3
    },
    {
     "title": "What Anchor Nodes Actually Are",
     "level": 3
    },
    {
     "title": "Part 5: Confidence as a Function of Connectivity",
     "level": 2
    },
    {
     "title": "The Confidence Spectrum",
     "level": 3
    },
    {
     "title": "Honest Uncertainty Is the Default",
     "level": 3
    },
    {
     "title": "Enrichment, Not Enforcement",
     "level": 3
    },
    {
     "title": "Part 6: Graphs of Graphs",
     "level": 2
    },
    {
     "title": "The Recursive Structure",
     "level": 3
    },
    {
     "title": "Cross-Graph References",
     "level": 3
    },
    {
     "title": "Versioning and Temporal Graphs",
     "level": 3
    },
    {
     "title": "Part 7: Practical Implications for Issues-FS",
     "level": 2
    },
    {
     "title": "What the Lexicon Actually Provides",
     "level": 3
    },
    {
     "title": "What Every Repo Can Do",
     "level": 3
    },
    {
     "title": "What the System Can Observe",
     "level": 3
    },
    {
     "title": "What the System Never Does",
     "level": 3
    },
    {
     "title": "Part 8: A Worked Example — End to End",
     "level": 2
    },
    {
     "title": "The Setup",
     "level": 3
    },
    {
     "title": "The Graph",
     "level": 3
    },
    {
     "title": "The QA Engineer in Tokyo",
     "level": 3
    },
    {
     "title": "The Compliance Officer in Frankfurt",
     "level": 3
    },
    {
     "title": "The Open Source Contributor in Nairobi",
     "level": 3
    },
    {
     "title": "Summary: Core Principles",
     "level": 2
    }
   ],
   "coverage": {
    "sections_with_prose": 31,
    "anchored": 29,
    "declared_empty": [
     {
      "section": "The Setup",
      "why": "Scene-setting for the worked example; its content is carried by the end-to-end example node."
     },
     {
      "section": "Part 8: A Worked Example — End to End",
      "why": "Announces the worked example; the example itself is the node anchored in The Graph."
     }
    ]
   }
  }
 ]
}