- A graph can be "of the form c & g, where c is the context of one node of the graph and g is the rest of the graph with that node removed".
- c has inEdges, vertex (id), label, outEdges.
- g is the rest of the graph (a set of contexts?).
- s5bug told me about them: a view of the agora at a node is a comonad