{"abstract":"Ordinal labels use a single class bit instead of cumulative thresholds.","category":"Training label alignment","checks":7,"contract":"For class index y and class_count C, return C-1 bits where bit j is 1 exactly when y>j; invalid y returns all zeros.","contract_signature":"labels, class_count","evaluation_group":"training-label-alignment-cumulative-ordinal-encoding","failed_approach":"Repeating one threshold bit across columns still loses which boundaries the class has crossed.","family":"w3-training-label-alignment-ordinal-threshold-targets","id":"FA-98026","implementations":{"attempt":{"sha256":"e5510980cbbf8f43a30364a2108f9e21ea3eaa89de2c6f8933a389ce48003568","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(labels, class_count):\n    return [[int(y>0)]*(class_count-1) for y in labels]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('upper ordinal class',solve([N],N+1),[[1]*N])\ncheck('middle class',solve([1],4),[[1,0,0]])\ncheck('lowest class',solve([0],N+1),[[0]*N])\ncheck('empty labels',solve([],N),[])\ncheck('one class has no thresholds',solve([0],1),[[]])\ncheck('invalid class',solve([N+1],N+1),[[0]*N])\ncheck('several labels',solve([0,2],3),[[0,0],[1,1]])\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":"01e84244832b5a39c8b22e3210f59c0a671e3b7bb91e08b34d0edf73e4add9b6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(labels, class_count):\n    return [[int(j==y) for j in range(class_count-1)] for y in labels]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('upper ordinal class',solve([N],N+1),[[1]*N])\ncheck('middle class',solve([1],4),[[1,0,0]])\ncheck('lowest class',solve([0],N+1),[[0]*N])\ncheck('empty labels',solve([],N),[])\ncheck('one class has no thresholds',solve([0],1),[[]])\ncheck('invalid class',solve([N+1],N+1),[[0]*N])\ncheck('several labels',solve([0,2],3),[[0,0],[1,1]])\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":"Class indices are integers and class_count is positive. 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-ordinal-threshold-targets","generated_at":"2026-09-30T16:48:08.407559+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":"An ordinal category is encoded as ordinary one-hot classification.","sha256":"04116bfe7645cbca829824d5f50e69f8e4b5f5d260e108fa4d6b9dba46dc83ee","title":"Ordinal labels use a single class bit instead of cumulative thresholds · 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":27.15,"exit_code":1,"observations":[{"actual":[[1]],"check":"upper ordinal class","expected":[[1]],"passed":true},{"actual":[[1,1,1]],"check":"middle class","expected":[[1,0,0]],"passed":false},{"actual":[[0]],"check":"lowest class","expected":[[0]],"passed":true},{"actual":[],"check":"empty labels","expected":[],"passed":true},{"actual":[[]],"check":"one class has no thresholds","expected":[[]],"passed":true},{"actual":[[1]],"check":"invalid class","expected":[[0]],"passed":false},{"actual":[[0,0],[1,1]],"check":"several labels","expected":[[0,0],[1,1]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"upper ordinal class\", \"actual\": [[1]], \"expected\": [[1]], \"passed\": true}, {\"check\": \"middle class\", \"actual\": [[1, 1, 1]], \"expected\": [[1, 0, 0]], \"passed\": false}, {\"check\": \"lowest class\", \"actual\": [[0]], \"expected\": [[0]], \"passed\": true}, {\"check\": \"empty labels\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"one class has no thresholds\", \"actual\": [[]], \"expected\": [[]], \"passed\": true}, {\"check\": \"invalid class\", \"actual\": [[1]], \"expected\": [[0]], \"passed\": false}, {\"check\": \"several labels\", \"actual\": [[0, 0], [1, 1]], \"expected\": [[0, 0], [1, 1]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":25.516,"exit_code":1,"observations":[{"actual":[[0]],"check":"upper ordinal class","expected":[[1]],"passed":false},{"actual":[[0,1,0]],"check":"middle class","expected":[[1,0,0]],"passed":false},{"actual":[[1]],"check":"lowest class","expected":[[0]],"passed":false},{"actual":[],"check":"empty labels","expected":[],"passed":true},{"actual":[[]],"check":"one class has no thresholds","expected":[[]],"passed":true},{"actual":[[0]],"check":"invalid class","expected":[[0]],"passed":true},{"actual":[[1,0],[0,0]],"check":"several labels","expected":[[0,0],[1,1]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"upper ordinal class\", \"actual\": [[0]], \"expected\": [[1]], \"passed\": false}, {\"check\": \"middle class\", \"actual\": [[0, 1, 0]], \"expected\": [[1, 0, 0]], \"passed\": false}, {\"check\": \"lowest class\", \"actual\": [[1]], \"expected\": [[0]], \"passed\": false}, {\"check\": \"empty labels\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"one class has no thresholds\", \"actual\": [[]], \"expected\": [[]], \"passed\": true}, {\"check\": \"invalid class\", \"actual\": [[0]], \"expected\": [[0]], \"passed\": true}, {\"check\": \"several labels\", \"actual\": [[1, 0], [0, 0]], \"expected\": [[0, 0], [1, 1]], \"passed\": false}], \"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."}}