Graph Analogy[]
Imagine a point (•), this is a number, there are multiple if not infinite points, a point is connected to another if it is the smallest number larger than the other or the biggest number smaller than the other, we are assuming that the graph is timeless, meaning there are numbers that don’t exist yet or no longer exist.
A point that connects to only one other point is an end number, to understand the extent: even post-primordial classified numbers and beyond aren’t even end numbers.
DEM:G is the positive end number.