{"abstract":"Call clearing chooses peak demand instead of executable volume.","category":"Auction allocation rules","checks":6,"contract":"Given candidate rows [price,demand,supply], choose maximum min(demand,supply), then minimum abs(demand-supply), then lowest price. Empty rows return None.","evaluation_group":"model-d81c1b3977e6dc61","failed_approach":"Maximizing volume without the specified imbalance tie-break selects a less balanced price.","family":"z-auction_matching-call-price-objective","id":"FA-12731","implementations":{"attempt":{"sha256":"a76ea0ee69fbfb9447257da6d2d078a1fa0662a77af2e736da9f287ae3bc0242","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    return min(rows,key=lambda r:(-min(r[1],r[2]),r[0]))[0] if rows else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('balance tie breaker', solve([[N,10,4],[N+1,4,4]]), N+1)\ncheck('volume before balance', solve([[1,2,2],[2,9,5]]), 2)\ncheck('lowest final tie', solve([[5,4,4],[3,4,4]]), 3)\ncheck('empty', solve([]), None)\ncheck('single', solve([[7,0,0]]), 7)\ncheck('supply shortage', solve([[1,20,1],[2,4,3]]), 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":"2f364189eb6a60bed400d2d3da78011838d931604432bfe71c0612be0f53d32d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    return max(rows,key=lambda r:r[1])[0] if rows else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('balance tie breaker', solve([[N,10,4],[N+1,4,4]]), N+1)\ncheck('volume before balance', solve([[1,2,2],[2,9,5]]), 2)\ncheck('lowest final tie', solve([[5,4,4],[3,4,4]]), 3)\ncheck('empty', solve([]), None)\ncheck('single', solve([[7,0,0]]), 7)\ncheck('supply shortage', solve([[1,20,1],[2,4,3]]), 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"},"fixed":{"sha256":"c384965e516a93058751825b0053c29d53c9c9c67abea604d78c7a8ab9f2bb59","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    return min(rows,key=lambda r:(-min(r[1],r[2]),abs(r[1]-r[2]),r[0]))[0] if rows else None\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('balance tie breaker', solve([[N,10,4],[N+1,4,4]]), N+1)\ncheck('volume before balance', solve([[1,2,2],[2,9,5]]), 2)\ncheck('lowest final tie', solve([[5,4,4],[3,4,4]]), 3)\ncheck('empty', solve([]), None)\ncheck('single', solve([[7,0,0]]), 7)\ncheck('supply shortage', solve([[1,20,1],[2,4,3]]), 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":"Offline toy model with explicit integer inputs; no strategic behavior or real market execution. 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-auction_matching-call-price-objective","generated_at":"2026-09-29T14:38:59.474970+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Deterministic teaching model for reviewing auction allocation software; not a representation of any venue or financial advice.","repair":"Implement the stated toy allocation contract directly: Given candidate rows [price,demand,supply], choose maximum min(demand,supply), then minimum abs(demand-supply), then lowest price. Empty rows return None.","root_cause":"Price selection maximizes demand rather than matched volume.","sha256":"5e1c8a5238ff7151b703f4eaa039774d28e6a711a94cd0748b47846b20090190","title":"Call clearing chooses peak demand instead of executable volume · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":42.733,"exit_code":1,"observations":[{"actual":1,"check":"balance tie breaker","expected":2,"passed":false},{"actual":2,"check":"volume before balance","expected":2,"passed":true},{"actual":3,"check":"lowest final tie","expected":3,"passed":true},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":7,"check":"single","expected":7,"passed":true},{"actual":2,"check":"supply shortage","expected":2,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"balance tie breaker\", \"actual\": 1, \"expected\": 2, \"passed\": false}, {\"check\": \"volume before balance\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"lowest final tie\", \"actual\": 3, \"expected\": 3, \"passed\": true}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"single\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"supply shortage\", \"actual\": 2, \"expected\": 2, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.424,"exit_code":1,"observations":[{"actual":1,"check":"balance tie breaker","expected":2,"passed":false},{"actual":2,"check":"volume before balance","expected":2,"passed":true},{"actual":5,"check":"lowest final tie","expected":3,"passed":false},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":7,"check":"single","expected":7,"passed":true},{"actual":1,"check":"supply shortage","expected":2,"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"balance tie breaker\", \"actual\": 1, \"expected\": 2, \"passed\": false}, {\"check\": \"volume before balance\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"lowest final tie\", \"actual\": 5, \"expected\": 3, \"passed\": false}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"single\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"supply shortage\", \"actual\": 1, \"expected\": 2, \"passed\": false}], \"passed\": false}\n"},"fixed":{"elapsed_ms":41.112,"exit_code":0,"observations":[{"actual":2,"check":"balance tie breaker","expected":2,"passed":true},{"actual":2,"check":"volume before balance","expected":2,"passed":true},{"actual":3,"check":"lowest final tie","expected":3,"passed":true},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":7,"check":"single","expected":7,"passed":true},{"actual":2,"check":"supply shortage","expected":2,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"balance tie breaker\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"volume before balance\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"lowest final tie\", \"actual\": 3, \"expected\": 3, \"passed\": true}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"single\", \"actual\": 7, \"expected\": 7, \"passed\": true}, {\"check\": \"supply shortage\", \"actual\": 2, \"expected\": 2, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}