FA-100291 / Dataset deduplication grouping / Open access
Dataset deduplication: near-duplicate chain is split into separate groups · case 01
near-duplicate chain is split into separate groups.
ROOT CAUSE
Pairs are compared only against the current representative, so similarity is treated as transitive only locally.
THE FAILURE
Pairs are compared only against the current representative, so similarity is treated as transitive only locally.
Unsuccessful approach: Grouping each item with its immediate neighbor fails when edges form a longer chain.
Case contract
Pairs [left,right] define undirected edges. Return sorted connected components including isolated nodes.
Why this case matters
This deterministic toy operation makes one dataset equivalence or representative rule explicit.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(nodes, edges):
return [[x] for x in sorted(nodes)]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('three node chain',solve(['a','b','c'],[['a','b'],['b','c']]),[['a','b','c']])
check('separate pair',solve(['a','b','c'],[['a','b']]),[['a','b'],['c']])
check('empty',solve([],[]),[])
check('isolated nodes',solve(['b','a'],[]),[['a'],['b']])
check('cycle',solve(['a','b','c'],[['a','b'],['b','c'],['c','a']]),[['a','b','c']])
check('duplicate edge',solve(['a','b'],[['a','b'],['a','b']]),[['a','b']])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| three node chain | [['a'], ['b'], ['c']] | [['a', 'b', 'c']] | Failed |
| separate pair | [['a'], ['b'], ['c']] | [['a', 'b'], ['c']] | Failed |
| empty | [] | [] | Passed |
| isolated nodes | [['a'], ['b']] | [['a'], ['b']] | Passed |
| cycle | [['a'], ['b'], ['c']] | [['a', 'b', 'c']] | Failed |
| duplicate edge | [['a'], ['b']] | [['a', 'b']] | Failed |
SHA-256 / 91190bf6f752796fbc195ef39ec46f1ac3374f19d84cff0ac546c8ec705b80f1
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(nodes, edges):
return [sorted([a,b]) for a,b in edges]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('three node chain',solve(['a','b','c'],[['a','b'],['b','c']]),[['a','b','c']])
check('separate pair',solve(['a','b','c'],[['a','b']]),[['a','b'],['c']])
check('empty',solve([],[]),[])
check('isolated nodes',solve(['b','a'],[]),[['a'],['b']])
check('cycle',solve(['a','b','c'],[['a','b'],['b','c'],['c','a']]),[['a','b','c']])
check('duplicate edge',solve(['a','b'],[['a','b'],['a','b']]),[['a','b']])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| three node chain | [['a', 'b'], ['b', 'c']] | [['a', 'b', 'c']] | Failed |
| separate pair | [['a', 'b']] | [['a', 'b'], ['c']] | Failed |
| empty | [] | [] | Passed |
| isolated nodes | [] | [['a'], ['b']] | Failed |
| cycle | [['a', 'b'], ['b', 'c'], ['a', 'c']] | [['a', 'b', 'c']] | Failed |
| duplicate edge | [['a', 'b'], ['a', 'b']] | [['a', 'b']] | Failed |
SHA-256 / b10b98688735de318cd5ee8222b0f390b6d0a1246b8d78815d89616966eb7d48
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 6 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.
Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.
Member access is invitation-based. Sign in with your invited account to inspect the repair.
Sign in to the archive ↗Verification & scope
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.
Observations recorded using Python 3.12.14 at 2026-09-30T16:48:34.014915+00:00.
Case digest / 9c01d9586c07cf34908af0ffd59bdf5b87cb962eec1686f90e5ab9cc442227ea