<!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>Knowledge Graph aided LLM based ESG Question-Answering from News</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tanay Kumar Gupta</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tushar Goel</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ishan Verma</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lipika Dey</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sachit Bhardwaj</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>TCS Research</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>New Delhi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>India</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Organizations around the globe have acknowledged the importance of sustainability. Sustainability performance has gained traction in investing and risk management and is now an integral part of business planning. The volume and velocity of information being published on the web have made use of natural language processing evident for insight generation. With the recent advancements in language modelling and the availability of Large Language Models (LLM), conversational insight generation is increasingly becoming popular. LLM combined with advanced retrieval techniques has eased the task of question-answering over large natural language datasets. In this work, we present a novel approach that leverages Knowledge Graph-based Retrieval Augmented Generation (KG-RAG) to facilitate question-answering in the context of sustainability news articles and corporate Environmental, Social, and Governance (ESG) performance. Our methodology encompasses the creation of an ESG Knowledge Graph, retrieval techniques that identify contextually relevant information, and an LLM-based answergeneration framework. We have experimented with multiple LLM models and have shown a comparative study of their performances against several baseline algorithms.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Sustainability</kwd>
        <kwd>ESG</kwd>
        <kwd>Knowledge Graph</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Question Answering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the contemporary landscape, the imperative of sustainability for individuals, corporations,
and government becomes increasingly evident [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Corporations embracing sustainability
practices often find that they lead to not only cost savings but also increased profitability and
long-term value. With increasing popularity amongst investors, it can facilitate access to capital
and support business growth. Environmental, social, and governance, or ESG, is a concept
that the United Nations Global Compact introduced for sustainability reporting in 2004 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Since then, companies have used these to highlight their eforts and commitments towards
sustainability. The Global Reporting Initiative (GRI)1 is a leading international organization
† Authors contributed equally.
that promotes sustainability reporting. It provides a comprehensive framework for companies
and organizations to report their economic, environmental, and social performance.
      </p>
      <p>
        Sustainability reports are published by organizations every year highlighting their eforts
in the area of ESG. Sustainability news on the other hand stands out for its advantage over
sustainability reports due to real-time event updates. It also ofers a diverse array of
perspectives and timely insights from experts and stakeholders, enabling a holistic understanding of
sustainability challenges. Given the speed and volume of information flow, organizations have
been adopting natural language processing techniques for news analysis for quite some time
now [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Question-answering (QA) systems are pivotal in sustainability analysis due to their eficiency
in data retrieval, contextual understanding, and ability to provide interdisciplinary insights.
Sustainability encompasses diverse domains, and QA systems assist stakeholders in providing
answers by extracting relevant data from various sources while understanding the context
of their inquiries. These systems reduce the manual eforts required to read and review each
story. QA systems aid in benchmarking, support data-driven decision-making, and tackle
complex queries, ultimately contributing to more informed sustainability analysis and strategy
development[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The emergence of large language models (LLM), trained on extensive text data,
represents a groundbreaking advancement in natural language processing. These models excel
at producing highly articulate and cohesive text with minimal input, unlocking new potentials
in conversational AI, creative writing, and various other fields.
      </p>
      <p>In this work, we present a system that facilitates ESG question-answering over news corpus
using a sustainability knowledge graph-aided retrieval augmented generation through LLMs.
Our methodology involves the construction of an ESG Knowledge Graph built on top of the
GRI reporting structure that encapsulates the essential entities and relationships extracted
from sustainability news articles. We show that KG-enhanced retrieval achieves better QA
performance than simple embedding matches. We have experimented with multiple
opensource LLMs and have shown their comparative performances. This framework ensures that
the answers provided to investors are not only informative but also comprehensible.</p>
      <p>The contributions of this work are highlighted below:
• The creation of Sustainability knowledge Graph using GRI reporting structure and other
web sources.
• We propose the use of KG driven document retrieval for answering ESG questions.
• Human like answer generation using LLMs.
• Evaluation and comparison of results from our approach with several LLM based baseline
approaches.</p>
      <p>• Comparative evaluation of performances of multiple LLMs for ESG QA.</p>
      <p>In the next section, we present details of the proposed system and its components.</p>
    </sec>
    <sec id="sec-2">
      <title>2. ESG Question-Answering System</title>
      <p>Figure 1 shows the architecture and components of the proposed system. The ESG knowledge
graph creation is presented in section 2.1. The news processing module presented in section
2.2 extracts information components from news articles and updates the existing Knowledge
graph. Section 2.3 details the knowledge graph-driven news document retrieval and answer
generation methodology.</p>
      <sec id="sec-2-1">
        <title>2.1. ESG Knowledge Graph</title>
        <p>
          The ESG knowledge graph is created using elements taken from the widely recognized
GRI sustainability reporting framework, FinSim4-ESG 2022 shared task, [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], and updated with
information extracted from news articles. In GRI, sustainability reporting is considered from
three perspectives: economic, environmental, and social [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] defined in the form of a series of
indicators. The FinSim4-ESG 2022 task focused on the elaboration of an ESG taxonomy based
on data like companies’ sustainability reports, annual reports, and environment reports, and
made use of them to analyze how an economic activity complies with the taxonomy.
        </p>
        <p>
          Figure 2 represents the schema of the Sustainability knowledge Graph. The graph comprises
multiple levels of entities defined as follows:
• Sustainability- This represents the root node of the graph.
• Sustainability categories – Three nodes branched under Sustainability represent the
three aspects of ESG that are Environment, Social, and Governance.
• Basic entities – These include 32 fundamental terms representing basic indicators of
GRIs which encompass the fundamental topics within the sustainability domain, such as
water (GRI_303), emissions (GRI_305), and public policy (GRI_415), etc. Apart from GRI
indicators, we have added additional basic entities taken from FinSim4-ESG shared task
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] data like Sustainable agriculture (GRI_none), executive compensation (GRI_none),
climate change (GRI_none), etc. Each entity at this level contains two attributes, GRI
ID and the definition of an indicator. We align GRI indicators with their corresponding
sustainability categories by referencing the indicator definitions. In this work, GRI 300
series and GRI 400 series indicators are associated with Environment and Social category,
respectively. However, for Governance, we have taken indicators from GRI 200 and 400
series, as GRI standards have not defined this category explicitly.
• Intermediate Entities – These are more specific than basic entities. For example,
freshwater, greenhouse gas emission, bribery, tax fraud, lobbying, etc. fall into this
category. The connections between basic entities and intermediate entities are represented
by the relation ‘Contains’ or ‘Process’ or ‘Measured_as’ depending on the nature of the
relationships or interactions within the specified domain of the ontology. For instance,
(biodiversity, contains, flora), (water, measured_as, water consumption).
• Lower-Level Entities – As we move down the hierarchy, entities become more
specialized and granular, representing specific instances or sub-types. Examples include
carbon-dioxide emission and methane emission are sources of greenhouse gas emissions.
Similarly, physical hazard and chemical hazard are types of work-related injuries. The
connections between Intermediate entities and Lower-level entities are represented by the
relation ‘Type’ or ‘Source’ or ‘Measured_as’. For instance, (Renewable energy, type, solar
energy), (greenhouse gas emission, source, carbon-dioxide emission), (emission reduction,
measured_as, green transportation).
        </p>
        <p>Intermediate and lower-level entities are derived from detailed descriptions of GRI indicators
given in GRI standards glossary. Sample hierarchy of knowledge graph entities from basic to
lower level is shown in Appendix A Table 3.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. News processing</title>
        <p>
          We have created a sustainability news corpus containing 4331 documents published during the
year 2021-2022 from Reuters sustainability business news2 to keep the collection sustainability
focused. Each article is processed and attached to the knowledge graph in the form of entities
and relations described below:
• Article Nodes - A news article within a knowledge graph is represented as an entity that
encapsulates information obtained from news. Each article node comprises 5 attributes
defined as follows:
2https://www.reuters.com/sustainability/
– Article_Id – a unique identifier for each article node.
– Publication_Date – It indicates the date when the article was published.
– Headline – It represents the title of the article.
– Article Summary – This attribute contains a summary of the content of the article
obtained using a pre-trained transformer-based encoder-decoder model PEGASUS
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. It helps in obtaining a fixed length representation of the article’s content.
– All_Organizations – It represents a collection of all organizations mentioned within
the article. We have used Named Entity Recognition module to obtain the list of
organizations mentioned in the news article.
• Organization Node – This type of node in the knowledge graph represents the
organizations that are frequently occurring in news articles. These nodes are connected
to their corresponding article nodes through a HAS_Org relation. Creating a separate
organization node aid in faster retrieval and organization-based filtering of articles.
        </p>
        <p>
          Linking news to KG: For each article, we employ RAKE (Rapid Automatic Keyword
Extraction) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] algorithm to extract informative phrases that encapsulate the main themes and topics
discussed in the articles. RAKE is a widely used unsupervised keyword extraction technique that
leverages statistical measures, such as word frequency and co-occurrence, to identify important
phrases within a document. Subsequently, we utilize the phrase-BERT algorithm [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] to generate
embeddings for these extracted key phrases, capturing their semantic meanings in dense vector
representations. Similarly, each entity in the KG is represented by 768-dimensional phrase-BERT
embedding. For each RAKE key phrase, its maximally similar phrase in KG entities is found
using cosine similarity. Each article phrase is mapped to the maximally matching entity and
depicts a mapping of a single article to multiple intermediate or lower-level entities in the KG.
Hence, an edge is built between an article node and all mapped intermediate or lower-level
entities with "Contained_in" relation.
        </p>
        <p>Figure 3 shows a subset of basic entities, intermediate entities, lower-level entities and article
node that are interconnected based on the relationships described in the schema.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. KG driven Retrieval augmented generation (KG-RAG)</title>
        <p>In this module, we present a retrieval strategy that uses the knowledge graph created earlier
for fetching relevant article nodes based on a user question, the content of which is further
used for generating answer to the question using a large language model. Our QA module
comprises two components: (i). KG Retriever, which takes a given question q within the context
of a knowledge graph (, ) and outputs the top k relevant article nodes; and (ii). an Answer
Generator responsible for crafting the sequence of answers.</p>
        <p>Knowledge Graph Retriever: Consider a knowledge graph (, ), where  denotes
the nodes and  represents the edges within the knowledge graph. Each node  contains a
variable number of attributes. Let  represent the ℎ node of the knowledge graph and  is
the ℎ attribute of the node. It’s important to note that nodes of the knowledge graph with
diferent labels can have diferent numbers of attached attributes. The edges, denoted as ,
serve as connection between nodes  and . Our task is to retrieve the top k most relevant
article nodes to the question .</p>
        <p>
          Graph Embedding: Given that each node is characterized by multiple attributes, we encode
each attribute of the node as a dense vector using the Universal Sentence Encoder (USE). USE
is a pre-trained deep learning model that encodes sentences into fixed-size vectors, capturing
semantic meanings [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The USE produces a 512-dimension vector.
        </p>
        <p>
          Retrieval Based on Traversed Sub-Graphs: In the process of creating embedding, the
graph structure has not been utilized. To maximize the utility of the graph, it is essential to
incorporate the path from article node to the root node. This path encompasses additional
information present at the article level. Our approach involves traversing the graph from the
article node through all possible paths to the sustainability (root) node, thereby creating a
sub-graph that contains all paths leading to the article from the sustainability node(root). Paths
leading to the root node are traced utilizing a depth-first algorithm [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The process initiates
with all article nodes, identifying their first neighbors and proceeding in a singular direction to
include all inter-related nodes from each level back to the root node as shown in algorithm 1.
These traversed sub-graphs are denoted as the document representation _, and they
play a crucial role in generating scores for articles.
        </p>
        <p>Document scoring: Each input question q is encoded using USE. Subsequently, we calculate
the cosine similarity between the encoded question and all nodes  in the knowledge graph.
Node similarity score is the maximum of similarity scores for attributes. To score an article
node based on these similarity scores, we leverage the traversed sub-graph structure and
__ represents the score of ℎ node of ℎ document in _ in decreasing
order. Our methodology involves determining the final score for each article by adding the
maximum scored node from the traversed sub-graph and the average scores of the other top
n-scored nodes. In cases where a question exhibits the highest similarity to a single path, that
specific path singularly contributes to the overall score. Conversely, when multiple paths exist,
the top n scores are distributed among these paths, highlighting diverse relevant paths. The
scoring function utilized is outlined as follows:</p>
        <p>_ = (_(,  ))∀
Algorithm 1 Document Representation or Traversed sub graph &amp; Document Score
1: Inputs: (, ),  _
2: Output: _, _
3: ,  ℎ_, _, _ ← []
4: for  = 1, 2, . . . ,  do
5: if . is Document then
6:  ←  _
7:  ℎ_ ← all nodes in the path from  to sustainability
8: _ ← [,  ℎ_]
9: end if
10: end for
11: for  = 1, 2, . . . ,  in  do
12: _ℎ_ ← [ _[]]
13: for  ℎ = 1, 2, . . . ,  in  ℎ_ do
14: _ℎ_ ←  _[ ℎ]
15: end for
16:  = ((_ℎ_)[1 : 4]
17: _ ← (_ℎ_) + 
18: end for
_ = __0 + 1 ∑︁ __
 =1</p>
        <p>Answer Generation: We have experimented with multiple LLM models for answer
generation. LLM model takes as input the question, a fixed prompt, and the content of the retrieved
article to generate the answer.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Experiments and Results</title>
      <p>Within our Knowledge Graph, we have a comprehensive representation of 540 unique
organizations. Notably, 28 organizations have more than 30 articles each. Among these, Shell holds
the lead with a maximum of 62 articles. Additionally, 86 organizations are within the range of
10-30 articles, contributing to the richness of our graph. The majority of organizations, totaling
426, are associated with less than 10 articles each. This distribution reflects the diversity of
information captured in the Knowledge Graph across various organizations and their respective
article counts. We have curated a question dataset consisting of 144 questions generated with the
help of multiple ESG domain experts. These questions are expert categorized into environment,
social, and governance categories having 59, 41, and 44 questions, respectively. As validating
QA on all companies entailed a significant computational load, we chose to run all 144 questions
on 30 companies to evaluate the performance of our models. We have randomly picked 15
companies from greater than 30 articles and 10 from 10-30 articles and 5 from less than 5 articles.
The answers generated by diferent methods are manually evaluated by domain experts. We
have experimented with two variations of the Knowledge Graph referenced in this section as
KG and KG_Enhanced. KG_Enhanced includes additional attributes for article nodes such as
summary and all organization which were omitted from KG.</p>
      <p>
        For evaluating proposed KG-RAG architecture, we utilized the following baseline retrieval
methods, returning top 3 news articles for each question considering news title and content:
• BM25- It calculates relevance scores based on term frequency, document length, and
inverse document frequency. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
• LangChain- LangChain employs a retriever using a sentence transformer model. We
created embeddings for complete articles separately using all-MiniLM-L6-v2 [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Based
on similarity score with question we get top 3 articles.
• MMR - Maximal Marginal Relevance ensures the selection of diverse and relevant
information by iteratively maximizing the similarity between retrieved items while minimizing
redundancy [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. It also uses all-MiniLM-L6-v2 for embeddings.
      </p>
      <p>
        For the answer generation task, we have used the following LLMs:
• Llama2 - Llama 2 7b chat-hf model, which is a transformer-based model with 7 billion
parameters is used with 4-bit quantization [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. It is a fine-tuned model of base Llama2
using RLHF. Its context length is 4096 tokens.
• Mistral - Mistral-7B-Instruct-v0.1 Large Language Model (LLM) is an instruction
finetuned version of the Mistral-7B-v0.1 generative text model using a variety of publicly
available conversation datasets [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. This model also has context length is 4096 tokens
and its 4-bit quantized version is used.
• Phi2 - Phi-2 is a Transformer with 2.7 billion parameters [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. It was trained using the
same data sources as Phi-1, augmented with a new data source that consists of various
NLP synthetic texts and filtered websites. Its context length is 2048 tokens.
• TinyLlama - TinyLlama-1.1B-Chat-v1.0, following the Llama 2 architecture, is a chat
model fine-tuned on top of TinyLlama-1.1B base model [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>Figure 4 illustrates the comparative performance of the two LLMs, Llama2 and Mistral,
across diferent retrieval methods. Here accuracy represents percentage of correct answers
generated. We observe a consistent trend where the accuracy of both Llama2 and Mistral
tends to increase as we move from traditional models such as BM25, LangChain and MMR to
more advanced KG based models, which is KG and KG_Enhanced. Notably, the KG_Enhanced
model achieves the highest accuracy with Mistral and comparable accuracy to KG retriever with
Llama2. Overall, the KG driven models achieves better accuracy than baselines with both LLMs.
This observation underscores the efectiveness of leveraging KG in enhancing the accuracy of
LLM based question-answering task.</p>
      <p>Category Environment Social Governance Overall
KG_Llama2 70.61% 75.6% 70.45% 71.99%
KG_Mistral 70.72% 81.29% 80.3% 76.62%
KG_Phi2 52.07% 52.03% 59.84% 54.39%
KG_Enhanced_Llama2 74% 71.54% 68.93% 71.75%
KG_Enhanced_Mistral 80.78% 82.54% 85.25% 84.72%
KG_Enhanced_Phi2 49.71% 56.09% 63.63% 55.78%
with retrieved article headline.</p>
      <p>TinyLlama with 1.1 billion parameters on the other hand exhibited comparatively weaker
performance, consistently generating responses based on its own knowledge or producing random
output. The answers generally fall short of expectations, and despite experimenting with various
prompts, it consistently fails to generate satisfactory responses. As an illustration, when posed
with the inquiry "Does Amazon have any initiatives or partnerships for Forest Restoration?"
and provided with KG enhanced articles, other models deliver meaningful responses. In sharp
contrast, TinyLlama ofers an unhelpful reply, "# Given a text, generate response." Moreover, in
certain instances, it tends to generate answers that lack coherence, following no discernible
patterns and resembling random output.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Related Work</title>
      <p>
        In the dynamic landscape of information retrieval, a task that is both crucial and continually
evolving, recent research has made significant strides with the introduction of diverse retrieval
models. Traditional BM25 has provided a robust foundation, relying on sparse
representations to facilitate eficient document retrieval [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. On the other hand, the Dense Passage
Retrieval framework which leverages dense representations and neural networks is also
achieving state-of-the-art performance in open-domain question answering and document retrieval
[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Furthermore, innovative methodologies, such as Colbert, introduced by Ma et al.[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
emphasize the importance of context augmentation through text generation. These approaches
have proven to be instrumental in enhancing query semantics and optimizing information
retrieval processes. In [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], LLM-based diverse retrieval models and techniques collectively
contribute to the ongoing evolution of information retrieval, ofering valuable insights and
solutions to address the multifaceted challenges in this field. However, with the advancement
of Large Language models viz GPT3 [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], PaLM2 [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], Gemini [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], RAG stands out due to
factual answer generation. The Retrieval-Augmented Generation (RAG) [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] model combines
a retriever with a generator to answer questions over a knowledge base. A general-purpose
ifne-tuning recipe for RAG models which combines pre-trained parametric and non-parametric
memory for language generation is used.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion &amp; Future Work</title>
      <p>In this work, we presented a Knowledge-Graph driven Retrieval Augmented Generation system
to facilitate ESG question answering over news corpus. Our methodology encompasses the
creation of an ESG Knowledge Graph, retrieval techniques that identify contextually relevant
information, and an LLM-based answer-generation framework. We have experimented with
multiple LLMs and have shown a comparative study of their performances against several
baseline algorithms. LLMs with a higher number of parameters show promising results. In future,
we are planning to explore LLM fine-tuning on ESG data. Also, we are yet to include temporal
questions that span across multiple years of data. We are looking forward to advancements in
both retrieval and LLM space to expand the current work.</p>
    </sec>
    <sec id="sec-6">
      <title>A. Appendix</title>
      <sec id="sec-6-1">
        <title>Energy (GRI_302) Table 3: ESG Knowledge Graph entities - examples</title>
      </sec>
      <sec id="sec-6-2">
        <title>Occupational health and safety</title>
        <p>(GRI_403)
Emission (GRI_305)
energy intensity
energy consumption
energy reduction
safe work environment
accidental spill
physical hazard, ergonomic
hazard, chemical hazard,
biological hazard, psycho
social hazard, mental
hazard
carbon-dioxide emission,
global warming potential,
methane emission, nitrous
oxide, sulphur oxide
"""
Only use the text given within context "##" to answer the question, don’t make up
anything else based on your knowledge. If you don’t get the answer from context or no
mention of answer in context, then generate "insuficient information available" and
don’t add anything else. Answer in format
## Context: {context} ## Question: {question} Answer:
"""
Hardware: In our experiments, we utilized the MiGA100 GPU, which boasts 14 vCPUs, 60
GiB of RAM, and 20 GiB of GPU memory for our generation tasks. Additionally, we conducted
experiments on the free version of Google Colab, utilizing the T4 GPU provided.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lozano</surname>
          </string-name>
          , R. von Haartman,
          <article-title>Reinforcing the holistic perspective of sustainability: Analysis of the importance of sustainability drivers in organizations</article-title>
          ,
          <source>Corporate Social Responsibility and Environmental Management</source>
          <volume>25</volume>
          (
          <year>2018</year>
          )
          <fpage>508</fpage>
          -
          <lpage>522</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tsang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Frost</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cao</surname>
          </string-name>
          , Environmental, social, and
          <article-title>governance (esg) disclosure: A literature review</article-title>
          ,
          <source>The British Accounting Review</source>
          <volume>55</volume>
          (
          <year>2023</year>
          )
          <fpage>101149</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Murakami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Muraoka</surname>
          </string-name>
          ,
          <article-title>Exploring the potential of internet news for supply risk assessment of metals</article-title>
          ,
          <source>Sustainability</source>
          <volume>14</volume>
          (
          <year>2022</year>
          ). URL: https://www.mdpi.com/2071-1050/14/1/409. doi:
          <volume>10</volume>
          .3390/su14010409.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B.</given-names>
            <surname>Bui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Houqe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaman</surname>
          </string-name>
          ,
          <article-title>Climate governance efects on carbon disclosure and performance</article-title>
          ,
          <source>The British Accounting Review</source>
          <volume>52</volume>
          (
          <year>2020</year>
          )
          <fpage>100880</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>El Maarouf, FinSim4-ESG shared task: Learning semantic similarities for the financial domain. extended edition to ESG insights</article-title>
          , in: C.
          <string-name>
            <surname>-C. Chen</surname>
          </string-name>
          , H.
          <string-name>
            <surname>-H. Huang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Takamura</surname>
          </string-name>
          , H.
          <string-name>
            <surname>-H. Chen</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the Fourth Workshop on Financial Technology and Natural Language Processing (FinNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Abu Dhabi,
          <source>United Arab Emirates (Hybrid)</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>211</fpage>
          -
          <lpage>217</lpage>
          . URL: https: //aclanthology.org/
          <year>2022</year>
          .finnlp-
          <volume>1</volume>
          .28. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .finnlp-
          <volume>1</volume>
          .
          <fpage>28</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Webber</surname>
          </string-name>
          ,
          <article-title>A programmatic introduction to neo4j</article-title>
          ,
          <source>in: Proceedings of the 3rd annual conference on Systems, programming, and applications: software for humanity</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>217</fpage>
          -
          <lpage>218</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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>
          , P. Liu, Pegasus:
          <article-title>Pre-training with extracted gap-sentences for abstractive summarization</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>11328</fpage>
          -
          <lpage>11339</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Rose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Engel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cramer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Cowley</surname>
          </string-name>
          ,
          <article-title>Automatic keyword extraction from individual documents, Text mining: applications and theory (</article-title>
          <year>2010</year>
          )
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Thompson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Iyyer</surname>
          </string-name>
          , Phrase-bert:
          <article-title>Improved phrase embeddings from bert with an application to corpus exploration</article-title>
          ,
          <source>arXiv preprint arXiv:2109.06304</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Cer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , S.-y. Kong,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Limtiaco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>St. John</surname>
          </string-name>
          , N. Constant, M. GuajardoCespedes, S. Yuan,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Strope</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kurzweil</surname>
          </string-name>
          ,
          <article-title>Universal sentence encoder for English</article-title>
          , in: E. Blanco, W. Lu (Eds.),
          <source>Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, Association for Computational Linguistics</source>
          , Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>169</fpage>
          -
          <lpage>174</lpage>
          . URL: https://aclanthology.org/D18-2029. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D18</fpage>
          -2029.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Tarjan</surname>
          </string-name>
          ,
          <article-title>Depth-first search and linear graph algorithms</article-title>
          ,
          <source>SIAM journal on computing 1</source>
          (
          <year>1972</year>
          )
          <fpage>146</fpage>
          -
          <lpage>160</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zaragoza</surname>
          </string-name>
          , et al.,
          <article-title>The probabilistic relevance framework: Bm25 and beyond</article-title>
          ,
          <source>Foundations and Trends® in Information Retrieval</source>
          <volume>3</volume>
          (
          <year>2009</year>
          )
          <fpage>333</fpage>
          -
          <lpage>389</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <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>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanner</surname>
          </string-name>
          ,
          <article-title>Probabilistic latent maximal marginal relevance</article-title>
          ,
          <source>in: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>833</fpage>
          -
          <lpage>834</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Almahairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Babaei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bashlykov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhosale</surname>
          </string-name>
          , et al.,
          <source>Llama</source>
          <volume>2</volume>
          :
          <article-title>Open foundation and fine-tuned chat models</article-title>
          ,
          <source>arXiv preprint arXiv:2307.09288</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <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>Roux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Savary</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. d. l. Casas,
          <string-name>
            <given-names>E. B.</given-names>
            <surname>Hanna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bressand</surname>
          </string-name>
          , et al.,
          <source>Mixtral of experts, arXiv preprint arXiv:2401.04088</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bubeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Eldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Del Giorno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gunasekar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Textbooks are all you need ii: phi-1.5 technical report</article-title>
          , arXiv preprint arXiv:
          <volume>2309</volume>
          .05463 (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Zeng,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Tinyllama:</surname>
          </string-name>
          <article-title>An open-source small language model</article-title>
          ,
          <source>arXiv preprint arXiv:2401.02385</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Oğuz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Edunov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W.-t. Yih,
          <article-title>Dense passage retrieval for open-domain question answering</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>04906</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>O.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zaharia</surname>
          </string-name>
          ,
          <article-title>Colbert: Eficient and efective passage search via contextualized late interaction over bert</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>39</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          , W. Liu,
          <string-name>
            <given-names>C.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <article-title>Large language models for information retrieval: A survey</article-title>
          ,
          <source>arXiv preprint arXiv:2308.07107</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>R.</given-names>
            <surname>Anil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Firat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lepikhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shakeri</surname>
          </string-name>
          , E. Taropa,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bailey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.,
          <source>Palm 2 technical report, arXiv preprint arXiv:2305.10403</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>G.</given-names>
            <surname>Team</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Anil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgeaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-B. Alayrac</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Soricut</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Schalkwyk</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Hauth</surname>
          </string-name>
          , et al.,
          <article-title>Gemini: a family of highly capable multimodal models</article-title>
          ,
          <source>arXiv preprint arXiv:2312.11805</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Perez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piktus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Petroni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Karpukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Küttler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rocktäschel</surname>
          </string-name>
          , et al.,
          <article-title>Retrieval-augmented generation for knowledge-intensive nlp tasks</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>9459</fpage>
          -
          <lpage>9474</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>