{"abstract":"Segment spans include the next segment boundary.","category":"Sequence batch packing","checks":6,"contract":"Return half-open [start,end] token spans for consecutive segments; zero-length segments have empty spans at the current cursor.","contract_signature":"lengths","evaluation_group":"w3-seqpack-segment-spans-v1","failed_approach":"Subtracting one creates reversed or incomplete spans, especially for empty segments.","family":"w3-sequence-batch-packing-segment-ownership-spans","id":"FA-98111","implementations":{"attempt":{"sha256":"422f3e4f794dffba81d3e41100d45685adec664c93b3018413f2f5b2165c3efe","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(lengths):\n    out=[]; p=0\n    for n in lengths: out.append([p,p+n-1]); p+=n\n    return out\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('adjacent segments', solve([N,2]), [[0,N],[N,N+2]])\ncheck('zero length', solve([0,N]), [[0,0],[0,N]])\ncheck('empty', solve([]), [])\ncheck('singleton', solve([1]), [[0,1]])\ncheck('three segments', solve([1,0,2]), [[0,1],[1,1],[1,3]])\ncheck('cursor cumulative', solve([N,N]), [[0,N],[N,2*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":"b9d7732fde273b7794371fd98f6f444062f8d0b17665e367f16bf9730bafa4ad","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(lengths):\n    out=[]; p=0\n    for n in lengths: out.append([p,p+n+1]); p+=n\n    return out\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('adjacent segments', solve([N,2]), [[0,N],[N,N+2]])\ncheck('zero length', solve([0,N]), [[0,0],[0,N]])\ncheck('empty', solve([]), [])\ncheck('singleton', solve([1]), [[0,1]])\ncheck('three segments', solve([1,0,2]), [[0,1],[1,1],[1,3]])\ncheck('cursor cumulative', solve([N,N]), [[0,N],[N,2*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-segment-ownership-spans","generated_at":"2026-09-30T16:48:09.321879+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":"The end cursor is advanced one beyond the segment length.","sha256":"c268f199e0721e96017ee0d7114543bd7ccf2f817c23906039de9da184a2231e","title":"Segment spans include the next segment boundary · 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":27.509,"exit_code":1,"observations":[{"actual":[[0,0],[1,2]],"check":"adjacent segments","expected":[[0,1],[1,3]],"passed":false},{"actual":[[0,-1],[0,0]],"check":"zero length","expected":[[0,0],[0,1]],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[[0,0]],"check":"singleton","expected":[[0,1]],"passed":false},{"actual":[[0,0],[1,0],[1,2]],"check":"three segments","expected":[[0,1],[1,1],[1,3]],"passed":false},{"actual":[[0,0],[1,1]],"check":"cursor cumulative","expected":[[0,1],[1,2]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"adjacent segments\", \"actual\": [[0, 0], [1, 2]], \"expected\": [[0, 1], [1, 3]], \"passed\": false}, {\"check\": \"zero length\", \"actual\": [[0, -1], [0, 0]], \"expected\": [[0, 0], [0, 1]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[0, 0]], \"expected\": [[0, 1]], \"passed\": false}, {\"check\": \"three segments\", \"actual\": [[0, 0], [1, 0], [1, 2]], \"expected\": [[0, 1], [1, 1], [1, 3]], \"passed\": false}, {\"check\": \"cursor cumulative\", \"actual\": [[0, 0], [1, 1]], \"expected\": [[0, 1], [1, 2]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":26.978,"exit_code":1,"observations":[{"actual":[[0,2],[1,4]],"check":"adjacent segments","expected":[[0,1],[1,3]],"passed":false},{"actual":[[0,1],[0,2]],"check":"zero length","expected":[[0,0],[0,1]],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[[0,2]],"check":"singleton","expected":[[0,1]],"passed":false},{"actual":[[0,2],[1,2],[1,4]],"check":"three segments","expected":[[0,1],[1,1],[1,3]],"passed":false},{"actual":[[0,2],[1,3]],"check":"cursor cumulative","expected":[[0,1],[1,2]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"adjacent segments\", \"actual\": [[0, 2], [1, 4]], \"expected\": [[0, 1], [1, 3]], \"passed\": false}, {\"check\": \"zero length\", \"actual\": [[0, 1], [0, 2]], \"expected\": [[0, 0], [0, 1]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[0, 2]], \"expected\": [[0, 1]], \"passed\": false}, {\"check\": \"three segments\", \"actual\": [[0, 2], [1, 2], [1, 4]], \"expected\": [[0, 1], [1, 1], [1, 3]], \"passed\": false}, {\"check\": \"cursor cumulative\", \"actual\": [[0, 2], [1, 3]], \"expected\": [[0, 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."}}