{"id":"greedy-algorithms-provably-optimal","text":"Greedy strategies across the repo are accompanied by explicit correctness arguments — prefix-free code uniqueness, leftmost-digit positional weight, exchange arguments — not treated as heuristics.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["greedy-scan-correct-for-prefix-free-codes","can-place-flowers-greedy-is-optimal","max-sum-greedy-correctness","max69-greedy-leftmost","min-time-typewriter-greedy-optimal"],"outlist":[],"label":"Each greedy choice has a structural proof that no lookahead can improve it"}],"dependents":["greedy-optimality-requires-nonnegative-domain","greedy-with-early-exit-maximizes-pruning","mathematical-insight-replaces-brute-computation"],"metadata":{"last_reviewed":"2026-06-07T22:02:22","review_result":"unnecessary"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"greedy-algorithms-provably-optimal","truth_value":"IN","reason":"SL justification valid","antecedents":["greedy-scan-correct-for-prefix-free-codes","can-place-flowers-greedy-is-optimal","max-sum-greedy-correctness","max69-greedy-leftmost","min-time-typewriter-greedy-optimal"],"label":"Each greedy choice has a structural proof that no lookahead can improve it"},{"node":"greedy-scan-correct-for-prefix-free-codes","truth_value":"IN","reason":"premise"},{"node":"can-place-flowers-greedy-is-optimal","truth_value":"IN","reason":"premise"},{"node":"max-sum-greedy-correctness","truth_value":"IN","reason":"premise"},{"node":"max69-greedy-leftmost","truth_value":"IN","reason":"premise"},{"node":"min-time-typewriter-greedy-optimal","truth_value":"IN","reason":"premise"}]}}