<!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>Team Zhang at Factify 2: Unimodal Feature-enhanced and Cross-modal Correlation learning for Multi-Modal Fact Verification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fanrui Zhang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Qiang Zhang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jiawei Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Esther Sun</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Science and Technology of China</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, social media has enabled users to get exposed to a myriad of misinformation and disinformation which have attracted a great deal of attention in research fields. Despite the progress in text-based fact-checking, there has been very limited work on applying multi-modal techniques to fact verification. In this work, we propose a novel unimodal feature-enhanced and cross-modal correlation learning approach (UFCC) for multi-modal fact verification by jointly modeling the basic intra-modal semantic correlation and the inter-modal correlation. Specifically, UFCC consists of a text-semantic feature Module, an image-semantic feature module and a text-image correlation module. In the textsemantic feature module, UFCC exploits pre-trained backbones to separately extract text features from claims and documents. Then we utilize the signed attention mechanism to enhance text information representation by using diferent text features as query. The image-semantic feature module is similar to the text. In the text-image correlation module, UFCC first adopts the fine-tuned clip model to encode the claims' (or documents') textual and visual features. Then, UFCC explore the cross-modal relationships between the extracted features by using similarity layer. Based on this, we finally fuse the text and image features for better performance. Our team, Zhang, won the fourth prize (F1-score: 77.423%) in Factify challenge hosted by De-Factify2 @ AAAI 2023, which demonstrated the efectiveness of the method.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Multi-modal fact verification</kwd>
        <kwd>attention</kwd>
        <kwd>fine-tuned clip</kwd>
        <kwd>De-Factify2</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The emergence of social media has revolutionized the traditional way that people access
information online [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. People enjoy the convenience and eficiency of online social media in
sharing information and exchanging ideas [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, spreading disinformation and
misinformation in the modern media ecosystem has also become much easier. Many reports pointed
out that fabricated stories possibly caused citizens’ misconceptions about political candidates
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], manipulated stock prices [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and threatened public health [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Therefore, it is desirable to
detect and regulate ’fake news’ to promote truthful information on social media platforms.
      </p>
      <p>Claim image</p>
      <p>Claim text
Delhi Chief Electoral Officer Ranbir
Singh: The highest voter turnout was
recorded in Ballimaran assembly
constituency at 71.6 per cent while
the lowest voter turnout was
recorded in Delhi Cantonment at
45.4 per cent. #DelhiAssemblyPolls</p>
      <p>Document text
The final voter turnout in the Delhi
polls was 62.59 per cent, senior
officials said on Sunday. Elections
to the 70-member Delhi Assembly
were held on Saturday. “The final
voter turnout was recorded at 62.59
per cent,” a senior…
Support_Text</p>
      <p>Claim image
Document image</p>
      <p>Document image
Claim image</p>
      <p>Claim text
Punjab: Farmers at Talwandi
Kalan village in Ludhiana
burn wheat straw https://t.co/
ljIrtELKfn</p>
      <p>Document text
Bearing testimony to the failure
of the Punjab government in
controlling stubble burning, the
state has recorded 7,326
incidents wherein wheat straw
was burned in fields. According
to experts, the…
Support_Multimodal</p>
      <p>Claim image</p>
      <p>Document image</p>
      <p>Claim text
Jammu and Kashmir PDP
leader and former minister
Javed Mustafa Mir resigns
https://t.co/RoB3JX9qS5
https://t.co/E7aOt500sy
Document image</p>
      <p>Document text
In another blow to Mehbooba
Mufti-led Peoples Democratic
Party (PDP), senior leader and
former minister Javed Mustafa
Mir has resigned from the
party.Mir will forward his
resignation to the party…
Insufficient_Multimodal</p>
      <p>Claim image
Document image</p>
      <p>Claim text
Rhea Chakraborty said Sushant
Singh Rajput told her to leave
his house, chats with Mahesh
Bhatt reveal otherwise: lawyer
https://t.co/eAAVirIv1z
https://t.co/sAW7DfiiXX</p>
      <p>Document text
Vikas Singh, the lawyer
representing late actor Sushant
Singh Rajput’s family has said
that there is a chance that actor
Rhea Chakraborty might be
taken into custody by …</p>
      <p>Insufficient_Text</p>
      <p>Claim text
An asteroid is expected to hit
Earth on Nov. 2, 2020, right
before Election Day in the
U.S.</p>
      <p>Document text
An asteroid will approach Earth
on Nov. 2, 2020, the day before
Election Day in the U.S.</p>
      <p>Asteroid 2018 VP1 is expected
to come within about 3,000
miles of the Earth and has...</p>
      <p>Refute</p>
      <p>
        Some research formulates this problem as the fact verification task, which targets to
automatically verify the integrity of statements using trustworthy corpora [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], e.g., Wikipedia
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. To verify the claim from the real world in Figure 1, this task first requires searching and
retrieving relevant evidence from reliable sources, and making a comparison by absorbing the
knowledge of the evidence [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], which would take a great deal of time and efort. Given the
large number of claims that need to be checked, manual validation is insuficient and unrealistic.
Thus, how to automatically check the integrity of claims, prevent the spread of fake news,
and avoid the negative impact on society, is urgently needed for our society. Existing work
has presented a number of approaches for tackling fact verification automatically, of which
traditional fact verification approaches typically concentrate on text-only content analysis and
have produced a range of related work. Nie et al [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] string all the evidence together to verify
the claim. Another approach is to reason about each claim evidence pair and aggregate them
thus verifying the claim [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. There are also many fact-checking models that utilize Natural
Language Inference(NLI) techniques [
        <xref ref-type="bibr" rid="ref12 ref13 ref14">12, 13, 14</xref>
        ], and one of the most widely used NLI-based
models is the Enhanced Sequential Inference Model (ESIM) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], which uses some form of hard
or soft alignment to associate relevant subcomponents between premises and assumptions.
      </p>
      <p>
        Recently, multi-modal fact verification has received considerable attention since the content
form of posts tends to coexist with multi-modal information. Compared to text-based fact
verification, multi-modal fact verification is a new and challenging area of research [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Although
both Image and text contain rich information, they are in heterogeneous modalities and there is
a modality gap between them [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Some early detectors proposed to investigate cross-modal
information, but the lack of the construction of large-scale annotated datasets hindered the
development of the methods [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Considering this, the multi-modal fact verification (Factify)
challenge at AAAI 2022 has been held [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and released a large-scale dataset. A series of excellent
works have emerged that facilitate the development of multi-modal fact verification systems
[
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ]. For example, Team UofA-Truth [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] directly employs cosine similarity to connect
textual (visual) representations of statements and documents. Team Yao [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] uses multiple
pre-trained models to extract image and text features, and uses the co-attention mechanism to
enhance the information representation. Although the methods mentioned above make use of
multi-modal information, they don’t efectively enhance the unimodal information nor extract
the relationship of inter-modal information
      </p>
      <p>
        Based on the large-scale and high-quality Defactify dataset [
        <xref ref-type="bibr" rid="ref21 ref22">21, 22</xref>
        ] and previous excellent
works [
        <xref ref-type="bibr" rid="ref20 ref23 ref24">20, 23, 24</xref>
        ], we propose a novel unimodal feature-enhanced and cross-modal correlation
learning approach(UFCC) for multi-modal fact verification. Specifically, UFCC consists of a
text-semantic feature module, an image-semantic feature module, a text-image correlation
module, and a backbone network. In the text-semantic feature module and image-semantic
feature module, we first extract claims and documents’ unimodality features(text or image) from
the pre-trained backbone. These features are further fused by utilizing the signed attention
mechanism [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and a transformer encoder [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] to capture both positive (consistency) and
negative (inconsistency) correlations. In the text-image correlation module, we introduce the
ifne-tuned clip [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] model to reduce the modality gap and reconstruct the claims’ (or documents’)
image and text representations. Finally, we calculate their similarity [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and map them to the
reconstruction features. Figure 2 depicts our framework, showing a ’Support Text’ example
from the dataset [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] along with the corresponding evidence. As the task requires machine
comprehension and modality understanding, we perform diferent evaluations to design the
network and the representations.
      </p>
      <p>
        The main contributions of this paper are as follows: (1) we propose a novel unimodal
feature-enhanced and cross-modal correlation learning approach(UFCC) for multi-modal fact
verification by jointly modelling the basic intra-modal semantic correlation and the inter-modal
correlation. We efectively enhance the unimodal information and extract the relationship of
inter-modal information. (2) We propose two specified semantic feature modules with a signed
attention mechanism [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and a fusion layer to capture both consistency and inconsistency
unimodal enhanced features. (3) We introduce a fine-tuned clip model and fusion layer to
reduce the claim’s modality gap by capturing the relationship between text and image. (4) Our
UFCC model outperforms the baseline by at least 12.4% and won the fourth prize in the Factify
challenge hosted by De-Factify2 @ AAAI 2023 [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <sec id="sec-2-1">
        <title>2.1. Fact verification on Text</title>
        <p>
          Fact verification on Text can be seen as a Recognizing Textual Entailment(RTE) task [
          <xref ref-type="bibr" rid="ref29 ref30">29, 30</xref>
          ],
where the goal is to predict whether the text supports or disproves the claim. It is divided into
the following main steps, first retrieving documents from a text source(e.g., Wikipedia) that
are relevant to a given claim, then selecting sentences that may contain evidence, and finally
assigning an authenticity relationship label by the model to support or disprove the claim.
        </p>
        <p>
          Typical retrieval strategies in the evidence retrieval process include commercial search APIs,
Lucene indexes, entity linking, or ranking functions (e.g., dot product of TF-IDF vectors [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ]). To
improve accuracy, retrieved evidence can also be re-ranked using the stance detection systems
acting as a fine-grained filter [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ].
        </p>
        <p>
          Regarding claim verification, much of the recent work is based on graph neural networks.
GEAR [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] and KGAT [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] construct graphs with evidence as nodes and use deep graph neural
networks for knowledge propagation; DREAM [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ] further employ XLNet [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ] and build
semantic hierarchical graphs for inference to improve performance. These graph-based models
establish node interactions for joint inference over several evidence fragments. In recent
years, the use of transformer-based linguistic representation models(LRMs) such as BERT
[
          <xref ref-type="bibr" rid="ref37">37</xref>
          ], RoberTa [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ], etc. has also demonstrated their robust performance in claim verification
tasks. Transformer-XH [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ] propagates knowledge between [CLS] tokens of diferent evidence
fragments; CorefBERT [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ] trains a BERT-based LRM which uses an additional target modelling
co-reference knowledge and uses it in the KGAT architecture.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Muti-Modal Fact Verification</title>
        <p>
          Though the majority of existing works have focused on text, some early eforts also investigated
how to incorporate multimodal information, Zlatkova [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ] created a new dataset and explored
some baselines; Lee et al [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] proposed a unifying textual and visual matching layer to confuse
the two modality information. They pioneered this new direction.
        </p>
        <p>
          However, the mentioned methods [
          <xref ref-type="bibr" rid="ref23 ref41">41, 23</xref>
          ] above all have the problem that the constructed
dataset is not large enough for fact verification and the methods cannot efectively learn from
the shared information between modalities. Considering this, the multi-modal fact verification
(Factify) challenge at AAAI 2022 [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ] has been held and a series of excellent works have emerged
which facilitate the development of multimodal fact-checking systems. Team Yao [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] adopted
the ensemble method by using diferent pre-trained models and several co-attention modules.
Team UofA-Truth [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], used a straightforward approach that concatenated the claim, document
textual(visual) representations and their cosine similarity. Team Yet [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] integrated disturbance
on the embedding layer, a new loss function, and data augmentation by sequential dropout
layers into the vanilla RoBERTa. Gao et al [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] proposed an ensemble model architecture by
extracting various information for each modality individually. They applied multiple attention
mechanisms to learn the multimodal interaction between visual and textual content pairs.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Large-scale pre-trained model</title>
        <p>
          Large-scale pre-trained models (PTMs) based on transformer architectures such as BERT [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ],
ViT [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ] and CLIP [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] have demonstrated their powerful performance in a wide range of fields
such as NLP, CV, and multimodality. Due to the complex pre-training objectives and large
model parameters, PTMs can eficiently capture knowledge from large amounts of labelled and
unlabelled data and store the knowledge in a large number of parameters. At the same time,
PTMs can be fine-tuned for a specific task and thus applied to a variety of downstream tasks.
        </p>
        <p>
          In the field of natural language processing, since 2018 we have seen the rise of a range of
large-scale pre-trained language models (PLMs) , such as BERT [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ], RoBERTa [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ], DeBERTa
[
          <xref ref-type="bibr" rid="ref44">44</xref>
          ] and others. These PLMs have been fine-tuned by using task-specific labels and have created
new levels of skill in many downstream tasks. One of them, Bert, is based on the Multi-Layer
Transformer Encoder architecture and uses both Masked Language Modeling (MLM) and Next
Sentence Prediction (NSP) methods to train models unsupervised. RoBERTa uses a random
mask mechanism and removes the NSP task to enhance Bert’s performance. DeBERTa greatly
improves the eficiency of pre-training and the performance of downstream tasks by decoupling
the attention mechanism, enhanced mask decoder and virtual adversarial training (SiFT).
        </p>
        <p>
          In the field of computer vision, the ViT [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ] model proposed by the Google team applied
transformer to image classification, pioneering the application of transformer in vision. The
model divides the input image into multiple patches (16x16), then projects each patch into a
ifxed-length vector to feed the Transformer and uses the final output vector for the classification
task. After ViT was proposed, vision models such as DeiT [
          <xref ref-type="bibr" rid="ref45">45</xref>
          ], Swin Transformer [
          <xref ref-type="bibr" rid="ref46">46</xref>
          ] and
others were proposed, which significantly advanced the progress of the computer vision field.
        </p>
        <p>
          In the field of the multimodal domain, pre-trained models have also demonstrated their
powerful performance, such as CLIP [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ], ViLT [
          <xref ref-type="bibr" rid="ref47">47</xref>
          ], DALL-E 2 [
          <xref ref-type="bibr" rid="ref48">48</xref>
          ] and so on. Among them,
CLIP is a multimodal pre-training model based on contrasting text-image pairs. The model is
trained by jointly training an image encoder and a text encoder to predict the correct pairing
of a batch of (image, text) training samples to obtain a transferable visual model, and it has a
powerful zero-shot capability that can be used in a variety of downstream tasks.
        </p>
        <p>These pre-trained models have achieved excellent performance in a variety of downstream
tasks due to their powerful information characterization capabilities. At the same time, many
previous works have applied them to our task and achieved better results. This definitely
motivates us to use these pre-trained models as our backbone network to characterize image
and text information and convert them into contextual embedding.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>
        Muti-modal fact verification in this task is formulated as a five-classification problem to judge
the given claims with tests and images entailed in the given documents [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. To address the
problem, we propose a novel unimodal feature-enhanced and cross-modal correlation learning
approach(UFCC) by jointly modelling the unimodal semantic correlation and the cross-modal
consistency [
        <xref ref-type="bibr" rid="ref49">49</xref>
        ]. As illustrated in Figure 2, it consists of a text-semantic correlation Module, an
image-semantic correlation module, a text-image consistency Module, and a backbone network.
Firstly, given a claim with the text  and the image  , we denote the document text 
and the document image . And the task label is defined as . The goal is to find out the
relationship between given claims and documents as follows [
        <xref ref-type="bibr" rid="ref21 ref22">22, 21</xref>
        ]:
• support_Multimodal: the text and image of the given claim entailed similar news.
• Support_Text: the text of the given claim is entailed similar news but the image is not.
• Insuficient_Multimodal: the image is entailed similar news but the text is not.
• Insuficient_Text: the text of the given claim is not entailed but may have common words
and the image is not entailed.
(
)
(
)
( )
( )
( )
( )
      </p>
      <sec id="sec-3-1">
        <title>Text-Image Correlation Module</title>
      </sec>
      <sec id="sec-3-2">
        <title>Text-Semantic Feature Module</title>
      </sec>
      <sec id="sec-3-3">
        <title>Image-Semantic Feature Module</title>
        <p>FC+Max Pooling
Add &amp; Norm
Similarity</p>
      </sec>
      <sec id="sec-3-4">
        <title>Clip</title>
        <p>FC+LeckyReLU
FC+LeckyReLU
FC+LeckyReLU
FC+LeckyReLU
Feed Forward
Feed Forward
Feed Forward
Feed Forward
Add &amp; Norm
Add &amp; Norm
Add &amp; Norm
Add &amp; Norm
Q</p>
        <p>Signed
Attention</p>
        <p>K V
{ }
Signed</p>
        <p>Attention
Q K V
{ }
MHA
Add &amp; Norm
Add &amp; Norm
Add &amp; Norm
Q</p>
      </sec>
      <sec id="sec-3-5">
        <title>SMiguntei-dHead</title>
      </sec>
      <sec id="sec-3-6">
        <title>AtAtetntetinotnion</title>
        <p>K V
Add &amp; Norm</p>
      </sec>
      <sec id="sec-3-7">
        <title>SiMgnuetdi-Head</title>
      </sec>
      <sec id="sec-3-8">
        <title>AtteAntttieonntion</title>
        <p>Q K V
Im{{age}-Shared Em{b{ed}d}ing</p>
        <p>}
Backbone
"Nearly 200,000 in Assam
affected due to floods
l "With continued rainfall in northeastern parts
of the country on account of Cyclon Amphan,
the Central Water Commission has sounded a
flood alert even as nearly 2 lakh people have
been affected by flooding in 229
l The highest flood level for the Brahmaputra in
the Jorhat stretch is 87.37 metres and the
current level is 85.78 metre according to the
bulletin issued on Tuesday
l …………</p>
        <p>• Refute: the text and image of the given claim are fake.</p>
        <sec id="sec-3-8-1">
          <title>3.1. The Backbone Network</title>
          <p>The backbone network is designed in a two-stream fashion, consisting of a textual encoder and
a visual encoder to extract basic features from the text.</p>
          <p>Textual Feature Extractor. Specifically, according to several experiments, we employ a
pretrained DeBERTa model to map the word sequence of  into an embedding sequence { }=1

of length . The embedding sequence is then further consumed by a bidirectional long
shortterm memory network (Bi-LSTM) to obtain the final textual feature sequence
{ }=1 ∈ R.</p>
          <p>{ } =  (Bi-LSTM( )) + 
(1)
(2)
(3)
This is formulated as follows:
where  and  denote the learnable parameters of a fully connected (FC) layer.</p>
          <p>
            Visual Feature Extractor. Based on the excellent performance of the Vit [
            <xref ref-type="bibr" rid="ref43">43</xref>
            ] model, we
adopt a pre-trained Vit model [
            <xref ref-type="bibr" rid="ref43">43</xref>
            ] to encode image  into an initial feature map with dimension
768, which is then transformed by a linear block into the visual feature sequence {}=1 ∈ R.


{} = MLP(ViT())
where ViT denotes the pre-trained Vit model, MLP represents multi-Layer perceptrons. Similarly,
we get the representation of the document text and document image { },{}.
          </p>
        </sec>
        <sec id="sec-3-8-2">
          <title>3.2. Unimodal Semantic Feature Module</title>
          <p>
            Our UFCC model has two unimodal semantic feature modules including the text-semantic feature
module and the image-semantic feature module. Taking the text modules as an example, we first
further fused two extracted features  ,  by utilizing the signed attention mechanism [
            <xref ref-type="bibr" rid="ref25">25</xref>
            ],
in order to simultaneously capture both semantic consistency and inconsistency correlations
[
            <xref ref-type="bibr" rid="ref49">49, 50</xref>
            ]. In the traditional attention mechanism, if the correlations between query and keys
are negative, we would treat it as insignificant [
            <xref ref-type="bibr" rid="ref26">26</xref>
            ]. However, such a negative correlation may
represent the inconsistency semantics that can be beneficial to the fact verification task [
          </p>
          <p>As shown in Figure 3, it takes the   as the query, and   as the key and value to calculate
the positive correlation as follows:
  = Softmax ︁( ( )</p>
          <p>︁)
 ( )/√︀2
 =
︂( ∑︁
=1
 


 
︂)⧸(

∑︁  ︂)
=1
where 2 is the dimension of  .   denotes the positive attention coeficients. A larger
  indicates that the query claim text is more positively semantically associated with the
document text.</p>
          <p>
            On the contrary, the negative attention mechanism utilizes a “-softmax" operation to amplify
the inconsistent correlations [
            <xref ref-type="bibr" rid="ref25 ref26 ref49">49, 50, 25, 26</xref>
            ], that is,
Then we utilize two residual modules and a two layers feedforward Neural Network to enhance
the features:
  = − Softmax − ( )
︁(
the text evidence { } towards the text claim { } based on a linear layer.
representations with two  
, arithmetic operations, and obtain the final representation of
 ( ) =  (︀  [︀  :  
 ]︀ + )︀
where [:] denotes concatenation operation.  and  are learnable parameters for aggregating
the representations. denotes the LeckyReLU activation function.
          </p>
          <p>Similar to Eqn. 3-6, we get the outputs of the claim image  (); the document text  ( ),
and the document image  ().</p>
        </sec>
        <sec id="sec-3-8-3">
          <title>3.3. Cross-modal Correlation Module</title>
          <p>{−  }.</p>
          <p>The text and image features extracted by DeBERTa and ViT respectively have significant
semantic modal gaps, and it is dificult for the network to learn their consistency correlation if
they are fused directly. Therefore, we extract the alignment features of the text-image pair by
utilizing and fine-tuning the CLIP model. The extracted feature is denoted as {−  } and</p>
          <p>
            During fine-tuning, we pass the text-image pair through the CLIP encoders and normalize
their embeddings. We produce a joint embedding that is a dot product of the image and
text ones. Merely combining the CLIP-based features with the multimodal features cannot
necessarily provide enough reliable information. The reason is that fact verification is not
completely correlated with image-text correlation [
            <xref ref-type="bibr" rid="ref23 ref24">24, 23</xref>
            ]. To address the ambiguity issue
between multimodal features, we measure the cosine similarity between the text features and
the image features provided by CLIP, to adjust the intensity of fused features [
            <xref ref-type="bibr" rid="ref24">24</xref>
            ]. The cosine
similarity and the fused module are calculated as follows.
          </p>
          <p>sim = Norm( −  · (−  )</p>
          <p>).</p>
          <p>‖−  ‖ ‖−  ‖
 = sim · (−  · −  )
We then concatenate all previous features into one feature and update the final claim inter-modal
representations based on MaxPooling.
(4)
(5)
(6)
(7)
(8)
˜() =  ( [ : −  : −  ] + )</p>
          <p>︁( ˜())︁
() = Max Pooling  
where [:] denotes concatenation operation.  and  are learnable parameters for aggregating
the representations. denotes LeckyReLU activation function. Similarly, we also get the final
().
document inter-modal representations</p>
        </sec>
        <sec id="sec-3-8-4">
          <title>3.4. Classifier</title>
          <p>UFCC leverages the unimodal semantic correlation as well as the multimodal consistency
correlation to jointly perform fact classification. The cross-modal semantic consistency features
 () and () and the feature-enhanced unimodal representations  (),  (),  ( )

and  () are finally concatenated to form the discriminative fact representation, which is
further transformed by an FC layer with softmax activation function to verify the fact as the
following:</p>
          <p>() : () :  () :  () :  ( ) :  ()] + )
ˆ =  1( [
where  and  are the parameters of the classifier layer.  1 denotes the Sotfmax activation
function. The overall framework is supervised with a cross-entropy criterion.</p>
          <p>L = −
||
∑︁  log (ˆ)
=1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Experimental Settings</title>
        <p>Dataset. Factify is a dataset for multi-modal fact verification whose goal is to identify if
the claim entails the document. In this dataset, each sample includes claim image, claim,
claim ocr, document image, document, document ocr, and category. Also, the dataset contains
a total of 5 categories, which contain Support_Text, Support_Multimodal, Insuficient_Text,
Insuficient_Multimodal and Refute. The dataset is divided into three parts: a training set, a
validation set, and a test set. The training set contains a total of 35,000 samples, of which 7,500
are for each category. The validation set contains 7,500 samples, of which 1,500 are for each
category. The test set is used to evaluate the performance of the model and contains a total of
7,500 samples. For more details, we refer readers to [? ].</p>
        <p>
          Implementation Details. In the textual encoder, we set the length of the input text to at most
128 words, and utilize the pre-trained DeBERTa [
          <xref ref-type="bibr" rid="ref44">44</xref>
          ] model to initialize the word embeddings
with 768 dimensions. In the visual encoder, we use the pre-trained Vit model [
          <xref ref-type="bibr" rid="ref43">43</xref>
          ] to extract the
visual feature. The dimension of the visual feature {} and textual feature { } are 256. In
terms of parameter setting, we set the learning rate of the overall framework to 1.8− 4, and
ifne-tune the DeBERTa model and the Vit model with a learning rate of 5− 5. The batch size of
(9)
(10)
(11)
the input is 16. Adam optimizer is used to train UFCC. Weighted F1 scores are employed as the
evaluation metrics.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Analysis of experimental results</title>
        <p>Testing Performance. The final results of the test are presented in Table 1. the average F1
score value of our proposed model was 77.423%, outperforming the baseline by 12.4%, while
achieving fourth place among all participating teams. We can attribute the strengths of UFCC
to the following aspects: (1) the use of Vit and DeBERTa as the backbone network, resulting in
an excellent representation of image and text information. (2) The use of the Signed Attention
mechanism captures both semantic consistency and inconsistent correlation, which in turn
enhances unimodal information. (3) Using CLIP to fuse multimodal information and adjust the
strength of the fusion by calculating the cosine similarity of text and image information.</p>
        <p>Model -w/o TIC
F1 (%) 73.17</p>
        <p>Confusion Matrix. Figure 4 shows the confusion matrix of the testing set. We can find
that the model can accurately discriminate the Refute category, but performs poorly in the
Support_Text and Insuficient_Text categories, indicating that the model is weak at discriminating
when the claimed image or text is neither supported nor refuted. In subsequent studies, we will
improve it for this purpose.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Ablation Study</title>
        <p>To show the efectiveness of diferent modules in UFCC, we compare it with the sub-models
“-w/o TIC”, “-w/o TSF”, “-w/o ISF” and “-w/o Sim”. They denote the variant of UFCC without
considering the text-image correlation module, the text-semantic feature module, the
imagesemantic feature module and the clip similarity module, respectively. And the "-w/o S-A"
denotes UFCC without replacing the signed attention to the traditional attention mechanism.
The comparison results are shown in Table 2. We can observe that all ablation variants perform
worse than the complete UFCC model on the Factify2 dataset. The results indicate that: (1)
All three modules are important for fact verification; (2) the modal similarity architecture can
facilitate the multi-modal fusion; (3) The signed attention mechanism can both capture unimodal
consistency and inconsistency correlations.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this paper, we propose a novel unimodal feature-enhanced and cross-modal correlation
learning approach(UFCC) for multi-modal fact verification by jointly modelling the basic intra-modal
semantic correlation and the inter-modal. Our framework enables more efective multimodal
fusion by introducing fine-tuned clip and similarity-fused layers. Besides, we adopt the signed
attention mechanism to enhance the unimodal information representation. At last, the ablation
study demonstrates the efectiveness of our proposed approach.</p>
      <p>In " Hand movement appears to help in teaching about statistical models", Matthew Hutson
explains that gesture movements help speakers convey ideas, think and learn.</p>
      <p>First, the authors pointed out that psychological research is exploring the possibility of
gesturing while learning. Studies have shown that learners who imitate a teacher’s movements
are better at helping them learn and remember, even if they don’t know why.</p>
      <p>And the authors mention a study that tests this hypothesis. New work extends this finding.
The researchers tested the subconscious efects of
inconsistency network for multi-modal rumor detection, in: Findings of the Association
for Computational Linguistics: EMNLP 2021, 2021, pp. 1412–1423.
[50] J. Zheng, X. Zhang, S. Guo, Q. Wang, W. Zang, Y. Zhang, Mfan: Multi-modal
featureenhanced attention networks for rumor detection (2022).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Abdelnabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hasan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fritz</surname>
          </string-name>
          ,
          <article-title>Open-domain, content-based, multi-modal fact-checking of out-of-context images via online resources</article-title>
          ,
          <source>in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>14940</fpage>
          -
          <lpage>14949</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <article-title>Fake news detection using higher-order user to user mutual-attention progression in propagation paths</article-title>
          ,
          <source>in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>652</fpage>
          -
          <lpage>653</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Allcott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gentzkow</surname>
          </string-name>
          ,
          <article-title>Social media and fake news in the 2016 election</article-title>
          ,
          <source>Journal of economic perspectives 31</source>
          (
          <year>2017</year>
          )
          <fpage>211</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Kogan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. J.</given-names>
            <surname>Moskowitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Niessner</surname>
          </string-name>
          ,
          <article-title>Fake news: Evidence from financial markets</article-title>
          ,
          <source>Available at SSRN</source>
          <volume>3237763</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Ü.</given-names>
            <surname>Recep</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Ş. ÇİÇEKLİOĞLU</surname>
          </string-name>
          ,
          <article-title>Fake news pandemic: Fake news and false information about covid-19 and an analysis on factchecking from turkey in sample teyit</article-title>
          . org,
          <source>Erciyes İletişim Dergisi</source>
          <volume>9</volume>
          (
          <year>2022</year>
          )
          <fpage>117</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schlichtkrull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          , A survey on
          <source>automated fact-checking, Transactions of the Association for Computational Linguistics</source>
          <volume>10</volume>
          (
          <year>2022</year>
          )
          <fpage>178</fpage>
          -
          <lpage>206</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Milne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. H.</given-names>
            <surname>Witten</surname>
          </string-name>
          ,
          <article-title>Learning to link with wikipedia</article-title>
          ,
          <source>in: Proceedings of the 17th ACM conference on Information and knowledge management</source>
          ,
          <year>2008</year>
          , pp.
          <fpage>509</fpage>
          -
          <lpage>518</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Adair</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <article-title>Progress toward “the holy grail”: The continued quest to automate fact-checking</article-title>
          , in: Computation+ Journalism Symposium,(September),
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <article-title>Combining fact extraction and verification with neural semantic matching networks</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>33</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>6859</fpage>
          -
          <lpage>6866</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Luken</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , M.-C. de Marnefe,
          <article-title>QED: A fact verification system for the FEVER shared task</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Fact Extraction and VERification (FEVER)</source>
          ,
          <source>Association for Computational Linguistics</source>
          , Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>156</fpage>
          -
          <lpage>160</lpage>
          . URL: https://aclanthology.org/W18-5526. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W18</fpage>
          -5526.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Yoneda</surname>
          </string-name>
          , J. Mitchell, J. Welbl,
          <string-name>
            <given-names>P.</given-names>
            <surname>Stenetorp</surname>
          </string-name>
          , S. Riedel, UCL machine reading group:
          <article-title>Four factor framework for fact finding (HexaF)</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Fact Extraction and VERification (FEVER)</source>
          ,
          <source>Association for Computational Linguistics</source>
          , Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>102</lpage>
          . URL: https://aclanthology.org/W18-5515. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W18</fpage>
          -5515.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Inkpen</surname>
          </string-name>
          ,
          <article-title>Enhanced lstm for natural language inference</article-title>
          ,
          <source>arXiv preprint arXiv:1609.06038</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Narasimhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Salimans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Improving language understanding by generative pre-training (</article-title>
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Iyyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gardner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <article-title>Deep contextualized word representations</article-title>
          ,
          <source>in: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , New Orleans, Louisiana,
          <year>2018</year>
          , pp.
          <fpage>2227</fpage>
          -
          <lpage>2237</lpage>
          . URL: https://aclanthology.org/N18-1202. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>N18</fpage>
          -1202.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>End-to-end multimodal fact-checking and explanation generation: A challenging dataset and models</article-title>
          ,
          <source>arXiv preprint arXiv:2205.12487</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Suryavardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhaskar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Chopra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Reganti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patwa</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chakraborty</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ekbal</surname>
          </string-name>
          ,
          <article-title>Factify: A multi-modal fact verification dataset</article-title>
          , in: Proceedings of De-Factify: Workshop on Multimodal Fact Checking and Hate Speech Detection, ceur,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Yet at factify 2022 :
          <article-title>Unimodal and bimodal roberta-based models for fact checking (short paper)</article-title>
          , in: DE-FACTIFY@AAAI,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.-F.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Oikonomou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiskovski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bandhakavi</surname>
          </string-name>
          , Logically at factify 2022:
          <article-title>Multimodal fact verfication</article-title>
          ,
          <source>ArXiv abs/2112</source>
          .09253 (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dhankar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. R.</given-names>
            <surname>Zaiane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bolduc</surname>
          </string-name>
          , Uofa-truth at factify
          <year>2022</year>
          :
          <article-title>A simple approach to multi-modal fact-checking</article-title>
          , in: DE-FACTIFY@AAAI,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>W.-Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , W.-C. Peng, Team yao at factify 2022:
          <article-title>Utilizing pre-trained models and coattention networks for multi-modal fact verification (short paper)</article-title>
          ,
          <source>ArXiv abs/2201</source>
          .11664 (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Suryavardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chadha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Reganti</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chinnakotla</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ekbal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Factify 2: A multimodal fake news and satire news dataset</article-title>
          ,
          <source>in: proceedings of defactify 2: second workshop on Multimodal Fact-Checking and Hate Speech Detection, CEUR</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>S.</given-names>
            <surname>Suryavardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chadha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Reganti</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chinnakotla</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ekbal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Findings of factify 2: multimodal fake news detection</article-title>
          ,
          <source>in: proceedings of defactify 2: second workshop on Multimodal Fact-Checking and Hate Speech Detection, CEUR</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>N.</given-names>
            <surname>Vo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Where are the facts? searching for fact-checked information to alleviate the spread of fake news</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>03159</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Kiran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Shashi</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Madhuri, Multi-stage transfer learning for fake news detection using awd-lstm network (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hou</surname>
          </string-name>
          , X. Cheng,
          <article-title>Signed graph attention networks</article-title>
          ,
          <source>in: International Conference on Artificial Neural Networks</source>
          , Springer,
          <year>2019</year>
          , pp.
          <fpage>566</fpage>
          -
          <lpage>577</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          , et al.,
          <article-title>Learning transferable visual models from natural language supervision</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>8748</fpage>
          -
          <lpage>8763</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tversky</surname>
          </string-name>
          , Features of similarity.,
          <source>Psychological review 84</source>
          (
          <year>1977</year>
          )
          <fpage>327</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>I.</given-names>
            <surname>Dagan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dolan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Magnini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>Recognizing textual entailment: Rational, evaluation and approaches-erratum</article-title>
          ,
          <source>Natural Language Engineering</source>
          <volume>16</volume>
          (
          <year>2010</year>
          )
          <fpage>105</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Bowman</surname>
          </string-name>
          , G. Angeli,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>A large annotated corpus for learning natural language inference</article-title>
          ,
          <source>arXiv preprint arXiv:1508.05326</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cocarascu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Christodoulopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mittal</surname>
          </string-name>
          ,
          <article-title>The fact extraction and VERification (FEVER) shared task</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Fact Extraction and VERification (FEVER)</source>
          ,
          <source>Association for Computational Linguistics</source>
          , Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . URL: https://aclanthology.org/W18-5501. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W18</fpage>
          -5501.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanselowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Stab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schulz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>A richly annotated corpus for diferent tasks in automated fact-checking</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>01214</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , X. Han,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          , Gear:
          <article-title>Graph-based evidence aggregating and reasoning for fact verification</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <year>01843</year>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Kernel graph attention network for fact verification (</article-title>
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Duan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Reasoning over semantic-level graph for fact checking</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>03745</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , J. Carbonell,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>Xlnet: Generalized autoregressive pretraining for language understanding</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>32</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>04805</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach</article-title>
          , arXiv preprint arXiv:
          <year>1907</year>
          .
          <volume>11692</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rosset</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tiwary</surname>
          </string-name>
          , Transformer-xh:
          <article-title>Multievidence reasoning with extra hop attention (</article-title>
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Coreferential reasoning learning for language representation</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>06870</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>D.</given-names>
            <surname>Zlatkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Koychev</surname>
          </string-name>
          ,
          <article-title>Fact-checking meets fauxtography: Verifying claims about images</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>11722</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>P.</given-names>
            <surname>Patwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Suryavardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bhaskar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Chopra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Reganti</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chakraborty</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ekbal</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Ahuja</surname>
          </string-name>
          ,
          <article-title>Benchmarking multi-modal entailment for fact verification</article-title>
          , in: Proceedings of De-Factify: Workshop on Multimodal Fact Checking and Hate Speech Detection, ceur,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dosovitskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Beyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kolesnikov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Weissenborn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Unterthiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Minderer</surname>
          </string-name>
          , G. Heigold,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gelly</surname>
          </string-name>
          , et al.,
          <article-title>An image is worth 16x16 words: Transformers for image recognition at scale</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>11929</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , W. Chen, Deberta:
          <article-title>Decoding-enhanced bert with disentangled attention</article-title>
          , arXiv preprint arXiv:
          <year>2006</year>
          .
          <volume>03654</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cord</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Douze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Massa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jégou</surname>
          </string-name>
          ,
          <article-title>Training data-eficient image transformers &amp; distillation through attention</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>10347</fpage>
          -
          <lpage>10357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Swin transformer: Hierarchical vision transformer using shifted windows</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF International Conference on Computer Vision</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>10012</fpage>
          -
          <lpage>10022</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Son</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kim</surname>
          </string-name>
          ,
          <article-title>Vilt: Vision-and-language transformer without convolution or region supervision</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>5583</fpage>
          -
          <lpage>5594</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nichol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Hierarchical text-conditional image generation with clip latents</article-title>
          ,
          <source>arXiv preprint arXiv:2204.06125</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Ma, Y. Liu,
          <article-title>Inconsistency matters: A knowledge-guided dual-</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>