<!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>Quantifying Dataset Trustworthiness from Labeling Bias Using Subjective Logic</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ismael Ouattara</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>Ioannis Krontiris</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Theo Dimitrakos</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Frank Kargl</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Huawei Technologies Duesseldorf GmbH, Munich, Germany - Trustworthy Technology and Engineering Lab</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Ulm University</institution>
          ,
          <addr-line>Ulm</addr-line>
          ,
          <institution>Germany - Department of Distributed Systems</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Labeling bias, arising from disagreement and inconsistencies among annotators, threatens the reliability of datasets and downstream AI models. This paper introduces a framework based on Subjective Logic (SL) that quantifies dataset trustworthiness by mapping inter-annotator responses into opinions consisting of trust (belief), distrust (disbelief), and uncertainty. The approach provides an interpretable representation of how annotation volume and disagreement influence trust at the instance level. Using CIFAR-10H, we illustrate how trust and uncertainty evolve with diferent numbers of annotations and parameter settings, and how annotator-level reliability can be estimated. These findings highlight the potential of SL to support responsible data curation, such as identifying controversial items for re-labeling and profiling annotator consistency. While our study focuses on image classification, the framework is general and can be extended to probabilistic and textual annotations. Benchmarking against alternative aggregation methods is left as future work.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Trustworthy AI</kwd>
        <kwd>Labeling bias</kwd>
        <kwd>Subjective Logic</kwd>
        <kwd>Dataset quality</kwd>
        <kwd>Trust quantification</kwd>
        <kwd>Annotation reliability</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Artificial intelligence (AI) systems increasingly support high-stakes decisions in healthcare, finance, and
autonomous mobility. While research has advanced the trustworthiness of AI models through fairness,
explainability, and privacy-preserving techniques, less attention has been paid to the trustworthiness
of the training datasets that underpin those models. Empirical studies show that dataset-level issues
such as sampling bias, label noise, and privacy vulnerabilities can erode fairness, robustness, and
interpretability [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In safety-critical domains, even minor defects in collection or curation propagate to
harmful outcomes. For example, evaluations of pedestrian-detection systems in autonomous driving
report systematic miss-rate disparities, with notably higher miss rates for children and for pedestrians
with darker skin tones. These gaps remain after controlling for lighting, occlusion, distance, and other
scene-dificulty covariates, revealing dataset-driven inequities with direct safety implications. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        While such examples highlight distributional risk (coverage and sampling), labeling bias often appears
together with class imbalance and fairness concerns. Labeling bias refers to systematic deviations in
how data points are annotated, often arising from subjectivity, inconsistent guidelines, or annotator
disagreement. Unlike sampling bias, which afects the dataset at the distribution level, labeling bias is
inherently a local or entry-level phenomenon, since it manifests in the reliability of individual labels.
Inter-Annotator Agreement (IAA) metrics such as Cohen’s Kappa provide a statistical measure of
consistency among annotators, capturing uncertainty coming from disagreement [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. However, they
fail to capture other dimensions, like annotator confidence and reliability. They neither represent the
strength of evidence behind an agreed label (e.g., peaked vs. difuse per-item label distributions) nor the
trustworthiness of particular annotators.
      </p>
      <p>These limitations motivate an uncertainty-aware representation that preserves per-item label
distributions, quantifies residual doubt from limited or conflicting annotations, and accounts for
annotatorspecific reliability when aggregating multiple judgments. Such a representation should map observed
annotation evidence into distinct components of support and contradiction for a decided label and
behave predictably as annotation volume or disagreement thresholds change.</p>
      <p>
        In this paper, we adopt Subjective Logic (SL) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to transform inter-annotator responses into
perinstance trust opinions comprising belief, disbelief, and uncertainty. For a chosen label, votes and
label distributions are treated as positive and negative evidence, with the remaining mass encoding
uncertainty. This yields instance-level measures of dataset trustworthiness and a principled basis for
estimating and weighting annotator reliability, providing an auditable bridge from raw annotation
signals to downstream dataset assessment.
      </p>
      <p>More specifically, our work is guided by the following research objectives:
• Derive per instance SL opinions from annotation signals and analyze their sensitivity to
disagreement thresholds.
• Examine and investigate how opinions evolve when the number of annotators changes, and how
this afects the balance of belief, disbelief, and uncertainty.</p>
      <p>• Explore annotator level reliability as an additional signal for dataset quality management.
Contributions. This paper makes three contributions:
1. We formalize a mapping from inter annotator evidence to Subjective Logic opinions that
characterize trust, distrust, and uncertainty at the data instance level.
2. We demonstrate the framework on the CIFAR 10H dataset, showing how opinions evolve with
annotation.
3. We discuss how our framework can support responsible AI practices, including identifying items
for re labeling and profiling annotator reliability.</p>
      <p>Our focus in this work is to demonstrate the feasibility and interpretability of applying SL to labeling
bias.</p>
      <p>Summary and Paper Structure. We show that trust scores derived from SL provide finer-grained
insights than majority voting alone. Our approach enables both per-instance trust estimation and
annotator-level reliability profiling, ofering actionable signals for dataset refinement and quality
assurance. The remainder of this paper is organized as follows: Section 2 reviews related work and the
foundations of Subjective Logic. Section 3 presents our methodology. Section 4 outlines the experimental
setup. Section 5 presents our results and discusses their implications. Section 6 concludes the paper and
identifies future directions.</p>
      <p>Code Availability. All code and experiments are available at: https://github.com/Ouatt-Isma/
-Trustworthiness-of-AI-Training-Dataset</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Ouattara et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] introduced a general SL-based framework for assessing dataset trustworthiness,
focusing on properties such as bias and representativeness. Their work formalized the concept of trust
propositions and combined logical reasoning with evidence-based quantification. It also introduced
two complementary methods to assess class imbalance in centralized and federated settings. This
paper extends their methodology by shifting the focus from sampling bias to labeling bias, requiring
ifne-grained, per-instance analysis of trust.
      </p>
      <p>
        Regarding labeling bias, recent work by Vasilakes et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] introduced Subjective Logic Encodings
(SLEs), which model inter-annotator disagreement using belief-disbelief-uncertainty triplets. Their
formulation motivates our approach, which goes beyond traditional agreement metrics to compute
per-instance trust opinions grounded in SL. A key diference, however, is that while SLEs treat the
subjective opinion itself as the training label for models, we instead assume a standard label aggregation
strategies (e.g., majority vote) to determine a consensus label and then assess the degree of trust in that
decided label.
      </p>
      <p>
        SL has also been used to evaluate trustworthiness in machine learning metrics and model behavior.
Herd and Burton [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] applied SL to assess the reliability of ML metrics in safety-critical settings. Ouattara
et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] applied SL to model calibration. These works highlight the versatility of SL in encoding
uncertainty across various AI system components. In contrast, our contribution centers on the
labellevel granularity and the modeling of annotator reliability within a unified trust framework.
      </p>
      <p>
        Eforts to systematize dataset evaluation have also emerged through scorecard frameworks such
as METRIC [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and FRIES [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. These provide expert-curated frameworks for data quality assessment
but lack formal mechanisms to capture doubt or conflicting evidence. Other work on fairness and bias
mitigation [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ] focuses on improving dataset balance or transparency but does not ofer quantitative
trust measures. Our approach complements these eforts by embedding uncertainty reasoning into the
evaluation pipeline, enabling actionable insights into the reliability of labels and annotators alike.
      </p>
      <p>
        Beyond global agreement metrics, a long line of work in crowd annotation modeling has developed
statistical methods to infer latent ground truth. The seminal Dawid and Skene model [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] pioneered
this direction by applying the EM (Expectation–Maximization) algorithm to estimate annotator-specific
confusion matrices and infer the most likely true labels. This approach explicitly models observer error
rates, but it collapses disagreement into a single consensus probability and does not preserve residual
uncertainty.
      </p>
      <p>
        Subsequent methods extended this framework. GLAD (Generative model of Labels, Abilities, and
Dificulties) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] jointly estimates annotator expertise, item dificulty, and latent true labels, showing
robustness to noisy or adversarial annotators. By weighting labelers according to inferred ability and
accounting for image dificulty, GLAD achieves more accurate consensus than majority voting. However,
its outputs remain point estimates of labels and latent parameters, without a principled decomposition
of belief and uncertainty. MACE (Multi-Annotator Competence Estimation) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] instead focuses on
identifying spammers and unreliable annotators in an unsupervised fashion. By introducing latent
variables for spamming behavior and optimizing with EM or Variational Bayes, it estimates both the
ground-truth labels and annotator trustworthiness. While efective in filtering low-quality annotators,
MACE also ultimately reduces annotation signals to label probabilities and competence scores.
      </p>
      <p>In contrast, our framework based on Subjective Logic explicitly retains belief, disbelief, and uncertainty
as first-class quantities . Instead of just merging annotation evidence into a single label, we additionally
compute interpretable trust opinions at the instance level, making both consensus and disagreement
directly observable. This perspective complements prior work: while Dawid–Skene, GLAD, and MACE
focus on inferring hidden ground truth, our approach emphasizes auditable trust quantification , enabling
transparent assessment of label reliability and supporting downstream tasks such as dataset curation,
targeted re-labeling, and annotator profiling within trustworthy AI pipelines.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <sec id="sec-3-1">
        <title>3.1. Subjective Logic preliminaries</title>
        <p>
          Subjective Logic (SL) [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is a probabilistic logic framework designed to support reasoning under
uncertainty by explicitly modeling beliefs and uncertainty. A binomial opinion in SL is expressed as a
tuple  = (, , , ), where  is belief,  is disbelief,  is uncertainty (with  +  +  = 1), and  is the
base rate expressing the prior expectation in the absence of evidence. This structure enables nuanced
trust assessments, especially when information is incomplete or conflicting.
        </p>
        <p>
          To aggregate evidence from multiple sources or points of view, SL provides discounting and several
fusion operators [
          <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
          ]. SL ofers multiple fusion operators, such as cumulative or averaging fusion,
to aggregate trust opinions across sources. The cumulative fusion is used when sources are considered
independent, and the averaging operator when they are dependent. Moreover, logical operators such
as conjunction (AND), disjunction (OR), and negation are defined to combine opinions over complex
propositions. These operators are particularly useful when assessing composite properties of trust, such
as fairness, which may depend on multiple sub-properties.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Opinion construction from annotations</title>
        <p>
          We adopt the four–step trust quantification methodology introduced in previous work [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], adapting it
here to the context of labeling bias. Whereas sampling bias afects a dataset globally, labeling bias arises
locally at the instance level. Each labeled instance is thus treated as a trust proposition, and its trust
opinion is derived directly from inter–annotator agreement (IAA).
        </p>
        <p>The methodology unfolds in four steps. We first define the trust proposition , such as assessing whether
the dataset is free from bias. Next, we decompose this proposition into multiple atomic propositions,
one of which addresses labeling. Focusing on this labeling proposition, we then identify trust sources
and collect evidence, with one trust source capturing agreement based on annotator responses. Finally,
we quantify subjective opinions by converting annotation evidence into Subjective Logic opinions,
and, when multiple trust sources are present, we aggregate these opinions to obtain an overall trust
assessment.</p>
        <p>To quantify the opinion based on the agreement trust source, we assume the existence of a reference
label for each instance (e.g., majority vote or adjudication). For each annotator , we compute a
divergence score  measuring the distance between the annotator’s label and the reference label. Using
a divergence threshold  , we partition the evidence into positive evidence (, the number of annotations
with  ≤  ), negative evidence (, the number of annotations with  &gt;  ), and uncertainty, modeled
either based on the amplitude of the divergence values or based on a prior informative weight  .</p>
        <p>
          From this evidence, two quantification schemes can be applied. The Constant–Uncertainty
Quantification [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] scheme fixes the uncertainty  and distributes the remaining mass proportionally:
 = 1 − ,  =  · ,  =  · ,
        </p>
        <p>
          The Baseline–Prior Quantification [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] scheme follows the canonical Subjective Logic mapping
from evidence counts to opinions:
        </p>
        <p>= ,  = ,  = ,</p>
        <p>+  +   +  +   +  + 
where  &gt; 0 (usually set to 2) is the prior weight that moderates how quickly uncertainty shrinks as
more evidence accumulates.</p>
        <p>This formulation enables each instance to be assigned a nuanced trust opinion, which can in turn be
aggregated across instances to assess dataset–level trustworthiness. The overall reasoning process can
be summarized as follows:
(1) Trust Proposition → (2) Atomic Propositions → (3) Trust Sources +
Evidence Collection → (4) SL Opinion quantification + Aggregated Trust.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Examples</title>
        <p>Consider an image in the CIFAR–10H dataset annotated by 50 crowdworkers. Suppose 46 annotators
agree with the decision label * and 4 disagree. With a prior weight  = 2, the opinion is
46 4 2
 = 52 ≈ 0.885,  = 52 ≈ 0.077,  = 52 ≈ 0.038.</p>
        <p>This opinion indicates high belief in the correctness of the label, some degree of distrust due to
disagreement, and low residual uncertainty. As the number of annotations decreases, uncertainty 
increases according to  = + , where  =  + .</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Algorithmic summary</title>
        <p>For clarity, Algorithm 1 summarizes the procedure.</p>
        <p>Algorithm 1 Opinion construction from annotations
Require: Annotations { ()} or { ()}, decision label * , threshold  , prior weight 
1: for each instance  do
2:  ← |{  : divergence( (), * ) ≤  }|
3:  ← |{  : divergence( (), * ) &gt;  }|
4:  ← /( +  + )
5:  ← /( +  + )
6:  ← /( +  + )
7: Output opinion  = (, , , )
8: end for</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Setup</title>
      <sec id="sec-4-1">
        <title>4.1. Dataset</title>
        <p>
          We evaluate the proposed framework on the CIFAR–10H dataset [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], which provides human annotation
distributions for the CIFAR–10 test images. Each image is annotated by 50 crowdworkers, yielding a
rich source of inter–annotator disagreement.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Evaluation Protocol</title>
        <p>Each image is treated as a trust proposition. We assume the majority label as the decision label * ,
and compute divergence  for each annotator. With threshold  = 0, annotators who agree with
* contribute to positive evidence , and those who disagree contribute to negative evidence .
Uncertainty is controlled by the prior weight  that we set to 2.</p>
        <p>To study the efect of annotation volume, we subsample annotations at diferent rates (5, 10, 20, 50
annotators per instance) while preserving the decision label. This allows us to examine how belief,
disbelief, and uncertainty evolve as evidence increases.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Evaluation Metrics</title>
        <p>We report descriptive statistics of opinion masses across the dataset and analyze correlations between
trust , distrust  and uncertainty  against inter–annotator disagreement (measured as 1− majority
proportion). This captures whether (, , ) reflects the true dificulty of instances. We also visualize
the distribution of opinions using boxplots.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results and Discussion</title>
      <p>This section presents results from our CIFAR-10H experiments and explores the efects of annotation
volume on trust scores. We also discuss how the proposed framework can be extended to richer
annotation formats and used for annotator profiling.</p>
      <p>Trust Mass Distribution (Figure 1). On the full CIFAR-10H dataset (left), using all available
annotations per instance, we observe a high average trust mass, with most instances showing strong annotator
agreement. However, this setting may inflate confidence for instances with disproportionately many
annotations. After normalizing to 10 annotators per instance via majority-preserving subsampling
(right), the relative weight of distrust and uncertainty increases, reducing the dominance of trust mass
observed in the full dataset. This shift reflects the trade-of between annotation volume and confidence
in label quality, as fewer annotations provide weaker evidence and make disagreement more visible.
00..883030
0.600
Correlation with Disagreement (Table 1). We analyzed how Subjective Logic trust (), distrust
(), and uncertainty () masses correlate with inter-annotator disagreement (defined as one minus
the majority proportion). As shown in Table 1, trust mass consistently shows a strong negative
correlation with disagreement, while distrust mass shows a strong positive correlation, reflecting their
complementary roles. Uncertainty mass exhibits a weaker and less stable relationship: it is moderately
positive with few annotations (5), but decreases as annotation volume grows and eventually approaches
zero. At the same time, average trust increases steadily with more annotations, while both average
distrust and uncertainty remain low. These results indicate that SL trust and distrust masses are reliable
indicators of annotator disagreement across annotation volumes, whereas uncertainty mass is most
informative in low-evidence settings.</p>
      <p>Extension to Probabilistic and Natural Language Annotations. Our current analysis assumes
categorical annotations. However, many modern datasets include probabilistic labels or free-text
annotations. For probabilistic labels, divergences can be computed using KL divergence or
crossentropy between annotator distributions and the reference label. For text labels, semantic similarity
measures (e.g., cosine similarity between embeddings) can provide divergence values relative to a gold
ontology or adjudicated reference. These extensions broaden the applicability of our framework to
more complex labeling scenarios.</p>
      <p>Calibrating the Divergence Threshold  . The divergence threshold  determines whether an
annotation is counted as positive or negative evidence. It can be calibrated empirically from
highconfidence samples, set statistically (e.g., one standard deviation around the mean divergence), or fixed
according to domain-specific policy (e.g.,  = 0 for categorical labels,  = 0.1 for soft labels). This
lfexibility allows tailoring the framework to diferent annotation contexts.</p>
      <p>Inferring Annotator reliability. The same approach as the one detailed in Section 3.2 can be
extended to estimate annotator reliability. For annotator , we partition the evidence into positive
evidence ( , the number of data with  ≤  ) and negative evidence ( , the number of data with  &gt;  ).</p>
      <p>By treating each response as positive or negative evidence, we can construct an opinion about
the annotator’s reliability. Such opinions enable the identification of low quality annotators whose
responses may warrant down–weighting or further review.</p>
      <p>Implications for Responsible AI. The framework contributes to responsible dataset management
in three ways. First, high-uncertainty instances can be flagged for re-labeling (or more annotators),
supporting active dataset curation. Second, annotator opinions provide auditable signals for quality
control in crowdsourcing pipelines. Third, per-instance trust scores can be used to re-weight data
during model training, reducing the influence of uncertain or controversial labels. Finally, systematic
disagreement patterns can help detect unreliable annotators (e.g., spammers or consistently
inconsistent contributors), enabling targeted interventions such as retraining, filtering, or exclusion. These
mechanisms complement existing dataset documentation practices and provide actionable insights for
trustworthy AI development.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>We presented a Subjective Logic-based framework to quantify labeling bias and derive instance-level
trust scores from human annotations. By representing inter-annotator disagreement as belief, disbelief,
and uncertainty, our method provides a richer characterization of annotation reliability than majority
voting or global agreement metrics.</p>
      <p>Our experiments on the CIFAR-10H dataset demonstrated how trust varies with annotation volume,
highlighting the value of modeling uncertainty explicitly in dataset diagnostics. In particular, reduced
annotations led to increased uncertainty and reduced confidence in label correctness, which could have
significant implications for downstream learning tasks.</p>
      <p>We also outlined extensions of the framework to handle probabilistic and natural language annotations
and proposed how trust signals could inform annotator profiling. These capabilities open avenues for
more informed data filtering, re-annotation strategies, and training pipeline integration.</p>
      <p>Future work includes refining trust threshold calibration, validating annotator trust metrics on larger
and more diverse datasets, and exploring how trust scores can be used to dynamically weight training
data. Overall, this framework contributes toward principled, transparent tools for assessing dataset
reliability within trustworthy AI development pipelines.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgements</title>
      <p>This research has received funding from the European Union’s Horizon 2020 EU Research &amp; Innovation
program under Grant Agreement No 101069688 (H2020-EU CONNECT). The authors thank the project
partners for their collaboration and feedback.</p>
    </sec>
    <sec id="sec-8">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the authors used ChatGPT-4 in order to: Grammar and spelling
check.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Schwabe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Becker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Seyferth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Klaß</surname>
          </string-name>
          , T. Schaefter,
          <article-title>The metric-framework for assessing data quality for trustworthy ai in medicine: a systematic review</article-title>
          ,
          <source>NPJ Digital Medicine</source>
          <volume>7</volume>
          (
          <year>2024</year>
          )
          <fpage>203</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Sarro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , X. Liu,
          <source>Bias Behind the Wheel: Fairness Testing of Autonomous Driving Systems</source>
          ,
          <year>2024</year>
          . URL: https://arxiv.org/abs/2308.02935. arXiv:
          <volume>2308</volume>
          .
          <fpage>02935</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zamzmi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Angara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rajaraman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Aquilina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jaeger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Papagiannakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Antani</surname>
          </string-name>
          ,
          <article-title>Assessing Inter-Annotator Agreement for Medical Image Segmentation</article-title>
          ,
          <source>IEEE Access 11</source>
          (
          <year>2023</year>
          )
          <fpage>21300</fpage>
          -
          <lpage>21312</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2023</year>
          .
          <volume>3249759</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jøsang</surname>
          </string-name>
          , Subjective Logic:
          <article-title>A Formalism for Reasoning under Uncertainty, 1 ed</article-title>
          ., Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K. I.</given-names>
            <surname>Ouattara</surname>
          </string-name>
          , I. Krontiris,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dimitrakos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kargl</surname>
          </string-name>
          ,
          <article-title>Assessing Trustworthiness of AI Training Dataset using Subjective Logic: A Use Case on Bias</article-title>
          ,
          <source>in: Proceedings of the Bias and Fairness in AI Workshop at ECML/PKDD 2025, Lecture Notes in Computer Science</source>
          , Springer,
          <year>2025</year>
          . URL: https://arxiv.org/abs/2508.13813, also available as arXiv preprint arXiv:
          <volume>2508</volume>
          .
          <fpage>13813</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Vasilakes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zerva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          , Subjective Logic Encodings,
          <source>arXiv preprint arXiv:2502.12225</source>
          (
          <year>2025</year>
          ). URL: https://arxiv.org/abs/2502.12225.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Herd</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Burton</surname>
          </string-name>
          ,
          <article-title>Can You Trust Your ML Metrics? Using Subjective Logic to Determine the True Contribution of ML Metrics for Safety</article-title>
          ,
          <source>in: Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>1579</fpage>
          -
          <lpage>1586</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K. I.</given-names>
            <surname>Ouattara</surname>
          </string-name>
          , I. Krontiris,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dimitrakos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kargl</surname>
          </string-name>
          ,
          <article-title>Quantifying Calibration Error in Neural Networks Through Evidence-Based Theory</article-title>
          , in
          <source>: Proceedings of the 28th International Conference on Information Fusion (FUSION)</source>
          ,
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Rutinowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Klüttermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Endendyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Reining</surname>
          </string-name>
          , E. Müller, Benchmarking Trust:
          <article-title>A Metric for Trustworthy Machine Learning</article-title>
          ,
          <source>in: World Conference on Explainable Artificial Intelligence</source>
          , Springer,
          <year>2024</year>
          , pp.
          <fpage>287</fpage>
          -
          <lpage>307</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chouldechova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>A snapshot of the frontiers of fairness in machine learning</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>63</volume>
          (
          <year>2020</year>
          )
          <fpage>82</fpage>
          -
          <lpage>89</lpage>
          . URL: https://doi.org/10.1145/3376898. doi:
          <volume>10</volume>
          .1145/3376898.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gebru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Morgenstern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Vecchione</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Vaughan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          , H. D. III,
          <string-name>
            <surname>K. Crawford</surname>
          </string-name>
          , Datasheets for datasets,
          <source>Communications of the ACM</source>
          <volume>64</volume>
          (
          <year>2021</year>
          )
          <fpage>62</fpage>
          -
          <lpage>71</lpage>
          . URL: https://doi.org/10.1145/3458723. doi:
          <volume>10</volume>
          .1145/3458723.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Dawid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Skene</surname>
          </string-name>
          ,
          <article-title>Maximum likelihood estimation of observer error-rates using the EM algorithm</article-title>
          ,
          <source>Journal of the Royal Statistical Society</source>
          . Series C (Applied Statistics)
          <volume>28</volume>
          (
          <year>1979</year>
          )
          <fpage>20</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Whitehill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bergsma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Movellan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ruvolo</surname>
          </string-name>
          ,
          <article-title>Whose vote should count more: Optimal integration of labels from labelers of unknown expertise</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>22</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hovy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Berg-Kirkpatrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Hovy</surname>
          </string-name>
          ,
          <article-title>Learning whom to trust with MACE, in: Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , Association for Computational Linguistics,
          <year>2013</year>
          , pp.
          <fpage>1120</fpage>
          -
          <lpage>1130</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jøsang</surname>
          </string-name>
          , T. Bhuiyan,
          <article-title>Optimal Trust Network Analysis with Subjective Logic</article-title>
          , in: 2008
          <source>International Conference on Emerging Security Information, Systems and Technologies</source>
          ,
          <year>2008</year>
          , pp.
          <fpage>179</fpage>
          -
          <lpage>184</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>K. I.</given-names>
            <surname>Ouattara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Petrovska</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Hermann,
          <string-name>
            <given-names>N.</given-names>
            <surname>Trkulja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Dimitrakos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kargl</surname>
          </string-name>
          ,
          <article-title>On Subjective Logic Trust Discount for Referral Paths</article-title>
          ,
          <source>in: Proceedings of the 27th International Conference on Information Fusion (FUSION)</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Peterson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Battleday</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Grifiths</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Russakovsky</surname>
          </string-name>
          ,
          <article-title>Human Uncertainty Makes Classiifcation More Robust</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems (NeurIPS)</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1908</year>
          .07086.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>