<!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>Logically at Factify 2022: Multimodal Fact Verification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jie Gao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hella-Franziska Hofmann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stylianos Oikonomou</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>David Kiskovski</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anil Bandhakavi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Brookfoot Mills, Brookfoot Industrial Estate</institution>
          ,
          <addr-line>Brighouse, HD6 2RW</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes our participant system for the multi-modal fact verification (Factify) challenge at AAAI 2022. Despite the recent advance in text-based verification techniques and large pre-trained multimodal models cross vision and language, very limited work has been done in applying multimodal techniques to automate fact checking processes, particularly considering the increasing prevalence of claims and fake news about images and videos on social media. In our work, the challenge is treated as a multimodal entailment task and framed as multi-class classification. Two baseline approaches are proposed and explored including an ensemble model (combining two uni-modal models) and a multimodal attention network (modeling the interaction between image and text pair from claim and evidence document). We conduct several experiments investigating and benchmarking diferent SoTA pre-trained transformers and vision models in this work. Our best model is ranked first on the leaderboard and obtains a weighted average F-measure of 0.77 on both validation and test set. Exploratory analysis is also carried out on the Factify data set and uncovers salient patterns and issues (e.g. word overlap, visual entailment correlation, source bias) that motivates our hypothesis. Finally, we highlight challenges of the task and multimodal dataset for future research.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;fact verification</kwd>
        <kwd>multimodal representation learning</kwd>
        <kwd>multimodal entailment</kwd>
        <kwd>text entailment</kwd>
        <kwd>attention mechanism</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Rapidly growing volume of misinformation and fake news have become a pressing challenge
and cause severe consequences on society. Significant joint eforts have been undertaken by
a wide range of parties (represented by journalists, researchers, independent fact checkers)
to protect communities from false information. It has never been more important to have
a versatile ecosystem to scale up and speed up fact checking against misinformation using
technology, which can be broadly categorised into claim detection and claim validation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
The former technique is to support fact checkers in content prioritisation through assessing
check-worthiness, and the latter one is to automate the process of evidence retrieval from large
knowledge bases and performing veracity prediction of the detected claims in order to assist
manual fact checking tasks. Claim matching [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] is another emerging trend, addressing the
need for timely identification of previously fact-checked claims. Prior eforts focused mostly
on text from news media articles and English language. In recent years, with the advance
in user-generated content and increasingly polarized social platforms, the challenges of fact
checking have increasingly become multilingual and multimodal which have been pervasive in
user-generated multimedia content [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. As a consequence, many new problems arise, typically
false context, false connections or misleading content [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7 ref8">4, 5, 6, 7, 8</xref>
        ]. Another understudied
process (known as amplification) is leveraged by coordinated disinformation campaigns [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
It deliberately spreads large volumes of repeated claims in many diferent ways, in order to
stimulate unintentional spread as false rumors [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Thus, there is an imperative need to develop
algorithms to group same claims resided in various multimodal context and automate the
verification process at scale.
      </p>
      <p>
        Compared to text-based fact checking, multimodal verification is an under-explored area of
research. Image and text both contain rich information but reside in heterogeneous modalities.
Comparing representation learning within the same modality, cross-modal architectures need
not only learn the features for image and text to express their respective content but
importantly capture a measure for cross-modal semantic integrity [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. We study multimodal
entailment in this paper. As a newly introduced subtask, it poses extra critical challenges.
      </p>
      <p>
        Simple image similarity cannot resolve fine-grained images diferences and perform poorly
for adversarial images [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], SAR images[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], etc. To exemplify this challenge, two pairs of claim
and document from insuficient multimodal samples in Factify dataset [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] are presented in
Table 1. The first sample shows two separate images of a politician taken in direct point-of-view,
sitting at the exact same table, in the exact same room, giving a televised speech on diferent
days for diferent issues. In both images, the politician is wearing a suit, in one image black,
and in the other white. In this case, the images are likely to yield high similarity with respect to
their content, but they should be considered diferent images and representative of diferent
contextual information. The second sample presents two images of the same nature, where
the politician is wearing the same white suit and ear plugs but with a news broadcasting logo
overlaid on the upper right corner of claim image, and the other document image with no
news channel logo visible. The main discrepancy is presented between text and image in
document which reports that the politician is wearing a white mask during the video conference.
Therefore, although the document text provide supporting evidence about the claim but the
image is missing important context information. On the contrary, the sample in Table 2 presents
two images having low content overlap but the document image corresponds to its textual
content that supports the politician death information as presented in claim image. Thus, the
right image should be considered as supporting image and representative of same information
contextually with corresponded claim image.
      </p>
      <p>Relying on visual similarity analysis alone for multimodal fact verification is naturally prone
to false positives, because images related to branding and advertisements (e.g., the “breaking
news” image or a company’s logo) are often reused. This may cause erroneous detection when
there is no real connection between them other than the reuse of a generic image. The problem
becomes more complex with images exploited in disinformation on social media.</p>
      <p>Our work in this competition is in response to current online misinformation multimodal
In the demise of Union Minister Ram Vilas Paswan,
the nation has lost a visionary leader. He was
among the most active and longest-serving
members of parliament...</p>
      <p>... President Ram Nath Kovind said on Wednesday,
... Addressing the fourth annual convocation of the
Jawaharlal Nehru University, he said said Indian
scholars of today ...</p>
      <p>Prime Minister Narendra Modi holds a meeting via
video-conferencing with the Chief Ministers over
#COVID19...</p>
      <p>... Prime Minister Narendra Modi on Saturday held
a video conference with ... showed Modi wearing a
white mask during the interaction ...
issue and has focused on solving the above challenges. Two diferent algorithms are designed
for the task that is framed as a multimodal entailment prediction problem following two
diferent frameworks, including an ensemble learning and an end-to-end attention network.
The ensemble model approach is implemented with a decision tree classifier that combines
predictions of two uni-modal models with a few data-specific heuristic features. Two uni-modal
models are implemented including a 3-way text entailment model based on a State-of-the-Art
(SoTA) pre-trained transformer language architectures fine-tuned on the task dataset, and a
pre-trained CNN model (ResNet-50) for image similarity. A SoTA multimodal attention network
for 5-way end-to-end entailment classification is implemented as an alternative solution in
attempt to infer combinatorial entailment relation by combining representation of language and
vision. Globe-level multimodal interactions are modeled with a popular multi-branch attention
network framework in order to fuse multimodal information. Strong baselines are implemented
for both 3-way and 5-way text entailment models to prove the advantage of our proposed
methods. Exploratory data analysis and bias test experiments are conducted to understand the
potential data issues and present the challenge of creating high-quality multimodal datasets
for the real-world problem. Best results from the ensemble model were submitted for the
competition.</p>
      <p>In the remainder of this paper, we firstly present a brief overview of related work (Section 2),
then task definition and our proposed methods in details (Section 3) followed by experiments
on the task dataset (Section 5). Exploratory data analysis is elaborated in Section 4. Finally, the
results discussion (including 3-way models and 5-way models) and conclusion are provided in
Sections 6 and 7 respectively.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Text Entailment Recognising Textual Entailment (RTE) is earliest and most related work to our
Factify challenge that aims to determine an inferential relationship between natural language
hypothesis and premise. On the basis of a given sentence pair, the task is to predict 3-way labels
including Support, Refute or NotEnoughInfo. Well-known shared tasks include FEVER [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and
SCIVER [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which advanced RTE research for claim validation in recent years. This line of
work performs diferent forms of evidence retrieval and then applies claim validation based on
that evidence. In contract, evidence retrieval is not required in the Factify task (although the
practice of sentence retrieval [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ] as a classic NLI problem for long document text in Factify
data can be considered as good practice and applicable). Stance detection is another direction of
work supported by shared tasks such as UKP Snopes [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], Semeval-2017 Rumoureval [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]), and
has also been exploited for RTE by retrieving texts relevant to a claim or story, determining the
stance of those text afterwards so as to ultimately predict the veracity of a given claim. The
common practice of RTE for claim verification [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is also incorporated in our ensemble model
(as one of the proposed solutions) and treated as a three-way text classification task on text data.
Sentence retrieval for evidence aggregation and stance detection are not exploited in this work.
      </p>
      <p>
        Multi/cross-modal representation learning In the field of multimodal reasoning and
matching, the success of attention mechanism in the NLP community motivated computer
vision techniques to shift from traditional twin network (typically with Siamese nets[
        <xref ref-type="bibr" rid="ref19 ref20 ref21">19, 20, 21</xref>
        ])
to pre-train models in multimodal settings for wide range of downstream tasks, such as visual
question answering (VQA), visual reasoning and image captioning. Similar to BERT[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], the
recent approach is to use a single transformer architecture to jointly encode text and image such
as VisualBERT [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], Uniter [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] and VL-BERT [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Alternatively, ViLBERT [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] and LXMERT
[
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] introduced the two-stream architecture, where two transformers are applied to images
and text independently, which is fused by a third transformer in a later stage. These models
typically rely on region-based image features extracted by pre-trained object detectors based
on commonly used two-staged detectors (typically Faster R-CNN model[
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] or its extension
Mask-RCNN [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]), or single-stage detectors (typically SSD and YOLO V3 [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]) or anchor-free
detectors(e.g., [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]). Another directions are patch embedding[
        <xref ref-type="bibr" rid="ref32 ref33 ref34 ref35 ref36">32, 33, 34, 35, 36</xref>
        ]. This direction of
work directly operates on patches (as a sequence of tokens with fixed length). Image patches and
text token embeddings are fed into a transformer or self-attention model to learn fused
crossmodal attention. The great progress of these recently developed models can be witnessed on the
leader boards of various tasks without using ensembling such as VQA, GAQ[
        <xref ref-type="bibr" rid="ref37">37</xref>
        ], NLVR2 [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ],
which can mainly be attributed to the availability of large scale weakly correlated multimodal
data (typically captioned images or video clips and accompanying subtitles [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]) that can be
utilised to learn cross-modal representation by contrastive learning [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ]. However, existing
pretrained models use mostly scene-limited image-text pairs with short and relatively simple
descriptive captions for images, while ignoring richer uni-modal text data and domain-specific
information. This leads to the dificulties in comprehending long paragraphs than short text[
        <xref ref-type="bibr" rid="ref41">41</xref>
        ].
Thus, most such task (e.g., VQA, VAC, image retrieval) still need additional fusion layer to model
interaction between visual and linguistic content. Moreover, limited ground truth information
forces many tasks to use evaluation metrics based on binary relevance. Diferent from most of
current cross-modal reasoning tasks, our work aims to model long sequence text and images
for claim verification. In contrast to these multimodal architectures, we utilize the individual
components from uni-modal pre-trained architectures. The equivalent architecture is employed
by [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ] for image-text pair interaction, however, we exploited richer cross-modal interaction
among vision and text pairs. Inspired by the practice in [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ], a stacked attention mechanism
is exploited in our solution for cross-modal matching by inferring the latent language-vision
alignments at a global level. Recent advance in fine-grained cross-modal representation learning
approaches for region-word correspondence are not exploited in this work.
      </p>
      <p>
        Relevance matching technique Relevance matching (RM) is the core problem of
information retrieval (IR) and has also been applied for the detecting the entailment relation[
        <xref ref-type="bibr" rid="ref44 ref45">44, 45</xref>
        ] by
computing the best alignment of hypothesis to premise based on local and global interactions.
Vo and Lee [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ] exploited a neural ranking model using textual and visual modalities to match
multimodal claim with fact-checked information. Their model unifies textual and visual
interaction between a claim and a collection of candidate articles, while Factify task aims to match a
claim with one given candidate document. In our proposed solution, we extended the matching
module introduced in Vo and Lee [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ] in order to better handle text with vary length.
      </p>
      <p>
        Visual Entailment Visual Entailment (VE) [
        <xref ref-type="bibr" rid="ref47">47</xref>
        ] is a variant of traditional RTE task that
consists of image-sentence pairs whereby a premise is defined by an image, rather than a natural
language sentence. The problem that VE is trying to solve is to reason about the relationship
between an image as premise P and a text as hypothesis H. This is diferent from
Factify task that aims to reason about the multimodal relationship between a hypothesis and
premise pair of both textual and visual content with respected to five categories. Moreover, the
premise text is of vary lengths rather than short hypothesis sentences in SNLI-VE dataset.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <sec id="sec-3-1">
        <title>3.1. Problem Statement</title>
        <p>We frame the Factify task as a problem of multimodal entailment, which is to reason about the
relationship of a multimodal claim as hypothesis and a multimodal document as premise.</p>
        <p>Specifically, given a multimodal hypothesis (e.g. tweet) denoted by  =  +  and a
document (typically one or more fact-checking articles) denoted by  =  + , both
of which contain one image and a text, we aim to derive a function  (, ) that infers their
entailment of five categories ( "Support_Multimodal", "Support_Text", "Insuficient_Multimodal" ,
"Insuficient_Text" , "Refute"). The label assignment is based on the relationship conveyed by
(, ),
• Support_Multimodal holds if there is enough evidence in  to conclude that  is
true and  is relevant to  and  in the same information context,
• Support_Text holds if there is enough evidence in  to conclude that  is true but
 is irrelevant to  and does not provide supplemental information for ,
• Insuficient_Multimodal holds if the evidence in  is insuficient to draw a
conclusion about  but  is relevant to  and  in the same information
context,
• Insuficient_Text holds if the evidence in  is insuficient to draw a conclusion about
 and  is irrelevant to  and does not provide supplemental information
for ,
• otherwise, the relationship is Refute, implying that there is enough evidence in  to
conclude that  is false and  is irrelevant to Q of both visual and text content.</p>
        <sec id="sec-3-1-1">
          <title>Additional details of the task definition can be referred in [12].</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. 3-way Text Entailment</title>
        <p>Recognizing entailment in natural language is a straightforward application for fact verification.
In this section, we aim to study how well a SoTA textual entailment model can be fine-tuned on
the textual data pairs in Factify data set and then used in a three-way RTE task. This allows us
to further assess and benchmark our proposed solution of combining two uni-modal models
prediction into an ensemble model for final 5-way multimodal entailment prediction.</p>
        <p>
          Pretrained transformer fine-tuning : Pretrained transformer models [
          <xref ref-type="bibr" rid="ref22 ref48 ref49">22, 48, 49</xref>
          ] have
become the de facto models for a wide range of NLP tasks and provide SoTA results for RTE
tasks[
          <xref ref-type="bibr" rid="ref50">50</xref>
          ]. More specifically, in this work, we attempt to investigate how a pretrained model can
learn to conduct RTE on the given dataset without utilizing hidden dataset bias, how eficiently
it can learn and generalise on the test set. The problem is diferent from existing benchmark
datasets (MultiNLI[
          <xref ref-type="bibr" rid="ref51">51</xref>
          ], SNLI[
          <xref ref-type="bibr" rid="ref52">52</xref>
          ], Adversarial-NLI[
          <xref ref-type="bibr" rid="ref53">53</xref>
          ]) mostly consisting of short sentences.
Fact verification task requires to apply natural language inference (NLI) on long paragraphs
or articles. As mentioned above, to simplify the problem, the practice of evidence sentence
selection [
          <xref ref-type="bibr" rid="ref54">54</xref>
          ] that are commonly adopted in SoTA evidence-aware fact checking system are
not included in our study. Thus, supported maximum sequence length and optimum document
context size are two of key factors to be considered.
        </p>
        <p>
          Transformer-based models, such as BERT, have been one of the most successful deep learning
models for NLP, but one of their core limitations is the quadratic dependency (mainly in
terms of memory) on the sequence length due to their full attention mechanism. For that
reason, Google’s BigBird model is selected in this study, which is one of the most successful
long-sequence transformers that supports sequence length of 4000 tokens. To deal with the
limitations that other models face, BigBird uses a sparse attention mechanism that reduces the
quadratic dependency to linear[
          <xref ref-type="bibr" rid="ref55">55</xref>
          ]. That means that it can handle sequences of length up to 8x
of what was previously possible using similar hardware. As a consequence of the capability to
handle longer context, these models drastically improve performance on various NLP tasks such
as claim verification for long sequences[
          <xref ref-type="bibr" rid="ref56">56</xref>
          ]. The model is fine-tuned as pair-wise classification
task on re-purposed data samples converted from 5-way categories to three-way categories.
Formally, given a pair of text sequence (denoted as  and ) from  and , we aim
to fine-tune a pre-trained model to map any pair of (, ) to a label , that determines the
pre-defined textual entailment relationship ("support", "refute", "insuficient") between 
and . The problem is treated as a supervised learning task and a set of training examples
in the form of (, , ) is given. [ ] is added as a separator between the two inputs in
pre-processing and a softmax classifier is added on top of the [] token in the last layer to
make predictions.
        </p>
        <p>
          MatchPyramid: In contrary to computationally expensive transformer models, we propose
a simple baseline text entailment model with relevance matching technique. Intuitively, an
article may be relevant to a claim if they have overlapping words or similar words. A strong
interaction model, known as MatchPyramid[
          <xref ref-type="bibr" rid="ref44 ref57 ref58">57, 58, 59, 44</xref>
          ], is adopted in our baseline model.
This technique leverages a similarity matrix plotted from the similarity between a pair of
sequences and a CNN with pooling strategies to extract hierarchical interaction patterns. CNNs
strength of modeling spatial (position-aware) correlation is utilised for vary length among data.
This deep neural network enables us to find the matching patterns between a piece of short text
in claim and a long document, which is critical to problems in our task. Multiple layers of 2D
convolutions and pooling are used followed by a feed-forward network. [59] experimented with
four similarity functions (indicator function, dot product, cosine and gaussian kernel) and found
that using embedding, gaussian kernel similarity function is better than others. A proper kernel
size will get more information and generate a better result. Pooling size are used to reduce the
dimension of the feature maps, and to pick out the most important information for the latter
layers. Especially in ac-hoc retrieval task, documents often contain hundreds of words, but most
of them might be background words (exactly same problem in our task). So the pooling layers
might be even more important to distill the useful information from the noisy background.
        </p>
        <p>
          Inspired by [
          <xref ref-type="bibr" rid="ref46 ref47">47, 46</xref>
          ],  and  are pre-processed and embedded with pre-trained word
embedding model. The embeddings are used to initialise the network. Self-attention layer is
applied to embeddings of two inputs since the premise document () in Factify can be very
long and complex. Intuitively, self-attention can be helpful to capture structural information
and focus on important keywords particularly in long distance dependencies. Specifically, the
scaled dot product (SDP) attention [60] is used to capture this hidden information:  =
 ( √ ) , _ = (), _ = (), where  here
represents  or ,  denotes the embedding dimension,  ∈ R×  is the claim text ()
feature matrix and  ∈ R×  is the document text () feature matrix.  and  is
sequence length (of embedding) in matrix  and .  ∈ R×  computes resulting
attention mask for  and  respectively.
        </p>
        <p>Subsequently, the self-attended  and  feature matrix is then fed into a GRU layer
in order to obtain contextual representation. Finally, dot product function is applied to build
similarity matrix between two GRU output sequences for MatchPyramid model in attempt to
measure the semantic relevance more accurately between claim and document with higher level
of word semantics. The output of MatchPyramid is flattened into a 1D vector and fed into a
fully connected multi-layer perceptron (MLP), followed by the Softmax model to perform 3-way
classification.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. 5-way Ensemble Model</title>
        <p>One way to utilize multiple models is to combine uni-modal model predictions in an ensemble
classifier to predict final labels. As elaborated in 3.2, 3-way textual entailment model is helpful
in distinguishing three-way entailment relationship based on linguistic and semantic clues
between  and . To address multimodal entailment (as defined in this task 3.1), a simple
relatedness measurement for visual content between  and  is adopted based on
image pairwise similarity as a proxy of their visual entailment computed with a pre-trained
CNN model (ResNet) in our approach. The same as text entailment, this is based on hypothesis
and salient correlation patterns observed in this dataset that an article is relevant to a claim if
the article contains images similar to the claim’s images.</p>
        <p>Hence, an ensemble approach is proposed to combine textual entailment, visual relatedness
measurement and additional data specific features. More specifically, the proposed ensemble
model utilizes a basic decision tree classifier with the following feature encoding to provide
end-to-end five categories classification as depicted in Fig. 1.</p>
        <p>• Length of Text and OCR: four features of text length between (, ) are employed
representing the length of , (), , and () respectively. OCR
text are measured and used as independent features here (ref. 4.4).
• Text Entailment: two features consisting of a numeric representations (0, 1, 2) of text
entailment prediction (i.e., "insuficient", "support", "refute") along with the corresponding
probabilities (Sec. 3.2)
• Image Similarity: the pairwise cosine similarity score between  and  is
computed based on the features obtained by pre-trained ResNet-50 model,
• Image Domain: two features encoded with one-hot-encoding scheme on the source domain
name for  and  (ref. 4.5).</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. 5-way Multimodal Entailment</title>
        <p>
          We consider how to obtain attended multimodal information that can efectively capture
consistency and integrity of multimedia content between  and . Inspired by current advance
in attention techniques [
          <xref ref-type="bibr" rid="ref46 ref47">60, 61, 46, 47</xref>
          ], we apply multiple attention mechanisms to learn the
multimodal interaction between pairs of visual and textual content. Instead of local alignment
approaches that model visual objects and textual words, we focus on global alignment based
methods in this study that aim to map whole image and sentences into joint semantic space.
A popular framework to model the multimodal relationship is using a multi-branch attention
network, typically one branch projects the image and another models the text. The similarity
is measured by dot product on the normalised feature vectors. The extended MatchPyramid
(elaborated in section 3.2) is applied to model high-level relevance between text pairs.
        </p>
        <p>In general, our end-to-end multimodal entailment architecture consists of embedding layer,
text matching layer, multimodal matching layer, and classification layer . Formally, as input
representations, Images pairs ( and ) are represented as the top layer (before softmax)
of a pre-trained convolutional network and text pairs ( and ) are mapped into a vector
 ∈ R by a fixed word embedding layer initialised by Glove embeddings.  denote as word
embedding dimension (e.g.,  set to 50 for Glove-50). There is no restriction on the choice of the
image encoder but the pre-trained ResNet-50 model is used in our experiments because of its
simplicity.</p>
        <p>In embedding layer, Let  be the dimension of an image visual vector (i.e.,  = 2049 for
ResNet-50) and Let  and  be the number of words in  and  respectively. Let  ∈ R
and  ∈ R×  be claim image embedding vector and word embedding matrix, respectively.
Likewise, let  ∈ R and  ∈ R×  be document image embedding vector and word embedding
matrix, respectively. Each 2048-dim feature vector ( and ) is fed into a (non-trainable) linear
layer to reduce the visual features from 2048 to 512 dimensional vector space in this work. For
the embeddings of the text pair, self-attention (SDP) is applied (as specified in section 3.2 for
both  and  before feeding into a separate GRU layer to obtain both of their context sequence
representation (_ ∈ R×  and _ ∈ R× ) and corresponding global representation (i.e.,
ifnal state), denoted by _ ∈ R and _ ∈ R.  denotes the GRU output dimension.</p>
        <p>In subsequent text matching layer, the same pipeline (as specified above for extended
MatchPyramid) is applied in attempt to model the high level relevance between article content ()
to claim text () based on contextual word embedding interactions. Interaction feature matrix
is calculated by the matrix dot product between _ and _, which is then applied by deep
hierarchical convolution layers in the MatchPyramid model to extract aggregated similarity
feature vector __ ∈ R and  is the output dimension of flattened feature maps. The
high-level matching patterns are then fed into a multi-layer perceptron (MLP) with dropout to
produce the final matching score with learnable weights.</p>
        <p>
          Multimodal latent interaction features are derived in multimodal matching layer which mainly
consists of visual matching layer and cross-modal attention layer. Fundamentally, multimodal
matching layer aims to find potential relevance of document visual vector ( ) to claim vectors of
either visual or text context or both ( and _), and are hence critical for predicting multimodal
entailment relations for target claim. The same as the process for text embeddings, our visual
matching layer utilises self-attention (SDP) for image pairs embeddings ( and ) in attempt to
capture important features in each image. Then, a visual similarity feature (, = ⃦⃦⃦ ⃦⃦⃦⃗ · ⃦⃦⃦ ⃦⃦⃦⃗ )
is computed by applying dot product to the two saliency guided image embeddings with 2
norm. This practice follows [
          <xref ref-type="bibr" rid="ref47">62, 63, 47</xref>
          ], which is a simple yet very eficient SoTA technique in
handling variations in image illumination, view points, texture and season. It also links to feature
whitening, linear discrimination analysis and image saliency. In addition, a separate image
1
euclidean similarity feature (, = ⃦ ⃦ ) is computed in an attempt to measure
(1 +⃦⃦  − ⃦⃦ )
potential adversarial images, same people in diferent scene, cropped image, etc [64, 65].
        </p>
        <p>In cross-modal attention layer, multiple attention mechanisms are applied, aiming to learn to
ifnd and attend to the maximum relevant elements on both feature importance and relational
mapping among each self-attended visual and content vectors between claim and document.
Specifically, text-image interaction feature between document image and claim text is computed
,
using same SDP attention: _ = (, _). Likewise, document image and
document text interaction is computed via ,</p>
        <p>_ = (, _). Note that due to
the mismatched feature space between vision and content, GRU is employed initially to align
image features and the text features in order to perform cross-modal learning. Finally, resulting
multimodal features  = (, ⊕ , ⊕ ,_ ⊕ ,_) are obtained from the
merge (with concatenation) of the two intermediate layers output before feeding into a MLP
with dropout to generate fused higher level features.</p>
        <p>Finally, in the classification layer , the outputs of two MLP layers are merged along with
corresponding hypothesis multimodal representation () into a combined representation
with batch normalisation.  is the output of a separate MLP layer for merged
(concatenation) _ and normalised _ ( ∈ R+). Final representation are applied with dropout
regularization before feeding to a softmax layer to output the probabilities of five categories.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Factify Dataset</title>
      <sec id="sec-4-1">
        <title>4.1. Data statistics</title>
        <p>
          Five entailment categories are balanced in both train and validation data set. As mentioned
above, both claim (hypothesis) and document(premise) contains an image and a text of vary
length. Optical character recognition (OCR) text extracted from image are not counted separately
here and combined with corresponding claim and document text respectively. Thus, large claim
word size presented in the table is due to extracted OCR text. The data details for each set are
shown in Table 3. More details about the dataset and task details can be referred in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Word Overlaps distribution</title>
        <p>Word overlap is an important indication for modeling textual entailment as well as of potential
data bias. Naturally, when pairing claims to evidence sentences, the word overlap ratio will
be higher on average for claims with their supporting evidence. However, models relying on
word-overlap will perform poorly when dealing with complexity in the real world examples
(typically antonymous examples and adversarial attacks). In VITAMINC[66] and FEVER[67]
dataset, this bias is deliberately minimized in order to create challenging examples that require
sentence-pair inference and cannot be solved by simple word matching techniques. Here, the
word overlaps distribution per class in train and val set are presented in Table 4. The data
distribution indicates that evidential premise data in Factify have clearly high word overlap
ratio than other two categories of insuficient evidence.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Image Similarity distribution</title>
        <p>Image similarity is the most basic indicator of multimodal entailment. To empirically validate
the intuition of potential similarity correlation between  and  (as mentioned in 3.3)
in the dataset, image relatedness analysis is conducted in this section. Similar to the potential
bias from data overlapping, we compute image pairwise similarity distribution with embedding
space computed from pre-trained ResNet50 model over train/val set as presented in Table 5
and 6. As seen from the distribution over five categories, two text related entailment categories
have clearly lower pairwise image similarity that multimodal evidential entailment categories.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Text Length Distribution</title>
        <p>Text and OCR (text) length distributions between (, ) in the train set are presented in
Fig 2 and Fig 3. Clearly separable distribution patterns can be seen across five categories in
claim and document text and their corresponding OCR text. As shown in Fig 2, document text
length varies most for ’Support_Multimodal’ among other four entailment categories. The
document length in two insuficient categories share similar range and ’Refute’ category has
the least document length. The claim length distribution shows a clear bias of ’Refute’ examples
towards shorter claims. While the remaining classes present similar ranges, ’Insufient_Text’
and ’Support_Multimodal’ tend to include slightly shorter claims. In comparison, OCR text for
both claim and document in "Refute" category samples shows surprising longer length than
other four categories. Motivated by the observation, we adopted text lengths as features in our
ensemble model as illustrated in 3.3.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Image Domain Bias</title>
        <p>
          Source bias is one of the known and common problems in machine learning dataset [68] which
happens when most data samples are collected from the same source. This problem has several
links which mainly include selection bias, capture bias (bias happens due to particular data
collection methods), label bias and negative set bias. We are interested in probing potential
source bias in Factify datset. The potential bias in images domains over five categories brought
to our attention in data analysis. This is important since multimedia metadata have been proved
to be valuable information and signal for fact verification [
          <xref ref-type="bibr" rid="ref5">69, 5, 70</xref>
          ] in real-world application
such as domain/source credibility, detection of image manipulation and tampering. Image (link)
domains are extracted from all document samples of train set and distributions are computed
across five categories. As shown in Fig. 4, experiments show a surprisingly strong correlation
between image domains and each entailment categories in both claim and document. Motivated
by the correlation analysis, image domains are employed as features in our ensemble model as
illustrated in section 3.3.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments</title>
      <sec id="sec-5-1">
        <title>5.1. Experimental Setting</title>
        <p>To evaluate the performance of our baseline solutions, we use weighted average F1 for
benchmarking on validation set. All the experiments are implemented on a single NVIDIA A100 GPU
with up to 20 GiB RAM.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Hypothesis Only Test</title>
        <p>We conducted hypothesis only reliance test by using hypothesis only information to train a
model as baseline. This is a commonly adopted approach [71, 72] in SNLI/RTE to verify the
presence of data bias. The assumption is that without any premise information, this baseline is
supposed to make a random guess out of the five classes. We train two models with or without
images and test the resulting accuracy for each model on val set.</p>
        <p>
          Two models (Hypo and Hypo+) are implemented with similar architecture that
consists of a text processing component and/or ResNet embedding layer followed by two
fullyconnected (FC) layers. The text processing component is used to extract the text feature from
the given hypothesis. It firstly generates a sequence of word embeddings for the given claim
text. The embedding sequence is then fed into a GRU [73] to output the text context features of
dimension 300. The image processing component involves BGR to RGB conversion, resizing
images (to [
          <xref ref-type="bibr" rid="ref3">300, 300, 3</xref>
          ]), the feature extraction with ResNet50 with a linear layer projecting
pre-trained embeddings to 512 dimensional vector. The input and output dimensions of two FC
layers for text only models are [300, 300] and [
          <xref ref-type="bibr" rid="ref3">300, 3</xref>
          ] respectively. For text+image model, the
hidden layers dimensions are [300, 300] and [
          <xref ref-type="bibr" rid="ref3">300, 3</xref>
          ] respectively.
        </p>
        <p>Our experiments shows that the resulting accuracy and weighted F1 achieves same value in
both 0.60 and both 0.64 on val set for text and text+image models respectively, implying the
existence of bias in Factify dataset. The details are presented in results section. Our proposed
solutions outperform the two hypothesis only baselines.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. 3-way text entailment</title>
        <p>Transformer fine-tune settings: For the best entailment model, the pre-trained
BigBird model from Huggingface and the implementation for pair-wise classification
finetune was used. For our experiment the model was fine-tuned for 2 epochs, using the
AdamW optimizer with learning rate 2e-5 and epsilon 1e-8 with batch size 4.
Maximum sentence length was set to the mean length of the input texts namely, 1396
tokens. To train the 3-way entailment model, the 5-way data categories were converted to
3-way categories including "Support" ("Support_Multimodal"+"Support_Text"), "Refute",
Insuficient("Insuficient_Multimodal"+"Insuficient_Text"). OCR text from both  and  were
excluded.</p>
        <p>MatchPyramid baseline model settings: We use Glove embeddings with 50 dimension
(GloVe 6B 50d) for text input and GRU output dimension is set to 50. The number of CNN
layers is set to 2, each with kernel size 3 × 3, pooling size 5 × 10 and in valid mode (i.e., no
padding). ReLu activation is placed between all convolutional layers. Convolution channels
are set to 16 and 32 respectively. 2-layer MLP are set with hidden dimensions of 128 and 64
respectively. The maximum text length for  and  are set to 100 and 1000 respectively.
Limited experiments are conducted including content context size of claim and document, global
average pooling and convolution padding schemes.</p>
      </sec>
      <sec id="sec-5-4">
        <title>5.4. 5-way Ensemble Model</title>
        <p>The ensemble model is implemented using sklearn’s DecisionTreeClassifier class. Best
pretrained transformer ("BigBird") based text entailment classifier is adopted and pairwise image
similarity is computed based on ResNet-50. For image pre-processing and feature extraction,
same practice introduced in 5.2 is applied. One-hot encoding function provided in Scikit-learn
is utilised to converts two categorical features (i.e., URL domains of  and ) as a
one-hot numeric array learnt from train set. Text are pre-processed separately for BigBird
model and ensemble model. No pre-processing is applied for four text length features. For the
ensemble model training, we use ‘best’ split based on ‘gini’ impurity matrix as training criteria
and limit the number of layers to 8 to avoid overfitting.
5.5. 5-way Multimodal classification
5-way end-to-end Multimodal Entailment model Multimodal is implemented with Keras and
tensorflow(v2.4) with Adam optimiser with an adaptive learning scheduler. The initial learning
rate and weight decay are both set to 0.0001. Batch size is 32 and maximum number of training
epochs is set to 80. Optimal parameters and settings from MatchPyramid baseline model
experiments are applied. Checkpoint callback is used to save best model that achieves best validation
accuracy. ReLu activation is applied to all convolution layers and fully-connected layers. The
uniform He initialization ("he_uniform") is used for all ReLU layers. Same settings (layer size,
hidden dim, activation, etc) are applied for three separate MLP layers. Few parameters and
architectures are experimented including vary lengths of claim and document content, MLP layer size
(1-2), hidden layer dimensions of MLPs(64,256,512,768,1024), merge strategies (concatenation
and multiplication) of three MLPs output for classification layer. Ablation study is conducted by
removing individual sub-components including hypothesis MLP (), document crossmodal
interaction(,_), and document-claim crossmodal interaction(,_). The ablation
experiments show the efectiveness of full model architecture. Best model (as reported in result
6.2) is obtained at training epoch 9 and stopped at epoch 14 with optimal settings of the 3 MLPs
architecture, 1-layer MLP with dimension 256, MLPs outputs merged with concatenation, and
text input lengths of  and  with 100 and 1000 respectively.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Results and Discussion</title>
      <sec id="sec-6-1">
        <title>6.1. 3-way text entailment</title>
        <p>The results of the 3-way text entailment models are presented in Table 7. To validate our
model choice, we evaluate few SoTA pre-trained transformer models, including BERT, RoBerta,
BigBird and LongFormer. The best performing models are BigBird and LongFormer with the
overall winner being BigBird because of the slightly better results and smaller input context
size required (1396 vs 1484 respectively).</p>
        <p>
          For the architecture of extended MatchPyramid baseline, we have experimented with diferent
parameters such as longer context length in  (including 1500, 2000, 3000), Glove model
with 300 dimension, larger GRU output dimension of 300, various pooling size ([
          <xref ref-type="bibr" rid="ref10 ref3">3, 10</xref>
          ]), etc,
none of these attempts provide major improvement. Overall, our baseline implementation
with self-attention and Glove-50d based contextual representation learning achieve optimal
performance, which is competitive to large transformer model based approaches as presented
in Table 7.
        </p>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. 5-way classification</title>
        <p>
          The results of 5-way  and   model on val set are presented in Table
8. Four of our baseline methods outperform all baseline models proposed by task organiser as
reported in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The result of best baseline model (Multimodal) in Factify data paper
is presented in the table 1. Unsurprisingly, our ensemble model achieved best results on val
set with 0.77 F1 which is 8% higher than the results of   model. The experiment
results demonstrate a large performance gain with the large pre-trained text entailment model
which works efectively on long paragraphs and contribute the most towards predicting final
5-way categories. This is particularly obvious for "Refute" label, the samples in which are mostly
relying on text based inference. It is not surprising that the useful features incorporated from
the heuristics and bias learned from the dataset have proved to be efective for this multimodal
prediction task.
        </p>
        <p>It was found that diferentiating between "Insuficient_Multimodal" and "Support_Text" or
between "Insuficient_Text" and "Support_Multimodal" was the most challenging task without
relying data specific features. In other words, when a sample contains supporting document</p>
        <sec id="sec-6-2-1">
          <title>1the corresponding class-wise performance are not provided by organisers</title>
          <p>text for the claim but the image is irrelevant, our model has low confidence in predicting the
label as "Support_Text" or "Insuficient_Multimodal" . Likewise, when document image is relevant
to claim image about same information context but document text is irrelevant, our model
has low confidence in predicting the correct label. The decision is highly dependent on the
annotation bias. From all the labels, the "Refute" label is the most distinguishable category and
highly dependent on the text. The performance is highly consistent among all our models and
participant systems in this competition (as seen in leaderboard 10). This is possibly mainly
attributed to the articles samples selected from very few fact checking sources that have highly
diferentiable linguistic clues (typically high frequent negative words used and same verdict
sentences frequently appeared in this category such as "The claim is false").</p>
        </sec>
      </sec>
      <sec id="sec-6-3">
        <title>6.3. Competition Result</title>
        <p>Final test set results and competition leaderboard are presented in Table 9 and 10 respectively.
Our best model ("Ensemble") outperform all competition systems and best baseline models [74].
Test result of  model achieved 0.77 avg. F1 which is the same as the result on val set
and 10% higher than the result of  .</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>We described our participation in the Multimodal Fact Verification Factify Challenge with
the implementation of two proposed baseline solutions including an ensemble model and an
end-to-end multimodal entailment model. Ensemble model based system outperform the
endto-end model on val set and test set. The best performing model in this competition combines
results of 3-way text entailment classifier, visual similarity with a pre-trained CNN model and
heuristics learnt from the dataset. Multimodal fusion technique is explored in this paper to
model interaction between diferent modalities (i.e., text and image) in claim and document pairs
and combines information from them to learn multimodal entailment relationship end-to-end.
We found that multimodal entailment based system sufer from overfitting. Apart from limited
train size and identified data bias, our experiments suggest that fine-grained image and text
interaction model need to be explored further.</p>
      <p>We found that the ambiguous labels in Factify dataset undermines the performance of
our deep learning architecture. Creating a dataset for a complex real-word multimodal NLP
problems particularly natural language inference as multimodal verification has raised emergent
challenges [75, 76] and indeed a cumbersome task, and we appreciate the work by the Factify
organizers, yet, a more elaborate and unbiased dataset along with well defined annotation
criterion should make this dataset more suitable for benchmark. More efort is required to tackle
the dataset challenge of minimising hypotheses from human annotators and make dataset better
reflecting real-world challenges. As an emergent research field, we hope our extensive data
analysis and proposed baseline solutions can inspire further work.
[59] L. Pang, Y. Lan, J. Guo, J. Xu, X. Cheng, A study of matchpyramid models on ad-hoc
retrieval, arXiv preprint arXiv:1606.04648 (2016).
[60] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, I.
Polosukhin, Attention is all you need, in: Advances in neural information processing systems,
2017, pp. 5998–6008.
[61] Z. Li, Y. Li, H. Lu, Improve image captioning by self-attention, in: International Conference
on Neural Information Processing, Springer, 2019, pp. 91–98.
[62] T. Malisiewicz, A. Gupta, A. A. Efros, Ensemble of exemplar-svms for object detection and
beyond, in: 2011 International conference on computer vision, IEEE, 2011, pp. 89–96.
[63] M. Gharbi, T. Malisiewicz, S. Paris, F. Durand, A gaussian approximation of feature space
for fast image similarity (2012).
[64] L. Wang, Y. Zhang, J. Feng, On the euclidean distance of images, IEEE transactions on
pattern analysis and machine intelligence 27 (2005) 1334–1339.
[65] A. Pedraza, O. Deniz, G. Bueno, Really natural adversarial examples, International Journal
of Machine Learning and Cybernetics (2021) 1–13.
[66] T. Schuster, A. Fisch, R. Barzilay, Get your vitamin c! robust fact verification with
contrastive evidence, arXiv preprint arXiv:2103.08541 (2021).
[67] J. Thorne, A. Vlachos, C. Christodoulopoulos, A. Mittal, Evaluating adversarial attacks
against multiple fact verification systems, Association for Computational Linguistics, 2020.
[68] A. Torralba, A. A. Efros, Unbiased look at dataset bias, in: CVPR 2011, IEEE, 2011, pp.</p>
      <p>1521–1528.
[69] B.-C. Chen, L. S. Davis, Deep representation learning for metadata verification, in: 2019
IEEE Winter Applications of Computer Vision Workshops (WACVW), IEEE, 2019, pp.
73–82.
[70] T. Prabhakar, A. Gupta, K. Nadig, D. George, Check mate: Prioritizing user generated
multimedia content for fact-checking, in: Proceedings of the International AAAI Conference
on Web and Social Media, volume 15, 2021, pp. 1025–1033.
[71] S. Gururangan, S. Swayamdipta, O. Levy, R. Schwartz, S. R. Bowman, N. A. Smith,
Annotation artifacts in natural language inference data, arXiv preprint arXiv:1803.02324
(2018).
[72] H. T. Vu, C. Greco, A. Erofeeva, S. Jafaritazehjan, G. Linders, M. Tanti, A. Testoni,
R. Bernardi, A. Gatt, Grounded textual entailment, arXiv preprint arXiv:1806.05645
(2018).
[73] J. Chung, C. Gulcehre, K. Cho, Y. Bengio, Empirical evaluation of gated recurrent neural
networks on sequence modeling, arXiv preprint arXiv:1412.3555 (2014).
[74] P. Patwa, S. Mishra, S. Suryavardan, A. Bhaskar, P. Chopra, A. Reganti, A. Das,
T. Chakraborty, A. Sheth, A. Ekbal, C. Ahuja, Benchmarking multi-modal entailment for
fact verification, in: Proceedings of De-Factify: Workshop on Multimodal Fact Checking
and Hate Speech Detection, CEUR, 2022.
[75] R. Le Bras, S. Swayamdipta, C. Bhagavatula, R. Zellers, M. Peters, A. Sabharwal, Y. Choi,
Adversarial filters of dataset biases, in: International Conference on Machine Learning,
PMLR, 2020, pp. 1078–1088.
[76] S. Sharma, M. Dey, K. Sinha, Evaluating gender bias in natural language inference, arXiv
preprint arXiv:2105.05541 (2021).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Abumansour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zubiaga</surname>
          </string-name>
          ,
          <source>Automated fact-checking: A survey, Language and Linguistics Compass</source>
          <volume>15</volume>
          (
          <year>2021</year>
          )
          <article-title>e12438</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kazemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Garimella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gafney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Hale</surname>
          </string-name>
          ,
          <article-title>Claim matching beyond english to scale global fact-checking</article-title>
          ,
          <source>arXiv preprint arXiv:2106.00853</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.-H.</given-names>
            <surname>Park</surname>
          </string-name>
          , Y.-S. Seo,
          <article-title>Fake news analysis modeling using quote retweet</article-title>
          ,
          <source>Electronics</source>
          <volume>8</volume>
          (
          <year>2019</year>
          )
          <fpage>1377</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Nakamura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Levy</surname>
          </string-name>
          , W. Y. Wang, r/fakeddit:
          <article-title>A new multimodal benchmark dataset for ifne-grained fake news detection</article-title>
          , arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>03854</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Elhadad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. F.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gebali</surname>
          </string-name>
          ,
          <source>Detecting misleading information on covid-19, Ieee Access</source>
          <volume>8</volume>
          (
          <year>2020</year>
          )
          <fpage>165201</fpage>
          -
          <lpage>165215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cresci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dimitrov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. D. S.</given-names>
            <surname>Martino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Firooz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <article-title>A survey on multimodal disinformation detection</article-title>
          ,
          <source>arXiv preprint arXiv:2103.12541</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <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 dualinconsistency network for multi-modal rumor detection</article-title>
          ,
          <source>in: Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>1412</fpage>
          -
          <lpage>1423</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>E.</given-names>
            <surname>Müller-Budack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Theiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Diering</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Idahl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hakimov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ewerth</surname>
          </string-name>
          ,
          <article-title>Multimodal news analytics using measures of cross-modal entity and context consistency</article-title>
          ,
          <source>International Journal of Multimedia Information Retrieval</source>
          <volume>10</volume>
          (
          <year>2021</year>
          )
          <fpage>111</fpage>
          -
          <lpage>125</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.-M.</given-names>
            <surname>Moosavi-Dezfooli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fawzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Frossard</surname>
          </string-name>
          ,
          <article-title>Deepfool: a simple and accurate method to fool deep neural networks</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>2574</fpage>
          -
          <lpage>2582</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>C.-A. Deledalle</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Denis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Poggi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Tupin</surname>
          </string-name>
          , L. Verdoliva,
          <article-title>Exploiting patch similarity for sar image processing: The nonlocal paradigm</article-title>
          ,
          <source>IEEE Signal Processing Magazine</source>
          <volume>31</volume>
          (
          <year>2014</year>
          )
          <fpage>69</fpage>
          -
          <lpage>78</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
            <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>S.</given-names>
          </string-name>
          <string-name>
            <surname>Amit</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>Factify: A multi-modal fact verification dataset</article-title>
          ,
          <source>in: Proceedings of the First Workshop on Multimodal Fact-Checking and Hate</source>
          Speech
          <string-name>
            <surname>Detection (DE-FACTIFY)</surname>
          </string-name>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <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>C.</given-names>
            <surname>Christodoulopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mittal</surname>
          </string-name>
          ,
          <article-title>Fever: a large-scale dataset for fact extraction and verification</article-title>
          , arXiv preprint arXiv:
          <year>1803</year>
          .
          <volume>05355</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Wadden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. van Zuylen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hajishirzi</surname>
          </string-name>
          ,
          <article-title>Fact or ifction: Verifying scientific claims</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>14974</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <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="ref16">
        <mixed-citation>
          [16]
          <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="ref17">
        <mixed-citation>
          [17]
          <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="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Derczynski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Liakata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Procter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. W. S.</given-names>
            <surname>Hoi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zubiaga</surname>
          </string-name>
          , Semeval
          <article-title>-2017 task 8: Rumoureval: Determining rumour veracity and support for rumours</article-title>
          ,
          <source>arXiv preprint arXiv:1704.05972</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Joty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Wang, Look, imagine and match: Improving textual-visual cross-modal retrieval with generative models</article-title>
          ,
          <source>in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>7181</fpage>
          -
          <lpage>7189</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <article-title>Joint global and co-attentive representation learning for image-sentence retrieval</article-title>
          ,
          <source>in: Proceedings of the 26th ACM international conference on Multimedia</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1398</fpage>
          -
          <lpage>1406</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-W.</given-names>
            <surname>Ha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Dual attention networks for multimodal reasoning and matching</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>299</fpage>
          -
          <lpage>307</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L. H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yatskar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-J. Hsieh</surname>
            ,
            <given-names>K.-W.</given-names>
          </string-name>
          <string-name>
            <surname>Chang</surname>
          </string-name>
          ,
          <article-title>Visualbert: A simple and performant baseline for vision and language</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>03557</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Y.-C. Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>El Kholy</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Ahmed</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Gan</surname>
          </string-name>
          , Y. Cheng, J. Liu,
          <article-title>Uniter: Learning universal image-text representations (</article-title>
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>W.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dai</surname>
          </string-name>
          , Vl-bert:
          <article-title>Pre-training of generic visuallinguistic representations</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>08530</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>02265</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>H.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <article-title>Lxmert: Learning cross-modality encoder representations from transformers</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>07490</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <surname>Faster</surname>
          </string-name>
          r-cnn:
          <article-title>Towards real-time object detection with region proposal networks</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>28</volume>
          (
          <year>2015</year>
          )
          <fpage>91</fpage>
          -
          <lpage>99</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          , G. Gkioxari,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dollár</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <surname>Mask</surname>
          </string-name>
          r-cnn,
          <source>in: Proceedings of the IEEE international conference on computer vision</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>2961</fpage>
          -
          <lpage>2969</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>P.</given-names>
            <surname>Adarsh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rathi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Yolo v3-tiny: Object detection and recognition using one stage improved model</article-title>
          ,
          <source>in: 2020 6th International Conference on Advanced Computing and Communication Systems (ICACCS)</source>
          , IEEE,
          <year>2020</year>
          , pp.
          <fpage>687</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>G.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Dang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          , et al.,
          <article-title>Pp-picodet: A better real-time object detector on mobile devices</article-title>
          ,
          <source>arXiv preprint arXiv:2111.00902</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>I.</given-names>
            <surname>Tolstikhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Houlsby</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kolesnikov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Beyer</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>J.</given-names>
            <surname>Yung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Steiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Keysers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          , et al.,
          <article-title>Mlp-mixer: An all-mlp architecture for vision</article-title>
          ,
          <source>arXiv preprint arXiv:2105.01601</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <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="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. E.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <article-title>Tokensto-token vit: Training vision transformers from scratch on imagenet</article-title>
          ,
          <source>arXiv preprint arXiv:2101.11986</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <article-title>Conditional positional encodings for vision transformers</article-title>
          ,
          <source>arXiv preprint arXiv:2102.10882</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>A survey of visual transformers</article-title>
          ,
          <source>arXiv preprint arXiv:2111.06091</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Hudson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Gqa: A new dataset for real-world visual reasoning and compositional question answering</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>6700</fpage>
          -
          <lpage>6709</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>A.</given-names>
            <surname>Suhr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , I. Zhang, H. Bai,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Artzi</surname>
          </string-name>
          ,
          <article-title>A corpus for reasoning about natural language grounded in photographs</article-title>
          , arXiv preprint arXiv:
          <year>1811</year>
          .
          <volume>00491</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>K.</given-names>
            <surname>Desai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Kaul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. T.</given-names>
            <surname>Aysola</surname>
          </string-name>
          , J. Johnson, Redcaps:
          <article-title>Web-curated image-text data created by the people, for the people</article-title>
          ,
          <source>in: 35th Conference on Neural Information Processing Systems (NeurIPS</source>
          <year>2021</year>
          )
          <article-title>Track on Datasets and Benchmarks</article-title>
          .,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hadsell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chopra</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <article-title>LeCun, Dimensionality reduction by learning an invariant mapping</article-title>
          ,
          <source>in: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)</source>
          , volume
          <volume>2</volume>
          , IEEE,
          <year>2006</year>
          , pp.
          <fpage>1735</fpage>
          -
          <lpage>1742</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>F.</given-names>
            <surname>Schneider</surname>
          </string-name>
          , Ö. Alaçam,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Biemann</surname>
          </string-name>
          ,
          <article-title>Towards multi-modal text-image retrieval to improve human reading</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Student Research Workshop</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhooshan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Firooz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Testuggine</surname>
          </string-name>
          ,
          <article-title>Supervised multimodal bitransformers for classifying images and text</article-title>
          , arXiv preprint arXiv:
          <year>1909</year>
          .
          <volume>02950</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <surname>K.-H. Lee</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , G. Hua,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>Stacked cross attention for image-text matching</article-title>
          ,
          <source>in: Proceedings of the European Conference on Computer Vision (ECCV)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>201</fpage>
          -
          <lpage>216</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>P.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-J.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>Deep fusion lstms for text semantic matching</article-title>
          ,
          <source>in: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>1034</fpage>
          -
          <lpage>1043</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <surname>M.-C. De Marnefe</surname>
            , B. MacCartney, T. Grenager,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Cer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Raferty</surname>
            ,
            <given-names>C. D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>Learning to distinguish valid textual entailments</article-title>
          , in: Second Pascal RTE Challenge Workshop, volume
          <volume>62</volume>
          ,
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <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="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>N.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Doran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kadav</surname>
          </string-name>
          ,
          <article-title>Visual entailment: A novel task for fine-grained image understanding</article-title>
          , arXiv preprint arXiv:
          <year>1901</year>
          .
          <volume>06706</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [48]
          <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="ref49">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          , et al.,
          <article-title>Language models are unsupervised multitask learners</article-title>
          ,
          <source>OpenAI blog 1</source>
          (
          <year>2019</year>
          )
          <article-title>9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Making pre-trained language models better few-shot learners</article-title>
          , arXiv preprint arXiv:
          <year>2012</year>
          .
          <volume>15723</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>A.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Nangia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Bowman</surname>
          </string-name>
          ,
          <article-title>The multi-genre nli corpus (</article-title>
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [52]
          <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="ref53">
        <mixed-citation>
          [53]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Dinan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <article-title>Adversarial nli: A new benchmark for natural language understanding</article-title>
          , arXiv preprint arXiv:
          <year>1910</year>
          .
          <volume>14599</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          [54]
          <string-name>
            <given-names>J.</given-names>
            <surname>Thorne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Glockner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Vallejo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlachos</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Evidence-based verification for real world information needs</article-title>
          ,
          <source>arXiv preprint arXiv:2104.00640</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          [55]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaheer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Guruganesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dubey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ainslie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Alberti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ontanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ravula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <article-title>Big bird: Transformers for longer sequences</article-title>
          ,
          <year>2021</year>
          . arXiv:
          <year>2007</year>
          .14062.
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          [56]
          <string-name>
            <given-names>D.</given-names>
            <surname>Stammbach</surname>
          </string-name>
          ,
          <article-title>Evidence selection as a token-level prediction task</article-title>
          ,
          <source>in: Proceedings of the Fourth Workshop on Fact Extraction and VERification (FEVER)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>14</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          [57]
          <string-name>
            <given-names>L.</given-names>
            <surname>Pang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wan</surname>
          </string-name>
          , X. Cheng,
          <article-title>Text matching as image recognition</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>30</volume>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          [58]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pang</surname>
          </string-name>
          , X. Cheng, Match-srnn:
          <article-title>Modeling the recursive matching structure with spatial rnn</article-title>
          ,
          <source>arXiv preprint arXiv:1604.04378</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>