fix(knowledge): hand a large bounded set's exhausted Tin windows to the GIN ranking

A narrow reader's page is left short by design once the widest window cannot fill it; a large bounded set's read was exhaustive before, so its widest window that still falls short now hands the page to the GIN ranking, which covers every match.

Author: waleedlatif1

apps/sim/lib/knowledge/search/queries.test.ts

@@ -1832,6 +1832,19 @@ describe('permitted-document planner', () => {
         expect(JSON.stringify(ginStatements()[0])).not.toContain('doc-4999')
       })
 
+      it('hands the page to the GIN ranking when the widest window cannot fill it', async () => {
+        tinPages = [
+          { ranked: 2000, candidates: [] },
+          { ranked: 20_000, candidates: [] },
+        ]
+        queueTableRows(schemaMock.embedding, [{ ...hit('a', 'src-a'), content: 'release notes' }])
+        await keyword({ permitted: { kind: 'bounded', documents: large }, accessPlan })
+        expect(tinStatements()).toHaveLength(2)
+        /** Every match is covered again, by the ranking whose cost follows the term, not the set. */
+        expect(ginStatements()).toHaveLength(1)
+        expect(JSON.stringify(ginStatements()[0])).not.toContain('doc-4999')
+      })
+
       it('keeps the bounded read for a set under the size', async () => {
         mockResolveTinKeywordQuery.mockResolvedValue(null)
         await keyword({ permitted: { kind: 'bounded', documents: large.slice(0, -1) }, accessPlan })

apps/sim/lib/knowledge/search/queries.ts

@@ -2154,7 +2154,9 @@ export async function executeKeywordSearch(params: KeywordSearchParams): Promise
       /**
        * A resolved scope decides readability on the ranked row. The windows widen while the page
        * is short, a narrow reader's to a wide one sooner and no further, and what the widest
-       * cannot fill is left short rather than handed to a ranking over every match.
+       * cannot fill is left short rather than handed to a ranking over every match. A large
+       * bounded set is the exception: its bounded read was exhaustive, so the widest window that
+       * still falls short hands the page to the GIN ranking, which covers every match.
        */
       const narrow =
         accessPlan !== undefined &&
@@ -2219,7 +2221,7 @@ export async function executeKeywordSearch(params: KeywordSearchParams): Promise
         if (
           page.candidates.length >= limit ||
           page.ranked < window ||
-          (accessPlan !== undefined && window === windows[windows.length - 1])
+          (accessPlan !== undefined && !largePermittedSet && window === windows[windows.length - 1])
         ) {
           return { candidates: page.candidates, nextOffset: offset + page.candidates.length }
         }