{"abstract":"Rows exceed the configured sequence count.","category":"Sequence batch packing","checks":6,"contract":"Partition the ordered sequence list into consecutive rows containing at most positive max_items entries.","contract_signature":"sequences, max_items","evaluation_group":"xaud-audio-block-partition-keeps-final-tail","failed_approach":"Subtracting one from the bound creates unnecessarily small rows.","family":"w3-sequence-batch-packing-max-examples-per-row","id":"FA-98091","implementations":{"attempt":{"sha256":"822ce08d781b8c69b965f7ffac9a5dfe9aa17aa1d845440a2e44a35329ada83b","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sequences, max_items):\n    return [sequences[i:i+max_items-1] for i in range(0,len(sequences),max_items)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nitems=[[i] for i in range(N+2)]\ncheck('partial row', solve(items,N), [items[i:i+N] for i in range(0,len(items),N)])\ncheck('exact row', solve(items[:N],N), [items[:N]])\ncheck('empty', solve([],N), [])\ncheck('one slot rows', solve(items,1), [[x] for x in items])\ncheck('one item', solve(items[:1],N), [items[:1]])\ncheck('two rows', solve(items[:2*N],N), [items[:N],items[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":"495ae841738a8a34c953ad78a9480e3e1c2d1fae9ef021bdca4007da8e566839","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(sequences, max_items):\n    return [sequences[i:i+max_items+1] for i in range(0,len(sequences),max_items+1)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nitems=[[i] for i in range(N+2)]\ncheck('partial row', solve(items,N), [items[i:i+N] for i in range(0,len(items),N)])\ncheck('exact row', solve(items[:N],N), [items[:N]])\ncheck('empty', solve([],N), [])\ncheck('one slot rows', solve(items,1), [[x] for x in items])\ncheck('one item', solve(items[:1],N), [items[:1]])\ncheck('two rows', solve(items[:2*N],N), [items[:N],items[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-max-examples-per-row","generated_at":"2026-09-30T16:48:09.322029+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 slice stride and width exceed the configured maximum by one.","sha256":"e25da0f8bd761b0770b07c7283c5d99edf64ebba0b388b3206fb4cf5c853bdc0","title":"Rows exceed the configured sequence count · 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.674,"exit_code":1,"observations":[{"actual":[[],[],[]],"check":"partial row","expected":[[[0]],[[1]],[[2]]],"passed":false},{"actual":[[]],"check":"exact row","expected":[[[0]]],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[[],[],[]],"check":"one slot rows","expected":[[[0]],[[1]],[[2]]],"passed":false},{"actual":[[]],"check":"one item","expected":[[[0]]],"passed":false},{"actual":[[],[]],"check":"two rows","expected":[[[0]],[[1]]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"partial row\", \"actual\": [[], [], []], \"expected\": [[[0]], [[1]], [[2]]], \"passed\": false}, {\"check\": \"exact row\", \"actual\": [[]], \"expected\": [[[0]]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"one slot rows\", \"actual\": [[], [], []], \"expected\": [[[0]], [[1]], [[2]]], \"passed\": false}, {\"check\": \"one item\", \"actual\": [[]], \"expected\": [[[0]]], \"passed\": false}, {\"check\": \"two rows\", \"actual\": [[], []], \"expected\": [[[0]], [[1]]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":27.054,"exit_code":1,"observations":[{"actual":[[[0],[1]],[[2]]],"check":"partial row","expected":[[[0]],[[1]],[[2]]],"passed":false},{"actual":[[[0]]],"check":"exact row","expected":[[[0]]],"passed":true},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[[[0],[1]],[[2]]],"check":"one slot rows","expected":[[[0]],[[1]],[[2]]],"passed":false},{"actual":[[[0]]],"check":"one item","expected":[[[0]]],"passed":true},{"actual":[[[0],[1]]],"check":"two rows","expected":[[[0]],[[1]]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"partial row\", \"actual\": [[[0], [1]], [[2]]], \"expected\": [[[0]], [[1]], [[2]]], \"passed\": false}, {\"check\": \"exact row\", \"actual\": [[[0]]], \"expected\": [[[0]]], \"passed\": true}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"one slot rows\", \"actual\": [[[0], [1]], [[2]]], \"expected\": [[[0]], [[1]], [[2]]], \"passed\": false}, {\"check\": \"one item\", \"actual\": [[[0]]], \"expected\": [[[0]]], \"passed\": true}, {\"check\": \"two rows\", \"actual\": [[[0], [1]]], \"expected\": [[[0]], [[1]]], \"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."}}