{"abstract":"The exact polynomial taylor shift result violates the stated contract at source degree iteration.","category":"Numerics","checks":8,"contract":"Input [A,h] ascending integer polynomial, integer h; return coefficients of A(t+h), preserving array length.","contract_signature":"x","evaluation_group":"s3-numerics-polynomial-taylor-shift","failed_approach":"The partial repair range(1,n) still violates the source degree iteration invariant.","family":"s3-numerics-polynomial-taylor-shift-source-degree-iteration","id":"FA-14641","implementations":{"attempt":{"sha256":"67dbc92e19b62d00e95fb243f104ec660b879ebd282a219cf9d79ee7f673f059","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport itertools\nfrom fractions import Fraction\nN = 1\nobservations = []\ndef solve(x):\n    A,h=x\n    n=len(A);r=[0]*n\n    for i in range(1,n):\n     for j in range(i+1):\n      r[j]+=(A[i]) * (math.comb(i,j) if j<=i else 0) * (h**(i-j) if j<=i else 0)\n    return r\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, -1, -1], -1], [0, -2, 2, -1]), ([[-1, -1, -1, -1], 0], [-1, -1, -1, -1]), ([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, -1], 2], [-15, -17, -7, -1]), ([[-1, -1, -1, 0], -2], [-3, 3, -1, 0]), ([[-1, -1, -1, 0], -1], [-1, 1, -1, 0])], [([[-1, -1, -1, -1], -1], [0, -2, 2, -1]), ([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, -1, 2], 0], [-1, -1, -1, 2]), ([[-1, -1, -1, 2], 1], [-1, 3, 5, 2]), ([[-1, -1, -1, 2], 2], [9, 19, 11, 2]), ([[-1, -1, 0, -1], -2], [9, -13, 6, -1])], [([[-1, -1, -1, -1], 0], [-1, -1, -1, -1]), ([[-1, -1, -1, 0], -1], [-1, 1, -1, 0]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 0, 1], 2], [5, 11, 6, 1]), ([[-1, -1, 0, 2], -2], [-15, 23, -12, 2]), ([[-1, -1, 0, 2], -1], [-2, 5, -6, 2]), ([[-1, -1, 0, 2], 0], [-1, -1, 0, 2])], [([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, 0], 2], [-7, -5, -1, 0]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 1, 1], -1], [0, 0, -2, 1]), ([[-1, -1, 1, 1], 0], [-1, -1, 1, 1]), ([[-1, -1, 1, 1], 1], [0, 4, 4, 1]), ([[-1, -1, 1, 1], 2], [9, 15, 7, 1])], [([[-1, -1, -1, -1], 2], [-15, -17, -7, -1]), ([[-1, -1, -1, 1], 0], [-1, -1, -1, 1]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 2, 0], 1], [0, 3, 2, 0]), ([[-1, -1, 2, 0], 2], [5, 7, 2, 0]), ([[-1, -1, 2, 1], -2], [1, 3, -4, 1]), ([[-1, -1, 2, 1], -1], [1, -2, -1, 1])]]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"explicit oracle %d\" % i, solve(args), expected)\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":"b0acb129207213ef20a25acc8aec57b48d0fc3217cf40c52da636f0b34cb5789","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport math\nimport itertools\nfrom fractions import Fraction\nN = 1\nobservations = []\ndef solve(x):\n    A,h=x\n    n=len(A);r=[0]*n\n    for i in range(n-1):\n     for j in range(i+1):\n      r[j]+=(A[i]) * (math.comb(i,j) if j<=i else 0) * (h**(i-j) if j<=i else 0)\n    return r\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, -1, -1], -1], [0, -2, 2, -1]), ([[-1, -1, -1, -1], 0], [-1, -1, -1, -1]), ([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, -1], 2], [-15, -17, -7, -1]), ([[-1, -1, -1, 0], -2], [-3, 3, -1, 0]), ([[-1, -1, -1, 0], -1], [-1, 1, -1, 0])], [([[-1, -1, -1, -1], -1], [0, -2, 2, -1]), ([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, -1, 2], 0], [-1, -1, -1, 2]), ([[-1, -1, -1, 2], 1], [-1, 3, 5, 2]), ([[-1, -1, -1, 2], 2], [9, 19, 11, 2]), ([[-1, -1, 0, -1], -2], [9, -13, 6, -1])], [([[-1, -1, -1, -1], 0], [-1, -1, -1, -1]), ([[-1, -1, -1, 0], -1], [-1, 1, -1, 0]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 0, 1], 2], [5, 11, 6, 1]), ([[-1, -1, 0, 2], -2], [-15, 23, -12, 2]), ([[-1, -1, 0, 2], -1], [-2, 5, -6, 2]), ([[-1, -1, 0, 2], 0], [-1, -1, 0, 2])], [([[-1, -1, -1, -1], 1], [-4, -6, -4, -1]), ([[-1, -1, -1, 0], 2], [-7, -5, -1, 0]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 1, 1], -1], [0, 0, -2, 1]), ([[-1, -1, 1, 1], 0], [-1, -1, 1, 1]), ([[-1, -1, 1, 1], 1], [0, 4, 4, 1]), ([[-1, -1, 1, 1], 2], [9, 15, 7, 1])], [([[-1, -1, -1, -1], 2], [-15, -17, -7, -1]), ([[-1, -1, -1, 1], 0], [-1, -1, -1, 1]), ([[-1, -1, -1, -1], -2], [5, -9, 5, -1]), ([[2, 2, 2, 2], 2], [30, 34, 14, 2]), ([[-1, -1, 2, 0], 1], [0, 3, 2, 0]), ([[-1, -1, 2, 0], 2], [5, 7, 2, 0]), ([[-1, -1, 2, 1], -2], [1, 3, -4, 1]), ([[-1, -1, 2, 1], -1], [1, -2, -1, 1])]]\nfor i, (args, expected) in enumerate(fixtures[N-1]):\n    check(\"explicit oracle %d\" % i, solve(args), expected)\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":"A deterministic bounded teaching model. Inputs are restricted to the explicit contract; this is not a production algebra library. 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":"s3-numerics-polynomial-taylor-shift-source-degree-iteration","generated_at":"2026-09-29T14:39:19.061602+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.","root_cause":"The source degree iteration step uses range(n-1) instead of range(n).","sha256":"f016eae2d758da428586901928607e7477669d87f6862e3f297e330192934020","title":"Polynomial taylor shift: source degree iteration · 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":45.326,"exit_code":1,"observations":[{"actual":[6,-9,5,-1],"check":"explicit oracle 0","expected":[5,-9,5,-1],"passed":false},{"actual":[28,34,14,2],"check":"explicit oracle 1","expected":[30,34,14,2],"passed":false},{"actual":[1,-2,2,-1],"check":"explicit oracle 2","expected":[0,-2,2,-1],"passed":false},{"actual":[0,-1,-1,-1],"check":"explicit oracle 3","expected":[-1,-1,-1,-1],"passed":false},{"actual":[-3,-6,-4,-1],"check":"explicit oracle 4","expected":[-4,-6,-4,-1],"passed":false},{"actual":[-14,-17,-7,-1],"check":"explicit oracle 5","expected":[-15,-17,-7,-1],"passed":false},{"actual":[-2,3,-1,0],"check":"explicit oracle 6","expected":[-3,3,-1,0],"passed":false},{"actual":[0,1,-1,0],"check":"explicit oracle 7","expected":[-1,1,-1,0],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": [6, -9, 5, -1], \"expected\": [5, -9, 5, -1], \"passed\": false}, {\"check\": \"explicit oracle 1\", \"actual\": [28, 34, 14, 2], \"expected\": [30, 34, 14, 2], \"passed\": false}, {\"check\": \"explicit oracle 2\", \"actual\": [1, -2, 2, -1], \"expected\": [0, -2, 2, -1], \"passed\": false}, {\"check\": \"explicit oracle 3\", \"actual\": [0, -1, -1, -1], \"expected\": [-1, -1, -1, -1], \"passed\": false}, {\"check\": \"explicit oracle 4\", \"actual\": [-3, -6, -4, -1], \"expected\": [-4, -6, -4, -1], \"passed\": false}, {\"check\": \"explicit oracle 5\", \"actual\": [-14, -17, -7, -1], \"expected\": [-15, -17, -7, -1], \"passed\": false}, {\"check\": \"explicit oracle 6\", \"actual\": [-2, 3, -1, 0], \"expected\": [-3, 3, -1, 0], \"passed\": false}, {\"check\": \"explicit oracle 7\", \"actual\": [0, 1, -1, 0], \"expected\": [-1, 1, -1, 0], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":45.714,"exit_code":1,"observations":[{"actual":[-3,3,-1,0],"check":"explicit oracle 0","expected":[5,-9,5,-1],"passed":false},{"actual":[14,10,2,0],"check":"explicit oracle 1","expected":[30,34,14,2],"passed":false},{"actual":[-1,1,-1,0],"check":"explicit oracle 2","expected":[0,-2,2,-1],"passed":false},{"actual":[-1,-1,-1,0],"check":"explicit oracle 3","expected":[-1,-1,-1,-1],"passed":false},{"actual":[-3,-3,-1,0],"check":"explicit oracle 4","expected":[-4,-6,-4,-1],"passed":false},{"actual":[-7,-5,-1,0],"check":"explicit oracle 5","expected":[-15,-17,-7,-1],"passed":false},{"actual":[-3,3,-1,0],"check":"explicit oracle 6","expected":[-3,3,-1,0],"passed":true},{"actual":[-1,1,-1,0],"check":"explicit oracle 7","expected":[-1,1,-1,0],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"explicit oracle 0\", \"actual\": [-3, 3, -1, 0], \"expected\": [5, -9, 5, -1], \"passed\": false}, {\"check\": \"explicit oracle 1\", \"actual\": [14, 10, 2, 0], \"expected\": [30, 34, 14, 2], \"passed\": false}, {\"check\": \"explicit oracle 2\", \"actual\": [-1, 1, -1, 0], \"expected\": [0, -2, 2, -1], \"passed\": false}, {\"check\": \"explicit oracle 3\", \"actual\": [-1, -1, -1, 0], \"expected\": [-1, -1, -1, -1], \"passed\": false}, {\"check\": \"explicit oracle 4\", \"actual\": [-3, -3, -1, 0], \"expected\": [-4, -6, -4, -1], \"passed\": false}, {\"check\": \"explicit oracle 5\", \"actual\": [-7, -5, -1, 0], \"expected\": [-15, -17, -7, -1], \"passed\": false}, {\"check\": \"explicit oracle 6\", \"actual\": [-3, 3, -1, 0], \"expected\": [-3, 3, -1, 0], \"passed\": true}, {\"check\": \"explicit oracle 7\", \"actual\": [-1, 1, -1, 0], \"expected\": [-1, 1, -1, 0], \"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."}}