{"abstract":"Vocabulary construction counts repeated labels as separate classes.","category":"Training label alignment","checks":7,"contract":"Return [vocabulary,indices], where vocabulary lists distinct labels in first-seen order and indices encode input labels.","contract_signature":"labels","evaluation_group":"training-label-alignment-stable-label-vocabulary","failed_approach":"Sorting unique labels gives stable IDs but violates the required first-seen class order.","family":"w3-training-label-alignment-label-vocabulary-dedup","id":"FA-98006","implementations":{"attempt":{"sha256":"f895ffa386e0e2537de244768039b7486b751f6c6ba52ee8224851a7a7da9cd3","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(labels):\n    v=sorted(set(labels))\n    return [v,[v.index(x) for x in labels]]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('repeat shares index',solve(['b','a','b']),[['b','a'],[0,1,0]])\ncheck('empty',solve([]),[[],[]])\ncheck('single',solve(['x']),[['x'],[0]])\ncheck('first seen differs lexical',solve(['z','a','z']),[['z','a'],[0,1,0]])\ncheck('zero-like labels',solve([0,1,0]),[[0,1],[0,1,0]])\ncheck('all same',solve(['q']*N),[['q'],[0]*N])\ncheck('distinct sequence',solve(['c','b','a']),[['c','b','a'],[0,1,2]])\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":"6023ca2baf02c2ddc84470a3edc3b5aed240502981631ff7bc205360bd0b0b68","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(labels):\n    return [list(labels),list(range(len(labels)))]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('repeat shares index',solve(['b','a','b']),[['b','a'],[0,1,0]])\ncheck('empty',solve([]),[[],[]])\ncheck('single',solve(['x']),[['x'],[0]])\ncheck('first seen differs lexical',solve(['z','a','z']),[['z','a'],[0,1,0]])\ncheck('zero-like labels',solve([0,1,0]),[[0,1],[0,1,0]])\ncheck('all same',solve(['q']*N),[['q'],[0]*N])\ncheck('distinct sequence',solve(['c','b','a']),[['c','b','a'],[0,1,2]])\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":"Labels are hashable and equality-comparable; vocabulary order is first occurrence. 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":"w3-training-label-alignment-label-vocabulary-dedup","generated_at":"2026-09-30T16:48:08.408670+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A small deterministic training-data operation makes label ownership and ordering explicit.","root_cause":"The vocabulary is collected from a sequence without deduplicating class identities.","sha256":"1fa88219d66df816a1689128e62784882f863848ae0669e59f82649d81499d15","title":"Vocabulary construction counts repeated labels as separate classes · case 01","variant":1,"variant_policy":"The fixture code references N, supplied as 1 through 5. Fixed boundary checks may repeat. These records share one mechanism and must remain together in evaluation splits.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":28.097,"exit_code":1,"observations":[{"actual":[["a","b"],[1,0,1]],"check":"repeat shares index","expected":[["b","a"],[0,1,0]],"passed":false},{"actual":[[],[]],"check":"empty","expected":[[],[]],"passed":true},{"actual":[["x"],[0]],"check":"single","expected":[["x"],[0]],"passed":true},{"actual":[["a","z"],[1,0,1]],"check":"first seen differs lexical","expected":[["z","a"],[0,1,0]],"passed":false},{"actual":[[0,1],[0,1,0]],"check":"zero-like labels","expected":[[0,1],[0,1,0]],"passed":true},{"actual":[["q"],[0]],"check":"all same","expected":[["q"],[0]],"passed":true},{"actual":[["a","b","c"],[2,1,0]],"check":"distinct sequence","expected":[["c","b","a"],[0,1,2]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"repeat shares index\", \"actual\": [[\"a\", \"b\"], [1, 0, 1]], \"expected\": [[\"b\", \"a\"], [0, 1, 0]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [[], []], \"expected\": [[], []], \"passed\": true}, {\"check\": \"single\", \"actual\": [[\"x\"], [0]], \"expected\": [[\"x\"], [0]], \"passed\": true}, {\"check\": \"first seen differs lexical\", \"actual\": [[\"a\", \"z\"], [1, 0, 1]], \"expected\": [[\"z\", \"a\"], [0, 1, 0]], \"passed\": false}, {\"check\": \"zero-like labels\", \"actual\": [[0, 1], [0, 1, 0]], \"expected\": [[0, 1], [0, 1, 0]], \"passed\": true}, {\"check\": \"all same\", \"actual\": [[\"q\"], [0]], \"expected\": [[\"q\"], [0]], \"passed\": true}, {\"check\": \"distinct sequence\", \"actual\": [[\"a\", \"b\", \"c\"], [2, 1, 0]], \"expected\": [[\"c\", \"b\", \"a\"], [0, 1, 2]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":27.062,"exit_code":1,"observations":[{"actual":[["b","a","b"],[0,1,2]],"check":"repeat shares index","expected":[["b","a"],[0,1,0]],"passed":false},{"actual":[[],[]],"check":"empty","expected":[[],[]],"passed":true},{"actual":[["x"],[0]],"check":"single","expected":[["x"],[0]],"passed":true},{"actual":[["z","a","z"],[0,1,2]],"check":"first seen differs lexical","expected":[["z","a"],[0,1,0]],"passed":false},{"actual":[[0,1,0],[0,1,2]],"check":"zero-like labels","expected":[[0,1],[0,1,0]],"passed":false},{"actual":[["q"],[0]],"check":"all same","expected":[["q"],[0]],"passed":true},{"actual":[["c","b","a"],[0,1,2]],"check":"distinct sequence","expected":[["c","b","a"],[0,1,2]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"repeat shares index\", \"actual\": [[\"b\", \"a\", \"b\"], [0, 1, 2]], \"expected\": [[\"b\", \"a\"], [0, 1, 0]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [[], []], \"expected\": [[], []], \"passed\": true}, {\"check\": \"single\", \"actual\": [[\"x\"], [0]], \"expected\": [[\"x\"], [0]], \"passed\": true}, {\"check\": \"first seen differs lexical\", \"actual\": [[\"z\", \"a\", \"z\"], [0, 1, 2]], \"expected\": [[\"z\", \"a\"], [0, 1, 0]], \"passed\": false}, {\"check\": \"zero-like labels\", \"actual\": [[0, 1, 0], [0, 1, 2]], \"expected\": [[0, 1], [0, 1, 0]], \"passed\": false}, {\"check\": \"all same\", \"actual\": [[\"q\"], [0]], \"expected\": [[\"q\"], [0]], \"passed\": true}, {\"check\": \"distinct sequence\", \"actual\": [[\"c\", \"b\", \"a\"], [0, 1, 2]], \"expected\": [[\"c\", \"b\", \"a\"], [0, 1, 2]], \"passed\": true}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}