<!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>Profiling Cryptocurrency Influencers with Sentence Transformers</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kavya Girish</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Asha Hegde</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fazlourrahman Balouchzahi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hosahalli Lakshmaiah Shashirekha</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Few Shot Learning (FSL) is a supervised Machine Learning (ML) problem which deals with learning with few labeled samples. To address the challenges of FSL in terms of low-resource perspective, in this paper, we describe the models submitted to "Profiling Cryptocurrency Influencers with Few-shot Learning" - a shared task in PAN@CLEF 2023. The task has a focus on English Twitter posts for three subtasks: i) Subtask1 - Low-resource Influencer Profiling, ii) Subtask2 - Low-resource Influencer Interest Identification and iii) Subtask3 - Low-resource Influencer Intent Identification, with a very small set of labeled data. Two models: i) FSL-Word2Vec - Linear Support Vector Classifier (LinearSVC) trained with word embeddings extracted from Google's pre-trained Word2Vec and ii) FSL-ST - LinearSVC trained with sentence embeddings obtained from stsb-bert-base, are submitted to the shared task. FSL-Word2Vec models obtained macro F1 scores of 46.66 and 50.42 for Subtasks 2 and 3 respectively and FSL-ST model obtained a macro F1 score of 37.92 for Subtask1.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Machine Learning</kwd>
        <kwd>Cryptocurrency</kwd>
        <kwd>Few Shot Learning</kwd>
        <kwd>Word2Vec</kwd>
        <kwd>Sentence Transformers</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Cryptocurrency is a digital currency created as an alternative form of currency using encryption
algorithms. The transactions in cryptocurrency are verified and maintained by a decentralized
system using cryptography, rather than by a centralized authority. Today, there are more than
22,789 diferent cryptocurrencies, with an estimated total value of 1 trillion dollars 1. Some of
the top cryptocurrencies with billions of dollars in the market include Bitcoin, Ethereum, Tether,
Binance Coin, and Dogecoin.</p>
      <p>
        Social media platforms are playing a prominent role in expanding the cryptocurrency
communities to reach the general public. The rising ubiquity of speculative trading of cryptocurrencies
over social media has led to sentiment driven “bubbles” [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Further, comments/ posts in
social media from highly influential personalities often cause a growing chain reaction leading
to a short squeeze and the creation of a bubble. These personalities known as Cryptocurrency
Influencers, act as the link between the cryptocurrency industry and general public. Vitalik
Buterin, Elon Musk, Andreas M, and S Anthony Pompliano are some of the most popular and
leading Crypto Influencers. These Influencers can help the public and new crypto investors
about the trending cryptocurrencies, comment on crypto news, and provide marketing services
to crypto startups2. Cryptocurrency Influencers can be categorized based on: i) number of
followers (Nano influencers - 1K–10K followers, Micro influencers - 10K–100K followers, Macro
influencers - 100K–1M followers and Mega or celebrity influencers - 1M+ followers), ii) interest
(technical information, price update, trading matters, gaming) and iii) intent (subjective opinion,
ifnancial information, advertising, announcement). People, especially the ones who want to
know more information about cryptocurrencies or the ones who are interested in investing in
cryptocurrencies can search for these Influencers to understand the nuances of crypto market.
Hence, instead of searching for the Influencers, it will be very helpful if such Influencers’ profile
is automatically available to the users. This requirement leads to profiling Cryptocurrency
Influencers automatically and can be considered as a special case of Author Profiling which is
the need of the day to expand cryptocurrency market [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>Crypto Influencers have built a sizable followers on social media sites by expressing their
thoughts and observations on cryptocurrencies. However, profiling Cryptocurrency Influencers
in social media is very challenging due the very informal kind of data that is available on social
media platforms. Given the social media data about the impact the cryptocurrency Influencers
have created and the category to which these Influencers belong, profiling the Influencers can
be modeled as a text classification problem. However, in a real environment, data collection is a
major challenge and real-time profiling needs to be done in a few milliseconds, which implies
to process as little data as possible. This demands for the tools which can make predictions
accepting very less data.</p>
      <p>
        Conventionally, large amount of annotated data is required to train the ML models. However,
collecting, annotating, and validating large data is very expensive. Further, there are many
cases where it is just next to impossible to collect large datasets or the available large datasets
may not be accessible for public. For example, rare diseases would not have a large number of
radiological images or it would be frustrating if smartphones need to have thousands of pictures
of users to recognize them and get unlocked. In such scenarios, ML models trained on a small
number of samples results in low performance on the Test set. A solution to such scenarios
is FSL which aims to build accurate ML models with less training data [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. FSL which was
originally developed for Computer Vision models to work with relatively few training samples
is now being used for Natural Language Processing (NLP) applications and the results are
encouraging. However, FSL for NLP applications is a young area that needs more research and
refinement.
      </p>
      <p>
        "Profiling Cryptocurrency Influencers with Few-shot Learning" is a shared task 3 in PAN
@CLEF 2023 which aims to profile Cryptocurrency Influencers in social media, from a
lowresource perspective [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Focusing on English Twitter posts, this shared task includes three
diferent subtasks and the details of the subtasks are shown in Table 1. To address the challenges
of text classification from a low-resource perspective, in this paper, we describe the FSL models
submitted to the above mentioned shared task to profile Cryptocurrency Influencers with very
      </p>
      <sec id="sec-1-1">
        <title>2https://dailycoin.com/crypto-influencers-you-need-to-know-about/ 3https://pan.webis.de/clef23/pan23-web/author-profiling.html</title>
        <p>32 users per label
with a maximum of
10 English tweets
each
64 users per label
with 1 English tweets
64 users per label
with 1 English tweets
each
160</p>
        <p>220
320</p>
        <p>402
256
292
less data provided by the organizers of the shared task. The proposed models makes use of
Google’s pre-trained Word2Vec4 and stsb-bert-base5 - a Sentence Transformer (ST), to represent
text which in turn are used to train LinearSVC models to predict the probabilities of the samples
belonging to the classes in the predefined set of classes of a subtask and assign the label of the
class having highest probability to the Test sample.</p>
        <p>The rest of the paper is organized as follows: Section 2 gives a brief description of the related
work followed by the methodology in Section 3. The experiments and results are discussed in
Section 4 and the paper concludes with future work in Section 5.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Profiling Cryptocurrency Influencers and FSL are relatively the new fields for NLP researchers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
However, researchers have explored many techniques for Author Profiling. Hence, considering
profiling Cryptocurrency Influencers as a special case of Author Pofiling, a brief description of
few of the relevant works are given below:
      </p>
      <p>
        Wang et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] conducted a comprehensive and systematic review of FSL starting from the
formal definition of FSL, the relatedness and diferences of FSL with relevant learning problems
such as weakly supervised learning, imbalanced learning, Transfer Learning (TL) and
metalearning. They focused on learning experiences for small samples and categorised FSL from the
perspective of data, model and algorithm. To discuss the pros and cons of each category, they
4https://huggingface.co/fse/word2vec-google-news-300
5https://huggingface.co/sentence-transformers/stsb-bert-base
explored various learning models including multitask learning, embedding learning, learning
with external memory, and generative modelling by refining existing parameters, meta-learned
parameters, and optimizer on image data with data augmentation, such as flipping, scaling,
rotation, and reflection. Patel et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] presented Sequential Autoregressive Prompting (SAP)
- a technique that enables the prompting of bidirectional models. Considering the machine
translation task as a case study, they prompt the bidirectional mT56 model and demonstrated
its few-shot and zero-shot translations. This model outperformed the few-shot translations
of unidirectional models like GPT-37 and XGLM8. Further, they also showed that SAP is a
better choice in question answering and text summarization tasks. Their results demonstrate
prompt based few-shot and zero-shot learning are emergent techniques in building broader
class of language models compared to unidirectional models. Joo and Hwang [8] presented the
model submitted to PAN@CLEF 2019 shared task on Author Profiling to determine whether
a tweet’s author is a bot or human and in case of human, to perform gender identification.
Their Gradient Boosted Decision Tree (GBDT) classifier trained by stacking: character count,
psycholinguistic features, Term Frequency - Inverse Document Frequency (TF-IDF), Doc2vec
and BERT embeddings, obtained accuracies of 0.9333 and 0.8352 for bot identification and
gender identification tasks respectively.
      </p>
      <p>
        Parnami and Lee [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] conducted a detailed survey of the recently proposed FSL algorithms.
The agenda of the survey includes learning dynamics, characteristics of FSL, approaches to
deal with FSL problems from the perspectives of meta-learning, TL, and hybrid approaches.
Further, with open problems and challenges in FSL followed by the discussion about FSL issues,
such as training the same way as testing, learning constrained to a single distribution of tasks,
performing joint classification from seen and unseen classes, and FSL for domains other than
images, they conclude their survey. Tunstall et al. [9] proposed SETFIT (Sentence Transformer
Finetuning) - an eficient and prompt-free framework for few-shot fine-tuning of ST. This model
ifrst finetunes a pretrained ST on a small number of text pairs to generate rich text embeddings,
which are used to train a classification head. This simple framework without prompts or
verbalizers have achieved high accuracy with orders of magnitude less parameters than existing
techniques. They have also demonstrated that SETFIT can be applied in multilingual settings
by simply switching the ST body and evaluated SETFIT with three variants of transformer
based models (SETFITROBERTA, SETFITMPNET, and SETFITMINILM) on various text classification
tasks (sentiment analysis, spam detection, and topic classification) considering the available
bench-marked datasets (SST-5, AmazonCF, Emotion, EnronSpam, and AGNews). Their proposed
SETFITROBERTA model out performed GPT-3 by exhibiting a maximum average score of 71.3.
      </p>
      <p>Many researchers have worked on Author Profiling considering a substantial amount of
data. But, very few works are explored for Author Profiling with few labeled samples. Hence,
exploring FSL for profiling Cryptocurrency Influencers with few labeled samples has enough
scope and opens up new avenues of research in this topic.</p>
      <sec id="sec-2-1">
        <title>6https://huggingface.co/docs/transformers/model_doc/mt5 7https://github.com/openai/gpt-3 8https://huggingface.co/docs/transformers/model_doc/xglm</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>
        Two models, FSL-Word2Vec and FSL-ST are proposed to address the challenges of the shared
task and these models difer primarily in pre-processing and the way of representing texts. The
dataset shared by the organizers of the shared task is collected from Twitter [
        <xref ref-type="bibr" rid="ref6">6, 10</xref>
        ] and Twitter
data will usually be noisy/dirty with lot of URL’s, hashtags, user mentions, emojis and numeric
information, which are not significant for classification. Hence, text data needs to be cleaned
and prepared for text representation. The first step in this direction is to tokenize the input into
sentences and applying the pre-processing steps on the sentences depending on the model used
for text representation.
      </p>
      <p>The framework of the proposed methodology is visualized in Figure 1 and the proposed
models are described below:
3.1. FSL-Word2Vec
• Pre-processing - emojis are converted to the corresponding text and the entire text is
lower cased. Further, the noisy content, punctuation, and the stop words are removed
from the text. English stopword list9 available at NLTK library is used to remove the stop
words and Porter Stemmer10 is used to strip the afixes from the words. The remaining
content in the pre-processed sentences are given as input to the text representation
module.
• Text Representation - deals with how eficiently text documents are represented. The
introduction of Word2Vec by Mikolov et al. [11] gave rise to the representation of words by
a fixed dimension dense vector of small size like 50, 100, 200 and 300. These vectors which
are called as pre-trained vectors/embeddings will be trained on a very large corpus. With
this representation, any text can be represented as an aggregation of the representation of
words. Leveraging pre-trained embeddings for word representation will help to capture
the semantic knowledge, even when the task-specific dataset is limited. Google’s
pretrained Word2Vec11 is one such implementation trained on roughly 100 billion words
9https://www.nltk.org/search.html?q=stopwords
10https://www.nltk.org/api/nltk.stem.porter.html
11https://huggingface.co/fse/word2vec-google-news-300
from a Google News dataset. Word2Vec captures the general semantic relationships,
patterns, and domains and contains vectors of size 300 for 3 million words and phrases.
Using Google’s pre-trained Word2Vec model, the text is represented as follows:
– for each word in a sentence, a vector of 300 dimension is extracted (if the word is
not in the vocabulary, a zero vector of length 300 is used)
– for each sentence, the mean of the vectors of all the words in that sentence is
obtained
– for each text, the mean of the vectors of all the sentences in that text is obtained
With this arrangement, each text/sample in the dataset will be represented by a dense
vector of size 300.
3.2. FSL-ST
• Pre-processing - as ST represent the sentences, very limited pre-processing is carried
out on the sentences to maintain the sentence structure. This includes converting emojis
to the corresponding text and removing the noisy content from each sentence in the given
text. Stopword removal, Stemming and converting text to lowercase, are not performed
to retain the sentence structure. The pre-processed sentences are given as input to the
text representation module.
• Text Representation - ST is a Python framework for generating contextualized
embeddings for sentences. By embedding sentences into a vector space, ST enables the
proximity of similar sentences, allowing for various applications such as semantic search,
clustering, and retrieval. With its user-friendly methods, ST simplifies the process of
generating embeddings, exhibits state-of-the-arts performance, provides multilingual
support, and is reliable as it belongs to open source community. Few-shot and zero-shot
approaches have received a great deal of interest in the research community due to the
availability of ST and the untapped capacity to use them in resource-constrained domains
[9]. stsb-bert-base is a ST model that maps sentences and paragraphs to a 768 dimensional
dense vector space and can be used for tasks like clustering or semantic search.
Using stsb-bert-base12, the text is represented as follows:
– Each sentence in a text is represented by a vector of 768 dimension
– for each text, the mean of the vectors of all the sentences in that text is obtained
With this arrangement, each sample in the dataset will be represented by a dense vector of size
768. Hyperparameters and their values of stsb-bert-base are shown in Table 2.</p>
      <sec id="sec-3-1">
        <title>3.3. Model Building</title>
        <p>The motivation for using FSL is to learn with few available samples. As the number of training
samples for each subtask is very less, the vector representations obtained for the text samples
of each subtask are grouped according to the classes/categories and the average of these
representations is obtained. This arrangement reduces the number of training samples in the
12https://huggingface.co/sentence-transformers/stsb-bert-base
subtask to the number of classes in that subtask. These new training samples which are the
representative of each class are used to train the LinearSVC model.</p>
        <p>To evaluate the model on the Test set, the samples in the Test set will be pre-processed
and represented as discussed in Sections 3.1 and 3.2. These vector representations are fed to
the LinearSVC model to predict the probabilities of the samples belonging to the classes in
the predefined set of classes in the subtask and assign the label of the class having highest
probability to the Test samples.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.4. Experiments and Results</title>
        <p>The statistics of the dataset for the subtasks shown in Table 1 indicates that the given datasets
are very small in size. If ML classifiers are used in a conventional way, this small size dataset
will pose challenges for achieving good performance and generalization on unseen data. This
justifies the need for using FSL for profiling Cryptocurrency Influencers.</p>
        <p>As the Development set is not provided by the organizers, several experiments were conducted
initially by splitting the given Train set into Train and Test set and considering diferent word
representations, ST and classifiers. The combination of word representation - Google’s
pretrained Word2Vec, ST - stsb-bert-base and classifier - LinearSVC, which exhibited the best
performance in the initial experiments are considered for the actual experiments to obtain
the probabilites and predictions on the Test set which in turn are submitted to the organizers
for evaluation. The predictions are evaluated based on the macro F1 score as it considers the
average F1 score across all classes, providing a comprehensive measure of model efectiveness.
Table 3 gives the performances of the proposed models for all the three subtasks. Among the
proposed models, FSL-Word2Vec model obtained better macro F1 scores of 46.66 and 50.42 for
Subtask2 and Subtask3 respectively whereas FSL-ST model obtained macro F1 score of 37.92 for
Subtask1. The very low macro F1 score for Subtask1 may be because the number of training
samples is only 160 which is very small to train any ML model. The performances of both the
models for Subtask3 are better compared to that of the other two subtasks. Further, there are
no much diferences in the performances of the two models in all the subtasks.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>This paper describes the FSL models proposed for "Profiling Cryptocurrency Influencers with
Few-shot Learning" shared task in PAN@CLEF 2023. The proposed methodology consists of two
models: i) FSL-Word2Vec - LinearSVC model trained with embeddings extracted from Google’s
pre-trained Word2Vec and ii) FSL-ST - LinearSVC model trained with sentence embeddings
obtained using stsb-bert-base. The performances of both the models for Subtask3 are better
compared to that of the other two subtasks. Further, there are no much diferences in the
performances of the two models in all the subtasks. Eficient FSL techniques will be explored
further to handle labeled data with few samples.
[8] Y. Joo, I. Hwang, Profiling on social media : An ensemble learning model using various
features notebook for pan at clef 2019, 2019.
[9] L. Tunstall, N. Reimers, U. E. S. Jo, L. Bates, D. Korat, M. Wasserblat, O. Pereg, Eficient</p>
      <p>Few-shot Learning without Prompts, in: arXiv preprint arXiv:2209.11055, 2022.
[10] M. Chinea-Rios, I. Borrego-Obrador, M. Franco-Salvador, F. Rangel, P. Rosso, Profiling
Cryptocurrency Influencers with Few shot Learning at PAN 2023, in: CLEF 2022 Labs and
Workshops, Notebook Papers, 2023.
[11] T. Mikolov, K. Chen, G. S. Corrado, J. Dean, Eficient estimation of word representations
in vector space, in: International Conference on Learning Representations, 2013.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sawhney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mittal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Nanda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chava</surname>
          </string-name>
          ,
          <article-title>Cryptocurrency bubble detection: A new stock market dataset, financial task &amp; hyperbolic models</article-title>
          ,
          <source>in: North American Chapter of the Association for Computational Linguistics</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>U. W.</given-names>
            <surname>Chohan</surname>
          </string-name>
          ,
          <article-title>Counter-hegemonic finance: The gamestop short squeeze</article-title>
          , in: Financial Crises eJournal,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Rios</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. L. D.</surname>
          </string-name>
          <article-title>la Pena Sarrac'en</article-title>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <article-title>Zero and few-shot learning for author profiling</article-title>
          , in: International Conference on Applications of Natural Language to Data Bases,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Kwok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Ni</surname>
          </string-name>
          ,
          <article-title>Generalizing from a few examples: A survey on few-shot learning</article-title>
          ,
          <source>in: ACM Comput. Surv.</source>
          , volume
          <volume>53</volume>
          ,
          <year>2021</year>
          , pp.
          <volume>63</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>63</lpage>
          :
          <fpage>34</fpage>
          . URL: https://doi.org/10.1145/3386252. doi:
          <volume>10</volume>
          .1145/3386252.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Parnami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Learning from few examples: A summary of approaches to few-shot learning</article-title>
          ,
          <source>in: ArXiv</source>
          , volume abs/2203.04291,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Borrego-Obrador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Ríos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Heini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kredens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pęzik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wolska</surname>
          </string-name>
          , , E. Zangerle, Overview of PAN 2023:
          <article-title>Authorship Verification, Multi-Author Writing Style Analysis, Profiling Cryptocurrency Influencers, and Trigger Detection</article-title>
          , in: A.
          <string-name>
            <surname>Arampatzis</surname>
            , E. Kanoulas,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Tsikrika</surname>
            ,
            <given-names>A. G.</given-names>
          </string-name>
          <string-name>
            <surname>Stefanos Vrochidis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Aliannejadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Vlachos</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Patel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Rasooli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Constant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Callison-Burch</surname>
          </string-name>
          ,
          <article-title>Bidirectional language models are also few-shot learners</article-title>
          ,
          <source>in: ArXiv</source>
          , volume abs/2209.14500,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>