{"abstract":"deduplication retains a lower-quality example.","category":"Dataset deduplication grouping","checks":6,"contract":"Rows [key,id,quality]. Return [key,id] for the highest-quality row per key, sorted by key; ties choose lexical ID.","contract_signature":"rows","evaluation_group":"dedup-quality-representative","failed_approach":"Choosing the greatest ID ignores quality and only appears right on tied fixtures.","family":"w3-dataset-deduplication-grouping-highest-quality-representative","id":"FA-100271","implementations":{"attempt":{"sha256":"9ce28f6f276e18cd33c6a1e08d64964dac25c81c48390dc34a816eb7514755a5","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    out={};\n    for k,i,q in rows:\n     if k not in out or i>out[k][1]: out[k]=[k,i]\n    return [out[k] for k in sorted(out)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('quality wins',solve([['k','low',N],['k','best',N+1]]),[['k','best']])\ncheck('quality over ID',solve([['k','z',N+2],['k','a',N+1]]),[['k','z']])\ncheck('tie lexical ID',solve([['k','z',N],['k','a',N]]),[['k','a']])\ncheck('empty',solve([]),[])\ncheck('different keys',solve([['b','B',1],['a','A',2]]),[['a','A'],['b','B']])\ncheck('singleton',solve([['x','X',0]]),[['x','X']])\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":"4a0a56960f04912b20591f36237828afbbe1997b11041fcb356a27c711139e95","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(rows):\n    out={};\n    for k,i,q in rows: out.setdefault(k,[k,i])\n    return [out[k] for k in sorted(out)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('quality wins',solve([['k','low',N],['k','best',N+1]]),[['k','best']])\ncheck('quality over ID',solve([['k','z',N+2],['k','a',N+1]]),[['k','z']])\ncheck('tie lexical ID',solve([['k','z',N],['k','a',N]]),[['k','a']])\ncheck('empty',solve([]),[])\ncheck('different keys',solve([['b','B',1],['a','A',2]]),[['a','A'],['b','B']])\ncheck('singleton',solve([['x','X',0]]),[['x','X']])\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 small in-memory fixtures with the stated contract; results do not claim production deduplication quality. 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-dataset-deduplication-grouping-highest-quality-representative","generated_at":"2026-09-30T16:48:33.560648+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"This deterministic toy operation makes one dataset equivalence or representative rule explicit.","root_cause":"Representative selection uses input order instead of the supplied quality score.","sha256":"d2fc6f3ed32cf879191bbe44f61264027165a1af52e725d5beac567940de4bda","title":"Dataset deduplication: deduplication retains a lower-quality example · 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":31.441,"exit_code":1,"observations":[{"actual":[["k","low"]],"check":"quality wins","expected":[["k","best"]],"passed":false},{"actual":[["k","z"]],"check":"quality over ID","expected":[["k","z"]],"passed":true},{"actual":[["k","z"]],"check":"tie lexical ID","expected":[["k","a"]],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[["a","A"],["b","B"]],"check":"different keys","expected":[["a","A"],["b","B"]],"passed":true},{"actual":[["x","X"]],"check":"singleton","expected":[["x","X"]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"quality wins\", \"actual\": [[\"k\", \"low\"]], \"expected\": [[\"k\", \"best\"]], \"passed\": false}, {\"check\": \"quality over ID\", \"actual\": [[\"k\", \"z\"]], \"expected\": [[\"k\", \"z\"]], \"passed\": true}, {\"check\": \"tie lexical ID\", \"actual\": [[\"k\", \"z\"]], \"expected\": [[\"k\", \"a\"]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"different keys\", \"actual\": [[\"a\", \"A\"], [\"b\", \"B\"]], \"expected\": [[\"a\", \"A\"], [\"b\", \"B\"]], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[\"x\", \"X\"]], \"expected\": [[\"x\", \"X\"]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":28.001,"exit_code":1,"observations":[{"actual":[["k","low"]],"check":"quality wins","expected":[["k","best"]],"passed":false},{"actual":[["k","z"]],"check":"quality over ID","expected":[["k","z"]],"passed":true},{"actual":[["k","z"]],"check":"tie lexical ID","expected":[["k","a"]],"passed":false},{"actual":[],"check":"empty","expected":[],"passed":true},{"actual":[["a","A"],["b","B"]],"check":"different keys","expected":[["a","A"],["b","B"]],"passed":true},{"actual":[["x","X"]],"check":"singleton","expected":[["x","X"]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"quality wins\", \"actual\": [[\"k\", \"low\"]], \"expected\": [[\"k\", \"best\"]], \"passed\": false}, {\"check\": \"quality over ID\", \"actual\": [[\"k\", \"z\"]], \"expected\": [[\"k\", \"z\"]], \"passed\": true}, {\"check\": \"tie lexical ID\", \"actual\": [[\"k\", \"z\"]], \"expected\": [[\"k\", \"a\"]], \"passed\": false}, {\"check\": \"empty\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"different keys\", \"actual\": [[\"a\", \"A\"], [\"b\", \"B\"]], \"expected\": [[\"a\", \"A\"], [\"b\", \"B\"]], \"passed\": true}, {\"check\": \"singleton\", \"actual\": [[\"x\", \"X\"]], \"expected\": [[\"x\", \"X\"]], \"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."}}