{"abstract":"Oversized sequences are split into artificial chunks.","category":"Sequence batch packing","checks":6,"contract":"Keep each sequence intact and place it alone if its length exceeds capacity; all other sequences use ordered greedy packing.","contract_signature":"sequences, capacity","evaluation_group":"w3-seqpack-oversize-policy-v1","failed_approach":"Truncating the oversized item respects the numeric bound but changes its content.","family":"w3-sequence-batch-packing-oversize-singleton","id":"FA-98046","implementations":{"attempt":{"sha256":"22d76e600708aec880aeab5d5eec9e5375fa413dd13259a354ff7e491364b250","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sequences, capacity):\n    bins=[]; cur=[]; used=0\n    for s in sequences:\n        if cur and used+len(s)>capacity: bins.append(cur); cur=[]; used=0\n        cur.append(s[:capacity]); used+=min(len(s),capacity)\n    if cur: bins.append(cur)\n    return bins\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ns=[N]* (N+1); a=[1]*N\ncheck('oversize preserved', solve([s],N), [[s]])\ncheck('oversize separated', solve([a,s,a],N), [[a],[s],[a]])\ncheck('exact capacity', solve([a],N), [[a]])\ncheck('empty input', solve([],N), [])\ncheck('zero capacity empty sequence', solve([[]],0), [[[]]])\ncheck('two normal fit', solve([[1],[2]],N+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":"400462c5f8b5d642aa4d2943198b051cf3f67997706947fc427b36402448183e","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sequences, capacity):\n    bins=[]; cur=[]; used=0\n    for s in sequences:\n        if len(s)>capacity and capacity>0:\n            if cur: bins.append(cur); cur=[]; used=0\n            bins.extend([[s[i:i+capacity]] for i in range(0,len(s),capacity)])\n            continue\n        if cur and used+len(s)>capacity: bins.append(cur); cur=[]; used=0\n        cur.append(s); used+=len(s)\n    if cur: bins.append(cur)\n    return bins\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ns=[N]* (N+1); a=[1]*N\ncheck('oversize preserved', solve([s],N), [[s]])\ncheck('oversize separated', solve([a,s,a],N), [[a],[s],[a]])\ncheck('exact capacity', solve([a],N), [[a]])\ncheck('empty input', solve([],N), [])\ncheck('zero capacity empty sequence', solve([[]],0), [[[]]])\ncheck('two normal fit', solve([[1],[2]],N+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":"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-oversize-singleton","generated_at":"2026-09-30T16:48:08.895808+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 builder splits an indivisible oversized sequence into capacity-sized token pieces.","sha256":"a6530ac5433d8935cca0d27c414aaf07a8d3f6598d342adbb1234022927cf979","title":"Oversized sequences are split into artificial chunks · 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":30.252,"exit_code":1,"observations":[{"actual":[[[1]]],"check":"oversize preserved","expected":[[[1,1]]],"passed":false},{"actual":[[[1]],[[1]],[[1]]],"check":"oversize separated","expected":[[[1]],[[1,1]],[[1]]],"passed":false},{"actual":[[[1]]],"check":"exact capacity","expected":[[[1]]],"passed":true},{"actual":[],"check":"empty input","expected":[],"passed":true},{"actual":[[[]]],"check":"zero capacity empty sequence","expected":[[[]]],"passed":true},{"actual":[[[1],[2]]],"check":"two normal fit","expected":[[[1],[2]]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"oversize preserved\", \"actual\": [[[1]]], \"expected\": [[[1, 1]]], \"passed\": false}, {\"check\": \"oversize separated\", \"actual\": [[[1]], [[1]], [[1]]], \"expected\": [[[1]], [[1, 1]], [[1]]], \"passed\": false}, {\"check\": \"exact capacity\", \"actual\": [[[1]]], \"expected\": [[[1]]], \"passed\": true}, {\"check\": \"empty input\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"zero capacity empty sequence\", \"actual\": [[[]]], \"expected\": [[[]]], \"passed\": true}, {\"check\": \"two normal fit\", \"actual\": [[[1], [2]]], \"expected\": [[[1], [2]]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":29.933,"exit_code":1,"observations":[{"actual":[[[1]],[[1]]],"check":"oversize preserved","expected":[[[1,1]]],"passed":false},{"actual":[[[1]],[[1]],[[1]],[[1]]],"check":"oversize separated","expected":[[[1]],[[1,1]],[[1]]],"passed":false},{"actual":[[[1]]],"check":"exact capacity","expected":[[[1]]],"passed":true},{"actual":[],"check":"empty input","expected":[],"passed":true},{"actual":[[[]]],"check":"zero capacity empty sequence","expected":[[[]]],"passed":true},{"actual":[[[1],[2]]],"check":"two normal fit","expected":[[[1],[2]]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"oversize preserved\", \"actual\": [[[1]], [[1]]], \"expected\": [[[1, 1]]], \"passed\": false}, {\"check\": \"oversize separated\", \"actual\": [[[1]], [[1]], [[1]], [[1]]], \"expected\": [[[1]], [[1, 1]], [[1]]], \"passed\": false}, {\"check\": \"exact capacity\", \"actual\": [[[1]]], \"expected\": [[[1]]], \"passed\": true}, {\"check\": \"empty input\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"zero capacity empty sequence\", \"actual\": [[[]]], \"expected\": [[[]]], \"passed\": true}, {\"check\": \"two normal fit\", \"actual\": [[[1], [2]]], \"expected\": [[[1], [2]]], \"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."}}