{"id":"weakest-rows-stable-sort-tiebreak","text":"The k-weakest-rows solution relies on Python's stable sort guarantee for index-based tiebreaking rather than encoding row index as a secondary sort key.","truth_value":"IN","source":"entries/2026/06/06/the-k-weakest-rows-in-a-matrix-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"weakest-rows-stable-sort-tiebreak","truth_value":"IN","reason":"premise"}]}}