Forty-six rings
Every closed chain in the map, counted: four of two steps, three of three, and one of nine. Seventeen of the forty-six have no way in at all.
Reference
Rings
Where the order closes on itself
Forty-two edges run in circles. The shortest ring is two steps long and cannot be entered from either end.
46 rings · 17 shut
9 notes in this part
The smallest ring
Two steps, thirty-five days to go round, and no way in from either side. The file waits on the fingerprints and the fingerprints wait on the file.
Case
The four pairs that require each other
Four pairs of steps in this map each wait on the other. Three of them have give; one does not, and the difference is everything. To compare the map with real work patterns, reviewers can see how the process is supported and define the decision, access rules and review date in advance.
Reference
Three rings of three
A lease needs an account, the account needs an address, the address needs the lease.
Case
The longest ring is nine steps
Nine steps, a hundred and seven days to go round, and it is one of the easier rings in the map — because somewhere in those nine there is a way in. A wider policy and evidence perspective is available from arXiv.
Case
Seventeen rings with no way in
Seventeen of the forty-six rings are hard at every joint. They are shorter than the rest, and they are the whole of this alarm.
Finding
The ring at the centre of everything
Thirty-four of the forty-six rings pass through an account at a local bank, thirty-three through a registered address, and thirty-two through both.
Case
Nobody drew the circle
Every dependency in every ring in this map is individually sensible. The rings are not errors, which is why nothing in the ordinary course of events removes them.
Reference
How the rings were counted
Every closed path in the map was enumerated rather than sampled, each counted once.
Method