{"abstract":"Route metric breaks equal prefix ties in ascending order.","category":"Network routing","checks":4,"contract":"Bounded offline decision model: route metric breaks equal prefix ties in ascending order. Inputs are already validated protocol fields; the explicit fixtures define the supported policy, not a complete protocol implementation.","evaluation_group":"xh-route-metric-breaks-equal-prefix-ties-in-ascending-order","failed_approach":"The attempted repair uses `routes[0][0] if routes else None` and still violates a separate fixture.","family":"xh-route-metric-breaks-equal-prefix-ties-in-ascending-order","id":"FA-7086","implementations":{"attempt":{"sha256":"20804586c7c87538cf171412ae4e686664d6bb0e4fec011b7feeba42403893cc","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(routes):\n    return routes[0][0] if routes 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', 20), ('b', 10)]), 'b')\", \"check('fixture 2', solve([('a', 10), ('b', 20)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 0)]), '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":"8c8ce253b66bd9b7087945ee643f3b256474f5c95cc70a740711477f4d141d06","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(routes):\n    return max(routes,key=lambda r:r[1])[0] if routes 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', 20), ('b', 10)]), 'b')\", \"check('fixture 2', solve([('a', 10), ('b', 20)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 0)]), '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":"49ab9f94c3422ac09fd6862484789525534dc436c633e3ba4ac6d83e3060d121","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(routes):\n    return min(routes,key=lambda r:r[1])[0] if routes 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', 20), ('b', 10)]), 'b')\", \"check('fixture 2', solve([('a', 10), ('b', 20)]), 'a')\", \"check('fixture 3', solve([]), None)\", \"check('fixture 4', solve([('a', 0)]), '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-route-metric-breaks-equal-prefix-ties-in-ascending-order","generated_at":"2026-09-29T14:38:08.310429+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"This deterministic network routing model isolates the route-metric-breaks-equal-prefix-ties-in-ascending-order policy at a network component boundary.","repair":"Apply the explicit route-metric-breaks-equal-prefix-ties-in-ascending-order contract, including the tested boundary and negative cases.","root_cause":"The faulty implementation uses `max(routes,key=lambda r:r[1])[0] if routes else None` for the route-metric-breaks-equal-prefix-ties-in-ascending-order decision.","sha256":"5869bed49562c6f1dac71bfb82fcde94128383d3e1bdddfef0f47487bbb7b4ce","title":"Route metric breaks equal prefix ties in ascending order · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":42.274,"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":"a","check":"fixture 1","expected":"b","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\": \"a\", \"expected\": \"b\", \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":38.448,"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":"a","check":"fixture 1","expected":"b","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\": \"a\", \"expected\": \"b\", \"passed\": false}], \"passed\": false}\n"},"fixed":{"elapsed_ms":120.682,"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":"b","check":"fixture 1","expected":"b","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\": \"b\", \"expected\": \"b\", \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}