{"abstract":"Overlapping annotation priority is ignored.","category":"Annotation span alignment","checks":7,"contract":"For each integer position in [0,length), choose covering span with highest priority; ties use earliest input; output one label per position or None.","contract_signature":"spans, length","evaluation_group":"annotation-span-priority-overlap-sweep","failed_approach":"Breaking equal-priority ties by later input order reverses the required stable tie rule.","family":"w3-annotation-span-alignment-priority-overlap-sweep","id":"FA-100181","implementations":{"attempt":{"sha256":"2a0639a0671047132eee822cc6a956b17db86f4222d20d6a362275cfaff99d96","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(spans, length):\n    return [max(((p,i,label) for i,(s,e,label,p) in enumerate(spans) if s<=x<e),default=(0,0,None))[2] for x in range(length)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('higher priority wins', solve([[1,4,'low',1],[2,5,'high',N+1]],6), [None,'low','high','high','high',None])\ncheck('equal priority earlier wins', solve([[0,2,'first',N],[0,2,'second',N]],2), ['first','first'])\ncheck('empty coverage', solve([],N), [None]*N)\ncheck('zero output length', solve([[0,2,'x',1]],0), [])\ncheck('nonoverlap labels', solve([[0,1,'a',1],[2,3,'b',1]],4), ['a',None,'b',None])\ncheck('singleton highest', solve([[0,1,'a',2],[0,1,'b',3]],1), ['b'])\ncheck('position at end excluded', solve([[0,1,'x',9]],2), ['x',None])\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":"18c652773c2dafd769dc6621b5a7e36e7e6a52022bcb30aea020c429059636a5","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(spans, length):\n    return [next((label for s,e,label,p in spans if s<=x<e),None) for x in range(length)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('higher priority wins', solve([[1,4,'low',1],[2,5,'high',N+1]],6), [None,'low','high','high','high',None])\ncheck('equal priority earlier wins', solve([[0,2,'first',N],[0,2,'second',N]],2), ['first','first'])\ncheck('empty coverage', solve([],N), [None]*N)\ncheck('zero output length', solve([[0,2,'x',1]],0), [])\ncheck('nonoverlap labels', solve([[0,1,'a',1],[2,3,'b',1]],4), ['a',None,'b',None])\ncheck('singleton highest', solve([[0,1,'a',2],[0,1,'b',3]],1), ['b'])\ncheck('position at end excluded', solve([[0,1,'x',9]],2), ['x',None])\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":"Contracts use integer offsets, explicit edits, and supplied token boundaries; they do not define a tokenizer or production annotation format. 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-annotation-span-alignment-priority-overlap-sweep","generated_at":"2026-09-30T16:48:32.646695+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A small offline annotation transformation keeps span coordinates explicit when text or token boundaries change.","root_cause":"The first covering span is selected without comparing annotation priorities.","sha256":"b87ea09cb48ed035e20c93f5750818b65ffba474f3237e4128979ce1cf5e6822","title":"Overlapping annotation priority is ignored · 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.233,"exit_code":1,"observations":[{"actual":[null,"low","high","high","high",null],"check":"higher priority wins","expected":[null,"low","high","high","high",null],"passed":true},{"actual":["second","second"],"check":"equal priority earlier wins","expected":["first","first"],"passed":false},{"actual":[null],"check":"empty coverage","expected":[null],"passed":true},{"actual":[],"check":"zero output length","expected":[],"passed":true},{"actual":["a",null,"b",null],"check":"nonoverlap labels","expected":["a",null,"b",null],"passed":true},{"actual":["b"],"check":"singleton highest","expected":["b"],"passed":true},{"actual":["x",null],"check":"position at end excluded","expected":["x",null],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"higher priority wins\", \"actual\": [null, \"low\", \"high\", \"high\", \"high\", null], \"expected\": [null, \"low\", \"high\", \"high\", \"high\", null], \"passed\": true}, {\"check\": \"equal priority earlier wins\", \"actual\": [\"second\", \"second\"], \"expected\": [\"first\", \"first\"], \"passed\": false}, {\"check\": \"empty coverage\", \"actual\": [null], \"expected\": [null], \"passed\": true}, {\"check\": \"zero output length\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"nonoverlap labels\", \"actual\": [\"a\", null, \"b\", null], \"expected\": [\"a\", null, \"b\", null], \"passed\": true}, {\"check\": \"singleton highest\", \"actual\": [\"b\"], \"expected\": [\"b\"], \"passed\": true}, {\"check\": \"position at end excluded\", \"actual\": [\"x\", null], \"expected\": [\"x\", null], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":26.713,"exit_code":1,"observations":[{"actual":[null,"low","low","low","high",null],"check":"higher priority wins","expected":[null,"low","high","high","high",null],"passed":false},{"actual":["first","first"],"check":"equal priority earlier wins","expected":["first","first"],"passed":true},{"actual":[null],"check":"empty coverage","expected":[null],"passed":true},{"actual":[],"check":"zero output length","expected":[],"passed":true},{"actual":["a",null,"b",null],"check":"nonoverlap labels","expected":["a",null,"b",null],"passed":true},{"actual":["a"],"check":"singleton highest","expected":["b"],"passed":false},{"actual":["x",null],"check":"position at end excluded","expected":["x",null],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"higher priority wins\", \"actual\": [null, \"low\", \"low\", \"low\", \"high\", null], \"expected\": [null, \"low\", \"high\", \"high\", \"high\", null], \"passed\": false}, {\"check\": \"equal priority earlier wins\", \"actual\": [\"first\", \"first\"], \"expected\": [\"first\", \"first\"], \"passed\": true}, {\"check\": \"empty coverage\", \"actual\": [null], \"expected\": [null], \"passed\": true}, {\"check\": \"zero output length\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"nonoverlap labels\", \"actual\": [\"a\", null, \"b\", null], \"expected\": [\"a\", null, \"b\", null], \"passed\": true}, {\"check\": \"singleton highest\", \"actual\": [\"a\"], \"expected\": [\"b\"], \"passed\": false}, {\"check\": \"position at end excluded\", \"actual\": [\"x\", null], \"expected\": [\"x\", null], \"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."}}