{"id":"complement-no-special-case-needed","text":"The XOR-with-mask algorithm handles all valid inputs (1 to 2^31 - 1) without branching; edge cases like single-bit numbers (e.g., `1 ^ 1 = 0`) resolve correctly through the general formula.","truth_value":"IN","source":"entries/2026/06/06/number-complement-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"complement-no-special-case-needed","truth_value":"IN","reason":"premise"}]}}