<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>A study of the impact of generative AI-based data augmentation on software metadata classification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tripti Kumari</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chakali Sai Charan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ayan Das</string-name>
          <email>ayandas@iitism.ac.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science and Engineering</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Indian Institute of Technology (ISM) Dhanbad</institution>
          ,
          <addr-line>Jharkhand, 826004</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the system submitted by the team from IIT(ISM) Dhanbad in FIRE IRSE 2023 shared task 1 on the automatic usefulness prediction of code-comment pairs as well as the impact of Large Language Model(LLM) generated data on original base data towards an associated source code. We have developed a framework where we train a machine learning-based model using the neural contextual representations of the comments and their corresponding codes to predict the usefulness of code-comments pair and performance analysis with LLM-generated data with base data. In the oficial assessment, our system achieves a 4% increase in F1-score from baseline and quality of generated data.</p>
      </abstract>
      <kwd-group>
        <kwd>Comment-code pairs</kwd>
        <kwd>LLM-generated data</kwd>
        <kwd>Support vector machine</kwd>
        <kwd>ELMO</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        In the rapidly developing world of software development, comments play a crucial role in
enhancing code readability and maintainability of the corresponding codes in the code bases [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Before executing any software maintenance-related task, or doing any kind of modification and
enhancement, developers usually spend a significant amount of time reading and understanding
the codes. This process is very time-consuming, particularly, in the case of source codes that
implement complex functionalities. So, it is common practice among developers to write
comments for code snippets to enhance the comprehensibility of the code. The comments are
expected to be helpful in capturing the complete structure and functionality of the codes. This
makes commenting one of the most commonly employed documentation methods for software
maintenance tasks [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] on condition that the comments are elaborate and expressive enough to
capture the functionality of the programs and that the quality of the comments is maintained
throughout the code base.
      </p>
      <p>
        However, sometimes the comments themselves may be incomplete, inconsistent, and dificult
to relate to the source code [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Such comments may result in a waste of efort in the
interpretation of the corresponding code and even may result in a complete misinterpretation of the
purpose of the program.
      </p>
      <p>Thus understanding the relevance of a comment to a piece of code is crucial before actually
CEUR
Workshop
Proceedings</p>
      <sec id="sec-2-1">
        <title>Comment</title>
      </sec>
      <sec id="sec-2-2">
        <title>Surrounding code context Label</title>
        <p>/*deal with it later*/ -1. /*deal with it later*/1.
/*switch on*/
-1.f(toggle)
/*switch on*/1.else</p>
      </sec>
      <sec id="sec-2-3">
        <title>Explanation</title>
      </sec>
      <sec id="sec-2-4">
        <title>The code does not exist</title>
        <p>for this comment.</p>
      </sec>
      <sec id="sec-2-5">
        <title>Not Useful So, comment is Not Useful</title>
      </sec>
      <sec id="sec-2-6">
        <title>The comment correctly describes the code and Useful hence Useful</title>
        <p>using it to understand the purpose of the program. However, given the volume of source
code in a standard software project, it is a laborious task to manually verify the usefulness of
each comment to their corresponding code. Thus, a system that can automatically predict the
usefulness of a comment to its related code snippet may significantly speed up the process of
source code analysis. Furthermore, the comment may be rewritten to make it more relevant
and informative in case the system predicts the comment to be unuseful.</p>
        <p>
          Recently, artificial intelligence-based interactive systems, such as ChatGPT [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] are being
widely used to generate texts for diferent real-time purposes. These systems are also being used
by programmers to generate comments for their programs to save time and efort. However,
no work has been reported in the literature on the quality of the comments generated by such
systems. Given a code-comment pair, these systems may also be used to predict the usefulness
of the comment to the corresponding code. However, the accuracy of the predictions of the
AI-based systems is not reported in the literature. Thus, it is an open and interesting research
area to explore the eficacy of such AI-based systems in automatic comment generation or
prediction of the usefulness of a comment for a given code snippet.
        </p>
        <p>
          The Task-1 of FIRE 2023 IRSE shared task[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], mainly focuses on two subtasks. The first
subtask is comment classification . It involves automatically predicting the usefulness of a given
comment to the corresponding source code snippet. It is a binary classification task, that requires
us to develop a system, which takes a source code snippet and their associated comment as
input. The proposed system automatically classifies whether the comment corresponding to the
source code is ”Useful” or ”Not Useful”. The overview paper of IRSE2022 contains information
about the shared task in detail[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. We have proposed a system, which takes a code-comment
pair as input and generates their representations using a pre-trained neural encoder uses these
representations to predict whether the comment is relevant to the code.
        </p>
        <p>
          The second subtask is to study the impact of large language models in comments. In this
subtask, the participants are required to augment the base data provided for Subtask 1 with
additional data and to carry out a comparative study of the performance of the models trained
using the base data and augmented data. The additional data for augmentation is expected
to comprise the code-comment pairs obtained from diferent sources with their usefulness
labels predicted using large language models (LLMs)[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. For this purpose, we manually collect
code-comment pairs from diferent data resources such as GitHub, stack overflow, computer
vision, Curl, etc., and then queried the ChatGPT[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] with each code-comment pair to get the
usefulness label. We augmented this data with the original seed data and trained some models
using diferent combinations of the additional dataset. We carried out a set of experiments to
study the efect of data augmentation on the system performance.
        </p>
        <p>
          This paper reported the comprehensive explanation of the proposed system submitted to FIRE
IRSE2023 for task 1[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. We have conducted some experiments and trained the machine learning
models, which take the representations of a snippet of source code and their corresponding
comments as input. These trained models made predictions about the relevance of the comment
to the associated source code with original base data and augmented datasets.
        </p>
        <p>The remaining sections are arranged as follows. Section 2, presented the related works where
we have done some literature surveys on previous work. In this section 3, we have presented
a description of diferent types of LLM-generated datasets and the data made available for
the shared task. We have also reported a brief description of data representation and system
specification of the system submitted for the shared task. Section 4, presented a comprehensive
analysis of the results on diferent runs with the dataset. In Section 5, we have concluded our
work on shared tasks.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2. Related work</title>
      <p>
        We have done some surveys on the usefulness of code-comment pairs as well as the impact of
ChatGPT[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] generated comments. We found out some important studies.
      </p>
      <p>
        Majumdar et al.[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], proposed a survey paper, which is based on the IRSE track (FIRE 2022),
and developed solutions for automated evaluation of code comments and classifying comments
as useful or not Useful. Rahman et al.[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] did a comparative study on usefulness and developed
a RevHelper for automatic usefulness prediction. Soni et al.[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] developed an automatic text
classifier to identify ChatGPT-generated summaries. Shinyama et al.[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]propose a model i.e.C4.5
for code-comments analysis. Naili et al.[11]developed a generator network with a coverage
mechanism. Pre-trained ELMo contextual embedding was used to generate the highlights
of this research paper. Majumdar et al.[12] have proposed a COMMENT-MINE semantic
search architecture. this architecture is mainly used to extract knowledge based on the design,
implementation, and development of software in the form of a knowledge graph. Majumdar
et al.[13], developed features to semantically analyze the comments to concepts based on
categories of usefulness. They have used Neural networks(NN) to know the usefulness of code
comment pairs. Majumdar et al.[14] search for contextualized embeddings for code search and
classification and developed a system for generating contextualized representations for codes
and comments by training ELMo from scratch.
      </p>
    </sec>
    <sec id="sec-4">
      <title>3. Experiment design</title>
      <p>This section presents a detailed discussion of the proposed system developed for automatically
predicting the relevance of code-comment pairs and the experiments carried out on the diferent
combinations of the data sets. In Subsection 3.1 we present the details of the prediction system.
The details for the datasets used for the experiments are reported in Subsection 3.2.</p>
      <sec id="sec-4-1">
        <title>3.1. System description</title>
        <p>Our prediction system is a supervised machine-learning-based system that consists of a support
vector machine (SVM) [15] trained on the distributed representations of the code-comment
pairs. It takes the representations of the code-comment pair as input and predicts whether the
comment is relevant to the corresponding code snippet.</p>
        <p>The distributed representations of code-comment pairs are obtained from a pre-trained
ELMO-based model [16]. We have used the ELMO code1 provided by the Information Retrieval
in Software Engineering (IRSE) team. For a given code comment pair, we separately pass the
code and the comment to the ELMO model[16] as input as a sequence of tokens. For an input
sequence, the ELMO model[16] generates 200-dimensional contextual embeddings for each
space-separated token in the input sequence. The representation for an input sequence is
then obtained by taking the mean of all the token representations. So, the representation of a
given input sequence is a 200-dimensional embedding. The 200-dimensional representations
of the code and the comment sequences are then concatenated into a joint 400-dimensional
representation.</p>
        <p>During training, we generate the representations for all the code-comment pairs in the training
data and use them to train the support vector machine using the radial basis function (RBF)
kernel[17]. During testing, the model saved during the training phase takes the representation
of the code-comment pair as input and predicts the usefulness of the comment.</p>
        <p>The details of the working of our prediction system is presented in Figure 1.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2. Data description</title>
        <p>
          3.2.1. Original data
Here we present a description of diferent combinations of the used datasets for our experiments.
The original data for task 1[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] was shared by the FIRE IRSE 2023. It contained 11,452 pairs of
comments, surrounding code snippets, and their class labels. i.e. if a comment is relevant to the
corresponding source code then the corresponding pair is labeled as ”Useful” otherwise it is
1ELMO Code link to generate word embeddings-https://github.com/SMARTKT/WordEmbeddings
labeled as ”Not Useful”. A total of 11,452 rows of comments were written in text format and
their surrounding source codes. A total of 4,389 code-comment pairs are labeled as ”Not Useful”
and 7,063 code-comment pairs are labeled as ”Useful”, which is mentioned in a sample example
in Table 1 and Table 2.
3.2.2. LLM-generated data
        </p>
        <sec id="sec-4-2-1">
          <title>Surrounding code context -7.if(dot) -6.host p++; -1.png set background fixed(png ptr,c;</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>Label</title>
        </sec>
        <sec id="sec-4-2-3">
          <title>Useful</title>
        </sec>
        <sec id="sec-4-2-4">
          <title>Not Useful</title>
          <p>
            For Subtask 2, we have manually collected a total of 510 code-comments pairs from diferent
data resources such as GitHub, stack overflow, computer vision, curl, etc., and then query the
ChatGPT[
            <xref ref-type="bibr" rid="ref4">4</xref>
            ] with each code-comments pair to get the usefulness label. Then we augment this
data with the original base data seen in Table 3 and we re-trained the model with the augmented
data.
3.2.3. Extra-generated data
We have experimented with another set of data where we have randomly extracted a subset of
250 ”Useful” and 250 ”Not Useful” code-comment pairs from the original seed data and altered
their labels using the following strategy. We converted the ”Useful” pairs into ”Not Useful” by
randomly shufling the comments and we ensured that at the end of the shufling none of the
codes had their original comments. We labeled such pairs as ”Not useful”. To convert the ”Not
Useful” comments to ”Useful”, we queried the ChatGPT[
            <xref ref-type="bibr" rid="ref4">4</xref>
            ] with the code snippets and got the
comments synthetically generated. This set of code and synthetically generated comment pairs
were labeled as ”Useful”. Table 3 gives an explanation of the datasets.
          </p>
          <p>For the sake of convenience, we referred to the original data, LLM-generated data, and
extra-generated data as Data1, Data2, and Data3 respectively as shown in Table 3.</p>
          <p>
            We have followed the following steps to split the original and the LLM-generated[
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] data: (i)
We have separated out the ”Useful” and ”Not Useful” code-comment pairs from the data into
two groups. (ii) We then split each group in an 80:20 ratio.
          </p>
          <p>Thus, the training data comprised a combination of 80% of the code-comment pairs with
”Useful” labels and 80% of the code-comment pairs with ”Not Useful” labels. The selection of the
80% of the samples in both cases was done randomly. The test data consisted of the remaining
20% of the samples from both groups.</p>
          <p>
            We followed the same splitting procedure for the ”LLM-generated data”[
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] and ”Extra
generated data” as well. The train and test split size of the dataset is shown in Table 3.
          </p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>3.3. Combination of all datasets</title>
        <p>
          We have created diferent combinations of datasets by combining diferent types of datasets.
The dataset description is given in this subsection ( 3.2.1, 3.2.2, and 3.2.3). Here, we have
combined the diferent data as shown in Table 4 with train test split sizes of data. The purpose
is to create new datasets to understand the impact of system performance on original data,
LLM-generated data[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], extra-generated data, and diferent combinations among them shown
in Table 4.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Result Analysis</title>
      <p>In this section, we present a discussion of our results. We performed four diferent experiments
with diferent combinations of test datasets as shown in Table 5, and Table 6.</p>
      <sec id="sec-5-1">
        <title>4.1. Run1: Original data (Dataset1)</title>
        <p>We performed experiments with the original base data of size 11,452. Original data is split into
train and test of sizes 9162 and 2290 in the ratio of 80:20 shown in Table 4. We used only the
test data of the original base data (Dataset1) for usefulness prediction.</p>
      </sec>
      <sec id="sec-5-2">
        <title>4.2. Run2: Combination of original data and LLM-generated data (Dataset2)</title>
        <p>
          Our second experiment was carried out with original data and LLM-generated data[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. A total
of 510 LLM-generated data are split in the ratio of 80:20 into train and test data sizes are 408
and 102 respectively. Now, the total sum of training data and test data of Dataset2 sizes are 9570
and 2392. To analyze the impact of LLM-generated data[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] on proposed system performance,
we augmented test data of original data and LLM-generated data[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] (Dataset2) are shown in
Table 4.
        </p>
      </sec>
      <sec id="sec-5-3">
        <title>4.3. Run3: Original data and extra-generated data (Dataset3)</title>
        <p>Our third experiment is with the combination of original base data and extra generated data. A
total of 500 extra-generated data are split in the ratio of 80:20 into train and test data sizes are
400 and 100 respectively. Now, the total sum of training data and test data of Dataset3 sizes are
9562 and 2390.</p>
      </sec>
      <sec id="sec-5-4">
        <title>4.4. Run4: Original data, LLM-generated data, and extra-generated data (Dataset4)</title>
        <p>
          We did one more experiment with the combination of original data, LLM-generated data[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ],
and extra-generated data. The total sum of training data and test data of Dataset4 sizes are 9970
and 2492.
        </p>
      </sec>
      <sec id="sec-5-5">
        <title>4.5. Result summary</title>
        <p>The overall accuracies corresponding to the experiments carried out for Run1 (Subsection 4.1,
Run2 (Subsection 4.2), Run3 (Subsection 4.3) and Run4 (Subsection 4.4) are 92.18%, 92.76%,
90.696%, and 92.47% respectively. The results are summarized in Table 5. In Run3 (Dataset3),
the accuracy value decreases, and in other Runs (with Dataset1, Dataset2, Dataset3), we are
getting almost the same accuracies with slight variation in decimal fractions value.</p>
        <p>To evaluate the performance of the system with respect to the ”Useful” class, we have used
precision, recall, and F1-score as evaluation metrics. The results are summarized in Table 6. We
have carried out diferent runs using their corresponding useful class dataset and evaluated
the Useful precision, recall, and F1-score. In Run1 (Useful dataset size -1465) and Run4 (Useful
dataset size- 1578), we are getting the same precision, recall, and F1 score. But, in the case
of Run2 (Useful dataset size- 1542), it gets slightly higher recall than other Runs but other
evaluation parameters remain the same and in Run2 (Useful dataset size- 1470), all evaluation
parameters slightly decrease than other Runs.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>In this paper, we presented our proposed system submitted for participating in task-1 shared by
IRSE FIRE 2023. The first task of shared task-1 is to build a system that takes a code-comment
pair as input to the encoder, which generates embedding that is passed to the classifier and
the classifier classifies whether the comment that corresponds to the code is ”Useful” or ”Not
Useful”. The second task is to make predictions on the augmentation of original seed data
and LLM-generated data. We have also done impact analysis and model performance with an
augmented dataset(original base data and LLM-generated data). All the performance evaluation
metrics parameters are mentioned in Table 5 and Table 6. According to the declared result, our
system achieves a 4% increase in F1-score from baseline and quality of data generated.
real summaries through blinded reviewers and text classification algorithms, 2023.
arXiv:2303.17650.
[11] M. Naili, A. H. Chaibi, H. H. B. Ghezala, Comparative study of word embedding methods
in topic segmentation, Procedia computer science 112 (2017) 340–349.
[12] S. Majumdar, S. Papdeja, P. P. Das, S. K. Ghosh, Comment-mine—a semantic search
approach to program comprehension from code comments, Advanced Computing and
Systems for Security: Volume Twelve (2020) 29–42.
[13] S. Majumdar, A. Bansal, P. P. Das, P. D. Clough, K. Datta, S. K. Ghosh, Automated evaluation
of comments to aid software maintenance, Journal of Software: Evolution and Process 34
(2022) e2463.
[14] S. Majumdar, A. Varshney, P. P. Das, P. D. Clough, S. Chattopadhyay, An efective
lowdimensional software code representation using bert and elmo, in: 2022 IEEE 22nd
International Conference on Software Quality, Reliability and Security (QRS), IEEE, 2022,
pp. 763–774.
[15] C. Cortes, V. Vapnik, Support-vector networks, Machine learning 20 (1995) 273–297.
[16] M. E. Peters, M. Neumann, M. Iyyer, M. Gardner, C. Clark, K. Lee, L. Zettlemoyer, Deep
contextualized word representations, Association for Computational Linguistics (2018)
2227–2237. URL: https://aclanthology.org/N18-1202. doi:10.18653/v1/N18- 1202.
[17] K. Thurnhofer-Hemsi, E. López-Rubio, M. A. Molina-Cabello, K. Najarian, Radial
basis function kernel optimization for support vector machine classifiers, arXiv preprint
arXiv:2007.08233 (2020).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shinyama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Arahori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gondow</surname>
          </string-name>
          ,
          <article-title>Analyzing code comments to boost program comprehension</article-title>
          ,
          <source>in: 2018 25th Asia-Pacific Software Engineering Conference (APSEC)</source>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>334</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>C. B. de Souza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Anquetil</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. de Oliveira</surname>
          </string-name>
          ,
          <article-title>A study of the documentation essential to software maintenance, Association for Computing Machinery (</article-title>
          <year>2005</year>
          )
          <fpage>68</fpage>
          -
          <lpage>75</lpage>
          . URL: https://doi.org/10.1145/1085313.1085331. doi:
          <volume>10</volume>
          .1145/1085313.1085331.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yuan</surname>
          </string-name>
          , G. Krishna,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , /*icomment: Bugs or bad comments?*/, SIGOPS Oper.
          <source>Syst. Rev</source>
          .
          <volume>41</volume>
          (
          <year>2007</year>
          )
          <fpage>145</fpage>
          -
          <lpage>158</lpage>
          . URL: https://doi.org/10.1145/1323293.1294276. doi:
          <volume>10</volume>
          . 1145/1323293.1294276.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4] OpenAI, Gpt-4
          <source>technical report</source>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Majumdar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Paul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Paul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Dave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chattopadhyay</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. P. Das</surname>
            ,
            <given-names>P. D.</given-names>
          </string-name>
          <string-name>
            <surname>Clough</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Majumder</surname>
          </string-name>
          ,
          <article-title>Generative ai for software metadata: Overview of the information retrieval in software engineering track at fire 2023, in: Forum for Information Retrieval Evaluation</article-title>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Majumdar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. P. Das</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. D Clough</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Chattopadhyay</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Majumder</surname>
          </string-name>
          ,
          <article-title>Overview of the IRSE track at FIRE 2022: Information Retrieval in Software Engineering, in: Forum for Information Retrieval Evaluation</article-title>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Enabling large language models to generate text with citations</article-title>
          ,
          <source>arXiv preprint arXiv:2305.14627</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Majumdar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          ,
          <string-name>
            <surname>P. P. Das</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Clough</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Chattopadhyay</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Majumder</surname>
          </string-name>
          ,
          <article-title>Can we predict useful comments in source codes?-analysis of findings from information retrieval in software engineering track@ fire 2022</article-title>
          ,
          <source>in: Proceedings of the 14th Annual Meeting of the Forum for Information Retrieval Evaluation</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>M. M. Rahman</surname>
            ,
            <given-names>C. K.</given-names>
          </string-name>
          <string-name>
            <surname>Roy</surname>
          </string-name>
          , R. G. Kula,
          <article-title>Predicting usefulness of code review comments using textual features and developer experience</article-title>
          ,
          <source>in: 2017 IEEE/ACM 14th International Conference on Mining Software Repositories (MSR)</source>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>215</fpage>
          -
          <lpage>226</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Soni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Wade</surname>
          </string-name>
          ,
          <article-title>Comparing abstractive summaries generated by chatgpt to</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>