Such exponential growth in computational demand underscores the need for more efficient processing strategies. In response, we have implemented a hierarchical rule application, denoted as Q hier , making use of the hierarchical structure of the templates. The processing time for Q hier is significantly lower than that of Q complete , with only a 60% increase in processing time from R 0 to R 3 compared to the 50-fold increase observed with Q complete . Despite these differences in processing time, both approaches maintain consistent coverage and novelty across all choices of the extension radius r, see Figs. and. Consequently, Q hier emerges as the more efficient choice, enabling equal outcomes with reduced resource expenditure.