{"abstract":"Discontinuous annotation fragments merge across a gap.","category":"Annotation span alignment","checks":7,"contract":"Given possibly disjoint intervals, sort and merge overlapping or touching intervals; preserve genuine gaps.","contract_signature":"pieces","evaluation_group":"annotation-span-discontinuous-fragment-union","failed_approach":"Sorting fragments leaves overlapping and touching intervals unmerged.","family":"w3-annotation-span-alignment-discontinuous-fragment-union","id":"FA-100226","implementations":{"attempt":{"sha256":"7fc00c1a490d5792b550282201598eaa9a88fb46d26a17a6b4becc38078f7938","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(pieces):\n    return sorted(pieces)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('disjoint retained', solve([[0,2],[5,7]]), [[0,2],[5,7]])\ncheck('overlap merged', solve([[0,4],[2,6]]), [[0,6]])\ncheck('touch merged', solve([[0,2],[2,4]]), [[0,4]])\ncheck('unsorted input', solve([[5,7],[0,2]]), [[0,2],[5,7]])\ncheck('empty input', solve([]), [])\ncheck('singleton', solve([[N,N+1]]), [[N,N+1]])\ncheck('nested interval', solve([[0,8],[2,3]]), [[0,8]])\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":"07e570ba95e9733e7207095366e825ad6e5394fb8cd93b8670705c00a788883d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(pieces):\n    return [[min(s for s,e in pieces),max(e for s,e in pieces)]] if pieces else []\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('disjoint retained', solve([[0,2],[5,7]]), [[0,2],[5,7]])\ncheck('overlap merged', solve([[0,4],[2,6]]), [[0,6]])\ncheck('touch merged', solve([[0,2],[2,4]]), [[0,4]])\ncheck('unsorted input', solve([[5,7],[0,2]]), [[0,2],[5,7]])\ncheck('empty input', solve([]), [])\ncheck('singleton', solve([[N,N+1]]), [[N,N+1]])\ncheck('nested interval', solve([[0,8],[2,3]]), [[0,8]])\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-discontinuous-fragment-union","generated_at":"2026-09-30T16:48:33.098896+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":"A fragment reducer spans the minimum and maximum offsets without checking adjacency.","sha256":"bcd98e2088b34c39753fc5d9ae65de0a0a13e80dd12a07d479fc0f866d568252","title":"Discontinuous annotation fragments merge across a gap · 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.187,"exit_code":1,"observations":[{"actual":[[0,2],[5,7]],"check":"disjoint retained","expected":[[0,2],[5,7]],"passed":true},{"actual":[[0,4],[2,6]],"check":"overlap merged","expected":[[0,6]],"passed":false},{"actual":[[0,2],[2,4]],"check":"touch merged","expected":[[0,4]],"passed":false},{"actual":[[0,2],[5,7]],"check":"unsorted input","expected":[[0,2],[5,7]],"passed":true},{"actual":[],"check":"empty input","expected":[],"passed":true},{"actual":[[1,2]],"check":"singleton","expected":[[1,2]],"passed":true},{"actual":[[0,8],[2,3]],"check":"nested interval","expected":[[0,8]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"disjoint retained\", \"actual\": [[0, 2], [5, 7]], \"expected\": [[0, 2], [5, 7]], \"passed\": true}, {\"check\": \"overlap merged\", \"actual\": [[0, 4], [2, 6]], \"expected\": [[0, 6]], \"passed\": false}, {\"check\": \"touch merged\", \"actual\": [[0, 2], [2, 4]], \"expected\": [[0, 4]], \"passed\": false}, {\"check\": \"unsorted input\", \"actual\": [[0, 2], [5, 7]], \"expected\": [[0, 2], [5, 7]], \"passed\": true}, {\"check\": \"empty input\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[1, 2]], \"expected\": [[1, 2]], \"passed\": true}, {\"check\": \"nested interval\", \"actual\": [[0, 8], [2, 3]], \"expected\": [[0, 8]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":26.675,"exit_code":1,"observations":[{"actual":[[0,7]],"check":"disjoint retained","expected":[[0,2],[5,7]],"passed":false},{"actual":[[0,6]],"check":"overlap merged","expected":[[0,6]],"passed":true},{"actual":[[0,4]],"check":"touch merged","expected":[[0,4]],"passed":true},{"actual":[[0,7]],"check":"unsorted input","expected":[[0,2],[5,7]],"passed":false},{"actual":[],"check":"empty input","expected":[],"passed":true},{"actual":[[1,2]],"check":"singleton","expected":[[1,2]],"passed":true},{"actual":[[0,8]],"check":"nested interval","expected":[[0,8]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"disjoint retained\", \"actual\": [[0, 7]], \"expected\": [[0, 2], [5, 7]], \"passed\": false}, {\"check\": \"overlap merged\", \"actual\": [[0, 6]], \"expected\": [[0, 6]], \"passed\": true}, {\"check\": \"touch merged\", \"actual\": [[0, 4]], \"expected\": [[0, 4]], \"passed\": true}, {\"check\": \"unsorted input\", \"actual\": [[0, 7]], \"expected\": [[0, 2], [5, 7]], \"passed\": false}, {\"check\": \"empty input\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[1, 2]], \"expected\": [[1, 2]], \"passed\": true}, {\"check\": \"nested interval\", \"actual\": [[0, 8]], \"expected\": [[0, 8]], \"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."}}