<!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 2: A Multi-Modal Fact Checking System Based on Evidence Retrieval techniques and Transformer Encoder Architecture</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pim Jordi Verschuuren</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <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>Adelize van Eeden</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>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>In this paper, we present the Logically submissions to De-Factify 2 challenge (DE-FACTIFY 2023) on task 1 of Multi-Modal Fact Checking. We describe our submission to this challenge including explored evidence retrieval and selection techniques, pre-trained cross-modal and unimodal models, and a cross-modal veracity model based on the well established Transformer Encoder (TE) architecture which heavily relies on the concept of self-attention. Exploratory analysis is also conducted on the Factify 2 data set that uncovers the salient multi-modal patterns and hypothesis motivating the architecture proposed in this work. A series of preliminary experiments were done to investigate and benchmark diferent pre-trained embedding models, evidence retrieval settings and thresholds. The final system, a standard two-stage evidence based veracity detection system, yielded a weighted average F1 score of 0.79 on both the validation set and final blind test set of task 1, which achieved 3rd place with a small margin to the top performing systems on the leaderboard among 9 participants.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;fact verification</kwd>
        <kwd>multimodal representation learning</kwd>
        <kwd>multimodal entailment</kwd>
        <kwd>text entailment</kwd>
        <kwd>Multi-head Attention</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Misinformation and fake news can spread rapidly and cause harm at various levels. One way to
protect ourselves from these negative impacts is through fact-checking and debunking false
information with evidence-based reporting. However, this process can be resource-intensive and
time-consuming. To address this issue, researchers have developed automated fact-checking
systems using deep learning techniques, which can handle tasks such as claim detection,
claim matching, evidence retrieval, and veracity prediction using natural language processing
techniques on textual content. While there has been progress in this area, there is still a need
for multimodal approaches that can handle both text and image inputs. To address this gap,
this paper presents a multimodal veracity prediction system for automated fact-checking which
was developed as part of the Factify 2 competition organized by De-Factify@AAAI 2023.</p>
      <p>The remainder of the paper is structured as follows: Section 2 presents a brief overview of
related work and section 3 describes our general framework and model architecture. Section
4 discusses the dataset supplied by the Factify 2 competition followed by an overview of
our experiments in section 5. Section 6 and 7 present the final results and our conclusions,
respectively.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        As an essential part of automated fact verification, efective techniques for modeling
claimevidence for veracity prediction have been a hot topic and key research questions in existing
fact-checking methods. Most of the recent work focuses on using textual evidence in veracity
prediction of which there are mainly two lines of work. One direction [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ] is to use a single
document (such as is provided in the Factify task dataset) with long text evidence and through
leveraging models constructed for long sequences. Examples such as BigBird [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], Longformer[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
and recent advancements in the ConvNets architecture witnessed in the Long Range Arena
leaderboard (e.g., Mega [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], S5[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]) are seen to obtain top results in a wide range of tasks and
other leaderboards. The benefits of exploiting long-sequence models at document level is a) the
simplicity of the overall architecture; b) allows to accommodate for more context of the whole
article into modeling and natural language inference. An optimal setup of the maximum length
for both claim (or query) and document sequence, and the document level veracity labels is
commonly required [
        <xref ref-type="bibr" rid="ref1 ref3 ref8">8, 1, 3</xref>
        ]. The advantage of incorporating lots of context into inference is also
seen in modeling question answering (QA) tasks [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], for which the document-level veracity
labels are relatively "cheap" to obtain. The downside of using a simple long-text model technique
at document-level is the lack of interpretability (w.r.t. evidence selection), it is computational
expensive, the limitation in dealing with the complexity of certain (multi-hop) claims [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and
lack of diversity and scalability when dealing with a large amount of diverse documents in a
real-world application. These constraints were more apparent in open domain fact checking
tasks that make use of web data extracted with commercial search engines as building blocks
in fact-checking systems in order to incorporate more diverse sources. It is worth to note
that long-sequence models can be adapted for the purpose of evidence selection e.g., through
framing the task as a token-level prediction task. For instance, as one of the top systems in the
SciFact leaderboard 1, LongChecker [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] used LongFormer [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for scientific claim verification
with paragraph-level evidence selection. In their method, every sentences is inserted with a
[CLS] token with global attention, which allows the model to predict on this sentence-level
token as evidence. Most of these works focus on a limited context such as a few Wikipedia
documents, a single article and abstracts or text snippets from either research literature or a
small synthetic corpus.
      </p>
      <p>
        Another line of work widely adopted and one of the key tasks in FEVER [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] is to
involve evidence retrieval and selection. The framework exploits larger document context to
extract evidentiary (or rationales) passages as first step and veracity prediction is then modeled
to condition on the claim and the selected rationales. The evidentiary passages report the
1https://leaderboard.allenai.org/scifact/submissions/public
ifndings to the claim which can be used to justify each veracity label and can be selected at
either sentence- or paragraph-level. Despite the revolutionary breakthroughs with Large-Scale
Language Models (LSLMs), such as GPT-3[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and ChatGPT2, and their impressive generative
capabilities, these large models are still lacking key zero-shot or few-shot learning capabilities
needed for fact checking tasks. This is mainly due to their incorrectly retrieved, incomplete
or outdated knowledge stored in their weights which makes these techniques susceptible to
hallucinations [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ], which is conflicting with fact checking tasks that require factuality as
an essential element in modeling. Moreover, an eficient approach to keep LSLMs up-to-date
and grounded to ever-growing factual and new information is imperative but still unresolved to
date. Recent work [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ] shows that lightweight methods with fine-tuned and smaller models
outperform these big models in a range of knowledge-intensive NLP tasks including Natural
Language Inference (NLI), Recognizing textual entailment (RTE), Reading Comprehension (RC),
QA, etc. Sentence-BERT (SBERT) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] is one of the most popular techniques based on the BERT
language model [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] used for evidence selection [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ] which can be framed as a sentence-pair
regression task. SBERT models are used to encode contextualized representations for each of
the evidence passages which are then ranked according to their semantic similarity with the
contextualized representation of the corresponding claim. In the final step, top  evidentiary
passages are selected for veracity prediction. The challenge of this multi-staged verification
framework is 1) the rationales extracted out-of-context may lack information required to make
a prediction (e.g., acronyms, unresolved coreferences); 2) the evidence extraction (through
passages ranking) requires high quality training data that is costly to obtain with domain
experts from both closed and open domain tasks [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Various eforts to address the constraints
have been undertaken to explore 1) paragraph level train data from scientific literature with
paper title as claim and abstract as evidence as high-precision heuristics (e.g., SciFact [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]); 2) QA
dataset with question and answer considered as claim and evidence respectively [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]; 3) NLI
dataset with the claim as hypothesis and evidence as evidence [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. We follow a second line
of work for which the evidence retrieval component is implemented in our system following
current SoTA methods.
      </p>
      <p>
        Automated multi- or cross-modal fact checking is an underdeveloped field compared to
text-based techniques. Recent developments have shown that cross-modal pre-trained models
(e.g.,VideoBERT [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], VisualBERT [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], Uniter [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], CLIP [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]) have achieved significant results
in downstream cross-modal tasks [
        <xref ref-type="bibr" rid="ref28 ref29 ref30">28, 29, 30</xref>
        ] with great transferability for zero-shot or few-shot
scenarios. Our work is inspired by [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ], which was one of the initial explorations in multimodal
fact-checking task. In their proposed method, the Contrastive Language–Image Pre-training
(CLIP) model [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]) is adopted as encoder to learn joint language-image embedding between
each image and input claim text. Top-5 candidate image evidences are taken as input along with
multimodal claim for multimodal claim verification model with a simple cross-attention network.
It is worth noting that the CLIP model allows to model image-text contextual alignment at
coarse-grained contextual (global) level but ignores the compositional matching of disentangled
concepts (i.e., finer-grained cross-modal alignment at region-word level)[
        <xref ref-type="bibr" rid="ref30 ref32 ref32">30, 32, 32</xref>
        ].
      </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 2 problem as a multimodal entailment task as in the previous submission
[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], which considers a multimodal claim  =  +  as hypothesis and a multimodal
document  =  +  as premise. The goal is to learn a function  (, ) that infers one
of the five entailment categories including "Support_Multimodal", "Support_Text", "Refutes",
"Insuficient_Multimodal" and "Insuficient_Text". Additional details on the task can be found in
[33].
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. General Architecture</title>
        <p>Our system architecture follows a standard two-stage claim verification approach as established
through various shared tasks in recent years, typically FEVER[34], FEVER 2.0 [35], FEVEROUS
[36] and SCIVER [37]. First, a textual evidence retrieval component identifies from a given
document the evidence passages most relevant to the corresponding claim text. Then, a
transformer based cross-modal model is trained on all the input across multimodalities including
selected evidence passages text, claim text, claim image, document image, claim OCR text
and document OCR text to predict five multimodal entailment categories with respect to the
multimodal claim. A pre-trained cross-modal model (i.e. CLIP) and a pre-trained text embedding
model are both employed in the embedding layer in order to learn a cross-modal matching
model using both unified-multimodal and unimodal representations. Overall, the implemented
architecture adopts a list-wise concatenation strategy [38] which is one of common strategies
in most recent sequence-to-sequence SoTA veracity prediction models.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Evidence Retrieval</title>
        <p>In evidence retrieval, ‘multi-qa-mpnet-base-dot-v1‘ 3 and is employed to compute embeddings
for both claim text and document text at passage level. In terms of passage granularity, both
paragraph- and sentence-level retrieval have been experimented with (see Section 5). This is
a SBERT model based on the MPNet architecture [39] and is trained on a Question-Answer
(QA) dataset with 215M QA pairs from diverse sources. The model was tuned for a semantic
search using a dot-product score function in order to find relevant passages corresponding to a
given query. The model encodes text into a 768-d vector and supports 512 maximum number of
tokens.</p>
        <p>Regarding the similarity computation and semantic search, we use a simple dot product with
the normalised SBERT embeddings (as proxy to cosine similarity) which enables a quick and
eficient passage ranking and scalability of up to about 1 Million entries.</p>
        <p>Top  passages obtained from the semantic search are then re-ranked based on their relevancy
to the claim text and concatenated into a longer text snippet before being fed into the cross-modal
veracity prediction model.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Embedding Layer</title>
        <p>Our embedding layer consists of a cross-modal encoder and a unimodal text encoder. We
hypothesize that modeling solely on text-to-text interaction (i.e., text premise and hypothesis)
can supplement the modeling solely on cross-modal premise and hypothesis interaction and
vice versa. This architecture facilitates the measuring of multimodal semantic relatedness in
this multimodal fact checking task by mapping more textual alignment signals into
subsequent semantic space. This considers that text specific models can capture more accurate and
semantically meaningful word- or sentence-level alignment.</p>
        <p>The cross-modal encoder is implemented with a pre-trained CLIP model that aims to map
visual and text embeddings into a common space. The ViT-B/32 variant (ViT-Base with patch size
32) is chosen in this work because of its smaller amount of parameters, less FLOPS and greater
inference speed. ViT-B/32 consists of a text encoder and an image encoder which are used to
encode text inputs (including claim text, evidentiary passage and two images OCR text) and
image inputs (including claim image and document image) respectively before concatenating
into a 6 × 512 matrix as a single input to the subsequent transformer encoder. The CLIP
architecture allows for a maximum input text length of 77 tokens. The pre-trained Word2vec
model ("Word2vec Google News 300") [40] is adopted as a unimodal text encoder. It encodes the
concatenated text sequence of claim and document evidentiary passage text, and obtains a 300-D
feature vector for each token. Zero-padding is applied to match the longest sentence in the
training set. Both the pre-trained CLIP and Word2Vec embedding model were not fine-tuned.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Cross-modal veracity prediction</title>
        <p>The second component of veracity prediction is based on the well established Transformer
Encoder (TE) architecture, which heavily relies on the concept of self-attention [41] to efectively
3The model is available on the Hugging Face hub, accessible via
https://huggingface.co/sentencetransformers/multi-qa-mpnet-base-dot-v1
model higher-order interactions and context in an input. Recent research has shown that
multihead self-attention mechanisms and transformer architectures are computationally eficient and
accurate in this regard. The self-attention mechanisms of the TE encoder allows for simple but
powerful reasoning that can identify hidden relationships between vector entities, regardless of
whether they are visual or textual in nature. Therefore, our cross-modal veracity prediction
model is implemented based on self-attention mechanisms to learn the joint distribution of
text representations of claim-document text pair and cross-modal feature representations of all
modalities contained in claim and document.</p>
        <p>Specifically, the claim and document embeddings of joint input by CLIP and text input by
text embedding layer are passed through two separate transformer encoders [41] consisting
of  identical sequential blocks of a multi-head attention (MHA) and a fully connected
feedforward network (FFN). Within each transformer encoder, multiple blocks allows for a deeper
understanding of the inputs. For each block the input  is passed through a multi-head attention
layer of which the output is added to the initial input such that information in the initial
sequence is not lost. Layer normalization is applied to the output to allow for faster training
and small regularization i.e.  = LayerNorm( + MHA()). The output is then passed to a
feed-forward network to allow for more model complexity. The output is again added to the
original input and layer normalization is applied i.e.  = LayerNorm( + FFN()). The output
of the final block (i.e., the output of each transformer encoder in the diagram) is passed through
an adaptive max pooling layer to reduce the output dimensions. The output of two separate
transformer encoders are then concatenated before feeding into a MLP classifier for the five
category prediction. The five categories probabilities are obtained from the final output softmax
layer.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Factify Dataset</title>
      <sec id="sec-4-1">
        <title>4.1. Dataset Description</title>
        <p>The Factify 2 dataset created and supplied by the organisers covers a train, validation, and test
set. The train set contains 35000 data pairs, while the validation and test sets each contain 7500
data pairs. Each data pair consists of a claim and a document, each of which comprises an image,
a text, and an OCR text extracted from the image. The data pairs are annotated with one label
from 5 categories including Support_Multimodal, Support_Text, Refute, Insuficient_Multimodal,
or Insuficient_Text.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Text Length Distribution</title>
        <p>The training set text and OCR text length distributions are represented in Figures 2 and 3. The
text length distribution varies between the claim and document text, with the document text
that tends to be much longer. This is expected as it is used to verify the claim. From Figure 2
(a), we can can see that claim text is much shorter and less varied for the Refute category than
for the rest of the categories, which all have similar claim text length distributions. Figure 2
(b) shows that the Support_Multimodal and Support_Text categories have the larger spread
of document text lengths and also the longest document text lengths. The two Insuficient
categories have on average a smaller document text length, and Refute has the smallest variance
and maximum length in document text length.</p>
        <p>Considering the claim OCR length we see from Figure 3 that the Refute category has a much
larger claim OCR length distribution and maximum length than any other category. The second
largest claim OCR length distributions are the Support_Text and the Insuficient_Text categories,
which then leaves the two Multimodal categories with the shortest claim OCR text lengths. The
document OCR length distribution is very similar to that of the claim OCR, from Figure 3b we
see the only real diference is that the two Text categories have a smaller document OCR length
distrubution than that of the claim OCR.</p>
        <p>(a) Claim Text Length
(b) Document Text Length</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Image Similarity Distribution</title>
        <p>
          An image similarity investigation was conducted in order to gain an intuition of the similarity
between the claim and document images for each category. Using image pairwise CLIP
embeddings we calculate a similarity score and analyse it per category. Figures 4a and 4b illustrate that
the similarity between the claim and document image is comparatively higher within the
categories for Support_Multimodal and Insuficient_Multimodal than the other categories. The label
correlation with similarity of image pairs has largely increased compared to factity 1 dataset
[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] of last year. This further indicates that there is explicit correlation within the multimodal
categories which can be leveraged to learn and verify multimodal entailment categories.
(a) Claim OCR Text Length
(b) Document OCR Text Length
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Multimodal Similarity Distribution</title>
        <p>The multimodal CLIP similarity among multimodal claim and doc pairs is explored to investigate
our hypothesis that doc image should contain content that is related to the claim in order to
entail either support or refute verdict decisions. Figures 5a and 5b depict the cosine similarity
scores between the claim text and document image. It is noticeable that “Support_Multimodal”
presents the highest pairwise similarity correlation between label and claim-evidence pair.
“Insuficient text” have the lowest pairwise similarity correlation, although our initial hypothesis
was that “Insuficient_Multimodal” should have the lowest value. This analysis suggests that
diferentiating between the diferent categories based on the claim text and document image
correlation could be challenging.</p>
        <p>In terms of correlation between the claim image and document text, due to the maximum
text sequence constraints with CLIP, text access maximum length is truncated. Consequently,
longer context of document text is not incorporated in this analysis. As shown in Figure 6a and
6c, there is low degree of similarity correlation across the five categories, among which the
"Refute" category shows highest similarity correlation.</p>
        <p>Lastly, Figure 6b and Figure 6d show the similarity correlation between the claim image and
the claim text, and show no significant deviation in similarity scores of diferent categories when
the claim image and claim text are compared to each other. For the purpose of this task and this
dataset, we hypothesize that the claim image should provide supplementary information to the
claim text.</p>
        <p>(a) Claim Image and Document Image Similarity Score Histogram</p>
        <p>(b) Claim Image and Document Image Similarity Boxplot</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments</title>
      <sec id="sec-5-1">
        <title>5.1. Model settings</title>
        <p>To validate and optimize the efect of evidence retrieval, we attempt to experiment with our
model with 1) including or excluding evidence selection; 2) varying the length of evidence doc
text sorted by evidence retriever; 3) passage ranking at paragraph level versus sentence level;
4) text-to-text alignment with SBERT versus cross-modal alignment with CLIP. Both SBERT
and CLIP is used to rank evidence doc with paragraph and sentence level; 5) if SBERT model
trained on QA dataset perform better than general purpose SBERT model. Note that ranking
(a) Claim Text and Document Image Similarity Score Histogram</p>
        <p>(b) Claim Text and Document Image Similarity Boxplot
at paragraph level on top &lt;5 or sentence level on top &lt;5 is only an option for CLIP due to its
maximum allowed length restriction.</p>
        <p>For two transformer encoders, we choose an empirical setting of four heads in two MHAs.
The number of sequential MHA and feed-forward network blocks per embedding input is
 = 2. All our experiments are trained on a 3-layered MLP and the number of nodes per
layer are set to 3072, 1024 and 5, respectively. A dropout of 0.5 and ReLU activations are applied
between the MLP layers.</p>
        <p>Preliminary experiments conducted in this work are elaborated in details as follows:
• "model_w/o_ER": to validate the efectiveness with evidence retrieval, we remove evidence
(a) Claim Image and Document Text Similarity Score His- (b) Claim Image and Claim Text Similarity Score
Histogram togram
(c) Claim Image and Document Text Similarity Score</p>
        <p>
          Boxplot
(d) Claim Image and Claim Text Similarity Score
Boxplot
retrieval in our system and provide original document text to "Cross-modal veracity
prediction model".
• "SBERT_sentence_ER_top5": One of the "top" 4 performing general purpose SBERT model
("all-MiniLM-L6-v2") is chosen in our experiment. This is an all-round model tuned for
many use cases and 5 times faster while ofering good quality compared to the best
all-round model "all-mpnet-base-v2". The model is trained on a large and diverse dataset
of over 1 billion training pairs and also fine-tuned for dot-product score function suitable
for cosine similarity. The use of the all-round model allows us to evaluate the value of
adopting QA fine-tuned counterpart that we hypothesize to be the optimal solution. Top
4The best performing general purpose model is selected with a sorted list of model performances and
recommended use cases provided by SBERT, accessible via https://www.sbert.net/docs/pretrained_models.html
5 sorted sentences sorted by all-round SBERT model is configured in this setting.
• "SBERT_sentence_ER_top10": Top 10 sorted sentence sorted by all-round SBERT model
is configured in this setting.
• "SBERT_sentence_ER_top15": Top 15 sorted sentence sorted by all-round SBERT model
is configured in this setting.
• "SBERT-QA_paragraph_ER_top5": SBERT QA dataset fine-tuned model (as described
in 3.3) is adopted in this setting to obtain top 5 paragraphs as evidentiary passages for
veracity inference in this setting.
• "SBERT-QA_sentence_ER_top5": Top 5 sentences sorted by SBERT QA model and selected
as evidentiary passages in this setting.
• "BigBird_w/o_ER": To evaluate the value of evidence selection against the long context
modeling solution, the Google’s BigBird pre-trained model fine-tuned on Factity dataset
from last year [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] is used to replace the Word2Vec model in the "Text Embedding layer"
with this setting. This BigBird model allows a maximum 1396 tokens and contextual
representation of text is adopted in this setting.
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Training and validation</title>
        <p>For our experiment, the model was trained up to 80 epochs with early stopping on minimum
validation loss by minimizing the cross-entropy loss function using the adaptive AdamW
optimizer [42] with an initial learning rate of  = 1e− 4 and epsilon  = 1e− 8 with batch size
ℎ = 16. Early stopping patience is set to 5. A linear decreasing learning rate scheduler
was used including  = 438 warming up training steps during which the learning rate
increased linearly to the chosen learning rate.</p>
        <p>We have found that data scraping errors lead to invalid doc text content in the development
dateset provided by organiser with 463 and 114 invalid samples in train and val set respectively.
There also are 112 invalid samples in test set. This results in document text containing only
"We’ve detected that JavaScript is disabled in this browser ...". The invalid samples are removed
from our training data.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Results and Discussion</title>
      <p>The best model results in preliminary experiments described in section 5 are presented in Table
1, Table 2 and Table 3 respectively.</p>
      <p>Firstly, the Table 1 shows that our veracity model without ER exhibits a reasonably good
performance and utilising the long sequence model (BigBird) for text embeddings improves
the base model with a small margin, by 1% for all categories except "Refute". As comparison,
further experiments with ER are conducted of which the results are presented in Table 2 and
Table 3. The results in Table 2 indicate that all-round SBERT based evidence selection does
not provide obvious performance improvement based on current preliminary explorations
covering three top K sentences settings (K=5, 10, 15). In contrast, SERT-QA based model
achieves big marginal improvement at both paragraph and sentence level. Our experiments
covers both top 5 paragraphs and sentences, which improves best base model (without ER) by
5-way Classification Results of experiments without ER on val set
model_w/o_ER</p>
      <p>BigBird_w/o_ER
1% and 2% respectively. Final results across 7 diferent experiment setup shows that combining
SBERT-QA at top K sentence-level evidence passage retrieval achieves optimal performance
compared to the base model without ER and the use of all-round SBERT model. The best model
"SBERT-QA_sentence_ER_top5" obtains 0.79 weighted average F1 at the 20th epoch.
R
5-way Classification Results of experiments with all-round SBERT + ER on val set</p>
      <p>SBERT_sentence_ER_top5 SBERT_sentence_ER_top10 SBERT_sentence_ER_top15</p>
      <p>P R F1 P R F1 P R F1
5-way Classification Results of experiments with SBERT-QA + ER on val set</p>
      <sec id="sec-6-1">
        <title>Categories</title>
      </sec>
      <sec id="sec-6-2">
        <title>SBERT-QA_paragraph_ER_top5</title>
      </sec>
      <sec id="sec-6-3">
        <title>SBERT-QA_sentence_ER_top5</title>
        <sec id="sec-6-3-1">
          <title>6.1. Competition Result</title>
          <p>The final test set results and competition leaderboard are presented in Table 4. The results show
that top 3 participating systems achieves similar performance and our system is ranked at 3rd
place with a small margin (by 0.028) to the top performing system. Please refer to [43] for the
competition details.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion</title>
      <p>
        In this research, we present our multimodal fact checking system that is submitted to the
DeFactify 2023 competition. The system consists of various components, including a multimodal
fact checking dataset, a QA-enhanced evidence passage retrieval component, and a
Transformerbased cross-modal sequence-to-sequence veracity prediction model. Our findings from the
De-Factify 2023 competition show that recent advances in pre-trained cross-modal models, such
as CLIP, have strong zero-shot or few-shot capabilities and can be efectively transferred to
a variety of downstream tasks, including multimodal fact checking. However, there is still a
need for more efective techniques for multimodal modeling and explainability, particularly
in regards to learning finer-grained cross-modal representations by jointly modeling
intraand inter-modality relationships and aligning vision regions with sentence words or entities.
Additionally, more focus should be placed on real-world challenges that involve handling large
amounts of textual and multimodal information from multiple sources and domains for claim
verification. There is also a need for techniques that can efectively handle more complex
and nuanced real-world scenarios, such as those involving sarcasm, irony, and misleading
context. The dificulties in creating large and high-quality multimodal fact checking datasets
that accurately reflect real-world scenarios (e.g., insuficient/leaked evidence), as identified in
previous work [
        <xref ref-type="bibr" rid="ref3">44, 3</xref>
        ], remain a significant challenge.
Transactions on Multimedia Computing, Communications, and Applications (TOMM) 17
(2021) 1–23.
[33] S. Suryavardan, S. Mishra, P. Patwa, M. Chakraborty, A. Rani, A. Reganti, A. Chadha,
A. Das, A. Sheth, M. Chinnakotla, A. Ekbal, S. Kumar, Factify 2: A multimodal fake news
and satire news dataset, in: proceedings of defactify 2: second workshop on Multimodal
Fact-Checking and Hate Speech Detection, CEUR, 2023.
[34] J. Thorne, A. Vlachos, O. Cocarascu, C. Christodoulopoulos, A. Mittal, The fact extraction
and verification (fever) shared task, arXiv preprint arXiv:1811.10971 (2018).
[35] J. Thorne, A. Vlachos, O. Cocarascu, C. Christodoulopoulos, A. Mittal, The fever2. 0
shared task, in: Proceedings of the Second Workshop on Fact Extraction and VERification
(FEVER), 2019, pp. 1–6.
[36] R. Aly, Z. Guo, M. S. Schlichtkrull, J. Thorne, A. Vlachos, C. Christodoulopoulos, O.
Cocarascu, A. Mittal, The fact extraction and verification over unstructured and structured
information (feverous) shared task, in: Proceedings of the Fourth Workshop on Fact
Extraction and VERification (FEVER), 2021, pp. 1–13.
[37] D. Wadden, K. Lo, Overview and insights from the sciver shared task on scientific claim
verification, arXiv preprint arXiv:2107.08188 (2021).
[38] K. Jiang, R. Pradeep, J. Lin, Exploring listwise evidence reasoning with t5 for fact
verification, in: Proceedings of the 59th Annual Meeting of the Association for Computational
Linguistics and the 11th International Joint Conference on Natural Language Processing
(Volume 2: Short Papers), 2021, pp. 402–410.
[39] K. Song, X. Tan, T. Qin, J. Lu, T.-Y. Liu, Mpnet: Masked and permuted pre-training for
language understanding, Advances in Neural Information Processing Systems 33 (2020)
16857–16867.
[40] T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, J. Dean, Distributed representations of
words and phrases and their compositionality, Advances in neural information processing
systems 26 (2013).
[41] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, I.
Polosukhin, Attention is all you need, arXiv (2017). URL: https://arxiv.org/abs/1706.03762.
doi:10.48550/ARXIV.1706.03762.
[42] I. Loshchilov, F. Hutter, Decoupled weight decay regularization (2017). URL: https://arxiv.
      </p>
      <p>org/abs/1711.05101. doi:10.48550/ARXIV.1711.05101.
[43] S. Suryavardan, S. Mishra, M. Chakraborty, P. Patwa, A. Rani, A. Chadha, A. Reganti,
A. Das, A. Sheth, M. Chinnakotla, A. Ekbal, S. Kumar, Findings of factify 2: multimodal
fake news detection, in: proceedings of defactify 2: second workshop on Multimodal
Fact-Checking and Hate Speech Detection, CEUR, 2023.
[44] M. Glockner, Y. Hou, I. Gurevych, Missing counter-evidence renders nlp fact-checking
unrealistic for misinformation, arXiv preprint arXiv:2210.13865 (2022).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Wadden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          , I. Beltagy,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hajishirzi</surname>
          </string-name>
          , Multivers:
          <article-title>Improving scientific claim verification with weak supervision and full-document context</article-title>
          ,
          <source>in: Findings of the Association for Computational Linguistics: NAACL</source>
          <year>2022</year>
          ,
          <year>2022</year>
          , pp.
          <fpage>61</fpage>
          -
          <lpage>76</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <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>
          ,
          <source>EMNLP, Association for Computational Linguistics (ACL)</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.-F.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Oikonomou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiskovski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bandhakavi</surname>
          </string-name>
          , Logically at factify 2022:
          <article-title>Multimodal fact verification</article-title>
          ,
          <source>arXiv</source>
          (
          <year>2021</year>
          ). URL: https://arxiv.org/abs/2112.09253. doi:
          <volume>10</volume>
          .48550/ARXIV.2112.09253.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaheer</surname>
          </string-name>
          , G. Guruganesh,
          <string-name>
            <given-names>K. 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>
          , et al.,
          <article-title>Big bird: Transformers for longer sequences</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>17283</fpage>
          -
          <lpage>17297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I.</given-names>
            <surname>Beltagy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cohan</surname>
          </string-name>
          ,
          <article-title>Longformer: The long-document transformer</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>05150</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>X.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Gui</surname>
          </string-name>
          , G. Neubig,
          <string-name>
            <given-names>J.</given-names>
            <surname>May</surname>
          </string-name>
          , L. Zettlemoyer, Mega:
          <article-title>Moving average equipped gated attention</article-title>
          ,
          <source>arXiv preprint arXiv:2209.10655</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Warrington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Linderman</surname>
          </string-name>
          ,
          <article-title>Simplified state space layers for sequence modeling</article-title>
          ,
          <source>arXiv preprint arXiv:2208.04933</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , Ror:
          <article-title>Read-over-read for long document machine reading comprehension</article-title>
          ,
          <source>arXiv preprint arXiv:2109.04780</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Nakano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hilton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Balaji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ouyang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kosaraju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Saunders</surname>
          </string-name>
          , et al.,
          <article-title>Webgpt: Browser-assisted question-answering with human feedback</article-title>
          ,
          <source>arXiv preprint arXiv:2112.09332</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <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="ref11">
        <mixed-citation>
          [11]
          <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>
          ,
          <source>in: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , New Orleans, Louisiana,
          <year>2018</year>
          , pp.
          <fpage>809</fpage>
          -
          <lpage>819</lpage>
          . URL: https://aclanthology.org/N18-1074. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>N18</fpage>
          -1074.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schlichtkrull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>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>O.</given-names>
            <surname>Cocarascu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mittal</surname>
          </string-name>
          , Feverous:
          <article-title>Fact extraction and verification over unstructured and structured information</article-title>
          ,
          <source>arXiv preprint arXiv:2106.05707</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>L.</given-names>
            <surname>Floridi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chiriatti</surname>
          </string-name>
          , Gpt-3
          <article-title>: Its nature, scope, limits, and consequences</article-title>
          ,
          <source>Minds and Machines</source>
          <volume>30</volume>
          (
          <year>2020</year>
          )
          <fpage>681</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Maynez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narayan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bohnet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>McDonald</surname>
          </string-name>
          ,
          <article-title>On faithfulness and factuality in abstractive summarization</article-title>
          , arXiv preprint arXiv:
          <year>2005</year>
          .
          <volume>00661</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lazaridou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gribovskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Stokowiec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Grigorev</surname>
          </string-name>
          ,
          <article-title>Internet-augmented language models through few-shot prompting for open-domain question answering</article-title>
          ,
          <source>arXiv preprint arXiv:2203.05115</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Guu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>Finetuned language models are zero-shot learners</article-title>
          ,
          <source>arXiv preprint arXiv:2109.01652</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          , arXiv preprint arXiv:
          <year>1908</year>
          .
          <volume>10084</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <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="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>Saakyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chakrabarty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Muresan</surname>
          </string-name>
          ,
          <article-title>Covid-fact: Fact extraction and verification of real-world claims on covid-19 pandemic</article-title>
          , arXiv preprint arXiv:
          <volume>2106</volume>
          .03794 (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-H.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>End-to-end multimodal fact-checking and explanation generation: A challenging dataset and models</article-title>
          ,
          <source>arXiv preprint arXiv:2205.12487</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Elsayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          , G. Da San Martino, M. Hasanain,
          <string-name>
            <given-names>R.</given-names>
            <surname>Suwaileh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Babulkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hamdan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nikolov</surname>
          </string-name>
          , et al.,
          <source>Overview of checkthat!</source>
          <year>2020</year>
          :
          <article-title>Automatic identification and verification of claims in social media</article-title>
          ,
          <source>in: International Conference of the Cross-Language Evaluation Forum for European Languages</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>215</fpage>
          -
          <lpage>236</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-S. Wu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Fung</surname>
          </string-name>
          ,
          <article-title>Improving large-scale fact-checking using decomposable attention models and lexical tagging</article-title>
          ,
          <source>in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1133</fpage>
          -
          <lpage>1138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>T.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Barzilay</surname>
          </string-name>
          ,
          <article-title>Get your vitamin c! robust fact verification with contrastive evidence</article-title>
          ,
          <source>arXiv preprint arXiv:2103.08541</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>C.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Myers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vondrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Murphy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schmid</surname>
          </string-name>
          ,
          <article-title>Videobert: A joint model for video and language representation learning</article-title>
          ,
          <source>arXiv (</source>
          <year>2019</year>
          ). URL: https://arxiv.org/abs/
          <year>1904</year>
          .01766. doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>1904</year>
          .
          <volume>01766</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <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 (
          <year>2019</year>
          ). URL: https://arxiv.org/abs/
          <year>1908</year>
          .03557. doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>1908</year>
          .
          <volume>03557</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <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. E.</given-names>
          </string-name>
          <string-name>
            <surname>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, Uniter:
          <article-title>Universal image-text representation learning</article-title>
          ,
          <source>arXiv (</source>
          <year>2019</year>
          ). URL: https://arxiv.org/abs/
          <year>1909</year>
          .11740. doi:
          <volume>10</volume>
          .48550/ARXIV.
          <year>1909</year>
          .
          <volume>11740</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          , et al.,
          <article-title>Learning transferable visual models from natural language supervision</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>8748</fpage>
          -
          <lpage>8763</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>P.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Geng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , T. Ma,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qiao</surname>
          </string-name>
          ,
          <article-title>Clip-adapter: Better vision-language models with feature adapters</article-title>
          ,
          <source>arXiv preprint arXiv:2110.04544</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Miao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Cui</surname>
          </string-name>
          , Calip:
          <article-title>Zero-shot enhancement of clip with parameter-free attention</article-title>
          ,
          <source>arXiv preprint arXiv:2209.14169</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>K.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. E.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Comclip:
          <article-title>Training-free compositional image and text matching</article-title>
          ,
          <source>arXiv preprint arXiv:2211.13854</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>W.-Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , W.-C. Peng, Team yao at factify 2022:
          <article-title>Utilizing pre-trained models and co-attention networks for multi-modal fact verification</article-title>
          ,
          <source>arXiv</source>
          (
          <year>2022</year>
          ). URL: https://arxiv. org/abs/2201.11664. doi:
          <volume>10</volume>
          .48550/ARXIV.2201.11664.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>N.</given-names>
            <surname>Messina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Amato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Esuli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Falchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gennaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marchand-Maillet</surname>
          </string-name>
          ,
          <article-title>Fine-grained visual textual alignment for cross-modal retrieval using transformer encoders</article-title>
          , ACM
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>