{"id":"sumzero-symmetric-pair-construction","text":"`sumZero(n)` constructs its result by appending `(i, -i)` pairs for `i` in `[1, n//2]`, plus `0` if `n` is odd — guaranteeing uniqueness, zero-sum, and correct length by construction without tracking a running sum.","truth_value":"IN","source":"entries/2026/06/06/find-n-unique-integers-sum-up-to-zero-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sumzero-symmetric-pair-construction","truth_value":"IN","reason":"premise"}]}}