{"id":"valid-word-square-boundary-as-logic","text":"The three-part boundary condition (`j >= len(words)`, `i >= len(words[j])`, character mismatch) both enforces the word-square invariant and prevents all `IndexError` scenarios in a single expression.","truth_value":"IN","source":"entries/2026/06/06/valid-word-square-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"valid-word-square-boundary-as-logic","truth_value":"IN","reason":"premise"}]}}