<!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>Retrieval Augmented Generation of Summarized Answers on Visually-Rich Documents for Trend and Risk Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giuseppe Gallipoli</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Cagliero</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Mosca</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arianna Miola</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Borghi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Intesa Sanpaolo Innovation Center</institution>
          ,
          <addr-line>Corso Inghilterra 3, 10138 Turin</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Politecnico di Torino</institution>
          ,
          <addr-line>Corso Duca degli Abruzzi 24, 10129 Turin</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Università degli Studi di Milano-Bicocca</institution>
          ,
          <addr-line>Piazza dell'Ateneo Nuovo 1, 20126 Milan</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The analysis of Visually-Rich Documents (VRDs) is crucial in the banking sector to support Trend and Risk Analysis (TRA) as financial TRA documents are multimodal to a large extent. Recently, Retrieval Augmented Generation (RAG) systems have enabled the efective use of Large Language Models (LLMs) to answer questions related to multimodal content. However, the inherent verbosity and complexity of financial documents could degrade the quality of the generated answers. In this work, we explore the use of text summarization techniques to condense the information retrieved from TRA-related VRDs. We analyze the level of synthesis of the original RAG answers, both with and without cascading an ad hoc summarization step. We apply summarization performance measures to compare standard RAG answers with the summarization outputs achieved on the retrieved passages directly. The results show that proprietary LLMs (GPT-4o) significantly improve the RAG's ability to sum up the retrieved passages, whereas integrating open-source LLMs or traditional summarizers turns out to be not beneficial even while applying the summarization step on top of the RAG answer.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Visually-Rich Documents</kwd>
        <kwd>Trend and Risk Analysis</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>RAG Systems</kwd>
        <kwd>Text Summarization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Visually-Rich Documents (VRDs) are types of documents
that are commonly used in the banking sector to perform
Trend and Risk Analysis (TRA). They consist of visual and
textual elements such as charts, diagrams, textual
paragraphs, and tables. Multimodal elements collectively refer to
semantic entities whose identification, comprehension, and
elaboration are crucial to solve advanced reasoning tasks
such as Visual Question Answering [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Entity Linking [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
and Key Information Extraction [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        In the banking sector, analysts of TRA units often need to
query financial VRDs to gain insights into the latest
advancements in economic and technological fields. To support
this time-consuming activity, the use of Large Language
Models has become increasingly appealing [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Specifically,
Retrieved Augmented Generation (RAG) systems combine
the efectiveness of Information Retrieval modules, which
extract passages relevant to the analyst-generated question,
with the generative capabilities of LLMs [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Existing RAG
applications to financial documents mainly focus on textual
reports [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ], with limited research devoted to multimodal
sources [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ], which are, however, of major interest for TRA
banking units. Although RAG answers produced by LLMs
are expected to be relevant to the input question, their
conciseness and non-redundancy are usually not guaranteed
by design. However, especially when dealing with financial
VRDs, the multimodal content and its textual reformulations
are often characterized by a fairly high level of verbosity,
making the generated answers not suficiently focused.
      </p>
      <p>To deal with this issue, we first design and implement a
RAG system to manage the financial VRDs provided by three
separate TRA units of a primary banking institution. Next,
given the textual passages shortlisted by the multimodal
retrieval step, we compare the level of synthesis of the RAG
outputs produced by three alternative strategies:
(S1) Classical RAG: The LLM is prompted with the content
of the retrieved passages without explicitly enforcing any
summarization constraints;
(S2) Summarization: The retrieved passages are
summarized by an ad hoc summarization module;
(S3) Cascade of RAG and Summarization: The output of
S1 is summarized by an ad hoc summarization module.</p>
      <p>We compare the summarization performance achieved
by the above-mentioned strategies S1-S3 against a
humangenerated ground truth. The goal is to address the following
research questions:
(Q1) Are LLMs efective in summarizing TRA document
passages?
(Q2) To what extent are RAG outputs less similar than
summarizers’ outputs to ground truth summaries?
(Q3) Is it beneficial to apply text summarization on top of the
Classical RAG answers?</p>
      <p>The experimental results show that the answers provided
by Classical RAG to TRA-related questions are inherently
redundant, calling for ad hoc summarization strategies. While
proprietary LLMs excel at generating concise summaries of
the retrieved passages, the level of synthesis of open-source
models (including LLMs) is, in general, not satisfactory.
Furthermore, cascading RAGs with summarization modules
(regardless of the approach used) turns out to be not
beneficial.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Problem statement</title>
      <p>Given a set of Visually-Rich Documents  related to Trend,
Innovation, and Risk Analysis in the banking sector and
a textual question  ∈  on , the RAG system returns
the answers to each question  by performing the following
steps: (1) Document chunking and encoding: it recognizes
and splits the visual and textual elements in the documents’
content, generates alternative textual descriptions of the
visual elements, and encodes the text corresponding to each
element separately; (2) Passage retrieval: it encodes the
ques</p>
      <p>Documents</p>
      <p>Retriever
Retrieved passages
Summarizer
sim(RAGtP , P)
sim(S-RAGtP , P)
sim(StP , P)
Summarizer
Summary of
RAG Output
Summary of
passages
sim(RAGtP , GTt)
sim(StP , GTt)
sim(S-RAGtP , GTt)</p>
      <p>Ground truth
summary
tion  and retrieves the top- passages   from  that are
most relevant to ; (3) LLM prompting: it prompts the LLM
with both the question  and the retrieved passages  .
Note that Classical RAG prompts are designed for Question
Answering and do not include any explicit summarization
step.</p>
      <p>We aim to analyze the level of synthesis of the RAG
output  . Specifically, given an input question  ∈  , we
compare the corresponding passages   and the
(humangenerated) ground truth summary  of   with the
following outputs:
(1) Classical RAG: The final output of the RAG, denoted
by  ;
(2) Summarizer: The output of an external summarizer
that takes as input  , denoted by  ;
(3) Cascade of RAG+Summarizer: The output of an
external summarizer that takes as input the RAG output  ,
denoted by - .</p>
      <p>The diagram in Figure 1 shows the scenario under
analysis, where the similarities between the retrieved
passages and the outputs are depicted using blue dashed lines,
whereas those between the outputs and the ground truth
summaries are depicted using red dashed lines. Note that
the summarizer module is not necessarily integrated into
the RAG system, as we explore various summarization
approaches and models, including abstractive summarization
(using both LLMs and non-LLM models) and hybrid
strategies combining extractive and abstractive methods.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Settings of RAG and Summarizers</title>
      <p>We implement the RAG system using the LangChain
framework.</p>
      <sec id="sec-3-1">
        <title>Document chunking and encoding We detect the VRD</title>
        <p>
          elements using the proprietary Document Intelligence
service provided by the Azure AI platform [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and generate
alternative textual descriptions of visual contents using the
Multimodal LLM GPT-4o [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. To encode the VRD elements,
we use the OpenAI text-embedding-ada-002
embedding model.
        </p>
        <p>Passage retrieval We retrieve passages via textual
semantic similarity. Specifically, we retrieve the textual content
associated with the  elements in  whose embeddings
maximize the cosine similarity with the ’s encoding.
LLM prompting We consider the proprietary LLM
GPT4o and use the following prompt:
You are a virtual assistant that can do Q&amp;A. Try to
answer without using bullet points. Given the
following context, try to write a text that
highlights the topics discussed in the question.
If any of the context elements are not useful, ignore
them. If you don’t know the answer, just say you don’t
know, don’t try to invent an answer, but say that the
documents you have can’t satisfy the request.
[context]
[question]
where [context] and [question] are the retrieved
passages and the current question, respectively.</p>
        <p>
          External summarizers We conduct experiments with
traditional Transformer-based models, i.e., LED [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], which
is suited to long documents, PEGASUS [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], BART [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], and
T5 [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], three open-source LLMs, i.e., Llama3-Instruct 8B
[
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], Zephyr 7B [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], and Mistral-Instruct 7B [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] and one
proprietary LLM, i.e., GPT-4o [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. For LLM-based
summarization, we use the following prompt:
Summarize the following text.
        </p>
        <p>Focus on the topic of [keyword]: [to_summarize]
where we replace [keyword] with the question expressed
as a keyword and [to_summarize] with the
corresponding retrieved passages to summarize. We also test two
hybrid strategies combining extractive summarization using
graph-based (TextRank, LexRank) or clustering (K-Means)
methods with an LLM-based generative step.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Strategies for similarity computation</title>
      <p>We evaluate the pairwise textual similarities between
passages, LLM answers, and summaries using the following
strategies:</p>
    </sec>
    <sec id="sec-5">
      <title>5. Experimental results</title>
      <p>
        Open-source models are accessed via the Hugging
Face Transformers library and the proprietary GPT-4o
(gpt-4o-2024-05-13) model [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] using the OpenAI API.
We run experiments on a machine equipped with Intel®
CoreTM i9-10980XE CPU, 1 × NVIDIA® RTX A6000 48GB
GPU, 128 GB of RAM running Ubuntu 22.04 LTS.
Datasets We analyze three proprietary collections of
English VRDs provided by the following TRA units of a leading
banking institution: (1) ICT Risk: 10 documents related to
cyber risk, Distributed Ledger Technology, and AI in the
ICT Risk area. They contain 2800 textual elements and 45
visual ones; (2) Innovation: 3 documents related to embedded
ifnance/insurance, digital players, and Digital Wealth
Management. They contain 82 textual elements and 32 visual
ones; (3) Trend: 5 documents related to specific technologies
and technological fields such as hydrogen economy. They
mainly contain visual elements (232).
      </p>
      <p>We ask TRA units’ experts to generate questions
corresponding to distinct keywords (72 for ICT Risk, 19 for
Innovation, and 11 for Trend). For each question, ground
truth summaries are manually annotated by at least 3 units’
experts.</p>
      <sec id="sec-5-1">
        <title>Human evaluation of generated summaries To an</title>
        <p>
          swer Q1, we conduct a human validation of the passage
summaries generated by the best-performing open-source
LLM according to the automatic evaluation metrics and
GPT-4o. TRA units’ experts evaluated each output as Very
bad, Bad, Moderate, Good, or Very good according to the
following facets: Grammaticality, Usefulness, Coherence,
NonRedundancy, and Overall Quality [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. The results reported
in Table 1 highlight GPT-4o’s superior summarization
capabilities and, conversely, the limitations of open-source
sum90
80
70
60
50
%
40
30
20
10
0
        </p>
        <p>S-RAGtP (A)
vs.</p>
        <p>StP (B)</p>
        <p>RAGtP (A)
vs.</p>
        <p>StP (B)</p>
        <p>S-RAGtP (A)
vs.</p>
        <p>StP (B)</p>
        <p>RAGtP (A)
vs.</p>
        <p>StP (B)</p>
        <p>S-RAGtP (A)
vs.</p>
        <p>StP (B)</p>
      </sec>
      <sec id="sec-5-2">
        <title>Comparison between RAG and summarizers’ outputs with respect to ground truth summaries To address</title>
        <p>Q2, we evaluate the similarities between the ground truth
summaries and the outputs of (1) The classical RAG (see line
Output of Classical RAG in Table 2), and (2) The best
configurations for each dataset of the diferent summarizers
employed (see lines GPT-4o, Llama3-Instruct, Zephyr, LED large,
BART large, and hybrid strategies in Table 2). The results
indicate that GPT-4o outperforms Classical RAG in terms
of coherence with the ground truth summaries, whereas
all the other summarizers, including the open-source LLMs
and hybrid approaches, generally perform on par with or
even worse than Classical RAG.</p>
      </sec>
      <sec id="sec-5-3">
        <title>Efect of cascading RAG and Summarizer To answer</title>
        <p>Q3, the line Output of Cascade RAG+Summarizer in Table 2
reports the summarization performance of the approach
based on applying summarization on top of the RAG output.
In this case, we always use the best-performing model (i.e.,
GPT-4o) as the summarizer. The comparison with Classical
RAG shows that cascading is never beneficial, even when
employing the most efective summarizer, consistently
resulting in performance degradation. These findings suggest
that, since RAG answers are not specifically designed for
the summarization task, concise answers condensing the
relevant retrieved information can be produced more
efectively by applying an explicit summarization step directly
to the retrieved passages. Notably, summarizing the RAG
output generated in the previous step fails to achieve the
same quality as a direct summarization step, leading to even
lower performance.</p>
        <p>LLM-based similarity We carry out an A/B test using
GPT-as-an-expert to compare Classical RAG against
summarizers’ outputs (see the left-hand side bars of the plots
in Figure 2) and Cascade RAG+Summarizer against
summarizers’ outputs (see the right-hand side bars). We consider
as summarizer GPT-4o, the best-performing open-source
LLM and traditional Transformer-based model separately
for each dataset. The results align with the automatic
evaluation: GPT-4o as a summarizer outperforms both Classical
and Cascade RAG+Summarizer (&gt;80% vs. &lt;20%),
opensource LLMs perform comparably with them (both around
50%), whereas non-LLM summarizers demonstrate worse
performance (&lt;20% vs. &gt;80%).</p>
        <p>Comparison between RAG and summarizers’ outputs
with respect to retrieved passages Instead of
evaluating the similarities between the generated outputs and
the ground truth summaries (see Table 2), in this analysis
we consider the retrieved passages as references.
Specifically, we report in Table 3 the results of the comparisons
between the retrieved passages and the outputs of (1) The
classical RAG (see line Output of Classical RAG), (2) The
cascade of RAG and summarizer (see line Output of Cascade
RAG+Summarizer), and (3) The best configurations for each
dataset of the diferent summarizers tested (see lines GPT-4o,
Llama3-Instruct, Zephyr, LED large, BART large, and hybrid
strategies).</p>
        <p>In most cases, GPT-4o outperforms all the other
approaches including open-source LLMs, traditional
Transformer-based models, and hybrid strategies. Notably,
it achieves significantly higher performance compared to
both types of RAG outputs (i.e., Classical and Cascade
RAG+Summarizer). Similar to the previous analysis,
applying an additional summarization step on top of the RAG
output proves to be detrimental, leading to even lower scores
across all metrics. The results are aligned with those
obtained using ground truth summaries as references.
However, here we focus on a diferent aspect. Higher similarity
with respect to the retrieved passages denotes better
attribution of the generated text to the source passages. This is
particularly relevant in TRA domains, where maintaining a
high level of accountability to the document sources is
critical. In conclusion, both sets of results indicate that GPT-4o,
when used as a summarizer directly applied to the retrieved
passages, excels at generating summaries that align well
not only with the ground truth summaries but also with
the source documents. In contrast, the other summarizers,
and in particular the two types of RAG outputs considered,
demonstrate lower performance.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>This paper explored methods for summarizing passages
retrieved by a RAG system indexing financial VRDs related
to Trend and Risk Analysis in the banking sector. Employing
proprietary LLMs as summarizers enhances the level of
synthesis of classical RAG outputs, whereas open-source
LLMs or traditional summarizers do not achieve significant
performance improvements due to the inherent complexity
of multimodal, domain-specific sources. Notably, applying
summarizers directly to the retrieved passages has shown to
be more efective than cascading RAGs with an additional
summarization step.</p>
      <p>
        As future work, we plan to generate summarized answers
using RAG systems with diferent characteristics and
evaluate them on existing benchmarks, as well as using
sequenceto-sequence models specialized on languages other than
English [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. We also aim to generate explanations
highlighting the weaknesses of RAG outputs.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Limitations</title>
      <p>We identify the following limitations of our work:
Open-source LLMs Due to computational constraints,
we have currently tested the 8B parameter version of
Llama3Instruct. As a future extension, we plan to evaluate a broader
suite of open-source LLMs with varying levels of complexity.
It is worth noting that, despite their significantly smaller
number of parameters, the open-source LLMs considered
show fairly good performance, in some cases comparable
to that of larger, proprietary ones.</p>
      <p>Model fine-tuning Currently, both LLMs and traditional
Transformer-based model versions we employ are not
specialized on domain-specific data. We plan to fine-tune a
selection of models to generate more domain-aware
summaries.</p>
      <p>
        RAG architecture For visual elements, the retrieval
module currently relies on semantic similarity between textual
descriptions of multimodal elements generated using
GPT4o. We aim to explore the use of diferent Multimodal LLMs
that also capture layout information (e.g., LayoutLLM [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ])
and test them in combination with various document
retrieval strategies.
      </p>
    </sec>
    <sec id="sec-8">
      <title>Ethics statement</title>
      <p>Proprietary LLMs are, by design, non-transparent,
therefore the reproducibility of their results is limited and the
motivations behind their weaknesses remain partly obscure.</p>
      <p>LLMs are also known to sufer from bias issues. Although
we verified the coherence of the summarization outputs
with the help of domain experts, we cannot guarantee that
the summaries produced by generative AI models in a
realworld scenario are entirely free of hallucination. This could
be mitigated by introducing ad hoc approaches or models to
evaluate the factuality of the generated answers, enabling
to filter out or possibly improve non-factual outputs.</p>
      <p>The proprietary data were selected by banking units’
experts who were explicitly trained on how to properly sample
the document collections under analysis. While the overall
quality of the data sampling is above average, we cannot
exclude the possibility that the collection may contain outliers
or minor errors.</p>
    </sec>
    <sec id="sec-9">
      <title>Data and code availability</title>
      <p>Documents cannot be disclosed due to confidentiality and
copyright restrictions. Code could be made available upon
request to the authors.</p>
    </sec>
    <sec id="sec-10">
      <title>Credits to financial institution</title>
      <p>Intesa Sanpaolo is a leading banking group in the Eurozone
and the largest one in Italy. Intesa Sanpaolo Innovation
Center is part of ISP group, and its mission is exploring
business models of the future to discover new assets and
skills that support the long-term competitiveness of ISP
group and its customers. ISP has established the Innovation
Center Labs to respond to the complex needs of the bank and
the market, determined by the evolution of market trends
and exponential technology growth.</p>
    </sec>
    <sec id="sec-11">
      <title>Acknowledgments</title>
      <p>The authors would like to thank Giorgio Bella, Anna Polise,
Stefania Vigna, Laura Li Puma, Chiara Napione, Giovanni
Troiano, Patrizio Paolo Dionisi, Maura Bertaglia, Carla
Monferrato, and Simone Scarsi for their useful comments. They
would also like to thank Luigi Ruggerone for supporting the
research team.</p>
      <p>The work by Giuseppe Gallipoli was carried out within
the MICS (Made in Italy – Circular and Sustainable)
Extended Partnership and received funding from
NextGenerationEU (Italian PNRR – M4 C2, Invest 1.3 – D.D.
1551.11-10-2022, PE00000004). This study was also partially
carried out within the FAIR (Future Artificial Intelligence
Research) and received funding from Next-GenerationEU
(Italian PNRR – M4 C2, Invest 1.3 – D.D. 1555.11-10-2022,
PE00000013). This manuscript reflects only the authors’
views and opinions, neither the European Union nor the
European Commission can be considered responsible for
them.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , Layoutlm:
          <article-title>Pre-training of text and layout for document image understanding</article-title>
          ,
          <source>in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD '20</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>1192</fpage>
          -
          <lpage>1200</lpage>
          . URL: http://dx.doi.org/10.1145/3394486. 3403172. doi:
          <volume>10</volume>
          .1145/3394486.3403172.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y</given-names>
            <surname>.-M. Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-T.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.-F.</given-names>
            <surname>Lou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.-L.</given-names>
            <surname>Liao</surname>
          </string-name>
          , C.-L. Liu, Damgcn:
          <article-title>Entity linking in visually rich documents with dependency-aware multimodal graph convolutional network</article-title>
          , in: G. A.
          <string-name>
            <surname>Fink</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Kise</surname>
          </string-name>
          , R. Zanibbi (Eds.),
          <source>Document Analysis and Recognition - ICDAR 2023</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>47</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Vaiani</surname>
          </string-name>
          , C. Han,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Garza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Poon</surname>
          </string-name>
          , L. Cagliero, 3MVRD:
          <article-title>Multimodal multi-task multiteacher visually-rich form document understanding</article-title>
          , in: L.
          <string-name>
            <surname>-W. Ku</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Martins</surname>
          </string-name>
          , V. Srikumar (Eds.),
          <source>Findings of the Association for Computational Linguistics: ACL</source>
          <year>2024</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Bangkok, Thailand,
          <year>2024</year>
          , pp.
          <fpage>15233</fpage>
          -
          <lpage>15244</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .findings-acl.
          <volume>903</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2024</year>
          .findings-acl.
          <volume>903</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Stevens</surname>
          </string-name>
          , S. C. Han,
          <string-name>
            <given-names>M.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <article-title>A survey of large language models in finance (finllms</article-title>
          ),
          <year>2024</year>
          . URL: https: //arxiv.org/abs/2402.02315. arXiv:
          <volume>2402</volume>
          .
          <fpage>02315</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>A survey on RAG meeting llms: Towards retrieval-augmented large language models</article-title>
          , in: R.
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Bonchi</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD</source>
          <year>2024</year>
          , Barcelona, Spain,
          <source>August 25-29</source>
          ,
          <year>2024</year>
          , ACM,
          <year>2024</year>
          , pp.
          <fpage>6491</fpage>
          -
          <lpage>6501</lpage>
          . URL: https://doi.org/10.1145/3637528.3671470. doi:
          <volume>10</volume>
          .1145/3637528.3671470.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Yepes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>You</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Milczek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Laverde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Financial report chunking for efective retrieval augmented generation</article-title>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/ 2402.05131. arXiv:
          <volume>2402</volume>
          .
          <fpage>05131</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Bhathena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ramos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gadiyaram</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <article-title>Optimizing LLM based retrieval augmented generation pipelines in the financial domain</article-title>
          , in: Y.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Davani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sil</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Kumar (Eds.),
          <source>Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          (Volume
          <volume>6</volume>
          :
          <string-name>
            <surname>Industry</surname>
            <given-names>Track)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          , Mexico City, Mexico,
          <year>2024</year>
          , pp.
          <fpage>279</fpage>
          -
          <lpage>294</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .naacl-industry.
          <volume>23</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2024</year>
          .naacl-industry.
          <volume>23</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gallipoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Papicchio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Vaiani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cagliero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Miola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Borghi</surname>
          </string-name>
          ,
          <article-title>Keyword-based annotation of visuallyrich document content for trend and risk analysis using large language models</article-title>
          ,
          <source>in: Proceedings of the Joint Workshop of the 7th Financial Technology and Natural Language Processing, the 5th Knowledge Discovery from Unstructured Data in Financial Services, and the 4th Workshop on Economics and Natural Language Processing @ LREC-COLING</source>
          <year>2024</year>
          ,
          <article-title>ELRA</article-title>
          and
          <string-name>
            <given-names>ICCL</given-names>
            ,
            <surname>Torino</surname>
          </string-name>
          , Italia,
          <year>2024</year>
          , pp.
          <fpage>130</fpage>
          -
          <lpage>136</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .finnlp-
          <volume>1</volume>
          .
          <fpage>13</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mei</surname>
          </string-name>
          ,
          <article-title>Famma: A benchmark for financial domain multilingual multimodal question answering</article-title>
          ,
          <year>2024</year>
          . URL: https: //arxiv.org/abs/2410.04526. arXiv:
          <volume>2410</volume>
          .
          <fpage>04526</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Microsoft</surname>
            <given-names>Azure</given-names>
          </string-name>
          ,
          <source>Azure AI Document Intelligence</source>
          ,
          <year>2024</year>
          . URL: https://azure.microsoft.com/en-us/ products/ai-services/ai-document-intelligence/.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11] OpenAI,
          <source>OpenAI GPT-4o</source>
          ,
          <year>2024</year>
          . URL: https://openai. com/index/gpt-4o
          <string-name>
            <surname>-</surname>
          </string-name>
          system-card/.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
          ,
          <year>2020</year>
          . URL: https://arxiv. org/abs/
          <year>2004</year>
          .05150. arXiv:
          <year>2004</year>
          .05150.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Saleh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Pegasus: pretraining with extracted gap-sentences for abstractive summarization</article-title>
          ,
          <source>in: Proceedings of the 37th International Conference on Machine Learning, ICML'20</source>
          , JMLR.org,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghazvininejad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          , L. Zettlemoyer, BART:
          <article-title>Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>7871</fpage>
          -
          <lpage>7880</lpage>
          . URL: https:// aclanthology.org/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <year>2020</year>
          .acl-main.
          <volume>703</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Rafel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the limits of transfer learning with a unified text-to-text transformer</article-title>
          ,
          <source>J. Mach. Learn. Res</source>
          .
          <volume>21</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Llama</surname>
            <given-names>Team</given-names>
          </string-name>
          ,
          <source>The Llama 3 Herd of Models</source>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2407.21783. arXiv:
          <volume>2407</volume>
          .
          <fpage>21783</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Tunstall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Beeching</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lambert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Rajani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rasul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Belkada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Huang</surname>
          </string-name>
          , L. von
          <string-name>
            <surname>Werra</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Fourrier</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Habib</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Sarrazin</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Sanseviero</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Rush</surname>
          </string-name>
          , T. Wolf, Zephyr: Direct distillation of lm alignment,
          <year>2023</year>
          . arXiv:
          <volume>2310</volume>
          .
          <fpage>16944</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A. Q.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bamford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Chaplot</surname>
          </string-name>
          , D. de las Casas,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , G. Lengyel,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lample</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Saulnier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Lavaud</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          <string-name>
            <surname>Scao</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>W. E.</given-names>
          </string-name>
          <string-name>
            <surname>Sayed</surname>
          </string-name>
          , Mistral 7b,
          <year>2023</year>
          . arXiv:
          <volume>2310</volume>
          .
          <fpage>06825</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>C.-Y. Lin</surname>
            ,
            <given-names>ROUGE:</given-names>
          </string-name>
          <article-title>A package for automatic evaluation of summaries, in: Text Summarization Branches Out, Association for Computational Linguistics</article-title>
          , Barcelona, Spain,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          . URL: https://aclanthology.org/ W04-1013.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kishore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Artzi,</surname>
          </string-name>
          <article-title>BERTScore: Evaluating text generation with BERT</article-title>
          ,
          <source>in: 8th International Conference on Learning Representations, ICLR</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Addis</given-names>
            <surname>Ababa</surname>
          </string-name>
          , Ethiopia,
          <source>April 26-30</source>
          ,
          <year>2020</year>
          , OpenReview.net,
          <year>2020</year>
          . URL: https://openreview. net/forum?id=SkeHuCVFDr.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Grootendorst</surname>
          </string-name>
          ,
          <source>KeyBERT: Minimal keyword extraction with BERT</source>
          ,
          <year>2020</year>
          . URL: https://doi.org/10.5281/ zenodo.4461265. doi:
          <volume>10</volume>
          .5281/zenodo.4461265.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>N.</given-names>
            <surname>Iskender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Polzehl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <article-title>Reliability of human evaluation for text summarization: Lessons learned and challenges ahead</article-title>
          , in: A.
          <string-name>
            <surname>Belz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Graham</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Reiter</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Shimorina (Eds.),
          <source>Proceedings of the Workshop on Human Evaluation of NLP Systems (HumEval)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2021</year>
          , pp.
          <fpage>86</fpage>
          -
          <lpage>96</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .humeval-
          <volume>1</volume>
          .
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>M. La Quatra</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Cagliero</surname>
          </string-name>
          ,
          <article-title>Bart-it: An eficient sequence-to-sequence model for italian text summarization</article-title>
          ,
          <source>Future Internet</source>
          <volume>15</volume>
          (
          <year>2023</year>
          ). URL: https: //www.mdpi.com/1999-5903/15/1/15. doi:
          <volume>10</volume>
          .3390/ fi15010015.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>C.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yao</surname>
          </string-name>
          , Layoutllm:
          <article-title>Layout instruction tuning with large language models for document understanding</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>15630</fpage>
          -
          <lpage>15640</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>