FAILURE MAP
← Case archive

FA-100306 / Dataset deduplication grouping / Open access

Dataset deduplication: short duplicate fragment fails containment test · case 01

short duplicate fragment fails containment test.

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

ROOT CAUSE

The containment score divides by the larger document size.

THE FAILURE

The containment score divides by the larger document size.

Unsuccessful approach: Normalizing by the larger size makes a short subset look weakly related.

Case contract

Return overlap coefficient: intersection size divided by smaller set size; two empty sets score 1.

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(a, b):
    u=set(a); v=set(b); return len(u&v)/max(len(u),len(v)) if u or v else 1
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('left contained',solve(['a'],['a','b','c']),1)
check('right contained',solve(['a','b','c'],['a']),1)
check('partial smaller coverage',solve(['a','b'],['a','c','d']),0.5)
check('disjoint',solve(['a'],['b']),0)
check('both empty',solve([],[]),1)
check('one empty',solve([],['a']),0)
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 fixtureActualExpectedOutcome
left contained0.33333333333333331Failed
right contained0.33333333333333331Failed
partial smaller coverage0.33333333333333330.5Failed
disjoint0.00Passed
both empty11Passed
one empty0.00Passed

SHA-256 / d14b1543caa8ec4d1257de44404e705e6281291b9c468dcfd3de0efd864599e6

2 / The unsuccessful fix

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

N = 1
observations = []
def solve(a, b):
    u=set(a); v=set(b); return len(u&v)/len(u) if u else (1 if not v else 0)
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('left contained',solve(['a'],['a','b','c']),1)
check('right contained',solve(['a','b','c'],['a']),1)
check('partial smaller coverage',solve(['a','b'],['a','c','d']),0.5)
check('disjoint',solve(['a'],['b']),0)
check('both empty',solve([],[]),1)
check('one empty',solve([],['a']),0)
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 fixtureActualExpectedOutcome
left contained1.01Passed
right contained0.33333333333333331Failed
partial smaller coverage0.50.5Passed
disjoint0.00Passed
both empty11Passed
one empty00Passed

SHA-256 / 6d15ccd915d27b2cbf9e0342d982885b83602a5d178f40ed17da9a4e3b2c9cfd

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

Case digest / 52d61e34613ec0923c4d162b7988b285be8207adfe7ab280ac917d707d0a72bc