Are the PIS/PASEP weights the same as the CPF ones?
No. The CPF uses descending weights from 10 to 2 (then 11 to 2 for the second digit); the PIS/PASEP uses the fixed sequence 3, 2, 9, 8, 7, 6, 5, 4, 3, 2, which climbs to 9 on the third digit before descending, and it has no second check digit recomputed over the first.
Why does a remainder of 1 also become digit 0, not just remainder 0?
Because "11 minus the remainder" only works for remainders from 2 to 10; applied to a remainder of 1 it would yield check digit 10, which does not fit a single digit, so the rule intercepts remainders 0 and 1 before subtracting and pins the check digit to 0 for both.
My validator accepts a PIS/PASEP with repeated digits like 11111111111, is that correct?
The modulo-11 algorithm alone does not reject repeated sequences, the same way CPF validation does not either on its own; if your validator needs to block those cases, that is an extra business rule layered on top of the check-digit calculation, not part of it.
Do I need to validate the 10 base digits before computing the check digit?
Just confirm they are exactly 10 numeric characters: the algorithm accepts any combination of 0 through 9 in each position, so format validation (length, digits only) should run first, and check-digit validation after, as two separate steps.