<!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>
      <journal-title-group>
        <journal-title>CLEF</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Fake news spreader detection using neural tweet aggregation</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Antiplagiat</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia;</country>
          <institution>Moscow Institute of Physics and Technology (MIPT), Moscow, Russia Higher School of Economics, Moscow Institute of Physics and Technology</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Oleg Bakhteev</institution>
          ,
          <addr-line>Aleksandr Ogaltsov, and Petr Ostroukhov</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>22</volume>
      <fpage>22</fpage>
      <lpage>25</lpage>
      <abstract>
        <p>The paper describes the neural networks-based approach for Profiling Fake News Spreaders on Twitter task at PAN 2020. The problem is reduced to the binary classification with a set of tweets of the user as an object to classify and class labels corresponding to users that are likely to spread fake news and ordinary users. To deal with a set of tweets we employ two neural network architectures: either based on recurrent or convolutional neural networks. We try aggregate the whole information obtained from the tweets to decide whether the user can spread fake news or not. We also present an ensemble of models that consists of a neural network and a classification model that works on each tweet separately.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Author profiling task is focused on investigating different aspects of the author style.
This year the task considers the problem of fake news spreaders detection [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]: given a
set of tweets written by an author, one should decide whether the author keen to spread
fake news or not. The tweets are written in two languages: English and Spanish. The
training dataset contains 300 sets of tweets for each language with 150 sets for users
that are keen to spread fake news and 150 sets for ordinary users. The performance
metric for the task is an accuracy.
      </p>
      <p>
        The problem of detection fake news spreading in social media becomes more and
more important nowadays. There are plenty of works devoted to classification distinct
social media messages based on the fact they contain fake news or not. The methods
of fake news detection significantly vary from usage of classical linguistic features [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
to the usage of contemporary deep learning-based models [
        <xref ref-type="bibr" rid="ref4">13,4</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] the authors
propose an end-to-end deep learning-based approach to detect fakes using external
resources, such as news datasets, which can improve the performance of the existing
methods of fake news detection.
      </p>
      <p>
        Despite the significant amount of works devoted to the fake news detection, many
of them cannot be implemented for this task straightforwardly: the analysed object for
this task is not a unique text, but a collection of short texts. Therefore even if we have
any fake news in the tweet collection, we don’t know exactly, which tweet in collection
really contains fake. Moreover, we don’t have any guarantee that the set of tweets for
the target fake news spreader really contains any fake news: we only know the fact that
the author spreads them. Therefore the usage of external resources becomes less
important for this task. In this way the fake news spreader detection is similar to previous
author profiling task, such as gender profiling [12] or bot detection [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The key idea
for many approaches for such tasks is to aggregate information that contained in all the
texts written by the author. For such an aggregation we employ a neural network-based
approach. Inspired by idea described in [14] we consider two architectures based on
recurrent and convolutional neural networks. Both the architectures interpret the input
object as a set without any knowledge about tweet order. We also analyse the
performance of the ensemble of two models that work on different hierarchy levels of the
dataset, both on the corpus of tweets level and on the distinct tweet level with classifier
trained on the external corpus.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>The following section describes the proposed method of fake news spreader detection.
Formally we consider the problem as a classification problem, where the classified
object is a set of tweets. Given a labeled dataset D = (xi; yi):
xi = fxi1; : : : ; ximg;</p>
      <p>j
xi 2 W+;
j 2 f1; : : : ; mg;
yi 2 f0; 1g;
where W+ is a set of all possible strings written in the given language, yi = 1
corresponds to users that are likely to spread fake news, yi = 0 corresponds to ordinary user.
The task is to find the binary classifier, that minimizes an empirical risk on the dataset
D:
f = arg min
f2F</p>
      <p>X [f (xi) 6= yi];
xi;yi2D
where F is a set of all considered classification models.</p>
      <p>The following sections gives a brief overview of the used models.
2.1</p>
      <sec id="sec-2-1">
        <title>Recurrent network-based architecture</title>
        <p>The proposed architecture is illustrated in Figure 1. It consists of 3 main components:
1. Recurrent network fRNN that works with the word embeddings of the current tweet.
2. Weighting layer fWL, which determines the impact of each tweet in the final
decision.
3. The feedforward network with softmax layer fSM that makes a final decision on the
class of the tweet collection author.</p>
        <p>Once the recurrent network fRNN processed the tweet xij with hidden state hij we
employ the weighting layer in order to determine the weight of it in total sum:
wij = fRNN(hij ); wij 2 [0; 1]:
After that we sum all the hidden states with their weights normalized by softmax:
hi =
m
X w^i hi ;</p>
        <p>j j
j=1</p>
        <p>w^i = softmax(wi):
The final stage of the classification is done by the feedforward network fSM with a
softmax layer:
f (xi) = arg max fSM(hi)j ;
j2f0;1g
(1)
where fSM(hi)j represents the component j of the softmax output fSM(hi).</p>
        <p>We use GRU for the fRNN component and a one-layer neural network with sigmoid
activation as a weighting layer fWL.</p>
        <p>ui = fCNN(Midxk)
f (xi) = arg max fSM(ui);</p>
        <p>j2f0;1g</p>
        <p>The intuition behind such conversion on the one hand is to make representation
independent of tweets order in collection xi and on the other hand to construct abstract
representation of topics and sentiments of the collection. We apply common filters and
pooling with fully-connected network with one hidden layer on the top to predict final
class label. The scheme of this aggregation method is on Figure 2.
where d is an embedding size and k is number of most frequent words to take. Than we
get vector of high-level features from filters:
(2)
(3)
In order to analyse the tweet collection on both the hierarchical levels, either on the
whole tweet set level or on the distinct tweet level, we employ an ensemble of two
models: neural network for aggregation of total information about the author and a
pertweet classification model. For the per-tweet model we train a classification model fLR
on the dataset from [15]. This is a binary classification dataset, where objects are tweets
about events from 2016, and labels are the indicators of whether particular tweet is
rumour or not. The percentage of rumour tweets in this collection is about 37%.</p>
        <p>As a classification model we use a l2-regularized logistic regression model with
TF-IDF representation as tweet features.</p>
        <p>As a final decision rule we use the following formula:
f (xi) =
8&gt;0; if minfxij2xig fLR(xij )
&lt; j</p>
        <p>1; if min fxi 2 xigfLR(xij )
&gt;:fNN (xi) otherwise.;
0;
1;
where fLR is a probability of the rumour prediction for the logistic regression model,
fNN is either CNN or RNN described in (1), (2), 0; 1 are the hyperparameters tuned
on the validation set. The described scheme gives us an opportunity to use some
tweetlevel information straightforwardly without neural networks for the two cases:
1. if all the tweets of the user seem to be very usual and not suspicious;
2. if any of the tweets is likely to be fake or rumour with high probability and we don’t
need to use neural network for the tweet collection.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiment Details</title>
      <sec id="sec-3-1">
        <title>Preliminary dataset analysis</title>
        <p>
          For the preliminary dataset analysis we vectorized all the tweets from English part of
dataset using Universal Sentence Encoder [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. We clusterized them using DBSCAN [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]
from scikit-learn package [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. The visualization of T-SNE projection [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] of the
clusterization results is represented in Figure 3. Despite the fact the cluster structure is not
rather clear, we can see that the clusters of messages with high amount of users that are
likely to spread fake news are concentrated on the right part of the projection. Although
we do not have any ground truth for the distinct tweets, we believe that clusters with
high amount of messages from the users that are likely to spread fake news contain our
point of interest. A brief analysis of these messages showed that the most part of them
is devoted to the three topics:
1. news about politics;
2. news about pop-starts and actors;
3. news about sport.
        </p>
        <p>A significant part of such messages also mention different celebrities famous in one of
these areas. We tried to use this information in the following experiments.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Experiment results</title>
        <p>In order to validate our models we conducted a computational experiment. As a
preprocessing step we lowercased tweets and removed stop-words and punctuation. We did
not use any special preprocessing.</p>
        <p>
          For the word embeddings we used fastText [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] trained on Common Crawl and
Wikipedia with dimension set to 100. For the hyperparameters tuning we used 5-fold
validation both for the neural networks (1),(2) and the tweet classification model fLR.
We tuned the following hyperparameters:
1. number of layers and hidden dimension for the RNN model;
2. number of top-k most frequent words, number of filters and padding size for the
        </p>
        <p>CNN model;
3. learning rate, l2 and dropout rate;
4. 0 and 1 for the model ensemble (3).</p>
        <p>Based on the preliminary analysis from subsection 3.1 we also considered the
proposed models with an addition indicator: whether the token corresponds to the celebrity
or not. The celebrity list was mined from the web-resources devoted to the political,
sports, music and cinema news.</p>
        <p>
          The model evaluation was done using TIRA environment [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The results of our
model performance for the cross-validation is shown in Table 1. As we can see, the
RNN-based architecture gives a slightly better performance than CNN-based
architecture. The usage of ensemble also allowed us to slightly increase the resulting accuracy.
An additional feature for the celebrity in tokens did not give us any improvement and
lowered the predictional performance.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Language CNN RNN</title>
        <p>English
Spanish
0:74
0:77
0:05 0:76
0:06 0:78</p>
      </sec>
      <sec id="sec-3-4">
        <title>CNN with RNN with CNN with RNN with celebrity celebrity ensemble ensemble indicator indicator</title>
        <p>0:05 0:7 0:05 0:7 0:05 0:75 0:05 0:77 0:05
0:05 0:74 0:06 0:75 0:04 — —</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>The paper describes the neural networks-based approach for Fake news spreaders
detecion task. We proposed two neural network architectures based on RNN and CNN. The
resulting performance gave us an accuracy about 77% for the English dataset and 78%
for the Spanish dataset. We believe that the proposed approach can be considered as one
of the baselines for the further problem development. The future work include a detailed
analysis of the dataset and more advanced usage of external resources, such as list of
celebrities mentioned in tweets or external datasets of fake news in tweet messages.
12. Rangel, F., Rosso, P., Potthast, M., Stein, B.: Overview of the 5th author profiling task at
pan 2017: Gender and language variety identification in twitter. Working notes papers of the
CLEF pp. 1613–0073 (2017)
13. Wang, Y., Ma, F., Jin, Z., Yuan, Y., Xun, G., Jha, K., Su, L., Gao, J.: Eann: Event adversarial
neural networks for multi-modal fake news detection. In: Proceedings of the 24th acm
sigkdd international conference on knowledge discovery &amp; data mining. pp. 849–857
(2018)
14. Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R.R., Smola, A.J.:</p>
      <p>Deep sets. In: Advances in neural information processing systems. pp. 3391–3401 (2017)
15. Zubiaga, A., Hoi, G.W.S., Liakata, M., Procter, R.: Pheme dataset of rumours and
non-rumours (2016). https://doi.org/10.6084/M9.FIGSHARE.4010619,
https://figshare.com/articles/PHEME_dataset_of_rumours_and_non-rumours/4010619</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>5</volume>
          ,
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Cer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kong</surname>
          </string-name>
          , S.y.,
          <string-name>
            <surname>Hua</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Limtiaco</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>John</surname>
          </string-name>
          , R.S.,
          <string-name>
            <surname>Constant</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guajardo-Cespedes</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tar</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , et al.:
          <article-title>Universal sentence encoder for english</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          . pp.
          <fpage>169</fpage>
          -
          <lpage>174</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ester</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kriegel</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sander</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          , et al.:
          <article-title>A density-based algorithm for discovering clusters in large spatial databases with noise</article-title>
          .
          <source>In: Kdd</source>
          . vol.
          <volume>96</volume>
          , pp.
          <fpage>226</fpage>
          -
          <lpage>231</lpage>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petrak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bontcheva</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maynard</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Team bertha von suttner at semeval-2019 task 4: Hyperpartisan news detection using elmo sentence representation convolutional network</article-title>
          .
          <source>In: Proceedings of the 13th International Workshop on Semantic Evaluation</source>
          . pp.
          <fpage>840</fpage>
          -
          <lpage>844</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Maaten</surname>
          </string-name>
          , L.v.d.,
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.:
          <article-title>Visualizing data using t-sne</article-title>
          .
          <source>Journal of machine learning research 9(Nov)</source>
          ,
          <fpage>2579</fpage>
          -
          <lpage>2605</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Pedregosa</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varoquaux</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gramfort</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michel</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thirion</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grisel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blondel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prettenhofer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiss</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubourg</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanderplas</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cournapeau</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brucher</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perrot</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duchesnay</surname>
          </string-name>
          , E.:
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          ,
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Pérez-Rosas</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kleinberg</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lefevre</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mihalcea</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Automatic detection of fake news</article-title>
          .
          <source>In: Proceedings of the 27th International Conference on Computational Linguistics</source>
          . pp.
          <fpage>3391</fpage>
          -
          <lpage>3401</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Popat</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yates</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>Declare: Debunking fake news and false claims using evidence-aware deep learning</article-title>
          .
          <source>In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <fpage>22</fpage>
          -
          <lpage>32</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiegmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>TIRA Integrated Research Architecture</article-title>
          . In: Ferro,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <surname>C</surname>
          </string-name>
          . (eds.)
          <article-title>Information Retrieval Evaluation in a Changing World</article-title>
          . Springer (Sep
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giachanou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghanem</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of the 8th Author Profiling Task at PAN 2020: Profiling Fake News Spreaders on Twitter</article-title>
          . In: Cappellato,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Eickhoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Névéol</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers</article-title>
          .
          <source>CEUR Workshop Proceedings (Sep</source>
          <year>2020</year>
          ),
          <article-title>CEUR-WS</article-title>
          .org
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Overview of the 7th author profiling task at pan 2019: Bots and gender profiling in twitter</article-title>
          .
          <source>In: Proceedings of the CEUR Workshop</source>
          , Lugano, Switzerland. pp.
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>