<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Fing-Udelar-Students Participation in TA1C at IberLEF 2025: Clickbait Detection and Spoiling Shared Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Miguelángel Díaz Cerecetto</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gastón Paiva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Instituto de Computación (InCo), Facultad de Ingeniería, Universidad de la República</institution>
          ,
          <country country="UY">Uruguay</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>We present two competitive solutions in the Te Ahorré Un Click (TA1C) competition for (i) clickbait detection in Spanish tweets and (ii) clickbait spoiling given a headline and an article body. For the detection task, multiple BERT encoders were benchmarked, obtaining a blind-test macro-F1 of 0.80480, ranking 4th on the blind test set. On the spoiler generation task, we designed a pipeline and tested multiple axes of variation. These included the use of information retrieval (top- chunks) versus no retrieval (using the full article on the prompt), prompt language (Spanish vs. English), number of few-shot demonstrations (0-3), and whether to inject definitions of clickbait and spoiler. Supervised fine-tuning and multiple inference generation, ranked by a separate “judge” model, provided a significant upgrade over the Gemini-1.5-flash-002 model. The final spoiling pipeline achieved a BLEU metric of 0.43589 on the blind test set, ranking 1st in spoiler generation.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Large Language Models</kwd>
        <kwd>Spanish NLP</kwd>
        <kwd>Clickbait Detection</kwd>
        <kwd>Spoiler Generation</kwd>
        <kwd>Chain-of-Thought Prompting</kwd>
        <kwd>Retrieval-Augmented Generation</kwd>
        <kwd>Supervised Fine-Tuning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Clickbait is a widespread practice in online journalism: headlines or teasers deliberately omit a key
piece of information in order to trigger curiosity and force the reader to click. Curiosity arises when
people notice a gap between what they know and what they want to know; clickbait exploits that gap
to capture trafic. The Te Ahorré Un Click (TA1C) shared task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] at IberLEF 2025 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] is, to the best of
our knowledge, the first evaluation campaign that tackles clickbait detection and spoiling in Spanish,
covering twelve national varieties. Task 1 is Clickbait Detection. Given a tweet and the full news article
it links to, systems must decide whether the tweet is clickbait. Evaluation follows standard classification
metrics: precision, recall and their harmonic mean F1, averaged per class to obtain macro-F1, which is
the oficial task 1 metric. Precision measures the proportion of predicted clickbait tweets that are truly
clickbait, while recall measures the proportion of actual clickbait tweets that are correctly detected; their
combination in F1 balances both aspects. Task 2 is Clickbait Spoiling. Systems must generate a short
Spanish sentence (280 characters) that reveals the missing fact, or state that no answer is present in the
article. Because multiple valid spoilers may exist, automatic evaluation relies on three overlap-based
metrics: BLEU[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], ROUGE-L [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and BERTScore[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. After the automatic phase, the top systems will
undergo a human assessment of fluency, accuracy and conciseness as described in the oficial website.
      </p>
      <p>In this paper, Section 2 introduces the two TA1C subtasks and the corpora on which they are evaluated.
Section 3 details our methodology for both clickbait detection and spoiler generation, including model
architectures, prompt design and experimental protocol. Section 4 reports and analyses the results
obtained in each task. Finally, Section 5 summarises the main findings and sketches directions for future
work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Task and Data Overview</title>
      <sec id="sec-2-1">
        <title>2.1. Clickbait Detection Task</title>
        <p>
          The corpus comprises 4200 Spanish tweets posted between October 2020 and October 2021 by 18 major
media outlets, spanning twelve national varieties [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Each instance stores the tweet, the target URL and
the cleaned HTML of the article (headline, sub-headline, body, captions and embedded links). Tweets
were manually labeled. The split is 2800 training and 700 development tweets; a hidden set of 700 tweets
is kept for the final leaderboard, which is ranked by macro-F 1. Table 1 shows a typical tuple.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Spoiler Generation Task</title>
        <p>A manually curated subset of 500 tweets (300 train, 100 dev and 100 test examples) extends the detection
corpus with human-written spoilers that close the information gap. The answers cover factoids,
summaries, lists and “no-answer” cases. Table 2 presents an abbreviated example. The full article text is
stored as JSON and omitted here for space.
1355225506040438784
2021-01-29
Cómo inversores aficionados se enfrentaron a . . .</p>
        <p>La clave son las “ventas en corto”, en las que un fondo apuesta a que el precio caerá.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology and experimental setup</title>
      <sec id="sec-3-1">
        <title>3.1. Clickbait Detection Methodology</title>
        <p>
          Our detection pipeline is simple. We benchmarked a small pool of Spanish (and one multilingual)
BERT-type encoders. The evaluated models were PlanTL-GOB-ES/roberta-large-bne[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ],
dccuchile/bertbase-spanish-wwm-cased[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], pln-udelar/rouberta-base-uy22-cased[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], and the multilingual
xlm-robertabase[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The same protocol was implemented for each model: batch size 16, max length 128,
classweighted cross-entropy, and five-fold cross-validation using the 2800 labeled training tweets. The model
that obtained the highest macro-F1 on the development fold was used for the blind-test submission.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Spoiler Generation Methodology</title>
        <p>
          Figure 1 presents a detailed overview of our spoiler generation pipeline. The process begins with
the user providing the input pair: a tweet and its linked article with optional metadata (country and
outlet) that we choose to include in the article body if requested. This input is first preprocessed (e.g.
truncation, format cleaning), after which the article is then split into  key chunks of  sentences each,
using a semantic model, allowing the possibility of using the whole body in the prompt. Then, the
system branches depending on whether KATE-style[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] retrieval is enabled. Unlike canonical RAG[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ],
which incorporates passages of external knowledge, KATE seeks relevant in-context examples.
        </p>
        <p>
          If KATE-style retrieval is active, the title is first embedded with all-MiniLM-L6-v2[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], and the 
most similar training examples are retrieved via FAISS[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. In the hard-coded path, 0-3 illustrative
examples can be supplied, and each could be annotated with a handcrafted 5-step chain-of-thought to
guide the model, whereas in the KATE path the retrieved instances are automatically enriched with
meta-prompted CoT reasoning generated by the best local Large Language Model (LLM) benchmarked
in evaluation phase 1.
        </p>
        <p>
          Once the examples are selected, the system builds a complete prompt by concatenating a task-specific
system message based in similar works[
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], then the optional clickbait and spoiler definitions, also
optional special case instructions (e.g., for tweets lacking an answer in the retrieved parts from the
article), after that we include the selected examples, and finally the actual tweet–article pair to be
spoiled. This full prompt, built as shown in Figure 2, is passed to a language model wrapper class, which
can be configured to dispatch to any LLM provider services, local models or APIs.
        </p>
        <p>In the second phase, we also introduced a two-stage generation and correction pipeline, and a
postprocessing final step. At first, the chosen writer LLM produces distinct candidate spoilers. This
generates M candidates that can present variations in their structure. Then, a dedicated judge LLM
reviews all M outputs, choosing the best one according to a tiny prompt we wrote for this final step
(Figure 3). We propose this fix as external to the final model, and present 4 final models for the evaluation
phase, varying only this parameter. Finally, we use a postprocessing step to remove manually detected
prompt-related inaccuracies generated by the models (e.g. "SALIDA ESPERADA:" message at the start).</p>
        <p>--- SYSTEM
--Eres un experto en redactar spoilers de clickbait para arruinar las noticias clickbait en español.
El clickbait es un método para generar titulares llamativos, especialmente en línea, que omite
deliberadamente parte de la información con el objetivo de generar curiosidad,
al crear una brecha de información, atrayendo así la atención de los lectores
y logrando que hagan clic.</p>
        <p>Un spoiler de clickbait es una corta respuesta objetiva que acaba con la brecha
de información que el Tweet siembra y que, en el artículo, se resuelve.</p>
        <p>La principal funcionalidad del spoiler es que el lector ya no necesite abrir la noticia.
Tu tarea es leer el titular y el artículo, y escribir una única oración en español
que revele claramente lo que el tweet insinúa. Busca en el artículo la frase o dato
que responda a la duda planteada, preferiblemente citando el texto original
entre comillas si se trata de una declaración. Sé conciso: redacta una sola
oración que contenga la idea central, sin repetir nombres, fechas, hashtags
ni frases o entidades ya presentes en el tweet.</p>
        <p>Ten presente que pueden existir los siguientes casos particulares:
1. Que no exista respuesta en el conjunto. En ese caso debes responder
SOLAMENTE (sin comillas): No hay respuesta
2. Que la respuesta sea la nota completa. En ese caso debes responder
SOLAMENTE (sin comillas): La respuesta es la nota completa
--- EXAMPLES
--Ejemplos (titular, artículo, frase reveladora):
TWEET: ...</p>
        <p>NOTICIA ORIGINAL:
...</p>
        <p>RAZONAMIENTO:
Paso 1: ¿Cuál es/son la(s) parte(s) oculta(s) a desvelar en el tuit?: ...</p>
        <p>Paso 2: Por lo tanto, ¿qué pregunta(s) debemos responder?: ...</p>
        <p>Paso 3: ¿Aparece(n) la(s) respuesta(s) en la noticia?
¿Dónde exactamente (cita breve o localiza el párrafo)?: ...</p>
        <p>Paso 4: ¿Cómo resumirías esa(s) respuesta(s) sin repetir datos del tuit?: ...</p>
        <p>Paso 5: Por lo tanto, la respuesta es: ...</p>
        <p>SALIDA ESPERADA (debes escribir lo siguiente): ...
--- TASK
--TWEET: {tweet}
NOTICIA ORIGINAL: {article}</p>
        <p>SALIDA ESPERADA:</p>
        <p>Elige el mejor spoiler entre los 3 candidatos. Criterio:
Responde la incógnita del tuit de forma correcta, concisa y sin repetir literalmente el tuit.
Tweet:
¿Sabes qué jugador fue transferido por cifra récord?
Artículo (referencia):
El club confirmó que Juan Pérez fue traspasado al Real FC por 50 millones
de euros, estableciendo un nuevo récord en la liga...</p>
        <p>Candidatos:
1. Fue Juan Pérez, vendido por 50 millones de euros.
2. El club no ha confirmado ninguna venta.
3. Se trata de Luis Gómez.</p>
        <p>Respuesta:</p>
        <sec id="sec-3-2-1">
          <title>3.2.1. Experimental setup</title>
          <p>In the detection task, we evaluated a range of Spanish BERT variants in the clickbait detection task
using a 5-fold cross-validation protocol with class-weighted loss, using both train and val datasets,
training each model for three epochs at a learning rate of 2 × 10− 5, and a batch size of 16.</p>
          <p>For the spoiling task, the evaluation was split into three phases. At the very start of the competition,
we set aside 60 training instances and benchmarked five candidates’ LLMs. Then, we chose the best local
model and then began refining the prompt using this model. Prompt configuration included evaluation
for article information retrieval, few-shot example building variants, clickbait and spoiler definitions,
and prompt language. When prompt construction was done, multiple LLM temperatures were evaluated
by a sweep, and supervised fine-tuning was also explored.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results and discussion</title>
      <sec id="sec-4-1">
        <title>4.1. Classification</title>
        <p>
          The best base model PlanTL-GOB-ES/roberta-large-bne[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] achieved a macro-F1 of 0.8928 ± 0.0096 in
this search step. Table 3 summarizes the mean and standard deviation of macro-F1 across the folds. We
ultimately deployed the best-performing model from our evaluation phase, which delivered an F1 score
of 0.80480 on the test dataset1.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Spoiling</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. Model selection</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Prompt construction</title>
          <p>We then refined the prompting strategy using Gemma-3 12B. Initially, we compared three article
retrieval methods: using the full article versus using smaller fragments (five fragments of two sentences
1https://huggingface.co/dcere/ta1c-Clickbait-Detector-es-large
or two fragments of two sentences each). As shown in 6, providing the model with the complete article
consistently outperformed fragmented versions, which frequently omitted critical information, causing
the model to mistakenly predict the fallback answer "No hay respuesta".</p>
          <p>
            Next, we examined few-shot prompting strategies. The KATE-style example retrieval—MiniLM
embeddings [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] with FAISS [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]— was compared against a simpler pool of manually curated examples.
Although similarity-based retrieval chose tweets lexically closer to the test headline, these KATE
prompts did not always capture diverse reasoning patterns. In contrast, manually curated examples
augmented with an explicit five-step Chain-of-Thought (CoT) rationale achieved consistently higher
scores, echoing the CoT-over-KATE outperforming reported by Fu et al. (2023) [19]. Consequently, we
adopted a fixed trio of hardcoded CoT-enhanced examples for the final system.
          </p>
          <p>We also assessed the impact of including explicit definitions of clickbait and spoiler. Although adding
these definitions did not noticeably alter performance metrics, we included them in the final pipeline
since they provided explicit and self-contained context, potentially aiding the model’s generalization
and interpretability. Lastly, we evaluated whether switching the prompt language from Spanish to
English afected performance. This comparison revealed negligible diferences (less than 0.1 points
diference), leading us to retain Spanish for practical reasons, such as ease of human evaluation, reduced
code-switching artifacts, and simplified prompt quality control.</p>
        </sec>
        <sec id="sec-4-2-3">
          <title>4.2.3. Language model tuning</title>
          <p>Once we had identified the best-performing prompt for Gemma-3, fine-tuning Gemma-3 was infeasible
within the competition’s tight timeline, we instead supervised-fine-tuned Gemini-1.5 with the winning
prompt from the previous phase. The resulting model became the core of our system.</p>
          <p>Using this fine-tuned Gemini-1.5, we conducted temperature sweeps and post-processing experiments.
We found that  = 0.80 produced the best results, whereas the optimal temperature for base Gemma-3
had been  = 1.0. This upgrade lifted BLEU on the development set from 0.2978 (base Gemma-3 + best
prompt) to 0.4201.</p>
          <p>With the writer model finalized, we next generated  candidate outputs and re-ranked them with
a second Gemini-1.5 acting as a judge. Generating six candidates and selecting the best one raised
BLEU on the test set by +4.7 points compared with single-shot decoding. Manual probing showed that
a high-quality spoiler often appeared only on the third, fourth, or even sixth attempt; the first answer
frequently missed key facts or omitted information. By letting the writer explore a small diversity
of outputs and allowing the judge to pick the most concise and faithful candidate, we systematically
increased the chance of capturing the correct answer gap.</p>
          <p>Our final spoiler-generation model used a Gemini-1.5-flash-002 base, fine-tuned in supervised mode
for 10 steps, with a learning-rate multiplier of 1 and an adapter size of 8, without intermediate
checkpoints. A simplified code implementation with the winning model is available in a companion notebook 2.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions and Future Work</title>
      <p>This study introduced a simple approach to Spanish clickbait detection and a competitive architecture
for spoiler generation, ranking fourth in classification and first in spoiling. Supplying the language
model with the full, cleaned article consistently outperformed any information-retrieval strategy that
restricted context, because crucial details often appear late in the body and a truncated window pushed
the model toward spurious “No hay respuesta” replies. A small, manually balanced set of Spanish
examples, each enriched with an explicit chain of thought, guided the model more efectively than
retrieval-based prompts whose similarity was measured only at the lexical level; the benefit stems
from showcasing diverse reasoning patterns rather than surface overlap. Finally, replacing the base
Gemma-3 with a supervised fine-tuned Gemini-1.5 and re-ranking multiple candidate outputs with a
second “judge” instance yielded a cumulative gain of more than 13 BLEU points. This shows the value
of supervised fine-tuning.</p>
      <p>Future research could explore multimodal LLMs: some training tweets contained spoilers available
only through an embedded image (see Table 8), we removed them from the train and val dataset before
performing the fine-tuning. Injecting an automatic caption of that image obtained with a multi-modal
LLM into the textual context could unlock currently unsolved cases. Most prompt-engineering choices
and decoding hyper-parameters (temperature, number of candidates, prompt language) were tuned
on the intermediate Gemma-3 model and only quick-checked once the pipeline migrated to the
finetuned Gemini-1.5 writer + judge. A systematic, model-specific search (e.g., grid search) directly on
Gemini—could reveal combinations better aligned with the newer model’s behavior and yield additional
gains in both automatic scores and human-rated fluency.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used two generative-AI tools—OpenAI GPT-4o and
OpenAI o3— for copy-editing tasks (grammar and spelling). All AI-suggested edits were reviewed
2https://colab.research.google.com/drive/1qnfduoTNdUTE-Tnb8kCZfFGR-ujwWiOW?usp=sharing
and, where necessary, modified by the authors, who accept full responsibility for every aspect of this
publication.
G. de Rosa, O. Saarikivi, A. Salim, S. Shah, X. Wang, R. Ward, Y. Wu, D. Yu, C. Zhang, Y. Zhang,
Phi-4 technical report, 2024. URL: https://arxiv.org/abs/2412.08905. arXiv:2412.08905.
[19] P. Fu, Y. Zhang, H. Wang, W. Qiu, J. Zhao, Revisiting the knowledge injection frameworks, in:
H. Bouamor, J. Pino, K. Bali (Eds.), Proceedings of the 2023 Conference on Empirical Methods
in Natural Language Processing, Association for Computational Linguistics, Singapore, 2023,
pp. 10983–10997. URL: https://aclanthology.org/2023.emnlp-main.677/. doi:10.18653/v1/2023.
emnlp-main.677.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Mordecki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Laguna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Prada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosá</surname>
          </string-name>
          , I. Sastre, G. Moncecchi, Overview of TA1C at IberLEF 2025:
          <article-title>Detecting and Spoiling Clickbait in Spanish-Language News</article-title>
          ,
          <source>Procesamiento del Lenguaje Natural</source>
          <volume>75</volume>
          (
          <year>2025</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Á</surname>
          </string-name>
          .
          <string-name>
            <surname>González-Barba</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Chiruzzo</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          <string-name>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <article-title>Overview of IberLEF 2025: Natural Language Processing Challenges for Spanish and other Iberian Languages, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2025), co-located with the 41st Conference of the Spanish Society for Natural Language Processing (SEPLN 2025), CEUR-WS</article-title>
          . org,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Papineni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Roukos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ward</surname>
          </string-name>
          , W.-J. Zhu,
          <article-title>BLEU: A method for automatic evaluation of machine translation</article-title>
          ,
          <source>in: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL</source>
          <year>2002</year>
          ), Philadelphia, PA,
          <year>2002</year>
          , pp.
          <fpage>311</fpage>
          -
          <lpage>318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.-Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <surname>ROUGE:</surname>
          </string-name>
          <article-title>A package for automatic evaluation of summaries, in: Text Summarization Branches Out (Post-</article-title>
          ACL Workshop), Barcelona, Spain,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kishore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Artzi,</surname>
          </string-name>
          <article-title>BERTScore: Evaluating text generation with BERT</article-title>
          ,
          <source>in: International Conference on Learning Representations (ICLR</source>
          <year>2020</year>
          ),
          <year>2020</year>
          . URL: https://openreview.net/forum?id=SkeHuCVFDr.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Mordecki</surname>
          </string-name>
          , G. Moncecchi,
          <string-name>
            <given-names>J.</given-names>
            <surname>Couto</surname>
          </string-name>
          ,
          <article-title>Te ahorré un click: A revised definition of clickbait and detection in spanish news</article-title>
          , in: L.
          <string-name>
            <surname>Correia</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rosá</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Garijo</surname>
          </string-name>
          (Eds.),
          <source>Advances in Artificial Intelligence - IBERAMIA 2024</source>
          , Springer Nature Switzerland, Cham,
          <year>2025</year>
          , pp.
          <fpage>387</fpage>
          -
          <lpage>399</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutiérrez-Fandiño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Armengol-Estapé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pàmies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Llop-Palao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Silveira-Ocampo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. P.</given-names>
            <surname>Carrino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Armentano-Oller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rodríguez-Penagos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gonzalez-Agirre</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Villegas, MarIA: Spanish language models</article-title>
          ,
          <source>Procesamiento del Lenguaje Natural</source>
          <volume>68</volume>
          (
          <year>2022</year>
          )
          <fpage>39</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Cañete</surname>
          </string-name>
          , G. Chaperon,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fuentes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pérez</surname>
          </string-name>
          ,
          <article-title>Spanish pre-trained bert model and evaluation data</article-title>
          ,
          <source>in: PML4DC at ICLR</source>
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Filevich</surname>
          </string-name>
          , G. Marco,
          <string-name>
            <given-names>S.</given-names>
            <surname>Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosá</surname>
          </string-name>
          ,
          <article-title>A language model trained on uruguayan spanish news text</article-title>
          ,
          <source>in: Proceedings of the Second International Workshop Towards Digital Language Equality (TDLE): Focusing on Sustainability@ LREC-COLING</source>
          <year>2024</year>
          ,
          <year>2024</year>
          , pp.
          <fpage>53</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Conneau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Khandelwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wenzek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Guzmán</surname>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Unsupervised cross-lingual representation learning at scale</article-title>
          , CoRR abs/
          <year>1911</year>
          .02116 (
          <year>2019</year>
          ). URL: http://arxiv.org/abs/
          <year>1911</year>
          .02116. arXiv:
          <year>1911</year>
          .02116.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dolan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Carin</surname>
          </string-name>
          , W. Chen,
          <article-title>What makes good in-context examples for gpt-3</article-title>
          ?,
          <year>2021</year>
          . URL: https://arxiv.org/abs/2101.06804. arXiv:
          <volume>2101</volume>
          .
          <fpage>06804</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , W. tau Yih, T. Rocktäschel,
          <string-name>
            <given-names>S.</given-names>
            <surname>Riedel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <article-title>Retrieval-augmented generation for knowledge-intensive nlp tasks</article-title>
          ,
          <year>2021</year>
          . URL: https://arxiv.org/abs/
          <year>2005</year>
          .11401. arXiv:
          <year>2005</year>
          .11401.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , Minilm:
          <article-title>Deep self-attention distillation for task-agnostic compression of pre-trained transformers</article-title>
          ,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2002</year>
          .10957. arXiv:
          <year>2002</year>
          .10957.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Douze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Guzhva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Deng</surname>
          </string-name>
          , J. Johnson, G. Szilvasy, P.-E. Mazaré,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lomeli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hosseini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jégou</surname>
          </string-name>
          ,
          <article-title>The faiss library (</article-title>
          <year>2024</year>
          ). arXiv:
          <volume>2401</volume>
          .
          <fpage>08281</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>I.</given-names>
            <surname>García-Ferrero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Altuna</surname>
          </string-name>
          ,
          <article-title>Noticia: A clickbait article summarization dataset in spanish</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2404</volume>
          .
          <fpage>07611</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>DeepSeek-AI</surname>
          </string-name>
          ,
          <article-title>Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning</article-title>
          ,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2501.12948. arXiv:
          <volume>2501</volume>
          .
          <fpage>12948</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G.</given-names>
            <surname>Team</surname>
          </string-name>
          , Gemma
          <volume>3</volume>
          (
          <year>2025</year>
          ). URL: https://goo.gle/Gemma3Report.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abdin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Aneja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Behl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bubeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Eldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gunasekar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Harrison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Hewett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Javaheripi</surname>
          </string-name>
          , P. Kaufmann,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C. T.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          , E. Price,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>