A Finite 2-adic Branch-Avoidance Problem Associated with Near-Collision Collatz Parity Words

This record contains a research note and reproducibility artefacts for a finite 2-adic branch-avoidance problem associated with near-collision Collatz parity words. The contribution is a precise reformulation of a finite residue problem as a survival problem for a deterministic map, together with finite computational checks for the listed parameter range. No proof of the Collatz conjecture and no asymptotic resolution of the branch-avoidance conjecture is claimed. The uploaded files include the research note, LaTeX source, C++17 verification code, deterministic JSON output, and SHA-256 hashes for reproducibility.