{"abstract":"Encoder emits distance values instead of codeword indices.","category":"PCM sample encoding","checks":8,"contract":"Encode PCM amplitudes to nearest entries of an explicit possibly repeated calibration table, with a declared lowest/highest code-index tie policy.","contract_signature":"samples, table, tie_high","evaluation_group":"s3-pcm-pcm-calibrated-nearest-code","failed_approach":"Emitting reconstruction amplitudes bypasses the code table representation.","family":"s3-pcm-pcm-calibrated-nearest-code-candidate-index","id":"FA-49926","implementations":{"attempt":{"sha256":"d90f78bcd0a3e6c8df3e1070c1d9db5756b99ada34300c64a1bead22c105f98a","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(samples, table, tie_high):\n    out=[]\n    for sample in samples:\n        distances=[abs(value-sample) for value in table]\n        best=min(distances)\n        candidates=[table[i] for i,d in enumerate(distances) if d==best]\n        out.append(candidates[-1] if tie_high else candidates[0])\n    return out\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('oracle 1', solve(*([-8, -2, 0, 5, 12], [-10, 0, 10], False)), [0, 1, 1, 1, 2])\ncheck('oracle 2', solve(*([5, -5], [-10, 0, 10], True)), [2, 1])\ncheck('oracle 3', solve(*([2, 3], [0, 4, 4, 8], True)), [2, 2])\ncheck('oracle 4', solve(*([], [-1, 1], False)), [])\ncheck('oracle 5', solve(*([0, 4], [2], False)), [0, 0])\ncheck('oracle 6', solve(*([1, 4, 8], [0, 3, 10], False)), [0, 1, 2])\ncheck('oracle 7', solve(*([-3, 3], [-6, 0, 6], True)), [1, 2])\nif N == 1: check('variant packet 1', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 2: check('variant packet 2', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 3: check('variant packet 3', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 4: check('variant packet 4', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 5: check('variant packet 5', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 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":"4452619e9c9cb282e7d3abd608da9e6c6c053cae5d6a6b62fe688a64eb210a12","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(samples, table, tie_high):\n    out=[]\n    for sample in samples:\n        distances=[abs(value-sample) for value in table]\n        best=min(distances)\n        candidates=[d for i,d in enumerate(distances) if d==best]\n        out.append(candidates[-1] if tie_high else candidates[0])\n    return out\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('oracle 1', solve(*([-8, -2, 0, 5, 12], [-10, 0, 10], False)), [0, 1, 1, 1, 2])\ncheck('oracle 2', solve(*([5, -5], [-10, 0, 10], True)), [2, 1])\ncheck('oracle 3', solve(*([2, 3], [0, 4, 4, 8], True)), [2, 2])\ncheck('oracle 4', solve(*([], [-1, 1], False)), [])\ncheck('oracle 5', solve(*([0, 4], [2], False)), [0, 0])\ncheck('oracle 6', solve(*([1, 4, 8], [0, 3, 10], False)), [0, 1, 2])\ncheck('oracle 7', solve(*([-3, 3], [-6, 0, 6], True)), [1, 2])\nif N == 1: check('variant packet 1', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 2: check('variant packet 2', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 3: check('variant packet 3', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 4: check('variant packet 4', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2])\nif N == 5: check('variant packet 5', solve(*[[-8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12, -8, -2, 0, 5, 12], [-10, 0, 10], False]), [0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 2, 0, 1, 1, 1, 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":"Stipulated finite model; no claim of hardware timing or full file-format conformance. 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-pcm-pcm-calibrated-nearest-code-candidate-index","generated_at":"2026-09-29T14:45:04.501573+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Offline PCM interchange uses these exact bounded packet and sample representation decisions.","root_cause":"Encoder emits distance values instead of codeword indices.","sha256":"4813df7932d36c68093f70566fc4b47cb678b5cdbc46f9ec6c4d2a66ef679cbb","title":"Pcm calibrated nearest code: candidate index · 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":40.264,"exit_code":1,"observations":[{"actual":[-10,0,0,0,10],"check":"oracle 1","expected":[0,1,1,1,2],"passed":false},{"actual":[10,0],"check":"oracle 2","expected":[2,1],"passed":false},{"actual":[4,4],"check":"oracle 3","expected":[2,2],"passed":false},{"actual":[],"check":"oracle 4","expected":[],"passed":true},{"actual":[2,2],"check":"oracle 5","expected":[0,0],"passed":false},{"actual":[0,3,10],"check":"oracle 6","expected":[0,1,2],"passed":false},{"actual":[0,6],"check":"oracle 7","expected":[1,2],"passed":false},{"actual":[-10,0,0,0,10,-10,0,0,0,10],"check":"variant packet 1","expected":[0,1,1,1,2,0,1,1,1,2],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"oracle 1\", \"actual\": [-10, 0, 0, 0, 10], \"expected\": [0, 1, 1, 1, 2], \"passed\": false}, {\"check\": \"oracle 2\", \"actual\": [10, 0], \"expected\": [2, 1], \"passed\": false}, {\"check\": \"oracle 3\", \"actual\": [4, 4], \"expected\": [2, 2], \"passed\": false}, {\"check\": \"oracle 4\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"oracle 5\", \"actual\": [2, 2], \"expected\": [0, 0], \"passed\": false}, {\"check\": \"oracle 6\", \"actual\": [0, 3, 10], \"expected\": [0, 1, 2], \"passed\": false}, {\"check\": \"oracle 7\", \"actual\": [0, 6], \"expected\": [1, 2], \"passed\": false}, {\"check\": \"variant packet 1\", \"actual\": [-10, 0, 0, 0, 10, -10, 0, 0, 0, 10], \"expected\": [0, 1, 1, 1, 2, 0, 1, 1, 1, 2], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.953,"exit_code":1,"observations":[{"actual":[2,2,0,5,2],"check":"oracle 1","expected":[0,1,1,1,2],"passed":false},{"actual":[5,5],"check":"oracle 2","expected":[2,1],"passed":false},{"actual":[2,1],"check":"oracle 3","expected":[2,2],"passed":false},{"actual":[],"check":"oracle 4","expected":[],"passed":true},{"actual":[2,2],"check":"oracle 5","expected":[0,0],"passed":false},{"actual":[1,1,2],"check":"oracle 6","expected":[0,1,2],"passed":false},{"actual":[3,3],"check":"oracle 7","expected":[1,2],"passed":false},{"actual":[2,2,0,5,2,2,2,0,5,2],"check":"variant packet 1","expected":[0,1,1,1,2,0,1,1,1,2],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"oracle 1\", \"actual\": [2, 2, 0, 5, 2], \"expected\": [0, 1, 1, 1, 2], \"passed\": false}, {\"check\": \"oracle 2\", \"actual\": [5, 5], \"expected\": [2, 1], \"passed\": false}, {\"check\": \"oracle 3\", \"actual\": [2, 1], \"expected\": [2, 2], \"passed\": false}, {\"check\": \"oracle 4\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"oracle 5\", \"actual\": [2, 2], \"expected\": [0, 0], \"passed\": false}, {\"check\": \"oracle 6\", \"actual\": [1, 1, 2], \"expected\": [0, 1, 2], \"passed\": false}, {\"check\": \"oracle 7\", \"actual\": [3, 3], \"expected\": [1, 2], \"passed\": false}, {\"check\": \"variant packet 1\", \"actual\": [2, 2, 0, 5, 2, 2, 2, 0, 5, 2], \"expected\": [0, 1, 1, 1, 2, 0, 1, 1, 1, 2], \"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."}}