The infinite pigeonhole principle for 2-partitions asserts the existence, for every set [Formula: see text], of an infinite subset of [Formula: see text] or of its complement. In this paper, we study the infinite pigeonhole principle from a computability-theoretic viewpoint. We prove in particular that [Formula: see text] admits strong cone avoidance for arithmetical and hyperarithmetical reductions. We also prove the existence, for every [Formula: see text] set, of an infinite low[Formula: see text] subset of it or its complement. This (...) answers a question of Wang. For this, we design a new notion of forcing which generalizes the first and second-jump control of Cholak et al. (shrink)