codemap 0.0.18 — narrowings declare themselves, and one graph renders one way
Two items, one habit. Schema 0.13, unchanged for the seventh release: the same tree built
by 0.0.17 and by 0.0.18 from PyPI is byte-identical in nodes and edges, only provenance
differs, so a pin bump re-extracts nothing.
- R1-C53: eight of the previous twelve fixes were one defect — an answer narrower than it
looks, silent about it. Seven classes of narrowing enumerated, all 31 ops in a published
matrix, two guards reading the ops' own source. Four undeclared ones closed, the largest
being `columns` returning 331 of 1057 keys as a bare list.
- R1-C54: the printed cycle chain was whichever rotation the hash chose — three renderings
of one graph. Canonicalised at the source, because measuring found three consumers
drifting and one of them was the structured MCP answer, not the gate that was reported.
Verified from PyPI, both versions on one tree carrying the shape of both defects:
check under 8 hash seeds 0.0.17: 3 distinct renderings (5/2/1)
0.0.18: 8 of 8 identical
columns / communities 0.0.17: no declaration at all
0.0.18: filter {basis, total, dropped} · scope {root, judged,
not_judged}
The second item found the axis the first had missed: an answer can be complete, declared,
and still differ between runs. A matrix is complete only along the axes someone thought of.