{"abstract":"Tokens with too few available routes are partially dispatched.","category":"Mixture of experts dispatch","checks":6,"contract":"For each token’s ranked routes, select up to k experts; emit the token with its selected list only if at least minimum routes survive.","contract_signature":"choices,k,minimum","evaluation_group":"moe-minimum-route-count","failed_approach":"Checking the minimum before capacity drops can keep a token that later falls below minimum.","family":"w3-mixture-of-experts-dispatch-minimum-routes","id":"FA-100631","implementations":{"attempt":{"sha256":"c1bdc45891148e677ab723956b50f52b4436fa9add7a4c1c397aaef28c4ac84d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(choices,k,minimum):\n    return [[i,row[:k]] for i,row in enumerate(choices) if len(row)>=minimum]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ne='e'+str(N); f='f'+str(N); rows=[[(e,3),(f,2)],[(e,1)],[]]\ncheck('minimum two',solve(rows,2,2),[[0,[(e,3),(f,2)]]])\ncheck('minimum one',solve(rows,1,1),[[0,[(e,3)]],[1,[(e,1)]]])\ncheck('zero minimum',solve(rows,1,0),[[0,[(e,3)]],[1,[(e,1)]],[2,[]]])\ncheck('empty choices',solve([],N,1),[])\ncheck('k below minimum',solve(rows,1,2),[])\ncheck('exact minimum',solve([[(e,1),(f,2)]],2,2),[[0,[(e,1),(f,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":"eb168e083de139507cba1254d26c83e457f6aca9816c99e6fb3d33e2cfa79ab4","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(choices,k,minimum):\n    return [[i,row[:k]] for i,row in enumerate(choices)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ne='e'+str(N); f='f'+str(N); rows=[[(e,3),(f,2)],[(e,1)],[]]\ncheck('minimum two',solve(rows,2,2),[[0,[(e,3),(f,2)]]])\ncheck('minimum one',solve(rows,1,1),[[0,[(e,3)]],[1,[(e,1)]]])\ncheck('zero minimum',solve(rows,1,0),[[0,[(e,3)]],[1,[(e,1)]],[2,[]]])\ncheck('empty choices',solve([],N,1),[])\ncheck('k below minimum',solve(rows,1,2),[])\ncheck('exact minimum',solve([[(e,1),(f,2)]],2,2),[[0,[(e,1),(f,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":"Inputs are finite toy scores and routes; the contract does not model a production model, accelerator, or learned routing quality. 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-mixture-of-experts-dispatch-minimum-routes","generated_at":"2026-09-30T16:48:37.646367+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic toy router makes this dispatch decision independently inspectable.","root_cause":"The router returns a partial assignment despite a minimum route contract.","sha256":"2dc7e0a48c72e241b77eeedcef1d450ff33b09d4d730fe56e028b660cb571224","title":"Tokens with too few available routes are partially dispatched · 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":30.273,"exit_code":1,"observations":[{"actual":[[0,[["e1",3],["f1",2]]]],"check":"minimum two","expected":[[0,[["e1",3],["f1",2]]]],"passed":true},{"actual":[[0,[["e1",3]]],[1,[["e1",1]]]],"check":"minimum one","expected":[[0,[["e1",3]]],[1,[["e1",1]]]],"passed":true},{"actual":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"check":"zero minimum","expected":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"passed":true},{"actual":[],"check":"empty choices","expected":[],"passed":true},{"actual":[[0,[["e1",3]]]],"check":"k below minimum","expected":[],"passed":false},{"actual":[[0,[["e1",1],["f1",2]]]],"check":"exact minimum","expected":[[0,[["e1",1],["f1",2]]]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"minimum two\", \"actual\": [[0, [[\"e1\", 3], [\"f1\", 2]]]], \"expected\": [[0, [[\"e1\", 3], [\"f1\", 2]]]], \"passed\": true}, {\"check\": \"minimum one\", \"actual\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]]], \"expected\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]]], \"passed\": true}, {\"check\": \"zero minimum\", \"actual\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"expected\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"passed\": true}, {\"check\": \"empty choices\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"k below minimum\", \"actual\": [[0, [[\"e1\", 3]]]], \"expected\": [], \"passed\": false}, {\"check\": \"exact minimum\", \"actual\": [[0, [[\"e1\", 1], [\"f1\", 2]]]], \"expected\": [[0, [[\"e1\", 1], [\"f1\", 2]]]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":27.041,"exit_code":1,"observations":[{"actual":[[0,[["e1",3],["f1",2]]],[1,[["e1",1]]],[2,[]]],"check":"minimum two","expected":[[0,[["e1",3],["f1",2]]]],"passed":false},{"actual":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"check":"minimum one","expected":[[0,[["e1",3]]],[1,[["e1",1]]]],"passed":false},{"actual":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"check":"zero minimum","expected":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"passed":true},{"actual":[],"check":"empty choices","expected":[],"passed":true},{"actual":[[0,[["e1",3]]],[1,[["e1",1]]],[2,[]]],"check":"k below minimum","expected":[],"passed":false},{"actual":[[0,[["e1",1],["f1",2]]]],"check":"exact minimum","expected":[[0,[["e1",1],["f1",2]]]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"minimum two\", \"actual\": [[0, [[\"e1\", 3], [\"f1\", 2]]], [1, [[\"e1\", 1]]], [2, []]], \"expected\": [[0, [[\"e1\", 3], [\"f1\", 2]]]], \"passed\": false}, {\"check\": \"minimum one\", \"actual\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"expected\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]]], \"passed\": false}, {\"check\": \"zero minimum\", \"actual\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"expected\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"passed\": true}, {\"check\": \"empty choices\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"k below minimum\", \"actual\": [[0, [[\"e1\", 3]]], [1, [[\"e1\", 1]]], [2, []]], \"expected\": [], \"passed\": false}, {\"check\": \"exact minimum\", \"actual\": [[0, [[\"e1\", 1], [\"f1\", 2]]]], \"expected\": [[0, [[\"e1\", 1], [\"f1\", 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."}}