{"id":"relative-ranks-no-tie-handling","text":"The function assumes all scores are unique; duplicate scores would receive arbitrary distinct ranks based on Python's stable sort order, with no explicit tie-breaking.","truth_value":"IN","source":"entries/2026/06/06/relative-ranks-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"relative-ranks-no-tie-handling","truth_value":"IN","reason":"premise"}]}}