mirror of
https://github.com/PR0M3TH3AN/unredact.git
synced 2026-10-27 08:40:29 +00:00
Group metrically identical characters into equivalence classes to reduce the DFS branching factor from N to K per node, with Cartesian product expansion on matches to recover all solutions. Co-Authored-By: Claude Opus 4.6 <[email protected]>