Poisson genericity of Fibonacci, Rudin–Shapiro, and Thue–Morse sequences

Let an infinite sequence over a finite alphabet be formed either by concatenating the Fibonacci numbers in any base, by taking the Rudin–Shapiro sequence along the squares, or by taking the Thue–Morse sequence along the squares. A sequence is 1-Poisson generic if its visit statistics to shrinking targets converge to the Poisson law with parameter $1$, in the sense defined in the source. The conjecture. The sequences obtained by concatenating the Fibonacci numbers in any base, the Rudin–Shapiro sequence along the squares, and the Thue–Morse sequence along the squares are $1$-Poisson generic. Almost-everywhere Poisson genericity and computable examples are known, but no explicit example was known in the surrounding discussion; these proposed examples are presented as conjectural instances.