{"abstract":"Map matching snaps a waypoint onto an inaccessible bridge deck in the controlled route-policy fixture.","category":"Navigation route constraints","checks":7,"contract":"Candidates are (ID, nonnegative integer distance, deck, modes). Return the closest ID matching the known deck and requested mode, or None. Ties use lexicographic ID.","evaluation_group":"model-ae63d04da54a8e46","failed_approach":"Filtering by deck fixes elevation confusion but ignores travel-mode permission.","family":"z-navigation_routes-map-deck-snap","id":"FA-12231","implementations":{"attempt":{"sha256":"faaaadcb17b564ae3c1b2e1ea6b944f2edb80f7f4f306604f55c533c93e62b12","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(candidates, deck, mode):\n    eligible = [c for c in candidates if c[2] == deck]\n    return min(eligible,key=lambda c:(c[1],c[0]))[0] if eligible else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nc = [('bridge',0,N+1,['car']),('walk',1,N,['walk']),('road',2,N,['car'])]\ncheck('deck and mode', solve(c,N,'car'), 'road')\ncheck('pedestrian deck', solve(c,N,'walk'), 'walk')\ncheck('bridge deck', solve(c,N+1,'car'), 'bridge')\ncheck('missing mode', solve(c,N,'bike'), None)\ncheck('missing deck', solve(c,N+2,'car'), None)\ncheck('empty candidates', solve([],N,'car'), None)\ncheck('stable tie', solve([('z',N,N,['car']),('a',N,N,['car'])],N,'car'), 'a')\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":"d266e653df86104889c45cd124f91ea6204ce848cbd4b0541c56896e6529fd55","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(candidates, deck, mode):\n    return min(candidates, key=lambda c:(c[1],c[0]))[0] if candidates else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nc = [('bridge',0,N+1,['car']),('walk',1,N,['walk']),('road',2,N,['car'])]\ncheck('deck and mode', solve(c,N,'car'), 'road')\ncheck('pedestrian deck', solve(c,N,'walk'), 'walk')\ncheck('bridge deck', solve(c,N+1,'car'), 'bridge')\ncheck('missing mode', solve(c,N,'bike'), None)\ncheck('missing deck', solve(c,N+2,'car'), None)\ncheck('empty candidates', solve([],N,'car'), None)\ncheck('stable tie', solve([('z',N,N,['car']),('a',N,N,['car'])],N,'car'), 'a')\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":"3115580c93adeda474d35639aafa9bed4d151e8908257267414841d7c601cc67","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(candidates, deck, mode):\n    eligible = [c for c in candidates if c[2] == deck and mode in c[3]]\n    return min(eligible,key=lambda c:(c[1],c[0]))[0] if eligible else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nc = [('bridge',0,N+1,['car']),('walk',1,N,['walk']),('road',2,N,['car'])]\ncheck('deck and mode', solve(c,N,'car'), 'road')\ncheck('pedestrian deck', solve(c,N,'walk'), 'walk')\ncheck('bridge deck', solve(c,N+1,'car'), 'bridge')\ncheck('missing mode', solve(c,N,'bike'), None)\ncheck('missing deck', solve(c,N+2,'car'), None)\ncheck('empty candidates', solve([],N,'car'), None)\ncheck('stable tie', solve([('z',N,N,['car']),('a',N,N,['car'])],N,'car'), 'a')\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":"Simplified deterministic offline policy model; not a production router or authoritative road guidance. 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":"z-navigation_routes-map-deck-snap","generated_at":"2026-09-29T14:38:54.964950+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Navigation policies depend on road context that a shortest-path cost alone does not encode.","repair":"Filter by deck and mode before minimizing distance with stable ID tie-breaking.","root_cause":"Horizontal proximity ignores the explicitly known road level.","sha256":"d5bae18d31bb2899ab9b1b67e3bd354a0ed55a47787233d01df8ee4eab6f4513","title":"Map matching snaps a waypoint onto an inaccessible bridge deck · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":38.783,"exit_code":1,"observations":[{"actual":"walk","check":"deck and mode","expected":"road","passed":false},{"actual":"walk","check":"pedestrian deck","expected":"walk","passed":true},{"actual":"bridge","check":"bridge deck","expected":"bridge","passed":true},{"actual":"walk","check":"missing mode","expected":null,"passed":false},{"actual":null,"check":"missing deck","expected":null,"passed":true},{"actual":null,"check":"empty candidates","expected":null,"passed":true},{"actual":"a","check":"stable tie","expected":"a","passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deck and mode\", \"actual\": \"walk\", \"expected\": \"road\", \"passed\": false}, {\"check\": \"pedestrian deck\", \"actual\": \"walk\", \"expected\": \"walk\", \"passed\": true}, {\"check\": \"bridge deck\", \"actual\": \"bridge\", \"expected\": \"bridge\", \"passed\": true}, {\"check\": \"missing mode\", \"actual\": \"walk\", \"expected\": null, \"passed\": false}, {\"check\": \"missing deck\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"empty candidates\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"stable tie\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":38.944,"exit_code":1,"observations":[{"actual":"bridge","check":"deck and mode","expected":"road","passed":false},{"actual":"bridge","check":"pedestrian deck","expected":"walk","passed":false},{"actual":"bridge","check":"bridge deck","expected":"bridge","passed":true},{"actual":"bridge","check":"missing mode","expected":null,"passed":false},{"actual":"bridge","check":"missing deck","expected":null,"passed":false},{"actual":null,"check":"empty candidates","expected":null,"passed":true},{"actual":"a","check":"stable tie","expected":"a","passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deck and mode\", \"actual\": \"bridge\", \"expected\": \"road\", \"passed\": false}, {\"check\": \"pedestrian deck\", \"actual\": \"bridge\", \"expected\": \"walk\", \"passed\": false}, {\"check\": \"bridge deck\", \"actual\": \"bridge\", \"expected\": \"bridge\", \"passed\": true}, {\"check\": \"missing mode\", \"actual\": \"bridge\", \"expected\": null, \"passed\": false}, {\"check\": \"missing deck\", \"actual\": \"bridge\", \"expected\": null, \"passed\": false}, {\"check\": \"empty candidates\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"stable tie\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":41.251,"exit_code":0,"observations":[{"actual":"road","check":"deck and mode","expected":"road","passed":true},{"actual":"walk","check":"pedestrian deck","expected":"walk","passed":true},{"actual":"bridge","check":"bridge deck","expected":"bridge","passed":true},{"actual":null,"check":"missing mode","expected":null,"passed":true},{"actual":null,"check":"missing deck","expected":null,"passed":true},{"actual":null,"check":"empty candidates","expected":null,"passed":true},{"actual":"a","check":"stable tie","expected":"a","passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"deck and mode\", \"actual\": \"road\", \"expected\": \"road\", \"passed\": true}, {\"check\": \"pedestrian deck\", \"actual\": \"walk\", \"expected\": \"walk\", \"passed\": true}, {\"check\": \"bridge deck\", \"actual\": \"bridge\", \"expected\": \"bridge\", \"passed\": true}, {\"check\": \"missing mode\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"missing deck\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"empty candidates\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"stable tie\", \"actual\": \"a\", \"expected\": \"a\", \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}