I would like to show that by forcing over Add$(\omega, \omega_1)$, one can get the model $HOD(\mathbb{R})^{V[G]}$ where the following weakened perfect set property holds: "for every subset $A$ of $\omega^{\omega}$ either $A$ or its complement (or both ) contains a perfect subset."
The construction is obviously going to parallel the solovay model (which I'm familiar with) but I'm unable to transfer a significant number of details (the Solovay construction I'm familiar with is forcing over Coll$(\omega, <\mu)$ where $\mu$ is an inaccessible) over to this case. The posets seem too different and the lack of an inaccessible hurts.
Does anyone have a reference or hints on how to see this fact?
You can find a version of this theorem in John Truss' paper, aptly named for your question
The idea behind the proof is fairly simple, you could argue it has parallels to Solovay's model, but it really is just the usual symmetries trick.
Suppose that $A$ is a set of reals in $\mathrm{HOD}(\Bbb R)$. Then $A$ is definable from a real, and because we forced with a c.c.c. forcing, it means that there are a name $\dot A$ and a countable initial segment of the forcing such that fixing that initial segment will not change the name $\dot A$. Call this initial segment $\alpha$.
Now suppose that $\dot A$ contains a real which is not from $\operatorname{Add}(\omega,\alpha)$. Then by applying permutations we conclude that it contains a perfect set of copies of this real. The key point is that the automorphism group is very wild, it allows us to switch indices, flip bits, apply permutations on different coordinates, etc.
Suppose that it doesn't contain such a real, then simply note that $\dot B$ defined to be the name for the complement of $A$ is also fixed by not moving the first $\alpha$ coordinates. So we can apply the previous argument.
In fact, we can observe that a set of reals can be well-ordered if and only if it is a subset of $\Bbb R^{V[G\restriction\alpha]}$ for some $\alpha$. So we really prove that a set of reals can be well-ordered or it contains a perfect subset. (This is generalised in Truss' paper as well.)