Thinking in Graphs: Meaning Through Connectivity
The cornerstone. The book's subtitle is this document's subtitle.
library/concepts/v0_4_0__thinking-in-graphs.md
Commitb561fa6b14 · carried 23 August 2026
Originimported 11 June 2026 from owasp-sbot/Issues-FS__Docs · docs/to_classify/v0_4_0__issues-fs__thinking-in-graphs.md · the two copies are byte-identical
LicenceApache-2.0 (repository) · no per-file licence line
Bytes36,779 · 5,297 words · SHA-256 9d23354fc9a674ae
Dated5 February 2026
Why it is here
If this site has one source document, it is this one. It is the foundational document of the Issues-FS ecosystem, and it states the thesis in a single sentence: everything is a graph, meaning is not declared but discovered through relationships, and confidence in that meaning is proportional to how richly connected a node is. Three of the five computed peaks on the concept map are named in its part headings, and the book's subtitle is lifted from its title unchanged.
What it says
- Everything is a node, and a node alone carries no meaning (parts 1 and 2).
- The fractal principle: the same structure at every scale (part 3).
- Anchor nodes and reference graphs: reference without authority (part 4).
- Confidence as a function of connectivity, which the book makes a computed peak (part 5).
- Graphs of graphs, the idea published elsewhere as G3 (part 6).
Worth re-reading for. Read part 5 against the concept map. The formula there is prose; the site turned it into arithmetic, and the two do not perfectly agree.
Where this document lands on the site
The document is the peak. Below it hang the concepts measured in its text and the places on this site that rest on it — and the two are different kinds of link, drawn differently: a measured edge is dashed and carries its count, an authored edge is solid. The method is stated in full on the hub.