The Governed Graph
A clone is not an achievement. A graph becomes better than its reference only when it develops governance: criteria, onboarding, machine contracts, and a loop that improves the structure after every conjecture.
A public graph does not become good by accumulating notes. It becomes good by developing governance: the rules by which notes are admitted, connected, revised, exposed to machines, and explained to future operators.
This matters more in an AI-assisted project than in a hand-built one. Generation is cheap enough that the graph can inflate faster than judgment can follow. The steering human's job is not to ask for more surface area. The steering human's job is to name the criteria by which surface area earns the right to exist.
Perplexity Computer changes the operating loop. The human supplies conjectures, direction, taste, lived context, and stop conditions. The computer supplies proofs: research, comparison, implementation, validation, packaging, and the unpleasant downstream work of keeping every artifact aligned. A good proof may produce a new conjecture the human did not know to ask for.
So the graph needs a constitution. Not a heavy one. A useful one. The constitution says: the graph is the product; machine readers are first-class readers; slugs are promises; onboarding is governance; every edge should encode a relationship; every iteration should trickle upstream into source and downstream into generated surfaces.
This is why cloning a reference is not enough. A clone copies form. A governed graph copies the productive constraint, then improves the system around it. It becomes better only if a future operator can enter, understand the operating criteria, make a change, run the build, inspect the machine outputs, and leave the graph more retrievable than they found it.
The core rule is simple: make the graph more useful to retrieve, not merely larger to browse.