{"abstract":"Negating the output is confused with negating the argument.","category":"Polynomial arithmetic","checks":4,"contract":"Integer coefficients in ascending power order and integer evaluation bounds; missing high-degree coefficients are zero. Rational outputs are reduced Fraction strings; the zero-polynomial degree is -1. Polynomial compose negative argument. Exact operational definition: [c*(-1)**i for i,c in enumerate(coeff)]","contract_signature":"coeff","evaluation_group":"model-c718cdba8949ed4a","failed_approach":"Reversing coefficients changes degree placement rather than argument sign.","family":"xn-polynomial-compose-negative-argument","id":"FA-6171","implementations":{"attempt":{"sha256":"d50f06fc9c27eff598c75620abb139eafffeca40ab07ca94cdac227fd54c94c0","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport calendar\nimport statistics\nimport itertools\nfrom fractions import Fraction\nfrom datetime import date, datetime, timedelta, timezone\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_DOWN, ROUND_CEILING, ROUND_FLOOR\n\nN = 1\nobservations = []\ndef solve(coeff):\n    return list(reversed(coeff))\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('fixture 1: ([1, 2, 3],)', solve(*([1, 2, 3],)), [1, -2, 3])\ncheck('fixture 2: ([5],)', solve(*([5],)), [5])\ncheck('fixture 3: ([0, 1, 0, -2],)', solve(*([0, 1, 0, -2],)), [0, -1, 0, 2])\ncheck('fixture 4: ([],)', solve(*([],)), [])\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":"df16d4b705e2d9764c2e2cb01f2d73c78e93c402fd8bef8fd719597c2fedd15a","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport calendar\nimport statistics\nimport itertools\nfrom fractions import Fraction\nfrom datetime import date, datetime, timedelta, timezone\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_DOWN, ROUND_CEILING, ROUND_FLOOR\n\nN = 1\nobservations = []\ndef solve(coeff):\n    return [-c for c in coeff]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('fixture 1: ([1, 2, 3],)', solve(*([1, 2, 3],)), [1, -2, 3])\ncheck('fixture 2: ([5],)', solve(*([5],)), [5])\ncheck('fixture 3: ([0, 1, 0, -2],)', solve(*([0, 1, 0, -2],)), [0, -1, 0, 2])\ncheck('fixture 4: ([],)', solve(*([],)), [])\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":" 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":"xn-polynomial-compose-negative-argument","generated_at":"2026-09-29T14:37:58.516389+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Small exact fixtures expose this error without platform timing, external services, or probabilistic observations. Polynomial arithmetic results depend on the stated convention.","root_cause":"Negating the output is confused with negating the argument.","sha256":"8c64b4a40fa42fc968a36fe190e9d2371f8b23c34d070b86ff9bf9575f73f574","title":"Polynomial compose negative argument · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":112.991,"exit_code":1,"observations":[{"actual":[3,2,1],"check":"fixture 1: ([1, 2, 3],)","expected":[1,-2,3],"passed":false},{"actual":[5],"check":"fixture 2: ([5],)","expected":[5],"passed":true},{"actual":[-2,0,1,0],"check":"fixture 3: ([0, 1, 0, -2],)","expected":[0,-1,0,2],"passed":false},{"actual":[],"check":"fixture 4: ([],)","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 1: ([1, 2, 3],)\", \"actual\": [3, 2, 1], \"expected\": [1, -2, 3], \"passed\": false}, {\"check\": \"fixture 2: ([5],)\", \"actual\": [5], \"expected\": [5], \"passed\": true}, {\"check\": \"fixture 3: ([0, 1, 0, -2],)\", \"actual\": [-2, 0, 1, 0], \"expected\": [0, -1, 0, 2], \"passed\": false}, {\"check\": \"fixture 4: ([],)\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":45.361,"exit_code":1,"observations":[{"actual":[-1,-2,-3],"check":"fixture 1: ([1, 2, 3],)","expected":[1,-2,3],"passed":false},{"actual":[-5],"check":"fixture 2: ([5],)","expected":[5],"passed":false},{"actual":[0,-1,0,2],"check":"fixture 3: ([0, 1, 0, -2],)","expected":[0,-1,0,2],"passed":true},{"actual":[],"check":"fixture 4: ([],)","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"fixture 1: ([1, 2, 3],)\", \"actual\": [-1, -2, -3], \"expected\": [1, -2, 3], \"passed\": false}, {\"check\": \"fixture 2: ([5],)\", \"actual\": [-5], \"expected\": [5], \"passed\": false}, {\"check\": \"fixture 3: ([0, 1, 0, -2],)\", \"actual\": [0, -1, 0, 2], \"expected\": [0, -1, 0, 2], \"passed\": true}, {\"check\": \"fixture 4: ([],)\", \"actual\": [], \"expected\": [], \"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."}}