{"id":"dp-rolling-reduction-correct-unless-degenerate-input","text":"The DP-to-rolling-variable reduction extends the O(1)-space running accumulator pattern from streaming to dynamic programming, collapsing O(n) DP tables to O(1) rolling variables while preserving recurrence correctness for all inputs within LeetCode constraints.","truth_value":"OUT","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["min-cost-dp-uses-constant-space","o1-space-via-running-accumulators"],"outlist":["min-cost-assumes-length-ge-2"],"label":"Rolling-variable DP is an instance of the running accumulator pattern, gated by the length-ge-2 precondition that crashes on degenerate input"}],"dependents":[],"metadata":{"source_type":"derived","_retracted":true},"created_at":"","updated_at":"2026-06-17T15:32:15+00:00","reviewed_at":"","verified_at":"","retracted_at":"2026-06-17T15:32:15+00:00","explanation":{"steps":[{"node":"dp-rolling-reduction-correct-unless-degenerate-input","truth_value":"OUT","reason":"SL justification invalid","failed_antecedents":[],"label":"Rolling-variable DP is an instance of the running accumulator pattern, gated by the length-ge-2 precondition that crashes on degenerate input","violated_outlist":["min-cost-assumes-length-ge-2"]}]}}