{"abstract":"Least loaded route normalizes by capacity.","category":"Network routing","checks":4,"contract":"Bounded offline decision model: least loaded route normalizes by capacity. Inputs are already validated protocol fields; the explicit fixtures define the supported policy, not a complete protocol implementation.","evaluation_group":"xh-least-loaded-route-normalizes-by-capacity","failed_approach":"The attempted repair uses `max(servers,key=lambda s:s[1]/s[2])[0] if servers else None` and still violates a separate fixture.","family":"xh-least-loaded-route-normalizes-by-capacity","id":"FA-7136","implementations":{"attempt":{"sha256":"ff5d1aefb0850157a9057612bc836db8cc2b66325ddc91e7e7eceab8afc1e613","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport ipaddress\nimport re\nfrom urllib.parse import urlsplit, urljoin\nN = 1\nobservations = []\ndef solve(servers):\n    return max(servers,key=lambda s:s[1]/s[2])[0] if servers else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\n_fixtures = [\"check('fixture 1', solve([('a', 5, 10), ('b', 3, 3)]), 'a')\", \"check('fixture 2', solve([('a', 1, 10), ('b', 5, 10)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 1, 2)]), 'a')\"]\nfor _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:\n    exec(_line)\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":"bee65387e63fc3db7ec5d6c7583b17b0aef12090b66210731e8118fd88bf8093","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport ipaddress\nimport re\nfrom urllib.parse import urlsplit, urljoin\nN = 1\nobservations = []\ndef solve(servers):\n    return min(servers,key=lambda s:s[1])[0] if servers else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\n_fixtures = [\"check('fixture 1', solve([('a', 5, 10), ('b', 3, 3)]), 'a')\", \"check('fixture 2', solve([('a', 1, 10), ('b', 5, 10)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 1, 2)]), 'a')\"]\nfor _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:\n    exec(_line)\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":"f3d9cacc1b167e75218cf1fa327a3c11e95dbd7f6d43afeaa84119ab44d8a786","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport ipaddress\nimport re\nfrom urllib.parse import urlsplit, urljoin\nN = 1\nobservations = []\ndef solve(servers):\n    return min(servers,key=lambda s:s[1]/s[2])[0] if servers else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\n_fixtures = [\"check('fixture 1', solve([('a', 5, 10), ('b', 3, 3)]), 'a')\", \"check('fixture 2', solve([('a', 1, 10), ('b', 5, 10)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 1, 2)]), 'a')\"]\nfor _line in _fixtures[N % len(_fixtures):] + _fixtures[:N % len(_fixtures)]:\n    exec(_line)\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":"Bounded deterministic policy model over validated inputs; not a complete protocol stack or an interoperability claim. The five variants rotate the same explicit fixture set. 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":"xh-least-loaded-route-normalizes-by-capacity","generated_at":"2026-09-29T14:38:08.712247+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"This deterministic network routing model isolates the least-loaded-route-normalizes-by-capacity policy at a network component boundary.","repair":"Apply the explicit least-loaded-route-normalizes-by-capacity contract, including the tested boundary and negative cases.","root_cause":"The faulty implementation uses `min(servers,key=lambda s:s[1])[0] if servers else None` for the least-loaded-route-normalizes-by-capacity decision.","sha256":"20e06a28be29ed5deca675c7b13f0630a183998ecd862aeb726333cc90e88a9f","title":"Least loaded route normalizes by capacity · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":42.951,"exit_code":1,"observations":[{"actual":"b","check":"fixture 2","expected":"a","passed":false},{"actual":null,"check":"fixture 3","expected":null,"passed":true},{"actual":"a","check":"fixture 4","expected":"a","passed":true},{"actual":"b","check":"fixture 1","expected":"a","passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 2\", \"actual\": \"b\", \"expected\": \"a\", \"passed\": false}, {\"check\": \"fixture 3\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"fixture 4\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}, {\"check\": \"fixture 1\", \"actual\": \"b\", \"expected\": \"a\", \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.74,"exit_code":1,"observations":[{"actual":"a","check":"fixture 2","expected":"a","passed":true},{"actual":null,"check":"fixture 3","expected":null,"passed":true},{"actual":"a","check":"fixture 4","expected":"a","passed":true},{"actual":"b","check":"fixture 1","expected":"a","passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 2\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}, {\"check\": \"fixture 3\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"fixture 4\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}, {\"check\": \"fixture 1\", \"actual\": \"b\", \"expected\": \"a\", \"passed\": false}], \"passed\": false}\n"},"fixed":{"elapsed_ms":43.553,"exit_code":0,"observations":[{"actual":"a","check":"fixture 2","expected":"a","passed":true},{"actual":null,"check":"fixture 3","expected":null,"passed":true},{"actual":"a","check":"fixture 4","expected":"a","passed":true},{"actual":"a","check":"fixture 1","expected":"a","passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 2\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}, {\"check\": \"fixture 3\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"fixture 4\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}, {\"check\": \"fixture 1\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}