```
ID: f-p8-indegree
Type: f

A6, generation 3, and the smallest correction that removes the withdrawn argument.

Same accumulation and the same shape of decay as #f-p8-add, but the decay is the NUMBER OF
APPLICATIONS THAT ACTUALLY ARRIVED at this position on this time step -- fwd_fired plus bwd_fired plus
tok_fired -- rather than the constant 2.

The 2 in A2 was the count of neighbours: information flows in from the left and from the right at rate
f each, so the fall-off had to be 2f for the sum to stay invariant (#f-p8, the withdrawn passage). The
invariant is gone, but the counting was never the questionable part. This alternative keeps the
counting and drops the assumption: a position that two patterns reached decays by 2, one that three
reached decays by 3, and one that nothing reached does not decay at all.

It therefore differs from A2 exactly where applications are missing -- the first and last positions of
a window, positions before the second byte where no token context exists, and every position whose
backward direction has an empty predecessor set under B1, which at e64 is 218 of the 256 bytes. Under
A2 those positions decay at the full rate while receiving less than the full evidence.

It needs no support at all, so unlike #f-p8-deficit and #f-p8-period it is unaffected by the k=1
strength gap and by axis B.
```