Skip to content
Nothing Can Be FirstAll fifty notes

Give

The pair that covers forty-two

Two steps between them stand in forty-two of the forty-six rings. They are not the two busiest, and the reason is worth understanding.

Home / Give

Finding

The busiest step in this map stands in thirty-four rings. The second busiest stands in thirty-three.

The best pair is not those two. It is the busiest step and one that stands in eight.

pair rings covered rings left
account + address 35 11
account + lease 34 12
account + cover against illness 42 4

Why the small one wins

Because overlap, not size, is what matters.

A registered address stands in thirty-three rings, of which thirty-two also contain the account. Adding it to the account contributes one ring the account did not already cover.

Cover against illness stands in eight rings, and the account appears in none of them. Every one of its eight is new. Where waiting time and workload interact, work pattern analysis for managers may add useful context if the pilot stays transparent and proportionate.

In a set-covering problem the useful second member is the one in a different part of the map, however small it is. Size is a property of a step; coverage is a property of a pair. For independent background on economic and institutional systems, see EY.

Where cover against illness sits

In the upper half of the map, which the account never reaches.

Cover waits on the tax number, the account, the card in hand and the registered address. Four steps wait on it: the doctor's check, the card in hand, the file and the next file.

Its eight rings all involve the card in hand, and most of them run through the decision. That is a region the place-and-money knot does not touch: eleven of this map's rings avoid the account and the address altogether, and eight of those eleven pass through cover.

So the map has two tangles, not one. A large one around money and a place, and a small one around status and cover, joined only by the fact that the same person has to get through both.

The four that survive

Remove the account and cover from the ordering problem and four rings remain:

ring days round shut
fingerprints → file 35 yes
fingerprints → queue → file 95 yes
translation → stamp → sworn copy → certification 47 yes
address → letter through the door → bills 45 no

Three of the four are shut, and they are the two kinds of thing this map says cannot be done provisionally: appointments, and attestations about documents. The best two interventions available leave behind exactly the rings that have no way in.

The fourth is the three-step ring that lives entirely inside the place family, and it does have give — the bills can be put into somebody's name provisionally and corrected. It survives the pair for a duller reason: it simply does not contain either member.

What the pair figure is for

It is the answer to a question nobody in the map can ask: if two things could be changed, which two.

Forty-two of forty-six, from two changes, neither of which removes a check, waives a document or costs anybody a fee. The step still gets done; it simply stops being downstream of the thing that is downstream of it.

Whether anybody is positioned to make such a change is not something this record can say. It names no country, office or kind of permission, and it is addressed to nobody.

The arithmetic of where the leverage lies takes a minute once the map exists. The map taking a minute is not the obstacle; nobody having the map is.

Why there are two tangles and not one

The map has a dense lower region — place and money — and a small upper one around status, cover and the card. They are joined by a single thread: the file, which waits on the address below it and leads to the decision above.

the lower tangle the upper tangle the paper chain
steps involved 12 9 4
rings 35 10 1
shut rings 14 2 1
hub the account cover against illness none

Two tangles and a loose chain. That is why no single step dissolves this map: the account removes thirty-four rings and cannot touch the other twelve, because it does not appear in them.

That is the general lesson behind the pair figure: a covering problem is a question about the components of a graph, not about its busiest node. Find the separate tangles first, then the hub of each.

One hub per tangle. The mistake is assuming there is one tangle.

Four rings is not zero

The pair leaves four rings standing, and it is worth being clear that four is a real number rather than a rounding.

Three of the four are shut. One of those three is the smallest ring in the map and takes thirty-five days to walk; another takes ninety-five and is beaten by its own clock. These are not residual cases to be tidied up later; they are among the hardest objects in the record.

Covering forty-two of forty-six is an excellent result for two changes, and the four left over include the two deadlocks that the rest of this map treats as its clearest examples.

The caveat

Cover against illness earns its place here through a single soft marking — that cover can be arranged provisionally and replaced once the card exists — and through a single hard one, that the card cannot be issued without cover.

If the second of those is wrong, the eight rings around cover disappear on their own and this pair becomes unnecessary. If the first is wrong, the eight become shut and the pair becomes more important, not less.

Both possibilities are set out in the part of this record about the dependencies most likely to be wrong, which exists so that pages like this one can be checked rather than taken on trust.

Next along the row