<!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>GPT3RecBot: a universal chatbot recom mender of movies, books and music in Telegram</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oleg Lashinin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kirill Bykov</string-name>
          <email>kvbykov@edu.hse.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marina Ananyeva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergey Kolesnikov</string-name>
          <email>s.s.kolesnikov@tinkoff.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>However, recent advances in Large Language Models</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>Myasnitskaya Ulitsa, 20, Moscow, Russia, 101000</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Tinkof</institution>
          ,
          <addr-line>2-Ya Khutorskaya Ulitsa, 38A, bld. 26, Moscow, Russia, 127287</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recent advances in large language models have extended their potential use cases to diferent domains. Models such as ChatGPT have an extensive internal knowledge base that enables them to provide answers to various domain-specific queries. In this paper, we explore the potential use of OpenAI's GPT3.5 model as a conversational recommender system. We designed a user-friendly chatbot capable of recommending items in three domains: books, movies, and music. Our study involved collecting explicit feedback from 517 users, and we report the results obtained. The average usefulness of our bot is 4.15 / 5. Our experimental results demonstrate the efectiveness of GPT3.5 as a personalised recommendation system. We hope that our work will inspire further research in this area. Our chatbot is available on the popular messaging platform Telegram ∗Corresponding author.</p>
      </abstract>
      <kwd-group>
        <kwd>mendations</kwd>
        <kwd>It allows to collect users' interests</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>recommender systems, large language models, user study
Although this is an incredible improvement over non- such as GPT3.5 can provide good recommendations to
tent on almost every topic. Since people are usually in- some heuristics or complicated architectures [5, 6], but</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <sec id="sec-2-1">
        <title>The use of social platforms continues to grow today [1].</title>
      </sec>
      <sec id="sec-2-2">
        <title>Platforms like Twitter [2], YouTube [3] have a lot of con</title>
        <p>terested in a limited number of topics, recommender
systems play an important role in generating personalised
interfaces. They try to understand the user’s interests
and intentions and select suitable items to be displayed
at the top.</p>
        <p>
          There are many types of recommender systems. Some
models work for registered users, using the user’s past
interactions to predict the user’s next actions. Other
methods, such as session-based recommenders, work even
when the user is not authenticated. Such systems
analyse the actions in the current session and try to predict
the actions in the next session. Currently,
state-of-theart next-item recommender systems such as BERT4Rec
correctly guess the next item 10%-30% of the time [
          <xref ref-type="bibr" rid="ref17">4</xref>
          ].
personalised methods, we are still a long way from more
accurate prediction in such experimental setups.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>There are many reasons for this, but one is that models deal with implicit feedback and try to understand the user’s intentions implicitly. Fortunately, conversational</title>
        <p>nEvelop-O
report the results. Our experiments demonstrate
1https://openai.com/blog/chatgpt</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2. Related Work</title>
      <p>the efectiveness of GPT3.5 as a personalised rec- phone) and service (travel). The authors found some
ommendation system. limitations, such as the use of outdated data, the
gen• We integrated our GPT3RecBot chatbot into Tele- eration of false and misleading text, and ignorance of
garm, one of the most popular messengers in the some facts. The researchers concluded that this model
world. has great potential for supporting recommendation tasks.</p>
      <p>In contrast to this article, we conduct a user study that
allows the calculation of qualitative metrics. In [27] the
authors use ChatGPT for personalised recommendations
via chat. They provide a case study for cross-domain
and cold-start recommendations. In addition, this paper
includes ofline experiments on MovieLens-100k where
the proposed ChatRec outperforms a state-of-the-art
conventional recommender LightGCN. Another paper [28] is
less related to our research, but still suggests using
Chat</p>
      <sec id="sec-3-1">
        <title>GPT for bibliometricians to build recommender systems that suggest relevant articles.</title>
      </sec>
      <sec id="sec-3-2">
        <title>To the best of our knowledge, we have not found any</title>
        <p>papers that present the results of a user study on the
quality of ChatGPT’s personalised recommendations. We
hope that our findings will inspire new research
directions in this area.</p>
        <p>Conversational Recommenders. The authors of the
survey [11] presented a typical conversational
recommender system (CRS) architecture, which includes five
components dedicated to diferent purposes. Due to their
complexity, CRSs face many challenges [12], such as
question-based user preference elicitation and dialogue
understanding and generation. The authors of [6]
distinguish between diferent types of utterances in CRSs. One
of the simplest approaches is ”System is Active, User is</p>
      </sec>
      <sec id="sec-3-3">
        <title>Passive” (SAUP), where a bot asks direct questions and</title>
        <p>users respond. We choose this approach as a first step in
using ChatGPT for recommender systems, and leave the
other types of utterances as future work.</p>
        <p>
          Approaches that follow the SAUR paradigm consist of
several complicated components. Paper [
          <xref ref-type="bibr" rid="ref30">13</xref>
          ] presents a 3. GPT3RecBot
multi-memory network with query, question and search
modules. The more recent CPR approach [14] models In this section, we describe our GPT3RecBot in terms of
conversational recommendation as an interactive path dialogue scheme and implementation for end users. We
reasoning problem on a graph. In another work, [15], have implemented a chatbot in Telegram3 that allows
researchers generate appropriate questions and recom- users to ask for recommendations on diferent types of
mendations taking into account online feedback from content (music, movies and books). Our bot prompts
users. In general, most of the currently developed CRSs them to rate the bot based on three distinct metrics,
are based on complex components and are only trained namely Reality, Usefulness, and Recommendation
Qualfor a specific domain. In addition, most of the work is ity, using a scale from 1 to 5. The Telegram bot is available
evaluated using ofline experiments. Some authors have to the public4.
conducted user studies on music [16, 17] and book [18]
recommendations. As CRSs are interactive services, it 3.1. Dialogue scheme
seems important to conduct user studies [7].
        </p>
        <p>ChatGPT. Thanks to the rapid development of large- The chat flow applied to all users in GPT3RecBot is shown
scale language models [19], the quality of dialogue un- in Figure 1. We have implemented a SUAP paradigm
derstanding has improved. ChatGPT is a good example. where only GPT3RecBot asks questions and the user
It has attracted the attention of researchers from physics answers. During the interaction process between the
[20], mathematics [21], computational biology [22], etc. user and our application, we have several steps. The first
Researchers have adopted ChatGPT for various fields of step is initialisation, where the bot randomly assigns the
machine learning such as natural language processing user to one of three test groups. These groups allow us to
[23], stock market prediction [24], binary classification test three diferent prompts for GPT3.5 in the user study.
[25] etc. ChatGPT was published on 30 Nov 2022, and the After initialisation, we are ready to communicate with
number of papers on Google Scholar related to ChatGPT the user and ask them to select the type of content. We do
is about 10000 as of 9 May 2023. Therefore, it is dificult not ask for specific types of content and the users choose
to describe all the cases, but it is definitely a topic that is for themselves. The next step is to ask explicitly about the
intensively studied by the research community. user’s interests. This helps ChatGPT to understand the</p>
        <p>The possible application of ChatGPT to recommender user’s preferences. The next question is asked to users
systems has not yet been well studied, due to the short in the second and third test groups. This is the question
time since publication. A very recent paper [26] provided
a case study of ChatGPT recommendations in three typ- 2BPMN - Business Process Model and Notation diagram
ical domains: entertainment (music), high cost (smart- 3https://telegram.org/</p>
      </sec>
      <sec id="sec-3-4">
        <title>4https://t.me/GPT3Recbot</title>
        <p>about the content the user does not like. We expect the
model to use this information to further restrict the types
of content genres that are recommended.</p>
        <p>After the questions have been asked, the prompt
generation phase begins, whereby ChatGPT is supplied with
generated prompts. During this phase, a unique prompt
is generated for the bot, making it specific for each test
group  , by filling in pre-existing templates with user
responses. We keep three diferent prompt templates, and
each subsequent group’s prompt extends the previous
one. The example is shown in Figure 2. After generating
the prompt, we send it to gpt-3.5-turbo (training data
until September 2021) using the OpenAI API, which
provides us with a convenient interface to use the power of</p>
      </sec>
      <sec id="sec-3-5">
        <title>ChatGPT in our application. After a waiting period, the</title>
        <p>answer is sent back to the user.</p>
        <p>We then ask the user to rate the reality of the
recommendation, which measures how realistic the
recommended items and descriptions seemed to the user. The
next question is about relevance to the user, which is
a measure of how well the model matches the user’s
preferences. The last is usefulness, where we measure
whether GPT3RecBot can help users in their daily lives.</p>
      </sec>
      <sec id="sec-3-6">
        <title>In addition, users can send us an open-ended feedback</title>
        <p>attendees. If we reach this limit before the conference, we
will provide an opportunity to try it via another OpenAI
account belonging to another author of this paper. In
case of force majeure, anyone can run our GPT3RecBot
as soon as we release an implementation code under the
MIT licence5.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. User study design</title>
      <sec id="sec-4-1">
        <title>Statement on ethics. Our respondents shared their</title>
        <p>interests without providing any personal information.
form. As this was done through a crowdsourcing platform,
participants knew that their ratings would be used for
3.2. Implementation anonymised aggregation. We informed them that this
information would only be used for research purposes. The
The architecture described in this section is typical of Research Ethics Committee (REC) of the HSE university
messaging bots. It’s shown in Figure 3. We have a simple approved this study.
client-server application, where the client is Telegram Description. We conducted a user study to evaluate
and the server is our own application. Let us describe the potential of GPT3RecBot. As GPT3RecBot is a
chatthe communication flow between the main components bot that recommends items on request, real users were
we have in the whole system. involved in the experiments. We used a crowdsourcing</p>
        <p>A user starts the bot and sends a start command using platform to get high quality feedback on the bot. All
the Telegram client when he decides to try our applica- crowdworkers were asked to read the questions carefully
tion and participate in the experiment. The Telegram and share their thoughts on the quality of the
recomclient sends calls to our server application via the Tele- mendations and the formatting of the recommendations.
gram API. This process continues until there are no more We asked students from an HSE university to test our
requests for messages. The main application, the core chatbot. It is important to note that respondents chose
of the server, stores all conversations and talks to Ope- the type of content they wanted to be recommended. For
nAI to get recommendations via ChatGPT based on the example, some people don’t like to read books, but they
user’s specific requests when it’s time. All responses, are music fans, so they are likely to be interested in music
messages and technical information (logs) are stored in recommendations. We believe that a set of music, book
the database, which is based on SQLite [29], a relational and movie recommendations can cover the interests of
database popular for small projects. The reason for choos- the majority of people. However, in future research, we
ing this database is that it can handle the full load of the aim to expand the applicability of our methodology to
system. It is convenient for research purposes to down- encompass a wider range of domains.
load the database from the server and monitor the exper- To gain some insight into prompt engineering for
GPTiment online, as this database stores all the information based recommendation models, we randomly divided the
in a single file. At the end of the full run, we ask the user users into three groups, with each user being assigned
if they want to try again. This creates a loop and allows to a group for the duration of the study. The first group
the user to do a few iterations. was only asked about their preferences in one selected</p>
        <p>Implementing a bot in Telegram for messaging with domain. In the second group, the users had to indicate
users is free. The messenger has reached 550 million the items they did not like. This information could
theomonthly active users in 2022 [30] and it is quite easy retically help the model to filter recommendations and
to register new users. Use of the OpenAI API is paid. avoid suggesting obviously irrelevant content.
AccordHowever, OpenAI grants $18 for new accounts. The price ing to recent research [26], ChatGPT are said to be good
is $0.002 / 1K tokens actual on 9 May 2023. The average explainers. In preliminary experiments, we found that
length of our requests is about 100 tokens, according to GPT3.5 could explain its recommendations to users, even
the user study. This means that we can get about 5000 linking items to their interests. So we added a third group
responses from GPT3.5 for free and continue to get them in which GPT3.5 was instructed to explain its
recommenfor $0.0002 / response. dations. We assumed that explaining recommendations</p>
        <p>We will maintain this bot until it reaches the limit could improve the user experience, based on the results
for free responses. At the time of submission, we have of other studies [31, 32].
about 4500 responses available to the OpenAI API, which
seems suficient to demonstrate the bot to conference</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <sec id="sec-5-1">
        <title>GPT. Films have descriptions that are much shorter than</title>
        <p>book texts. The worst performance is for music
recom517 people completed our task and left feedback. They mendations. When analysing free-form questions, we
gave explicit feedback on three diferent metrics, such were able to catch fake music titles generated by
Chatas the reality of the suggestions, the relevance of the GPT. It may try to synthesise additional information if it
recommended items and the usefulness of GPT3RecBot. is not available in suficient quantity in the training data.
Note that we do not count users who did not give explicit If we analyse the results within groups, we can see
feedback. The summarised results are listed in Table 1. that GPT3.5 significantly improves its recommendations
There are a few things to note. when it is aware of negative user experiences, which</p>
        <p>Firstly, people chose films more often than books and may help to filter recommendations. Asking GPT3.5 to
music combined. We shufled the domain selection but- explain its recommendations improved the results for
mutons during the experiments, so this bias is not introduced sic and film recommendations, which may have helped
by the GPT3RecBot interface. It is presumed that among to convince users of the appropriateness of the
recomthe users who participated in our system’s testing, films mendations generated.
watching is a more prevalent hobby compared to books To test the hypothesis that GPT only recommends a
or music. The other suggestion is that people are most limited number of content titles, we measured content
dilikely to want to try out movie recommendations, as they versity, which is the proportion of unique recommended
have experienced with movie recommendation engines content to the total number of content titles [34]. We
in the past. We leave the investigation of this efect to can clearly see in Table 1 that ChatGPT is able to provide
future work. users with content that is diferent and new to them. In</p>
        <p>Secondly, it is clear that there is a diference in user rat- Figure 4 we show 5 of the most popular recommended
ings depending on the type of content. GPT3.5 may have movies and books. The model recommended Nineteen
a diferent knowledge capacity for diferent types of con- Eighty-Four6 16% of the time. Other items were
recomtent. The best results were obtained when recommending mended less than 4% of the time. The top recommended
books, which received the highest ratings in all questions items appear to be popular and this may be due to
popuasked. The reason for this may be that ChatGPT has larity bias [35].
more knowledge about text-based content and is able to For the open-ended question, we had to come up with
process this type of content. This is followed by films,
where it also performed well. The poorer performance 6Nineteen Eighty-Four is a dystopian social science fiction novel and
may also be explained by the information available for cautionary tale by George Orwell.</p>
        <sec id="sec-5-1-1">
          <title>This form is convenient, interesting to use and</title>
          <p>provides a good selection of books for the future.
It would be great if it also described the genre. The
first three recommendations were to the author’s
liking, but they chose the wrong genre. The bot
makes good recommendations, but most of the
choices are those that have already been read. It is
useful as a handy assistant. The recommendation
of a collection of poems is based on preference,
but not on the theme of war</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>The bot correctly identified genres and recom</title>
          <p>mended films, but it would be nice to be able to
select films released by year and add additional
criteria to get a more satisfactory recommendation.</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>It would be ideal to link a conditional account</title>
          <p>from IMDB to the bot. The AI should be more
selective and understand general preferences to
make recommendations for films, not just
popular world films, but also lesser known good films.</p>
        </sec>
        <sec id="sec-5-1-4">
          <title>The bot should be able to recognise genres and</title>
          <p>make a recommendation based on the person’s
interests
The idea of the bot is interesting, but the
description of the recommended compositions is
imprecise. The format and quality are good, but the
recommendations need to be refined with
interest filters. This service is useful for discovering
new music and new artists, but it does not match
the user’s interests.</p>
        </sec>
        <sec id="sec-5-1-5">
          <title>Positive</title>
          <p>The narrator is looking for more thrillers and
detective stories. They have a good selection of
recommendations, 4/5 of which are known and
read. They like the format of the
recommendations, which is simple and clear. They hope that
the next recommendation will be more
interesting.</p>
        </sec>
        <sec id="sec-5-1-6">
          <title>The selection, the prompt and quick response, the</title>
          <p>clear way of providing information, the clarity
and format to meet the needs were all
appreciated. The service was good and the bot made
good recommendations for each genre, making it
convenient and easy to register.</p>
          <p>The most important details are that a bot can
be used to select music to listen to, and that the
recommendations are of high quality and match
preferred genres. The service is convenient and
eficient, and the recommendations are of high
quality and in preferred genres.
a special method to process such a large amount of
feedback. First, we split all the feedback into domains and
then used the Distilbert model7 for sentiment analysis
[36] and selected only those reviews where the model
was at least 70% sure about the sentiment of the
feedback. We then combined the feedback into a single text
and used the Quillbot8 to summarise it. The results are
shown in Table 2. The responses in the negative and
positive reviews seem a little contradictory. Users who
left negative feedback point out that GPT3RecBot does
not correctly guess the user’s intersets. However, users
who left positive feedback wrote the opposite opinion.</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>It is important to note that our bot received 82% posi</title>
        <p>tive feedback and 18% negative feedback according to</p>
      </sec>
      <sec id="sec-5-3">
        <title>Distillbert’s classification.</title>
      </sec>
      <sec id="sec-5-4">
        <title>7distilbert-base-uncased-finetuned-sst-2-english available at hug</title>
        <p>gingface.co, revision af0f99b</p>
      </sec>
      <sec id="sec-5-5">
        <title>8https://quillbot.com/summarize</title>
        <p>Nineteen Eighty-Four</p>
        <p>The Little Prince
To Kill a Mockingbird</p>
        <p>Three Comrades
One Hundred Years of Solitude
2
3
3
4
Interstellar
3.6
A Beautiful Mind</p>
        <p>La La Land</p>
        <p>Shutter Island
Game of Thrones</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion References</title>
      <p>In this paper, we present GPT3RecBot, which can
personally recommend movies, books or music. This bot is
available to Telegram users for research purposes, and
each user has 10 free requests. We share a chat flow,
implementation code, and a prompt used to facilitate future
research. Our paper is the first to present the results of a
user study on the recommendation quality of ChatGPT.
517 users participated in the study and gave an average
rating of 4.01 / 5 for reality of recommended content, 3.86
/ 5 for relevance and 4.15 / 5 for usefulness of GPT3RecBot.
We hope that such high ratings will increase the interest
of the research community in future work.
timent analysis: A survey, Wiley Interdisciplinary</p>
      <sec id="sec-6-1">
        <title>Reviews: Data Mining and Knowledge Discovery 8</title>
        <p>(2018) e1253.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>mender systems: A survey</article-title>
          ,
          <source>AI</source>
          Open 2
          <article-title>(</article-title>
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          100-
          <fpage>126</fpage>
          . [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Y. Zhang, Tutorial on con-
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>ings of the 14th ACM Conference on Recommender</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Systems</surname>
          </string-name>
          ,
          <year>2020</year>
          , pp.
          <fpage>751</fpage>
          -
          <lpage>753</lpage>
          . [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Manzoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          , Conversational recom-
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <source>are we?</source>
          ,
          <source>Computers in Human Behavior Reports 4</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          (
          <year>2021</year>
          )
          <fpage>100139</fpage>
          . [8]
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>arXiv:2303.18223</source>
          (
          <year>2023</year>
          ). [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. D.</surname>
          </string-name>
          Ka-
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>try</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <source>Language models are few-shot</source>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ortiz-Ospina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Roser</surname>
          </string-name>
          ,
          <article-title>The rise of social media, learners</article-title>
          ,
          <source>Advances in neural information process-</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>Our world in data (</article-title>
          <year>2023</year>
          ).
          <source>ing systems 33</source>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . [2]
          <string-name>
            <given-names>V. W.</given-names>
            <surname>Anelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kalloori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ferwerda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Belli</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Te- [10]
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nagato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nakao</surname>
          </string-name>
          , A. Liu, Oppor-
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>lain</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hunt</surname>
          </string-name>
          , et al.,
          <article-title>Recsys 2021 challenge edge management</article-title>
          ,
          <source>arXiv preprint arXiv:2304.02796</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>workshop:</surname>
          </string-name>
          Fairness-aware engagement prediction (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <article-title>at scale on twitter's home timeline</article-title>
          , in: Proceed- [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Jannach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Manzoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          , A survey
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <source>ings of the 15th ACM Conference on Recommender on conversational recommender systems</source>
          , ACM
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Systems</surname>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <fpage>819</fpage>
          -
          <lpage>824</lpage>
          . Computing Surveys (CSUR)
          <volume>54</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          . [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Covington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Adams</surname>
          </string-name>
          , E. Sargin, Deep neural net- [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. de Rijke</surname>
          </string-name>
          , T.-S. Chua,
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <article-title>ings of the 10th ACM conference on recommender recommender systems: A survey</article-title>
          ,
          <source>AI</source>
          Open 2
          <article-title>(</article-title>
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>systems</surname>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>198</lpage>
          .
          <fpage>100</fpage>
          -
          <lpage>126</lpage>
          . URL: https://www.sciencedirect.com/ [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          , P. Jiang, science/article/pii/S2666651021000164. doi:https:
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <article-title>Bert4rec: Sequential recommendation with bidirec- //doi</article-title>
          .org/10.1016/j.aiopen.
          <year>2021</year>
          .
          <volume>06</volume>
          .002.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <article-title>tional encoder representations from transformer</article-title>
          , in: [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          , To-
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <article-title>Proceedings of the 28th ACM international confer- wards conversational search</article-title>
          and recommendation:
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <year>2019</year>
          , pp.
          <fpage>1441</fpage>
          -
          <lpage>1450</lpage>
          . 27th acm international conference on information [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. de Rijke</surname>
          </string-name>
          , T.-S. Chua, Ad- and
          <source>knowledge management</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>177</fpage>
          -
          <lpage>186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          vances and challenges in conversational recom- [14]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Miao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <source>in: Proceedings of the 26th ACM SIGKDD In- of chatgpt/gpt-4 in computational biology</source>
          , arXiv
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <source>ternational Conference on Knowledge Discovery preprint arXiv:2303.16429</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <article-title>&amp;amp; Data Mining</article-title>
          , KDD '20,
          <string-name>
            <surname>Association for</surname>
            Com- [23]
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Qin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , J. Chen, M. Yasunaga,
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <surname>puting Machinery</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          , p.
          <string-name>
            <given-names>D.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Is chatgpt a general-purpose natural</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          2073-
          <fpage>2083</fpage>
          . URL: https://doi.org/10.1145/3394486. language processing task solver?, arXiv preprint
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          3403258. doi:
          <volume>10</volume>
          .1145/3394486.3403258. arXiv:
          <volume>2302</volume>
          .06476 (
          <year>2023</year>
          ). [15]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Miao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hong</surname>
          </string-name>
          , M.-Y. [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopez-Lira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tang</surname>
          </string-name>
          , Can chatgpt forecast stock
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <article-title>wards deep interaction between conversational language models</article-title>
          ,
          <source>arXiv preprint arXiv:2304.07619</source>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <article-title>and recommender systems</article-title>
          , in: Proceedings of (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <source>the 13th International Conference on Web Search</source>
          [25]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          ,
          <article-title>Chatgpt as a factual</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <string-name>
            <given-names>and Data</given-names>
            <surname>Mining</surname>
          </string-name>
          , WSDM '20,
          <article-title>Association for inconsistency evaluator for abstractive text summa-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <given-names>Computing</given-names>
            <surname>Machinery</surname>
          </string-name>
          , New York, NY, USA,
          <year>2020</year>
          , rization,
          <source>arXiv preprint arXiv:2303.15621</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          p.
          <fpage>304</fpage>
          -
          <lpage>312</lpage>
          . URL: https://doi.org/10.1145/3336191. [26]
          <string-name>
            <surname>X. ZHAO</surname>
          </string-name>
          ,
          <article-title>Using chatgpt as a recommender system:</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          3371769. doi:
          <volume>10</volume>
          .1145/3336191.3371769.
          <article-title>A case study of multiple product domains xianglin</article-title>
          [16]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. N.</given-names>
            <surname>Htun</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Ver- zhao li chen yucheng jin about 7 min chatgpt rec-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          <article-title>sic recommenders with conversational interac-</article-title>
          [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          tion,
          <source>in: Proceedings of the 28th ACM Inter- J</source>
          . Zhang, Chat-rec:
          <article-title>Towards interactive and ex-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          <string-name>
            <surname>edge</surname>
            <given-names>Management</given-names>
          </string-name>
          ,
          <source>CIKM '19</source>
          ,
          <string-name>
            <surname>Association for</surname>
          </string-name>
          Com- arXiv
          <source>preprint arXiv:2303.14524</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          <string-name>
            <surname>puting Machinery</surname>
          </string-name>
          , New York, NY, USA,
          <year>2019</year>
          , [28]
          <string-name>
            <given-names>D. K.</given-names>
            <surname>Kirtania</surname>
          </string-name>
          ,
          <article-title>Chatgpt as a tool for bibliometrics</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          p.
          <fpage>951</fpage>
          -
          <lpage>960</lpage>
          . URL: https://doi.org/10.1145/3357384. analysis:
          <article-title>Interview with chatgpt</article-title>
          , Available at SSRN
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          3357923. doi:
          <volume>10</volume>
          .1145/3357384.3357923. 4391794 (
          <year>2023</year>
          ). [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jin</surname>
          </string-name>
          , L. Chen, Impacts of personal char- [29]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kreibich</surname>
          </string-name>
          , Using SQLite,
          <string-name>
            <surname>” O'Reilly Media</surname>
          </string-name>
          , Inc.”,
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          <article-title>acteristics on user trust in conversational recom- 2010.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          <article-title>mender systems</article-title>
          ,
          <source>in: Proceedings of the</source>
          <year>2022</year>
          [30]
          <string-name>
            <surname>T. von Arx</surname>
          </string-name>
          , K. G. Paterson, On the cryptographic
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          <source>ing Systems</source>
          , CHI '22,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing ePrint Archive (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          <string-name>
            <surname>Machinery</surname>
          </string-name>
          , New York, NY, USA,
          <year>2022</year>
          . URL: https: [31]
          <string-name>
            <given-names>K.</given-names>
            <surname>Damak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Nasraoui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. S.</given-names>
            <surname>Sanders</surname>
          </string-name>
          , Sequence-
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          //doi.org/10.1145/3491102.3517471. doi:
          <volume>10</volume>
          .
          <article-title>1145/ based explainable hybrid song recommendation,</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          3491102.3517471.
          <article-title>Frontiers in big Data 4 (</article-title>
          <year>2021</year>
          )
          <fpage>693494</fpage>
          . [18]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghazimatin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pramanik</surname>
          </string-name>
          , R. Saha Roy, [32]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kan</surname>
          </string-name>
          , J. Ma,
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          <article-title>on explanations to improve recommender models, ishnan</article-title>
          , Y. Zhang, Ex3: Explainable attribute-
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          <source>in: Proceedings of the Web Conference</source>
          <year>2021</year>
          ,
          <year>2021</year>
          ,
          <article-title>aware item-set recommendations</article-title>
          , in: Proceed-
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          pp.
          <fpage>3850</fpage>
          -
          <lpage>3860</lpage>
          . ings of the 15th ACM Conference on Recom[19]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Almeida</surname>
          </string-name>
          , C. Wain- mender
          <string-name>
            <surname>Systems</surname>
          </string-name>
          , RecSys '21,
          <string-name>
            <surname>Association for</surname>
          </string-name>
          Com-
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          <string-name>
            <surname>wright</surname>
            , P. Mishkin,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , S. Agarwal, K. Slama, puting Machinery, New York, NY, USA,
          <year>2021</year>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Ray</surname>
          </string-name>
          , et al.,
          <source>Training</source>
          language models to follow p.
          <fpage>484</fpage>
          -
          <lpage>494</lpage>
          . URL: https://doi.org/10.1145/3460231.
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          <article-title>instructions with human feedback</article-title>
          ,
          <source>Advances in 3474240. doi:10.1145/3460231</source>
          .3474240.
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          <source>Neural Information Processing Systems</source>
          <volume>35</volume>
          (
          <year>2022</year>
          ) [33]
          <string-name>
            <given-names>H.</given-names>
            <surname>Abdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. J.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <article-title>Tukey's honestly signifi-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          27730-
          <fpage>27744</fpage>
          .
          <article-title>cant diference (hsd) test</article-title>
          , Encyclopedia of research [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Holmes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          , T. T. Sio, design
          <volume>3</volume>
          (
          <year>2010</year>
          )
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          <string-name>
            <surname>L. A. McGee</surname>
            ,
            <given-names>J. B.</given-names>
          </string-name>
          <string-name>
            <surname>Ashman</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Shen</surname>
            , [34]
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Kuscsik</surname>
            , J.-G. Liu,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Medo</surname>
            ,
            <given-names>J. R</given-names>
          </string-name>
          . Wake-
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          <source>preprint arXiv:2304</source>
          .
          <year>01938</year>
          (
          <year>2023</year>
          ).
          <source>ceedings of the National Academy of Sciences</source>
          <volume>107</volume>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Frieder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pinchetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.-R.</given-names>
            <surname>Grifiths</surname>
          </string-name>
          , T. Salva
          <string-name>
            <surname>-</surname>
          </string-name>
          (
          <year>2010</year>
          )
          <fpage>4511</fpage>
          -
          <lpage>4515</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          <string-name>
            <surname>tori</surname>
            , T. Lukasiewicz,
            <given-names>P. C.</given-names>
          </string-name>
          <string-name>
            <surname>Petersen</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Chevalier</surname>
            , [35]
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Feng</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          <source>arXiv preprint arXiv:2301.13867</source>
          (
          <year>2023</year>
          ).
          <article-title>and future directions</article-title>
          , ACM Transactions on Infor[22]
          <string-name>
            <given-names>T.</given-names>
            <surname>Lubiana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Medeiros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Silva</surname>
          </string-name>
          ,
          <source>mation Systems</source>
          <volume>41</volume>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref59">
        <mixed-citation>
          <string-name>
            <given-names>A. N. A.</given-names>
            <surname>Goncalves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Maracaja-Coutinho</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. I.</surname>
          </string-name>
          [36]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Deep learning for sen-</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>