Most AI search today splits one question into several text queries, then searches those strings. Whether your page contains those words still affects what comes back.
Google's latest research shows a path that skips writing that text. The question is encoded once, and a small model emits several fanout vectors directly. Search then retrieves the content closest in meaning to each vector. No readable sub-query is left behind.
In the paper, building fan-outs for a batch of 8 queries drops from 1.46 seconds with an LLM to 0.07 seconds with the diffusion model. The tests were fashion outfits and music playlists. The paper does not say this runs in Google Search or AI Overviews.
If retrieval moves from keywords to closeness in meaning, a page changes what it needs. Sprinkling the query's words is not enough to land near the vector. What matters is a passage that answers each facet head-on.
This check shows that state before you rewrite. It splits your query into 4 to 12 facets, depending on how broad it is, and scores how close the nearest passage on the page is. It is an approximation of the idea, not Google's model, and it is not a ranking.
From text fanouts to vector fanouts
The left is how fan-out works in wide use today. The right is what the paper tested. On the right, nobody writes a search query.
This tool is not the paper's diffusion model. It splits the question into 4 to 12 facets, embeds an ideal passage for each, and measures how close your page's passages sit.