# A FAIR Resource Recommender System for Smart Open Scientific Inquiries
## 3 The Deep Web Communication Protocol
### Message Structure and Data Model
Moreover, LLaMA displays high variability in runtime, with several queries taking over 100 s and some extreme outliers exceeding 600 s.

Figure 4: Structured data retrieval success (Success@1) across four language models, defined as the proportion of queries for which a valid tabular dataset was returned from the predicted access path. This includes all access types—form-based, table-based, and file-based interfaces. DeepSeek-R1 achieves the highest success rate at 98.98%, followed closely by Gemma at 97.96%. LLaMA 3.3 and Qwen3 both report 93.88%, slightly lower due to occasional failures in form execution or schema resolution. In contrast, DeepSeek-R1 demonstrates the most efficient and stable behavior, averaging only 13.6 s per query--almost three times faster than LLaMA 3.3. It also features a tighter variance range, making it particularly suitable for latency-sensitive applications. Gemma and Qwen3 show intermediate behavior. Gemma maintains low and consistent latency around 13.2 s per query, while Qwen3 averages 29.7 s but occasionally experiences delays above 90 s, indicating higher variance. Notably, both DeepSeek-R1 and Gemma exhibit robustness across different access types, showing minimal timing degradation in more complex scenarios. On the other hand, LLaMA 3.3's latency is less predictable, reflecting occasional spikes due to its increased prompt length, form parsing load, and runtime memory footprint. These results indicate a trade-off between latency stability and semantic accuracy. While LLaMA provides high retrieval accuracy, its processing overhead may be a limitation in contexts that require fast and consistent responses. DeepSeek-R1 presents a viable alternative, offering a more balanced combination of speed, reliability, and competitive retrieval performance. Table 4 provides a detailed breakdown of model performance across simple, complex, and overall queries. This perspective emphasizes how query complexity affects system behavior, whereas earlier figures concentrated on aggregate trends. As anticipated, simple queries that closely match the names of schema fields typically yield better results for models, with higher page and schema match rates. The biggest performance difference between simple and complex inputs is seen in LLaMA 3.3, especially in schema match accuracy, highlighting its strength in well-structured but abstraction-sensitive queries. DeepSeek-R1 and Gemma, on the other hand, show more consistent performance across query types, indicating greater resilience to changes in linguistic specificity. These patterns further sup

Figure 5: Distribution of total retrieval time (in seconds) per query across four language model variants: LLaMA 3.3, DeepSeek-R1, Qwen3 and Gemma. Each box plot shows median latency, interquartile range and outliers beyond 1.5 xIQR (depicted as circles) for the full DWCP pipeline, including semantic search, schema matching, and data access simulation. LLaMA 3.3 exhibits the highest average latency and greatest variance, with some queries exceeding 600 s. DeepSeek-R1 demonstrates the lowest and most stable response time, averaging 13.6s with minimal outliers. port DeepSeek-R1's balance between speed and accuracy, and indicate areas where form interpretation and semantic grounding can be improved, especially for abstract queries. ## 7 Discussion

This work presents FAIRFind, a system that augments the FAIRsharing registry by enabling automated indexing and access to deep web datasets. While FAIRsharing provides structured metadata about scientific standards and databases, it does not expose or enable access to the actual contents of those databases. FAIRFind addresses this gap by discovering, simulating, and structuring access to data hidden behind forms, tables, and file links, reinforcing the FAIR principles, particularly Findability and Accessibility, within the FAIRsharing infrastructure itself. ### Analysis of Results

The system operates consistently across a variety of access types, as shown by our experimental results.