<!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>Improving Accessibility and Reproducibility by Guiding Large Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Florian Andreas Marwitz</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>Marcel Gehrke</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Centre for the Study of Manuscript Cultures (CSMC), University of Hamburg</institution>
          ,
          <addr-line>Warburgstraße 26, 20354 Hamburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute for Humanities-Centered Artifical Intelligence, University of Hamburg</institution>
          ,
          <addr-line>Warburgstraße 28, 20354 Hamburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Research data repositories store numerous entries of research data, to among other advantages one goal is allowing to store us all data to reproduce experiments. Working with large corpora of texts is made significantly easier with chatbots using Large Language Models. However, Large Language Models are trained for general purposes and are not finetuned for the data originating from diferent kinds of projects. But the creators of such texts have an expert viewpoint on the data. Therefore, we propose to leverage the expert viewpoints of creators to obtain better answers from a chatbot. When creating an entry for the Research Data Repository, the creators have the possibility to add a so-called interpretation prompt. The interpretation prompt contains their expert viewpoint and be of any textual form to guide the Large Language Model to interpret the project-specific data. In particular, the interpretation prompt may contain instructions on how to reproduce experiments right inside the Large Language Model invocation. Afterward, the interpretation prompt is prepended to the query of the Large Language Model. In our examples, we show how the interpretation prompt helps to receive more tailored answers.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Large Language Model</kwd>
        <kwd>Research Data Management</kwd>
        <kwd>Prompt Engineering</kwd>
        <kwd>Reproducibility</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The goal of research data management is to keep any kind of research data accessible for other
researchers. To that end, research data repositories (RDRs) aim at preserving files for a long period of time.
From the viewpoint of a curious researcher, an RDR may contain a large number of entries in a variety
of forms: Conference paper, spreadsheets, measurements, images, and so on. Finding the relevant
entries for the own work is therefore challenging because of the vast amount and size of available data.
The advent of Large Language Models (LLMs) has given rise to the integration of LLMs into RDRs
for finding relevant works [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, LLMs are trained for general purposes and understand the
project-specific data in the RDR only in a generic way, while being perfectly capable of answering
questions and comparing texts, images, or other types of media. However, the uploader of an RDR entry
understands her uploaded data normally quite well and is an expert in her field of research. Thus, we
propose that the uploader helps the general purpose LLM to provide more finetuned answers to the
data at hand. The suggested interpretation can be thought of a prompt like “The main contribution in
this paper is Definition 4 ” or a more vague one like “This data is a time series measuring heartbeats. You
can use an algorithm to classify heartbeat anomalies”. The uploader creates such an interpretation prompt
during the creation of the RDR entry, bringing her expert viewpoint into textual form. Combining the
interpretation prompt with the actual data from the RDR entry, a chatbot is now capable of giving a
project-specific answer to the user in the way the uploader most likely intended it. Another concern
for future usage of research data is that of reproducibility: Researchers publish their results such that
others can reproduce these results. Since RDRs provide long-term access to data, RDRs are also used to
provide data for reproducing results from research projects. The interpretation prompt can then be used
to tell the LLM what code or algorithm to execute and to compare the results. Using the interpretation
prompt and the LLM, users can reproduce experiments without any technical efort.
Contribution We propose to include an interpretation prompt when uploading data into an RDR.
LLMs using the RDR should include the interpretation prompt when answering questions about the
corresponding entry. This way, the uploader uses her expert viewpoint to guide the LLM to understand
the data better, making her work more accessible and citable. Moreover, the users of the RDR benefit
from a service ofering reproducibility and insightful answers instead of leaving the LLM to decide
what is useful.
      </p>
      <p>
        Related Work Wilkinson et al. have proposed the FAIR principles in 2016, requesting that data should
be findable, accessible, interoperable, and reusable [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. RDRs help to comply with the FAIR principles
by providing the means to upload data and keeping that data accessible for a long period of time [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
LLMs change the way we work with data [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]: We can ask the model a question in natural language
and receive an answer in natural language. LLMs are trained on a very large corpus of documents, like
websites, codes and books, among other things. After training, the LLM is ready to use, but lacks newer
information, which was not included in the training corpus. Retrieval-augmented generation (RAG)
tries to fix this issue by searching for sentences, which appear relevant for the query, in a specified set
of documents [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The found sentences are then added to the query. Another approach is to finetune
the model on another, task-specific training corpus [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. We go a step further by allowing the creator
of a document to specify which parts of it should be understood in which way. Our work focuses on
empowering the creator of data to employ prompt engineering [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to help future users to correctly
interpret their work using LLMs. Prompt engineering itself is the art of writing the query to the LLM in
a way to get better answers.
      </p>
      <p>Structure The remainder of this paper is structured as follows: We start with describing the setting
in which we operate and continue with our concept of guiding LLMs by interpretation prompts in more
detail. Next, we showcase on examples how the interpretation prompt changes the answer of an LLM.
Then, we discuss the interpretation prompt in the light of the examples. We end with a conclusion.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Prerequisites</title>
      <p>RDRs store numerous entries of diferent types, like data sets, conference publications, or books among
other things. Users can upload their data through a form, which asks to input metadata like authorships
alongside the actual files. We call the collection of metadata and files an entry in the RDR. The uploader
is the user who has created the entry. When viewing the entry, other users can see the title, description,
authorship information, and the uploaded files. For some file types, even an online preview might be
available. If the user finds (parts of) the entry interesting, she might work with some files. For our
paper, we assume that the RDR is equipped with some kind of LLM and that this LLM is sandboxed. The
LLM is likely accessible through a chatbot interface and tasked with helping users to find useful entries
or asking questions about entries. We call the user’s question to the LLM a query. But only having an
LLM at hand, does not fully leverage all the capabilities it ofers. In the next section, we describe how
the uploader of an entry can define how her entry should be understood or used by an LLM.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Bringing Expert Viewpoints to Large Language Models</title>
      <p>We propose to accompany data in RDRs with a so-called interpretation prompt, which specifies how
the data and how parts of it should be understood or used. In a nutshell, the uploader creates an
interpretation prompt file containing instructions for the LLM how to interpret or use her data and
when a user asks the LLM about that entry, the interpretation prompt is prepended to the query. We
ifrst describe the upload process and then the usage.</p>
      <p>The uploader uses the upload form of the RDR. We extend this upload form with a new text field,
in which the uploader can input the interpretation prompt. The RDR then stores the interpretation
prompt in a file along the other files uploaded. The file is accessible to the users just as everything else
in the entry.</p>
      <p>The interpretation prompt itself may contain the viewpoint of the uploader regarding the uploaded
data. This expert viewpoint can stem from expertise in the research area, describe the data set in
more detail, be an annotated summary, or even be the result of running an algorithm. Furthermore,
instructions on how to process the data can be included in the interpretation prompt to provide an
automated execution for verifying reproducibility. In principal, the interpretation prompt can be
anything textual, which the uploader finds important for the LLM to know about her entry. Thus, one
may include terms like “If the user asks for &lt;X&gt;, ...” to include diferent guidings for diferent use cases.
Example. An example for an interpretation prompt is: “This data set is a recording of heartbeats of the
patient. The task for the patient was to rest on the couch and then move to a chair.”</p>
      <p>When other users open the entry in the RDR, they can not only view the entry and preview files, but
can also ask the LLM about the entry or the RDR in general. The interpretation prompt prepends the
query and both are sent to the LLM with the answer being returned to the user. By prepending the
interpretation prompt, the LLM can use the expert viewpoint provided in the interpretation prompt or
reproduce some results. Moreover, the uploader benefits from her work may become more accessible
and thereby citable. In the next section, we showcase the efect of interpretation prompts in examples.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Demonstration of Interpretation Prompts</title>
      <p>
        Interpretation prompts are designed to help the LLM understand the data better. In this section, we
showcase how the interpretation prompt alters the answer of the LLM and highlight how people might
conceive the answer better. Throughout this section, we use GPT-4.1 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] as LLM. We shorten the
answers of the LLM to exemplary parts. We start with an analysis of a simple synthetic data set where
the interpretation prompt tells the LLM more about the experiment behind the data set. We continue
with a summary task, where we intend a specific direction of summary. Next, the LLM is tasked with
explaining a knowledge representation. We end with reproducing an experiment via the LLM.
      </p>
      <sec id="sec-4-1">
        <title>4.1. Synthetic Heartbeat Data</title>
        <p>We have generated a synthetic heartbeat data set with the LLM. The heartbeats in the data set are
based around 60 and go up to around 100 for a small continuous section of time steps, which mimic
a movement of a patient. We intend that the LLM recognizes the increased activity and matches it
to the movement of the patient. Thus, we ask the LLM to summarize the data set and report the key
ifndings. Without interpretation prompt, the LLM correctly recognizes the section of increased activity
and suggests an interval of stress or activity. But, it also returns a rather extensive statistical analysis.
Listing 1 shows the shortened answer of the LLM.</p>
        <p>Listing 1: Answer for analyzing artificial heartbeat data without using an interpretation prompt. The
answer is shortened to exemplary parts.
## Summary of Heartbeat Data
...
### Descriptive Statistics
| Statistic | Value |
| :-- | :-- |
| Count | 40 |
| Mean | 71.08 |
| Standard Deviation | 18.42 |
| Minimum | 55 |
| 25th Percentile | 58 |
| Median | 63 |</p>
        <p>Afterward, we add the following interpretation prompt: “The data set is a recording of the heartbeat of
a female patient with her smartwatch. You can use any algorithms for such series to find interesting facts
yourself. However, the task was to rest on a couch and then move to a chair. Please keep your answer short
and precise and do not write about unnecessary facts, only the most important things.” Now, the LLM
matches the interval of increased heartbeats to the movement. Moreover, it keeps the answer short and
reports only the relevant facts.</p>
        <p>Listing 2: Answer for analyzing artificial heartbeat data using an interpretation prompt. The answer is
shortened to exemplary parts.
### Heartbeat Data Summary
#### Key Findings
...
#### Notable Pattern
- **Average heart rate:** 71 bpm
- **Minimum heart rate:** 55 bpm
- **Maximum heart rate:** 105 bpm
#### Interpretation
- The sharp increase in heart rate at measurement 15 indicates the moment the patient moved from
the couch to the chair.
- The elevated heart rate persists for several measurements, suggesting a physiological response
to the movement before returning to baseline.
#### Table: Heart Rate Change Point
...
**Conclusion:** The data clearly shows a resting phase, a distinct increase in heart rate due to
movement, and a return to baseline, matching the described activity.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Guiding the Summary of Linear Algebra</title>
        <p>
          In this test, we use the Wikipedia article on linear algebra as a dummy RDR entry. We have used
the Wikipedia article as of July 8th, 2025 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. We intend to learn about linear algebra with a focus on
vectors and matrices, on which everything else is build upon. When only telling the LLM to summarize
the article and report the key findings, it summarizes each section of the Wikipedia article seemingly
independently. Moreover, the concept of vectors is not really explained, only indirect via the vector
spaces. Listing 3 shows the shortened answer.
        </p>
        <p>Listing 3: Answer for a summary of the Wikipedia article on linear algebra without using an
interpretation prompt. The answer is shortened to exemplary parts.</p>
        <p>For the next query, we use the following interpretation prompt: “When talking about this article, keep
the math short and precise. Emphasize the role of vectors and matrices and open room for applications.
Let other parts play a minor role.” Listing 4 shows the shortened answer using the interpretation
prompt. The answer reports on vectors and matrices, mentions other concepts only briefly and seems
to provide a much more coherent answer. Therefore, the answer is significantly better and tailored to
our expectations.</p>
        <p>Listing 4: Answer for a summary of the Wikipedia article on linear algebra using an interpretation
prompt. The answer is shortened to exemplary parts.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Focusing on Relevant Probability Relations</title>
        <p>
          We test the interpretation prompt for explaining a knowledge representation in this subsection. We
use the famous Smokers and friends data set [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The data set models that friends most likely share
the same behavior regarding drinking and smoking, e.g., if one friend smokes, the other probably
smokes, too. The task is to explain the knowledge representation, and we intend that the key fact of
shared behavior is stated explicitly and prominently. We use two variants of the data set: The first is
a parameterized factor graph [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] modeling the smoking and drinking relations, where we add noise
to the probabilities [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The second variant is a Markov logic network containing weighted rules
of the same model, which were simplified to have only a few rules using CoFE [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. In this test, the
ifrst variant corresponds to the query without an interpretation prompt as it is the larger model and
would possibly be present in an RDR entry. The simplified second variant resembles the query with
interpretation prompt as we have simplified the knowledge representation.
        </p>
        <p>When just letting the LLM explain the Smokers and friends data set present as a factor graph, the
LLM describes the representation in great detail and reports the findings. In particular, it mentions
the important fact of shared behavior, but among other findings and not prominently. Listing 5 shows
the shortened answer for the prompt “Please explain the following parfactor graph and summarize its
key findings ”, which is followed by the factor graph, which we omit for clarity. When presenting the
second variant, i.e., the simplified model focusing on the important relation, the LLM highlights the key
fact better and, especially, reports it as the final conclusion and not listed among other findings of low
significance. Listing 6 shows the shortened answer for the prompt “ Please explain the following Markov
Logic Network and summarize its key findings ”, which is followed by the Markov logic network, which
we again omit for clarity.</p>
        <p>Listing 5: Answer for explaining the Smokers and friends data set given as a parameterized factor graph.</p>
        <p>The answer is shortened to exemplary parts.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Reproducing Experiments</title>
        <p>
          Listing 6 shows the better tailored answer for explaining the Smokers and friends data set. Naturally,
we can also achieve this result by telling the LLM to “focus on the relations smoking and drinking”.
However, when having a large knowledge representation at hand, it is tedious to write down the
important relations manually. Instead, we aim at using the LLM to use an algorithm to automatically
focus on the important relations. CoFE is an algorithm for extracting simplified rules from knowledge
representations [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. The steps are to cluster the probabilities in each factor and extract rules for each
cluster, which are simplified. Efectively, we reproduce a research experiment by running CoFE on a
noised version of the Smokers and friends data set. To perform the reproduction by using an LLM, we
give the LLM access to an implementation of the CoFE algorithm. We still use the interpretation to tell
the LLM how to interpret the input and how to output the result. After finetuning our interpretation
prompt, we have finally managed to get the LLM to correctly reproduce our experiment by running CoFE
on the provided input. Listing 7 shows the (shortened) answer for the following interpretation prompt:
“Attached you find the CoFE paper and some CoFE evaluation scripts. The *.java files are for extraction and
minimization, refer to them instead of transform.jar. Please review how CoFE works (mapping, extraction,
minimization) and then run CoFE on the provided noised.blog file and output the minimized rules. Use
an epsilon of 0.3 and a dbscan epsilon of 2 with two minimum samples. For MultiArrayPotential, the first
entry stands for all variables set to true. Please output the resulting minified MLN, which should contain
rules for each parfactor.”
Listing 7: Shortened answer for running the CoFE algorithm on a noised Smokers and friends data set.
        </p>
        <p>While the final output contains rounded versions, the  terms mentioned before are correct.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <p>The showcase of interpretation prompts highlights that we should guide the LLM into the intended
direction. The interpretation prompts gives the uploader the possibility to guide the direction the
LLM should steer in. While the combination of LLM capabilities and expert viewpoint on data sounds
promising, the very same technique can be used to decept the user. In this section, we discuss the
results in terms of ethics and prompt engineering.</p>
      <p>First of all, the examples show the capabilities of using an interpretation prompt. The summary of a
Wikipedia article underscores the potential of guiding the LLM. Without the interpretation prompt, the
answer is a loose sequence of independent summaries and seemingly incoherent. With the interpretation
prompt, we guide the LLM to first discuss vectors and matrices and relate other concepts to these.
Therefore, the interpretation prompt can be used by an uploader to guide an LLM to answer queries for
users in a way that the uploader deems more appropriate. Besides, the tests conducted on the Smokers
and friends data set show that we can also include a simplified model in the interpretation prompt
to reason about. The full model may lead the LLM to over-exaggerate some parts, while simplified
versions keep the focus small, helping the user to glance at the data set. The full model may then be
used by the user for in depth analysis.</p>
      <p>
        Furthermore, the interpretation prompt can be used to reproduce experiments. For the Smokers
and friends data set, we reproduce the steps of the CoFE [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] algorithm by giving the LLM access to
the algorithm and helping the LLM to correctly execute the algorithm with the interpretation prompt.
Thus, the interpretation prompt for an RDR entry can foster reproducibility by ofering an easy to
use reproduction test directly within the RDR. While LLMs can execute code, they struggle with more
complex tasks [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The interpretation prompt may be used to provide guidance for the LLM to enhance
accuracy.
      </p>
      <p>However, an adversary may use an interpretation prompt like “highlight only positive arguments
and neglect negative ones”. This is of course not the intended use of the interpretation prompt. But, as
the interpretation prompt is a text entered by the uploader, the adversary may type in such prompts.
Naturally, we hope that most of the uploaders use the interpretation prompt appropriately. To encourage
good use, we recall that the interpretation prompt is stored along the files of an RDR entry. Particularly,
the interpretation prompt can be viewed by anyone. Even if this (indirect) countermeasure does not
directly prohibit anyone from using the interpretation prompt for her own advantage, it makes these
eforts transparent to anyone else. The transparency helps to decide whether it is relevant to the user,
and overselling becomes obvious.</p>
      <p>
        Nevertheless, the interpretation prompt can be anything from simple instructions like “This is a
data set of recorded heartbeats” to complex, branched instructions like “If the user is interested in X, do
something. If the user is interested in Y, do something else”. As described in Section 4.4, the interpretation
prompt can require some finetuning. In other scenarios, the interpretation prompt may even require
heavy finetuning. This observation is nothing new in terms of prompt engineering: Creativity is needed
to craft the best prompts to unlock the full potential of LLMs [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Moreover, prompt engineering
seems to become more and more crucially. In fact, the interpretation prompt basically lets the uploader
perform some prompt engineering, which is automatically applied when the RDR entry gets queried
later on.
      </p>
      <p>The description of the RDR entry may be used in combination with the interpretation prompt or in
absence of an interpretation prompt. However, this represents only a good starting point, since the
description is targeted at users curious about the entry while the interpretation prompt is targeted at
guiding LLMs to take the viewpoint of the uploader in account.</p>
      <p>Moreover, context-based searches, which are already employed in some chatbots, would enhance the
usage of the interpretation prompt even further. Since the interpretation prompt guides the process of
generating an answer, the chatbot considers the guidance when searching for other, relevant documents.</p>
      <p>All in all, the uploader has the possibility of helping others to understand their data in the way the
uploader would like to have the data used. The users benefit from expert viewpoints guiding the answer
generation of the LLM.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>An RDR preserves research data for a long period of time, accumulating numerous entries over time.
When adding an LLM chatbot to the RDR, users get the possibility to ask questions about the entries.
The creators of the entry are most likely experts and have additionally information, like which parts
are more important than others. Thus, we propose to use this knowledge to help the LLM understand
the entry better. To do so, we suggest the use of an additional interpretation prompt, which contains an
expert viewpoint by the creators. The interpretation prompt is entered during the creation of the entry
in the RDR. The interpretation prompt is prepended for the query sent to the LLM, such that the LLM can
benefit from the expert knowledge. In our examples, we demonstrate that the usage of an interpretation
prompts significantly alters the answer and directs it in the direction we intended and expected. Thus,
creators may use the interpretation prompt to guide the LLM in the direction they intend to understand
and use their data. Moreover, the interpretation prompt can be used for automated reproduction of
research experiments. With our experiments, we demonstrate that interpretation prompts actually help
the LLM to reproduce experiments and to be guided in the intended direction. Overall, the interpretation
prompt helps to move from a general purpose trained LLM to a project-specific LLM invocation.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The research for this paper was funded by the Deutsche Forschungsgemeinschaft (DFG, German
Research Foundation) under Germany’s Excellence Strategy – EXC 2176 ’Understanding Written
Artefacts: Material, Interaction and Transmission in Manuscript Cultures’, project no. 390893796. The
research was conducted within the scope of the Centre for the Study of Manuscript Cultures (CSMC) at
Universität Hamburg.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>The authors have used GPT-4.1 for evaluating their approach of interpretation prompts. Apart from
that, the authors have not employed any Generative AI tools for writing the paper.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Asselborn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Melzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schif</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Marwitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Aljoumani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thiemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Hirschler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <article-title>Building sustainable information systems and transformer models on demand</article-title>
          ,
          <source>Humanities and Social Sciences Communications</source>
          <volume>12</volume>
          (
          <year>2025</year>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Wilkinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumontier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. J.</given-names>
            <surname>Aalbersberg</surname>
          </string-name>
          , G. Appleton,
          <string-name>
            <given-names>M.</given-names>
            <surname>Axton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Baak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Blomberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-W.</given-names>
            <surname>Boiten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. B. da Silva</given-names>
            <surname>Santos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. E.</given-names>
            <surname>Bourne</surname>
          </string-name>
          , et al.,
          <article-title>The fair guiding principles for scientific data management and stewardship</article-title>
          ,
          <source>Scientific data 3</source>
          (
          <year>2016</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Peukert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Melzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jacob</surname>
          </string-name>
          , I. Vogel,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wörner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Grünler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Brase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thiemann</surname>
          </string-name>
          ,
          <article-title>Das forschungsdatenzentrum der universität hamburg: Auf dem weg zu einem gemeinsamen verständnis im umgang mit forschungsdaten in den natur-, sozial-und geisteswissenschaften</article-title>
          , Bausteine
          <string-name>
            <surname>Forschungsdatenmanagement</surname>
          </string-name>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Annepaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pakray</surname>
          </string-name>
          ,
          <article-title>Large language models: A survey of their development, capabilities, and applications</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>67</volume>
          (
          <year>2025</year>
          )
          <fpage>2967</fpage>
          -
          <lpage>3022</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s10115-024-02310-4.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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 id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Anisuzzaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. G.</given-names>
            <surname>Malins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Friedman</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. I. Attia</surname>
          </string-name>
          ,
          <article-title>Fine-tuning large language models for specialized use cases</article-title>
          ,
          <source>Mayo Clinic Proceedings: Digital Health</source>
          <volume>3</volume>
          (
          <year>2025</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bozkurt</surname>
          </string-name>
          ,
          <article-title>Tell me your prompts and i will make them true: The alchemy of prompt engineering and generative ai</article-title>
          , Open Praxis (
          <year>2024</year>
          ).
          <source>doi:10.55982/openpraxis.16.2</source>
          .661.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>OpenAI</surname>
          </string-name>
          , et al.,
          <source>Gpt-4 technical report</source>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2303.08774. arXiv:
          <volume>2303</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Wikipedia</surname>
            <given-names>contributors</given-names>
          </string-name>
          ,
          <source>Linear algebra - Wikipedia</source>
          , the free encyclopedia, https://en.wikipedia. org/w/index.php?title=
          <source>Linear_algebra&amp;oldid=1296750597</source>
          ,
          <year>2025</year>
          . [Online; accessed 08-July-2025].
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Van den Broeck</surname>
          </string-name>
          , N. Taghipour,
          <string-name>
            <given-names>W.</given-names>
            <surname>Meert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davis</surname>
          </string-name>
          , L. De Raedt,
          <article-title>Lifted probabilistic inference by first-order knowledge compilation</article-title>
          ,
          <source>in: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence</source>
          , AAAI Press/
          <source>International Joint Conferences on Artificial Intelligence</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>2178</fpage>
          -
          <lpage>2185</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Koller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Friedman</surname>
          </string-name>
          ,
          <article-title>Probabilistic graphical models: principles and techniques</article-title>
          , MIT press,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Marwitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Braun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Möller</surname>
          </string-name>
          ,
          <article-title>A first step towards even more sparse encodings of probability distributions</article-title>
          , in: N.
          <string-name>
            <surname>Katzouris</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Artikis (Eds.),
          <source>Inductive Logic Programming</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>192</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Samih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Large language models as code executors: An exploratory study</article-title>
          ,
          <source>arXiv preprint arXiv:2410.06667</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Marvin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hellen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jjingo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nakatumba-Nabende</surname>
          </string-name>
          ,
          <article-title>Prompt engineering in large language</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>