{"abstract":"One expert filling its quota blocks unrelated experts.","category":"Mixture of experts dispatch","checks":6,"contract":"Requests [token,expert,score] are considered in order; admit at most capacity per expert and preserve request order.","contract_signature":"requests,capacity","evaluation_group":"moe-expert-capacity","failed_approach":"The repair admits one extra route but still uses a global counter.","family":"w3-mixture-of-experts-dispatch-per-expert-cap","id":"FA-100551","implementations":{"attempt":{"sha256":"6fc3ffbad7ee9cbb420d34a623bf81183869bbe2d2b64390bd302db7ee8bf188","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(requests,capacity):\n    return [r for i,r in enumerate(requests) if i<=capacity]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\na='a'+str(N); b='b'+str(N); rows=[[0,a,3],[1,a,2],[2,b,4],[3,b,1]]\ncheck('independent quotas',solve(rows,1),[rows[0],rows[2]])\ncheck('capacity two',solve(rows,2),rows)\ncheck('zero capacity',solve(rows,0),[])\ncheck('empty requests',solve([],N),[])\ncheck('singleton',solve([[0,a,1]],1),[[0,a,1]])\ncheck('interleaved expert',solve([[0,a,1],[1,b,1],[2,a,2]],1),[[0,a,1],[1,b,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":"d3a782e2a789044a97fef8be1f6a1f518afea7dda3c680dc790d5e87f77eda48","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(requests,capacity):\n    return [r for i,r in enumerate(requests) if i<capacity]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\na='a'+str(N); b='b'+str(N); rows=[[0,a,3],[1,a,2],[2,b,4],[3,b,1]]\ncheck('independent quotas',solve(rows,1),[rows[0],rows[2]])\ncheck('capacity two',solve(rows,2),rows)\ncheck('zero capacity',solve(rows,0),[])\ncheck('empty requests',solve([],N),[])\ncheck('singleton',solve([[0,a,1]],1),[[0,a,1]])\ncheck('interleaved expert',solve([[0,a,1],[1,b,1],[2,a,2]],1),[[0,a,1],[1,b,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":"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-per-expert-cap","generated_at":"2026-09-30T16:48:36.731182+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":"Capacity is counted across the batch rather than separately per expert.","sha256":"8da2e835a05806c4682b5642bcaf92eae61e68e7a7a9401486d03267a59dc99e","title":"One expert filling its quota blocks unrelated experts · 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.543,"exit_code":1,"observations":[{"actual":[[0,"a1",3],[1,"a1",2]],"check":"independent quotas","expected":[[0,"a1",3],[2,"b1",4]],"passed":false},{"actual":[[0,"a1",3],[1,"a1",2],[2,"b1",4]],"check":"capacity two","expected":[[0,"a1",3],[1,"a1",2],[2,"b1",4],[3,"b1",1]],"passed":false},{"actual":[[0,"a1",3]],"check":"zero capacity","expected":[],"passed":false},{"actual":[],"check":"empty requests","expected":[],"passed":true},{"actual":[[0,"a1",1]],"check":"singleton","expected":[[0,"a1",1]],"passed":true},{"actual":[[0,"a1",1],[1,"b1",1]],"check":"interleaved expert","expected":[[0,"a1",1],[1,"b1",1]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"independent quotas\", \"actual\": [[0, \"a1\", 3], [1, \"a1\", 2]], \"expected\": [[0, \"a1\", 3], [2, \"b1\", 4]], \"passed\": false}, {\"check\": \"capacity two\", \"actual\": [[0, \"a1\", 3], [1, \"a1\", 2], [2, \"b1\", 4]], \"expected\": [[0, \"a1\", 3], [1, \"a1\", 2], [2, \"b1\", 4], [3, \"b1\", 1]], \"passed\": false}, {\"check\": \"zero capacity\", \"actual\": [[0, \"a1\", 3]], \"expected\": [], \"passed\": false}, {\"check\": \"empty requests\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[0, \"a1\", 1]], \"expected\": [[0, \"a1\", 1]], \"passed\": true}, {\"check\": \"interleaved expert\", \"actual\": [[0, \"a1\", 1], [1, \"b1\", 1]], \"expected\": [[0, \"a1\", 1], [1, \"b1\", 1]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":28.022,"exit_code":1,"observations":[{"actual":[[0,"a1",3]],"check":"independent quotas","expected":[[0,"a1",3],[2,"b1",4]],"passed":false},{"actual":[[0,"a1",3],[1,"a1",2]],"check":"capacity two","expected":[[0,"a1",3],[1,"a1",2],[2,"b1",4],[3,"b1",1]],"passed":false},{"actual":[],"check":"zero capacity","expected":[],"passed":true},{"actual":[],"check":"empty requests","expected":[],"passed":true},{"actual":[[0,"a1",1]],"check":"singleton","expected":[[0,"a1",1]],"passed":true},{"actual":[[0,"a1",1]],"check":"interleaved expert","expected":[[0,"a1",1],[1,"b1",1]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"independent quotas\", \"actual\": [[0, \"a1\", 3]], \"expected\": [[0, \"a1\", 3], [2, \"b1\", 4]], \"passed\": false}, {\"check\": \"capacity two\", \"actual\": [[0, \"a1\", 3], [1, \"a1\", 2]], \"expected\": [[0, \"a1\", 3], [1, \"a1\", 2], [2, \"b1\", 4], [3, \"b1\", 1]], \"passed\": false}, {\"check\": \"zero capacity\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty requests\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[0, \"a1\", 1]], \"expected\": [[0, \"a1\", 1]], \"passed\": true}, {\"check\": \"interleaved expert\", \"actual\": [[0, \"a1\", 1]], \"expected\": [[0, \"a1\", 1], [1, \"b1\", 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."}}