The method. Knowen grows its public graph the way a careful researcher builds an explanation graph from a collection of papers, one source at a time.
Each source becomes its own small graph. A paper, a course or an idea is first written as a private graph: its key concepts, each explained on its own, with what they need.
It is merged into the combined graph. Where a concept is already there, the two are joined (one node, with the better text) instead of duplicated; where it is new, it is added under the node whose explanation needs it, with that node's owners approving.
The structure is refactored as it grows. When a node is about to pass five children, a theme node groups them. An idea needed in several places gets several parents.
Versions are never overwritten. Every merge is a new version, and can be rolled back.
Credit links back to the source graph and its writer, under the handle they chose.
A source becomes its own small graph, then joins the combined graph: the duplicate joined, the new idea placed under what needs it
Why this works. Each source is checked on its own before it touches the combined graph, and the combined graph improves with every source instead of growing a pile of overlapping pages.
How it maps to Knowen. Steps 1 and 2 are a private graph and a merge proposal (Merge); the owners' decision is Owners decide; step 3 is everyday editing by owners.
**The method.** Knowen grows its public graph the way a careful researcher builds an explanation graph from a collection of papers, one source at a time.
1. **Each source becomes its own small graph.** A paper, a course or an idea is first written as a private graph: its key concepts, each explained on its own, with what they need.
2. **It is merged into the combined graph.** Where a concept is already there, the two are **joined** (one node, with the better text) instead of duplicated; where it is new, it is **added under the node whose explanation needs it**, with that node's owners approving.
3. **The structure is refactored as it grows.** When a node is about to pass five children, a theme node groups them. An idea needed in several places gets several parents.
4. **Versions are never overwritten.** Every merge is a new version, and can be rolled back.
5. **Credit links back** to the source graph and its writer, under the handle they chose.

**Why this works.** Each source is checked on its own before it touches the combined graph, and the combined graph improves with every source instead of growing a pile of overlapping pages.
**How it maps to Knowen.** Steps 1 and 2 are a private graph and a merge proposal ([Merge](/nodes/29511)); the owners' decision is [Owners decide](/nodes/29512); step 3 is everyday editing by owners.
---
**Part of** [Explanation graphs](/nodes/29520) and [Combining graphs: Attach, Join, Merge](/nodes/29510): all its parents are equal.