{"abstract":"Packed positions count across segment boundaries.","category":"Sequence batch packing","checks":6,"contract":"For each packed row of segment lengths, assign positions 0 through length-1 inside each segment, resetting at every boundary.","contract_signature":"rows","evaluation_group":"w3-seqpack-segment-position-v1","failed_approach":"One-based local positions still misalign every segment start.","family":"w3-sequence-batch-packing-position-reset-per-segment","id":"FA-98086","implementations":{"attempt":{"sha256":"db47bef7f113f83fb94aa1b431f77549766984fc66f0a54dee9db282a5e45bf1","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    return [[p for length in row for p in range(1,length+1)] for row in rows]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('two segment reset', solve([[N,2]]), [list(range(N))+[0,1]])\ncheck('empty batch', solve([]), [])\ncheck('empty row', solve([[]]), [[]])\ncheck('zero segment', solve([[0,N]]), [list(range(N))])\ncheck('several boundaries', solve([[1,3,2]]), [[0,0,1,2,0,1]])\ncheck('separate rows', solve([[2],[N]]), [[0,1],list(range(N))])\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":"9329a192c133cd7da5538f94719caafd424ba6a50645dbc9157191ffabc44b2d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    return [[p for total in [sum(row)] for p in range(total)] for row in rows]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('two segment reset', solve([[N,2]]), [list(range(N))+[0,1]])\ncheck('empty batch', solve([]), [])\ncheck('empty row', solve([[]]), [[]])\ncheck('zero segment', solve([[0,N]]), [list(range(N))])\ncheck('several boundaries', solve([[1,3,2]]), [[0,0,1,2,0,1]])\ncheck('separate rows', solve([[2],[N]]), [[0,1],list(range(N))])\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 short integer-token lists under the stated toy contract; results do not claim compatibility with a specific training framework. 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-sequence-batch-packing-position-reset-per-segment","generated_at":"2026-09-30T16:48:09.322254+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"This deterministic toy packing rule models a common boundary in preparing bounded training sequences.","root_cause":"Position indices are cumulative over a packed row rather than local to its segment.","sha256":"28ddf6356d26496695ab8fe2fdfb06b6a38662823ddd8ed2409436a22230b46d","title":"Packed positions count across segment boundaries · 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":28.406,"exit_code":1,"observations":[{"actual":[[1,1,2]],"check":"two segment reset","expected":[[0,0,1]],"passed":false},{"actual":[],"check":"empty batch","expected":[],"passed":true},{"actual":[[]],"check":"empty row","expected":[[]],"passed":true},{"actual":[[1]],"check":"zero segment","expected":[[0]],"passed":false},{"actual":[[1,1,2,3,1,2]],"check":"several boundaries","expected":[[0,0,1,2,0,1]],"passed":false},{"actual":[[1,2],[1]],"check":"separate rows","expected":[[0,1],[0]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"two segment reset\", \"actual\": [[1, 1, 2]], \"expected\": [[0, 0, 1]], \"passed\": false}, {\"check\": \"empty batch\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty row\", \"actual\": [[]], \"expected\": [[]], \"passed\": true}, {\"check\": \"zero segment\", \"actual\": [[1]], \"expected\": [[0]], \"passed\": false}, {\"check\": \"several boundaries\", \"actual\": [[1, 1, 2, 3, 1, 2]], \"expected\": [[0, 0, 1, 2, 0, 1]], \"passed\": false}, {\"check\": \"separate rows\", \"actual\": [[1, 2], [1]], \"expected\": [[0, 1], [0]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":27.553,"exit_code":1,"observations":[{"actual":[[0,1,2]],"check":"two segment reset","expected":[[0,0,1]],"passed":false},{"actual":[],"check":"empty batch","expected":[],"passed":true},{"actual":[[]],"check":"empty row","expected":[[]],"passed":true},{"actual":[[0]],"check":"zero segment","expected":[[0]],"passed":true},{"actual":[[0,1,2,3,4,5]],"check":"several boundaries","expected":[[0,0,1,2,0,1]],"passed":false},{"actual":[[0,1],[0]],"check":"separate rows","expected":[[0,1],[0]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"two segment reset\", \"actual\": [[0, 1, 2]], \"expected\": [[0, 0, 1]], \"passed\": false}, {\"check\": \"empty batch\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty row\", \"actual\": [[]], \"expected\": [[]], \"passed\": true}, {\"check\": \"zero segment\", \"actual\": [[0]], \"expected\": [[0]], \"passed\": true}, {\"check\": \"several boundaries\", \"actual\": [[0, 1, 2, 3, 4, 5]], \"expected\": [[0, 0, 1, 2, 0, 1]], \"passed\": false}, {\"check\": \"separate rows\", \"actual\": [[0, 1], [0]], \"expected\": [[0, 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."}}