FA-73198 / Probabilistic sketches / Member archive

MinHash Jaccard estimation: agreement normalised like a set Jaccard · case 03

Similarity estimates are systematically deflated for partially overlapping sets.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Input {k, A, B} integer sets. Signature component i is min over v of (A_i v + B_i) mod 2^31-1 with fixed coefficients. The estimate is the fraction of positions where both signatures agree, rounded to 4 decimals. Two empty sets have undefined similarity (None, with empty signatures); exactly one empty set gives 0.0. Return [sigA, sigB, estimate].

Why this case matters

Near-duplicate detection and set-similarity joins compare MinHash signatures instead of the sets; signature and comparison rules must match exactly across producers.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
overlapping sets k=4	`[[416840246, 27093348, 345992755, 100022], [290151962, 27093348, 345992755, 100022], 0.6]`	`[[416840246, 27093348, 345992755, 100022], [290151962, 27093348, 345992755, 100022], 0.75]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.