FA-100336 / Dataset deduplication grouping / Open access

Dataset deduplication: pair exactly at distance budget is missed · case 01

pair exactly at distance budget is missed.

Verified by executionVariant 1 · 6 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The candidate filter uses a strict distance comparison.

THE FAILURE

The candidate filter uses a strict distance comparison.

Unsuccessful approach: Adding one to the budget admits candidates beyond the stated contract.

Case contract

Return candidate IDs whose supplied edit distance is <= budget; preserve candidate order.

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(candidates, budget):
    return [i for i,d in candidates if d<budget]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('exact budget',solve([['a',N]],N),['a'])
check('inside budget',solve([['a',N-1]],N),['a'])
check('outside budget',solve([['a',N+1]],N),[])
check('zero exact',solve([['a',0]],0),['a'])
check('empty',solve([],N),[])
check('order retained',solve([['b',0],['a',0]],0),['b','a'])
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
exact budget	`[]`	`['a']`	Failed
inside budget	`['a']`	`['a']`	Passed
outside budget	`[]`	`[]`	Passed
zero exact	`[]`	`['a']`	Failed
empty	`[]`	`[]`	Passed
order retained	`[]`	`['b', 'a']`	Failed

SHA-256 / 5ef702d1750c87d83e0d6e63d7b805bc810365d1ece99793f622a01d4e78b93d

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(candidates, budget):
    return [i for i,d in candidates if d<=budget+1]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('exact budget',solve([['a',N]],N),['a'])
check('inside budget',solve([['a',N-1]],N),['a'])
check('outside budget',solve([['a',N+1]],N),[])
check('zero exact',solve([['a',0]],0),['a'])
check('empty',solve([],N),[])
check('order retained',solve([['b',0],['a',0]],0),['b','a'])
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
exact budget	`['a']`	`['a']`	Passed
inside budget	`['a']`	`['a']`	Passed
outside budget	`['a']`	`[]`	Failed
zero exact	`['a']`	`['a']`	Passed
empty	`[]`	`[]`	Passed
order retained	`['b', 'a']`	`['b', 'a']`	Passed

SHA-256 / 8a0b389a98abf821c1051a4950d8219cb973c22c8ac2f259af7bfac824a95ea1

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.

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.470983+00:00.

Case digest / 8717eedfbcc7de0c868c68eaa73cb9b94650f08d9c8dd56d988f30fd10d733b6