fix(v2): de-duplicate a set filter before fingerprinting it

The filters compile to inArray, which is set membership, so workflowIds=A,A,B
selects exactly what A,B does. Sorting alone still bound them to different
pages, so an equivalent filter with a repeated member 400d mid-walk.

Author: waleedlatif1

apps/sim/lib/api/cursor-binding.test.ts

@@ -199,6 +199,15 @@ describe('unordered filter scope parts', () => {
     const b = cursorScopeKey({ workflowIds: unorderedScopePart('B,A') })
     expect(a).toBe(b)
   })
+  it('fingerprints a duplicate-bearing set identically', () => {
+    // The filters compile to `inArray`, which is set membership, so A,A,B
+    // selects exactly what A,B does and must resume the same page.
+    expect(cursorScopeKey({ workflowIds: unorderedScopePart('A,A,B') })).toBe(
+      cursorScopeKey({ workflowIds: unorderedScopePart('A,B') })
+    )
+    expect(unorderedScopePart('B,A,B')).toBe('A,B')
+  })
+
   it('still separates genuinely different sets', () => {
     expect(cursorScopeKey({ workflowIds: unorderedScopePart('A,B') })).not.toBe(
       cursorScopeKey({ workflowIds: unorderedScopePart('A,C') })

apps/sim/lib/api/cursor-binding.ts

@@ -68,16 +68,22 @@ export type CursorScopePart =
  * spelling, so a caller who reorders an equivalent filter mid-walk gets a 400
  * for a page that is genuinely the next one.
  *
- * {@link canonicalJson} already sorts object keys, so this only has to sort the
- * list members. Empty members are dropped because the parsers drop them too.
+ * {@link canonicalJson} already sorts object keys, so this only has to normalize
+ * the list. Members are de-duplicated as well as sorted: the filters compile to
+ * `inArray`, which is set membership, so `A,A,B` selects exactly what `A,B` does
+ * and must not bind to a different page. Empty members are dropped because the
+ * parsers drop them too.
  */
 export function unorderedScopePart(raw: string | undefined): string | undefined {
   if (raw === undefined) return undefined
-  const members = raw
-    .split(',')
-    .map((member) => member.trim())
-    .filter((member) => member.length > 0)
-    .sort()
+  const members = [
+    ...new Set(
+      raw
+        .split(',')
+        .map((member) => member.trim())
+        .filter((member) => member.length > 0)
+    ),
+  ].sort()
   return members.length > 0 ? members.join(',') : undefined
 }