{"abstract":"Case and Unicode composition produce multiple identities for equivalent names.","category":"Text processing","checks":3,"contract":"Normalize to NFC and case-fold each name before comparing identities.","evaluation_group":"model-b1337d8244951c2e","failed_approach":"Normalization alone leaves case differences intact.","family":"unicode-identity","id":"FA-026","implementations":{"attempt":{"sha256":"f01f5b6542143e79f65eb5a2b2494eea0dad346cfeb4dab1f2d61b7351d52069","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport unicodedata\nN = 1\nobservations = []\ndef solve(names):\n    return len({unicodedata.normalize('NFC', name) for name in names})\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('composed variants', solve(['CAFÉ', 'Cafe\\u0301', 'café'] * N), 1)\ncheck('different names', solve(['north', 'south']), 2)\ncheck('empty list', solve([]), 0)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"c87705150b84b05830cdef8dd75077a0aac297472c8606561593d4b5aae4fb91","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport unicodedata\nN = 1\nobservations = []\ndef solve(names):\n    return len(set(names))\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('composed variants', solve(['CAFÉ', 'Cafe\\u0301', 'café'] * N), 1)\ncheck('different names', solve(['north', 'south']), 2)\ncheck('empty list', solve([]), 0)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"fixed":{"sha256":"5dc18376990d0086c7af28f372b2ca1f2ef279341d6481b530197b73525a4ed8","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport unicodedata\nN = 1\nobservations = []\ndef solve(names):\n    return len({unicodedata.normalize('NFC', name).casefold() for name in names})\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('composed variants', solve(['CAFÉ', 'Cafe\\u0301', 'café'] * N), 1)\ncheck('different names', solve(['north', 'south']), 2)\ncheck('empty list', solve([]), 0)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":" This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"unicode-identity","generated_at":"2026-09-29T14:36:49.872091+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A compact reasoning and repair task with executable evidence.","repair":"Normalize to NFC and case-fold each name before comparing identities.","root_cause":"Identity comparison uses raw codepoints without a normalization contract.","sha256":"1d485484ea1a1f0634d95a8d3cb8854a9d6ca356af9e3e002cb09b1dc1c29cc1","title":"Equivalent names create separate identities · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":32.073,"exit_code":1,"observations":[{"actual":3,"check":"composed variants","expected":1,"passed":false},{"actual":2,"check":"different names","expected":2,"passed":true},{"actual":0,"check":"empty list","expected":0,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"composed variants\", \"actual\": 3, \"expected\": 1, \"passed\": false}, {\"check\": \"different names\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty list\", \"actual\": 0, \"expected\": 0, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.669,"exit_code":1,"observations":[{"actual":3,"check":"composed variants","expected":1,"passed":false},{"actual":2,"check":"different names","expected":2,"passed":true},{"actual":0,"check":"empty list","expected":0,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"composed variants\", \"actual\": 3, \"expected\": 1, \"passed\": false}, {\"check\": \"different names\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty list\", \"actual\": 0, \"expected\": 0, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":34.521,"exit_code":0,"observations":[{"actual":1,"check":"composed variants","expected":1,"passed":true},{"actual":2,"check":"different names","expected":2,"passed":true},{"actual":0,"check":"empty list","expected":0,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"composed variants\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"different names\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty list\", \"actual\": 0, \"expected\": 0, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}